Purity and Separation for Oriented Matroids

DOI10.1090/MEMO/1439MaRDI QIDQ6051925zbMATH OpenOpenAlexFDO

Authors Pavel Galashin, Alexander Postnikov

Publication date 23 October 2023

Published in Memoirs of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1708.01329

zbMATH Keywords

oriented matroidscluster algebrasouterplanar graphsstrong separationweak separationzonotopal tilingspositroidspurity phenomenonBohne-Dress theorem

Mathematics Subject Classification ID

Oriented matroids in discrete geometry (52C40) Algebraic combinatorics (05E99) Research exposition (monographs, survey articles) pertaining to convex and discrete geometry (52-02)

Abstract: Leclerc and Zelevinsky, motivated by the study of quasi-commuting quantum flag minors, introduced the notions of strongly separated and weakly separated collections. These notions are closely related to the theory of cluster algebras, to the combinatorics of the double Bruhat cells, and to the totally positive Grassmannian. A key feature, called the purity phenomenon, is that every maximal by inclusion strongly (resp., weakly) separated collection of subsets in $[n]$ has the same cardinality. In this paper, we extend these notions and define $mathcalM$-separated collections for any oriented matroid $mathcalM$. We show that maximal by size $mathcalM$-separated collections are in bijection with fine zonotopal tilings (if $mathcalM$ is a realizable oriented matroid), or with one-element liftings of $mathcalM$ in general position (for an arbitrary oriented matroid). We introduce the class of pure oriented matroids for which the purity phenomenon holds: an oriented matroid $mathcalM$ is pure if $mathcalM$-separated collections form a pure simplicial complex, i.e., any maximal by inclusion $mathcalM$-separated collection is also maximal by size. We pay closer attention to several special classes of oriented matroids: oriented matroids of rank $3$, graphical oriented matroids, and uniform oriented matroids. We classify pure oriented matroids in these cases. An oriented matroid of rank $3$ is pure if and only if it is a positroid (up to reorienting and relabeling its ground set). A graphical oriented matroid is pure if and only if its underlying graph is an outerplanar graph, that is, a subgraph of a triangulation of an $n$-gon. We give a simple conjectural characterization of pure oriented matroids by forbidden minors and prove it for the above classes of matroids (rank $3$, graphical, uniform).

Recommendations

• The purity conjecture in type \(C\)
• Combinatorics of positroids
• Weak separation and plabic graphs
• Combined tilings and separated set-systems
• The purity of set-systems related to Grassmann necklaces

Cites work

• scientific article; zbMATH DE number 3133252 (Why is no real title available?)
• scientific article; zbMATH DE number 3608716 (Why is no real title available?)
• scientific article; zbMATH DE number 575960 (Why is no real title available?)
• scientific article; zbMATH DE number 1126912 (Why is no real title available?)
• scientific article; zbMATH DE number 6928909 (Why is no real title available?)
• scientific article; zbMATH DE number 815564 (Why is no real title available?)
• scientific article; zbMATH DE number 1405498 (Why is no real title available?)
• scientific article; zbMATH DE number 5873618 (Why is no real title available?)
• scientific article; zbMATH DE number 3259770 (Why is no real title available?)
• scientific article; zbMATH DE number 3391043 (Why is no real title available?)
• A combinatorial problem; stability and order for models and theories in infinitary languages
• A counterexample to the extension space conjecture for realizable oriented matroids
• An introduction to hyperplane arrangements
• Cellular Strings on Polytopes
• Characteristic polynomials of subspace arrangements and finite fields
• Circuit-cocircuit reversing systems in regular matroids
• Cluster algebras IV: Coefficients
• Cluster algebras. I: Foundations
• Cluster algebras. II: Finite type classification
• Cluster algebras. III: Upper bounds and double Bruhat cells.
• Cocircuit graphs and efficient orientation reconstruction in oriented matroids
• Enumerating degree sequences in digraphs and a cycle--cocycle reversing system
• Free \(n\)-category generated by a cube, oriented matroids, and higher Bruhat orders
• GRASSMANNIANS AND CLUSTER ALGEBRAS
• Geometric bijections for regular matroids, zonotopes, and Ehrhart theory
• Higher Bruhat orders and cyclic hyperplane arrangements
• Manifolds associated to simple games
• Matroids and Graphs
• On maximal weakly separated set-systems
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• On the density of families of sets
• Oriented Matroids
• Proof of Grünbaum's conjecture on the stretchability of certain arrangements of pseudolines
• Quasi-commuting families of quantum minors
• The Tutte polynomial
• The purity of set-systems related to Grassmann necklaces
• Vapnik-Chervonenkis dimension and (pseudo-)hyperplane arrangements
• Weak separation and plabic graphs
• \(Y\)-systems and generalized associahedra

Cited in

(4)

• Cubillages in odd dimensions
• Inseparability graphs of oriented matroids
• scientific article; zbMATH DE number 5585143 (Why is no real title available?)
• The first higher Stasheff-Tamari orders are quotients of the higher Bruhat orders

This page was built for publication: Purity and Separation for Oriented Matroids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6051925)