mathematics, Coxeter matroids are generalization of matroids depending on a choice of a Coxeter group W and a parabolic subgroup P. Ordinary matroids correspond...

orderings or sets Coxeter matroid – Group-theoretic generalization of matroids Greedoid – Set system used in greedy optimization Oriented matroid – Abstraction...

the Coxeter graph, Coxeter groups, Coxeter's loxodromic sequence of tangent circles, Coxeter–Dynkin diagrams, and the Todd–Coxeter algorithm. Coxeter was...

a matroid polytope, also called a matroid basis polytope (or basis matroid polytope) to distinguish it from other polytopes derived from a matroid, is...

of Coxeter matroids; it was published by Serganova and Israel Gelfand in 1987 as part of their research originating the concept of a Coxeter matroid. "Book...

as a matroid, whose elements are the points of the configuration and whose nontrivial flats are the lines of the configuration. In this matroid, a set...

MR 2000133 Borovik, Alexandre V.; Gelfand, I. M.; White, Neil (2003), Coxeter matroids, Progress in Mathematics, vol. 216, Boston, MA: Birkhäuser Boston,...

map colourings by Tait, Heawood, and Hadwiger. László Fejes Tóth, H.S.M. Coxeter, and Paul Erdős laid the foundations of discrete geometry. A polytope is...

oriented matroid with n {\displaystyle n} elements has at least 3 n / 7 {\displaystyle 3n/7} two-point lines, or equivalently every rank-3 matroid with fewer...

New York, 1994 Borovik, Alexandre V.; Gelfand, I. M.; White, Neil: Coxeter matroids. Progress in Mathematics, 216. Birkhäuser Boston, Inc., Boston, MA...