Lagrangian Pairs and Lagrangian Orthogonal Matroids

Richard F. Booth; Alexandre V. Borovik; Neil White

Home/Archive/arXiv

arXiv · math/0209100

Lagrangian Pairs and Lagrangian Orthogonal Matroids

Richard F. Booth·Alexandre V. Borovik·Neil White

View original source ↗Read source document ↗Export metadata ↓

Abstract

Represented Coxeter matroids of types $C_n$ and $D_n$, 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 $C_n$ and $D_n$, 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 $B_n$ arising from flags of totally isotropic subspaces in odd-dimensional orthogonal space. Coxeter matroids of type $B_n$ are the same as those of type $C_n$ (since they depend only upon the reflection group, not the root system). However, buildings of type $B_n$ are distinct from those of the other types. The matroids representable in odd dimensional orthogonal space (and therefore in the building of type $B_n$) 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 $D_n$). Here we give a number of equivalent characterizations of Lagrangian pairs, and prove some rather strong properties of them.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Richard F. Booth, Alexandre V. Borovik, Neil White. 2002-09-09. Lagrangian Pairs and Lagrangian Orthogonal Matroids. https://arxiv.org/abs/math/0209100

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Domination in Johnson graphs J(n, 3) for odd n

In 2025 Cornet, Dravec, and Torres determined the domination number $γ(J(n,3))$ of the Johnson graph for every even $n \ge 6$, expressing it as a closed form $ϕ_n$ in terms of Fort-Hedlund covering numbers, and conjectured the same value for odd $n$. We prove this conjecture: $γ(J(n,3)) = ϕ_n$ for every odd $n \ge 7$. A dominating set of $J(n,3)$ is the same as a lotto design $\mathrm{LD}(n,3,3,2)$, and the lotto numbers $L(n,3,3,2)$, and hence $γ(J(n,3))$, were already determined for every $n$ by Bate (1978) and by Brouwer (1981); a short degree argument of Füredi, Székely, and Zubor (1996) gives the same lower bound for all $n \not\equiv 9, 10 \pmod{12}$. The contribution of this paper is therefore a new proof of the odd case, carried out within the bijective framework of Cornet, Dravec, and Torres.

math.CO↗

arXiv2026

HJ numbers revisited

Hales-Jewett theorem is well known. We prove a primitive recursive bound, in fact an $\clE^5$ one, for the density version. In preparation we deal with what was the main induction step in the old proof of Hales-Jewett as a result in its own right with better bounds. Also in improving our bounds.

math.CO↗

arXiv2026

Adjacency-degree algebras and spectral determination of graphs

Let $G$ be a graph with adjacency matrix $A$ and degree matrix $D$. Applying $A$ and $D$ repeatedly to the all-ones vector produces a space $M_G$ of functions on the vertices, and these functions are constant on the orbits of the automorphism group. We call $G$ AD-observable if $M_G$ contains the indicator vector of every orbit, and AD-separable if the functions in $M_G$ separate the orbits. Forests are AD-observable, by McKay's leaf-pruning argument. Our main result is that for every cograph, $M_G$ is spanned by the indicator vectors of the cells of the stable partition of color refinement. Hence a cograph is AD-observable, or equivalently AD-separable, exactly when color refinement finds its orbits, and we describe these cographs by their cotrees. We also show that two cographs with the same number of vertices and the same homomorphism counts from all caterpillars have the same counts from all trees. The main result does not extend to distance-hereditary graphs: we give two such graphs on nine vertices that are AD-separable but not AD-observable.

math.CO↗