• 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...
    3 KB (279 words) - 22:22, 6 June 2023
  • Geometry (redirect from Geometric)
    and principles with combinatorics. Computational geometry deals with algorithms and their implementations for manipulating geometrical objects. Important...
    102 KB (10,101 words) - 21:35, 19 June 2025
  • Thumbnail for Discrete geometry
    constructive methods of discrete geometric objects. Most questions in discrete geometry involve finite or discrete sets of basic geometric objects, such as points...
    15 KB (1,575 words) - 05:36, 16 October 2024
  • at Texas A&M University beginning in 1995. Thomas is the author of the textbook Lectures in Geometric Combinatorics (Student Mathematical Library, 33...
    3 KB (222 words) - 07:42, 11 January 2025
  • Thumbnail for Permutohedron
    Thomas, Rekha R. (2006), "Chapter 9. The Permutahedron", Lectures in Geometric Combinatorics, Student Mathematical Library: IAS/Park City Mathematical...
    17 KB (1,396 words) - 13:56, 4 June 2025
  • Glossary of areas of mathematics (category Articles lacking in-text citations from August 2024)
    geometry. Geometric calculus extends the geometric algebra to include differentiation and integration. Geometric combinatorics a branch of combinatorics. It...
    71 KB (7,692 words) - 22:32, 2 March 2025
  • semiregular polyhedra] (in German). VEB Deutscher Verlag der Wissenschaften. Thomas, Rekha (2006). Lectures in Geometric Combinatorics. American Mathematical...
    58 KB (5,764 words) - 07:06, 18 April 2025
  • Combinatorial commutative algebra (category Algebraic combinatorics)
    Concini, David Eisenbud, and Claudio Procesi. Algebraic combinatorics Polyhedral combinatorics Zero-divisor graph A foundational paper on Stanley–Reisner...
    5 KB (564 words) - 09:27, 1 October 2024
  • Thumbnail for Jiří Matoušek (mathematician)
    Jiří Matoušek (mathematician) (category Researchers in geometric algorithms)
    "Using the Borsuk-Ulam Theorem: Lectures on Topological Methods in Combinatorics and Geometry", Book Review, Combinatorics, Probability and Computing, 13...
    10 KB (904 words) - 15:36, 19 June 2025
  • combinatorics is the special case when only the operations of addition and subtraction are involved. Ben Green explains arithmetic combinatorics in his...
    9 KB (956 words) - 14:37, 1 February 2025
  • Thumbnail for Terence Tao
    Terence Tao (category All Wikipedia articles written in Australian English)
    differential equations, algebraic combinatorics, arithmetic combinatorics, geometric combinatorics, probability theory, compressed sensing and analytic number...
    79 KB (6,678 words) - 11:50, 19 June 2025
  • Thumbnail for Simplicial complex
    Theorem: Lectures on Topological Methods in Combinatorics and Geometry (2nd ed.). Berlin-Heidelberg: Springer-Verlag. ISBN 978-3-540-00362-5. Written in cooperation...
    14 KB (1,992 words) - 00:21, 18 May 2025
  • Facet (geometry) (category Polyhedral combinatorics)
    In geometry, a facet is a feature of a polyhedron, polytope, or related geometric structure, generally of dimension one less than the structure itself...
    3 KB (314 words) - 21:13, 27 February 2025
  • combinatorics Poset Topology: Tools and Applications Michelle L. Wachs, lecture notes IAS/Park City Graduate Summer School in Geometric Combinatorics...
    1 KB (221 words) - 17:45, 4 June 2021
  • Thumbnail for Algebraic combinatorics
    Combinatorial commutative algebra Polyhedral combinatorics Algebraic Combinatorics (journal) Journal of Algebraic Combinatorics International Conference on Formal...
    13 KB (1,289 words) - 14:02, 16 October 2024
  • Thumbnail for Abstract simplicial complex
    In combinatorics, an abstract simplicial complex (ASC), often called an abstract complex or just a complex, is a family of sets that is closed under taking...
    17 KB (2,486 words) - 22:41, 19 January 2025
  • Steinitz's theorem (category Polyhedral combinatorics)
    In polyhedral combinatorics, a branch of mathematics, Steinitz's theorem is a characterization of the undirected graphs formed by the edges and vertices...
    50 KB (5,973 words) - 06:51, 27 May 2025
  • Gale diagram (category Polyhedral combinatorics)
    MR 0936614 Thomas, Rekha R. (2006), "Chapter 5: Gale Diagrams", Lectures in Geometric Combinatorics, Student Mathematical Library, vol. 33, Institute for Advanced...
    13 KB (1,912 words) - 09:37, 31 December 2023
  • In mathematics, the polynomial method is an algebraic approach to combinatorics problems that involves capturing some combinatorial structure using polynomials...
    9 KB (1,387 words) - 00:26, 5 March 2025
  • Thumbnail for Hyperbolic group
    Hyperbolic group (category Combinatorics on words)
    In group theory, more precisely in geometric group theory, a hyperbolic group, also known as a word hyperbolic group or Gromov hyperbolic group, is a finitely...
    21 KB (2,729 words) - 12:27, 6 May 2025
  • Theorem: Lectures on Topological Methods in Combinatorics and Geometry (2nd ed.). Berlin-Heidelberg: Springer-Verlag. ISBN 978-3-540-00362-5. Written in cooperation...
    5 KB (824 words) - 04:10, 22 April 2025
  • Thumbnail for Hypersimplex
    In polyhedral combinatorics, the hypersimplex Δ d , k {\displaystyle \Delta _{d,k}} is a convex polytope that generalizes the simplex. It is determined...
    7 KB (599 words) - 10:13, 24 September 2024
  • Thumbnail for Geometry of numbers
    László; Schrijver, Alexander (1993), Geometric algorithms and combinatorial optimization, Algorithms and Combinatorics, vol. 2 (2nd ed.), Springer-Verlag...
    9 KB (1,054 words) - 02:08, 15 May 2025
  • Thumbnail for Timothy Gowers
    Timothy Gowers (category Mathematics education in the United Kingdom)
    the Combinatorics chair at the Collège de France, a director of research at the University of Cambridge and a Fellow of Trinity College, Cambridge. In 1998...
    23 KB (2,161 words) - 11:33, 15 April 2025
  • Szemerédi's theorem (category Theorems in combinatorics)
    In arithmetic combinatorics, Szemerédi's theorem is a result concerning arithmetic progressions in subsets of the integers. In 1936, Erdős and Turán conjectured...
    22 KB (2,490 words) - 14:21, 12 January 2025
  • Thumbnail for János Pach
    János Pach (category Researchers in geometric algorithms)
    Computational Geometry, Graphs and Combinatorics, Central European Journal of Mathematics, and Moscow Journal of Combinatorics and Number Theory. He was an...
    15 KB (1,299 words) - 07:29, 13 September 2024
  • therefore of great use in the fields of combinatorics and geometric group theory. Margulis lemma Ballmann, Werner (1995). Lectures on spaces of nonpositive...
    5 KB (661 words) - 05:47, 7 March 2025
  • Reiner, Victor; Sturmfels, Bernd (2007), Geometric Combinatorics: Lectures from the Graduate Summer School held in Park City, UT, 2004, IAS/Park City Mathematics...
    2 KB (191 words) - 09:04, 25 October 2024
  • Building (mathematics) (category Algebraic combinatorics)
    In mathematics, a building (also Tits building, named after Jacques Tits) is a combinatorial and geometric structure which simultaneously generalizes certain...
    26 KB (3,216 words) - 07:56, 13 May 2025
  • Thumbnail for Radon's theorem
    Radon's theorem (category Geometric transversal theory)
    Theorem: Lectures on Topological Methods in Combinatorics and Geometry (2nd ed.). Berlin-Heidelberg: Springer-Verlag. ISBN 978-3-540-00362-5. Written in cooperation...
    18 KB (2,424 words) - 10:45, 2 December 2024