mathematics

Lectures in Geometric Combinatorics

Lectures in Geometric Combinatorics is a mathematics topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Lectures in Geometric Combinatorics rather than just read about it. In short: Lectures in Geometric Combinatorics is a textbook on polyhedral combinatorics. It was written by Rekha R.

Key takeaways

Lectures in Geometric Combinatorics belongs to mathematics; place it in that map before memorising details.
Learn the definition first, then one example that makes the definition concrete.
Connect Lectures in Geometric Combinatorics to a quantity you can measure, compute or draw — that is where exam questions come from.
Reproduce the core statement of Lectures in Geometric Combinatorics from memory before moving on to harder problems.

Reference excerpt

Lectures in Geometric Combinatorics is a textbook on polyhedral combinatorics. It was written by Rekha R. Thomas, based on a course given by Thomas at the 2004 Park City Mathematics Institute, and published by the American Mathematical Society and Institute for Advanced Study in 2006, as volume 33 of their Student Mathematical Library book series.

Topics The 14 chapters of the book can be grouped into two parts, with the first 2/3 of the book concerning the combinatorial properties of convex polytopes and the remainder connecting these topics to abstract algebra. The topics covered include Schlegel diagrams and Gale diagrams, irrational polytopes, point set triangulations, regular triangulations and their polyhedral representation by secondary polytopes, the permutohedron as an example of a secondary polytope, Gröbner bases, toric ideals, and toric varieties, and the connections between Gröbner bases of toric ideals and regular triangulations of points.

Audience and reception Although originally presented as an advanced undergraduate course, the book is also suitable for graduate students and for researchers interested in beginning work in this area. It requires only an undergraduate level of background material in mathematics (particularly linear algebra), and includes exercises making it suitable as a textbook. Reviewers Miklós Bóna and Alexander Zvonkin suggest it as a "quick introduction" to its topics, after which other books on the same topics can provide greater depth.

Worked examples

Example 1 — a first encounter with Lectures in Geometric Combinatorics

Start with the simplest possible case. Write down what Lectures in Geometric Combinatorics claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In mathematics, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Lectures in Geometric Combinatorics before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Lectures in Geometric Combinatorics ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Lectures in Geometric Combinatorics

In research: Lectures in Geometric Combinatorics appears in mathematics research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry: Engineering practice reuses Lectures in Geometric Combinatorics in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom: Lectures in Geometric Combinatorics is common in secondary-school and first-year university syllabi. It links to neighbouring topics 2006 non-fiction books, Books of lectures, Mathematics textbooks, so understanding it makes those chapters shorter.
In everyday life: Look for Lectures in Geometric Combinatorics outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Lectures in Geometric Combinatorics in 20 minutes

Read the reference excerpt below once, without taking notes.
Close the page and write down what Lectures in Geometric Combinatorics means in your own words.
Compare your version with the excerpt and mark what you missed.
Work through the three examples above with pen and paper.
Explain Lectures in Geometric Combinatorics out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Lectures in Geometric Combinatorics in simple terms?

Lectures in Geometric Combinatorics is a textbook on polyhedral combinatorics. It was written by Rekha R.

Why does Lectures in Geometric Combinatorics matter?

Because it connects several mathematics ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Lectures in Geometric Combinatorics?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Lectures in Geometric Combinatorics.