Search arXivSearch

arXiv · 2602.05326

Tilted Richardson Varieties

Abstract

The study of the flag variety $\mathrm{Fl}_n$ and its subvarieties, including Schubert and Richardson varieties, plays a fundamental role in algebraic geometry and algebraic combinatorics. In this paper, we introduce and develop the theory of tilted Richardson varieties $\mathrm{T}_{u,v}$, a new family of subvarieties of the flag variety that provides a geometric framework for the quantum Bruhat graphs. These varieties are defined for all pairs of permutations $u$ and $v$, extending the classical Richardson varieties in the case where $u\leq v$ in the Bruhat order. We establish their fundamental geometric properties, proving irreducibility and providing explicit dimension formulas. Moreover, we show that they have a well-defined stratification indexed by tilted Bruhat intervals, a generalization of classical Bruhat intervals previously introduced by Brenti, Fomin, and Postnikov. Additionally, we introduce a tilted generalization of the classical Deodhar decomposition of Richardson varieties, which leads to a combinatorial formula for tilted Kazhdan--Lusztig R-polynomials, a notion that arises naturally in our framework. We further develop a theory of total positivity for tilted Richardson varieties. In particular, we define and study the totally nonnegative parts of tilted Richardson varieties, proving they form a CW complex. This generalizes earlier results on the totally nonnegative flag variety and answers Björner's questions regarding geometric realizations of tilted Bruhat intervals. Finally, we establish explicit connections between tilted Richardson varieties and quantum Schubert calculus. Specifically, we prove that $\mathrm{T}_{u,v}$ coincides with minimal-degree two-point curve neighborhoods. As a result, we compute their cohomology classes and derive new relationships among Gromov--Witten invariants of the flag variety.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jiyang Gao, Shiliang Gao, Yibo Gao. 2026-02-08. Tilted Richardson Varieties. https://arxiv.org/abs/2602.05326

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

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO