Search arXivSearch

arXiv · 2510.25041

Generalized Rothe diagrams for orthogonal roots

Abstract

Let $U$ be a set of positive roots of type $ADE$, and let $Ω_U$ be the set of all maximum-cardinality orthogonal subsets of $U$. We associate a generalized Rothe diagram to each element $R\in Ω_U$ as a broad, root-theoretic generalization of the traditional Rothe diagrams of permutations, and we use the generalized Rothe diagrams to define a $q$-polynomial in $U$ that we call the generalized quantum Hafnian of $U$. We study a large number of examples where these constructions recover a variety of widely studied algebraic and combinatorial objects. One of our motivating examples involves a certain set $U$ of $k^2$ roots in type $D_{2k}$, where the elements of $Ω_U$ can be identified with permutations in $S_k$, the generalized Rothe diagrams are the traditional Rothe diagrams of permutations, and the generalized quantum Hafnian is the $q$-permanent. In another example, the generalized quantum Hafnian gives a non-recursive method to compute the 45 terms of a well-known invariant cubic polynomial of type $E_6$. More generally, all our examples in types $A$ and $D$ are closely related to perfect matchings and rook configurations, and our examples in type $E$ have applications to labelled Fano planes, del Pezzo surfaces, and minuscule representations. Each of our examples also gives rise to a matroid, and many of our examples have an associated equal-rank simply-laced symmetric pair.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

R. M. Green, Tianyuan Xu. 2026-08-03. Generalized Rothe diagrams for orthogonal roots. https://arxiv.org/abs/2510.25041

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO