The greedy algorithm and Coxeter matroids

DOI10.1023/A:1008780132748zbMath0979.05029MaRDI QIDQ1575099

Andrew Vince

Publication date: 17 February 2002

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

zbMATH Keywords

greedy algorithmBruhat orderCoxeter matroidGale order

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items

A framework for the greedy algorithm, Orthogonal matroids, An adjacency criterion for Coxeter matroids

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Greedoids
• Some characterizations of Coxeter groups
• Combinatorial geometries, convex polyhedra, and Schubert cells
• Symplectic matroids
• A geometric characterization of Coxeter matroids
• The lattice of flats and its underlying flag matroid polytope
• An adjacency criterion for Coxeter matroids
• Boundaries of Coxeter matroids
• Bruhat lattices, plane partition generating functions, and minuscule representations
• Greedy algorithm and symmetric matroids
• Combinatorial geometries and torus strata on homogeneous compact manifolds