Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2607.21054

Computations of $\tilde{A}_2$ Bruhat intervals via shadows

Megan Masters
View original source ↗Read source document ↗Export metadata ↓

Abstract

We develop an explicit geometric and algebraic description of shadows in the affine Coxeter complex of type $\tilde{A}_2$, by introducing a coordinate system based on a decomposition of the complex into tunnels and channels. We also provide an algorithm for converting arbitrary reduced words into coordinates. Using this framework, we identify geometric symmetries of shadows and show that they are governed by the underlying channel structure. This allows us to derive explicit, piecewise formulas for the cardinality of shadows in $\tilde{A}_2$, depending on the parity of the coordinates. Furthermore, we establish a simple criterion for shadow membership via a counting function that detects admissible positions within channels. These results provide a concrete and computationally effective description of shadows in affine type $\tilde{A}_2$, bridging the gap between combinatorial definitions and geometric realisations.

Explore related subjects

math.GRmath.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Megan Masters. 2026-07-23. Computations of $\tilde{A}_2$ Bruhat intervals via shadows. https://arxiv.org/abs/2607.21054

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

KEEP EXPLORING

Related papers

arXiv2026

Hyperfiniteness of boundary actions via tree decompositions

We study conditions for a countable group acting on a connected locally finite hyperbolic graph to induce a hyperfinite orbit equivalence relation on the Gromov boundary of the graph in terms of tree-decompositions of the graph. We prove that for a connected locally finite hyperbolic graph $X$ equipped with an action of a countable group $G$, if $(T, β)$ is a $G$-invariant tree-decomposition of $X$ such that each bag induces a connected subgraph $X_t$ of $X$ for each $t \in V(T)$, each adhesion set is finite and such that there are only finitely many $G$-orbits of edges of $T$, then the orbit equivalence relation of $G$ acting on the Gromov boundary $\partial X$ is hyperfinite provided the orbit equivalence relation of $G$ acting on $\partial T$ is hyperfinite and the orbit equivalence relations of the bag stabilizers acting on $\partial X_t$ are all hyperfinite. We show that the converse also holds if $(T, β)$ satisfies the additional property that each adhesion set distinguishes at least two ends of $X$.

math.GR↗
arXiv2026

Compatible additions on a six-element commutative semigroup: equational bases and subvariety lattices

Let $M$ be the six-element commutative semigroup occurring as the common multiplicative reduct of the semirings $SR_6$ and $TR_6$. The closing paragraph of Shao, Ren, and Gao~\cite{ShaoRenGao2026} asks for the finite-basis and subvariety questions for the four remaining compatible additions on $M$. We answer these questions for the four isomorphism types $R_{01},R_{02},R_{11},R_{12}$. First, we classify all compatible additions on $M$: there are nine labelled additions and six isomorphism types, parametrized by $R_{ij}$ with $0\leq i\leq j\leq 2$. For each of the four new types we give a graph-theoretic criterion for every identity, an explicit infinite basis, and a proof of nonfinite basability. The generated varieties $\V(R_{01})$ and $\V(R_{02})$ have eleven subvarieties each, while $\V(R_{11})$ has sixty-six. The lattice $\Sub(\V(R_{12}))$ is countably infinite. Every identity in this variety reduces to a subset of twenty-five fixed identities together with two monotone path families $γ_n$ and $\gammaD_n$. This yields a canonical signature $(H,p,q)$, complete normal forms, explicit meet and join operations, and a formula for all covers. There are 153 fixed nodes, 43 one-parameter families, and 9 two-parameter families; exactly eighteen subvarieties are finitely based, and the unique limit subvariety is $\V(SR_6)$. The strong nonfinite-basis status of the four finite semirings remains open.

math.GR↗