Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2604.03484

Totally nonnegative maximal tori and opposed Bruhat intervals

Grant T. Barkley·Steven N. Karp
View original source ↗Read source document ↗Export metadata ↓

Abstract

Lusztig (2024) recently introduced the space $\mathcal{T}_{>0}$ of totally positive maximal tori of an algebraic group $G$. Each such torus is the intersection of a totally positive Borel subgroup and a totally negative Borel subgroup. Lusztig defined a map from the totally positive part of $G$ to $\mathcal{T}_{>0}$ and conjectured that it is surjective. We verify this conjecture. We also examine the closure of $\mathcal{T}_{>0}$, by studying when a totally nonnegative Borel subgroup is opposed to a totally nonpositive Borel subgroup. Our main result reduces this problem to a new combinatorial relation between pairs of Bruhat intervals of the Weyl group $W$, which we call 'opposition'. We provide a characterization of opposition when $G = \text{SL}_n$ (and $W$ is the symmetric group). Along the way, we disprove another conjecture of Lusztig (2021) on totally nonnegative Borel subgroups. Finally, we connect $\mathcal{T}_{>0}$ to the amplituhedron introduced by Arkani-Hamed and Trnka (2014) in theoretical physics, by showing that $\mathcal{T}_{>0}$ can be regarded as a 'universal flag amplituhedron'. This gives further motivation for studying $\mathcal{T}_{>0}$ and its closure.

Explore related subjects

math.COmath-phmath.MPmath.RT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Grant T. Barkley, Steven N. Karp. 2026-04-03. Totally nonnegative maximal tori and opposed Bruhat intervals. https://arxiv.org/abs/2604.03484

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗