Lagrangian Pairs and Lagrangian Orthogonal Matroids
Richard F. Booth, Alexandre V. Borovik, Neil White
Abstract
Represented Coxeter matroids of types Cn and Dn, that is, symplectic and orthogonal matroids arising from totally isotropic subspaces of symplectic or (even-dimensional) orthogonal spaces, may also be represented in buildings of type Cn and Dn, respectively. Indeed, the particular buildings involved are those arising from the flags or oriflammes, respectively, of totally isotropic subspaces. There are also buildings of type Bn arising from flags of totally isotropic subspaces in odd-dimensional orthogonal space. Coxeter matroids of type Bn are the same as those of type Cn (since they depend only upon the reflection group, not the root system). However, buildings of type Bn are distinct from those of the other types. The matroids representable in odd dimensional orthogonal space (and therefore in the building of type Bn) turn out to be a special case of symplectic (flag) matroids, those whose top component, or Lagrangian matroid, is a union of two Lagrangian orthogonal matroids. These two matroids are called a Lagrangian pair, and they are the combinatorial manifestation of the ``fork'' at the top of an oriflamme (or of the fork at the end of the Coxeter diagram of Dn). Here we give a number of equivalent characterizations of Lagrangian pairs, and prove some rather strong properties of them.
Create a lesson
Related papers
Combinatorics of hyperplane arrangements and Witten zeta function at the origin
Kam Cheong Au, Kazuhiro Onodera
Proof of the Pach-Tardos conjecture
Lior Gishboliner, Xiangyu Li
Longest cycles intersect linearly in highly connected graphs
Jie Ma, Bo Ning, Ziyuan Zhao
Cutting a convex body into fat parts and approximating Euclidean distance by graph distances
János Pach, Gábor Tardos
A counterexample to the quantum Hedetniemi conjecture
Julius A. Zeiss
Schrijver-Delsarte rigidity in association schemes and undecidability of quantum graph homomorphism
Lorenzo Ciardo, Iris Hebbeker, Gideo Joubert et al.