Cubulation of Bruhat graphs

Alex Bishop; Anne Thomas; Elizabeth Mili\'cevi\'c

arxiv: 2504.03046 · v2 · pith:LAR726PXnew · submitted 2025-04-03 · 🧮 math.RT · math.CO· math.GR

Cubulation of Bruhat graphs

Alex Bishop , Elizabeth Mili\'cevi\'c , Anne Thomas This is my paper

Pith reviewed 2026-05-22 21:23 UTC · model grok-4.3

classification 🧮 math.RT math.COmath.GR

keywords Bruhat graphscubulationCoxeter systemsKazhdan-Lusztig polynomialsaffine Weyl groupsnormal form forestsBruhat orderintervals in Coxeter groups

0 comments

The pith

If infinitely many Bruhat intervals admit cubulations then the Coxeter system must be affine type Ã_n.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper studies when the Bruhat graph on an interval [1,y] in a Coxeter group can be cubulated, meaning the graph can be realized as a product of subintervals of the integers. Prior results already show that any such cubulation forces every Kazhdan-Lusztig polynomial P_{x,y} to equal 1. The authors build explicit cubulations for the longest element in finite types A and B/C by means of normal form forests, yet they also find elements y with P_{1,y}=1 whose intervals refuse cubulation in certain exceptional finite types. The main theorem states that the existence of infinitely many cubulable intervals forces the Coxeter system to be of affine type Ã_n, and the paper supplies concrete cubulations for all such intervals in the case Ã2.

Core claim

For any Coxeter system (W,S) and any y in W, cubulation of the Bruhat graph on [1,y] is possible only when P_{x,y}=1 for every x ≤ y. Normal form forests produce cubulations of [1,w0] in types A and B/C. In some exceptional finite types there exist y with P_{1,y}=1 whose intervals cannot be cubulated. If infinitely many y admit cubulations then (W,S) must be of type Ã_n for some n ≥ 1. In type Ã2 the authors construct a cubulation for every y satisfying P_{x,y}=1 for all x ≤ y.

What carries the argument

Cubulation of the Bruhat graph on the interval [1,y], realized by spanning the graph with a product of subintervals of Z and constructed via normal form forests in types A and B/C.

If this is right

Cubulation of [1,y] is possible only when every Kazhdan-Lusztig polynomial P_{x,y} equals 1.
Finite Coxeter groups outside types A and B/C contain intervals with trivial Kazhdan-Lusztig polynomials that nevertheless admit no cubulation.
Only affine type Ã_n Coxeter systems can possess infinitely many cubulable intervals [1,y].
In type Ã2 every interval whose Kazhdan-Lusztig polynomials are all 1 admits an explicit cubulation.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The same normal-form-forest technique might extend to produce cubulations in other affine types beyond Ã2.
The characterization suggests that the geometry of Bruhat order in non-affine infinite Coxeter groups is fundamentally more complex than in affine A cases.
One could test whether the cubulation property holds uniformly for all y with trivial polynomials in Ã3 or higher affine A types.

Load-bearing premise

The argument rests on the known implication that any cubulation forces all Kazhdan-Lusztig polynomials on the interval to be identically 1, together with the existence of normal form forests that produce cubulations in types A and B/C.

What would settle it

Discovery of a Coxeter system outside affine type Ã_n that possesses infinitely many y with cubulable [1,y], or an explicit y in type Ã2 with P_{x,y}=1 for which no cubulation exists.

read the original abstract

For $(W,S)$ an arbitrary Coxeter system and any $y \in W$, we investigate the condition that the Bruhat graph for the interval $[1,y]$ can be cubulated, meaning roughly that this graph can be spanned by a product of subintervals of $\mathbb{Z}$. Results of Carrell-Peterson and Elias-Williamson imply that if $[1,y]$ can be cubulated, then the Kazhdan-Lusztig polynomial $P_{x,y} = 1$ for all $x \leq y$. We consider the converse to this result. For $(W,S)$ finite and $w_0$ the longest element in $W$, so that $P_{x,w_0} = 1$ for all $x \in W$, we use normal form forests to construct cubulations of $[1,w_0]$ in types $A$ and $B/C$. However, in some exceptional types, we determine elements $y \in W$ such that $P_{1,y} = 1$ but $[1,y]$ cannot be cubulated. We then prove that if there are infinitely many $y \in W$ such that $[1,y]$ can be cubulated, then $(W,S)$ must be of type $\tilde{A}_n$ for some $n \geq 1$. Finally, for $(W,S)$ of type $\tilde{A}_2$, we exhibit a cubulation of $[1,y]$ for each of the infinitely many $y \in W$ such that $P_{x,y} = 1$ for all $x \leq y$.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

Only affine A_n systems allow infinitely many cubulable Bruhat intervals, with explicit constructions given for A2 and for longest elements in finite A and B/C.

read the letter

The main result is that if a Coxeter system has infinitely many y where the Bruhat interval [1,y] cubulates, then the system must be affine type A_n. They also build explicit cubulations for the longest element in finite types A and B/C using normal form forests, produce counterexamples in some exceptional finite types where P=1 but cubulation fails, and give concrete cubulations for every qualifying y in affine A2. These pieces are not in the cited prior literature. The work sits cleanly on the Carrell-Peterson and Elias-Williamson implication that cubulation forces all KL polynomials to be 1, then adds independent constructions and a type classification for the infinite case. The counterexamples usefully separate the two directions. The necessity argument for affine A_n appears to rest on standard facts about infinite Coxeter systems and the growth of intervals, without visible circularity. The main limitation is that the full derivations for the forest constructions and the exceptional-type case analysis are not checkable from the abstract alone, so any referee would need to verify those steps in detail. Nothing in the stated claims contradicts itself or relies on fitting. This paper is for specialists in algebraic combinatorics and the combinatorics of Coxeter groups who already work with Bruhat orders and KL polynomials. A reader in that area will find the explicit constructions and the sharp classification useful. It deserves a serious referee because the new results are concrete and the central claim is a clean necessity statement that narrows the landscape.

Referee Report

0 major / 3 minor

Summary. The manuscript examines cubulation of Bruhat graphs on intervals [1,y] in arbitrary Coxeter systems (W,S). Building on Carrell-Peterson and Elias-Williamson, it recalls that cubulation forces P_{x,y}=1 for all x≤y. For finite W it constructs cubulations of [1,w0] in types A and B/C via normal form forests; it exhibits counterexamples in certain exceptional types where P=1 but cubulation fails. It proves that the existence of infinitely many cubulable [1,y] forces the Coxeter type to be affine Ã_n (n≥1), and supplies explicit cubulations in type Ã2 for every y with P_{x,y}=1.

Significance. If the constructions and the necessity theorem hold, the paper supplies a clean characterization of Coxeter systems admitting infinitely many cubulable Bruhat intervals together with concrete realizations in the affine-A case. The normal-form-forest technique for producing cubulations in types A and B/C is a positive contribution that may be reusable.

minor comments (3)

The abstract and introduction invoke “normal form forests” as the key tool for the type-A and type-B/C constructions; a one-paragraph definition or a reference to the precise combinatorial object would make the argument more self-contained.
A short table or diagram summarizing, by Coxeter type, which intervals admit cubulations and which do not would improve readability of the case analysis.
In the statement of the main necessity theorem, the precise meaning of “infinitely many y” (e.g., whether the y are required to be distinct up to length or up to conjugacy) should be spelled out explicitly.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their careful reading of the manuscript, their accurate summary, and their positive assessment of the significance of the results. We are pleased with the recommendation of minor revision.

Circularity Check

0 steps flagged

No significant circularity identified

full rationale

The derivation begins from external results of Carrell-Peterson and Elias-Williamson establishing that cubulation of [1,y] forces P_{x,y}=1; the paper then supplies independent constructions via normal form forests for [1,w_0] in finite types A and B/C, explicit counterexamples where P=1 but no cubulation exists in exceptional types, a necessity proof that infinitely many cubulable intervals forces type Ã_n, and direct exhibition of cubulations for infinitely many y in Ã2. No equation or step reduces a claimed result to a fitted parameter, self-definition, or load-bearing self-citation chain; all central claims rest on cited external theorems plus new constructions and proofs that do not loop back to the paper's own inputs.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The paper relies on standard facts about Coxeter systems, Bruhat order, and Kazhdan-Lusztig polynomials; no new free parameters, ad-hoc axioms, or postulated entities are introduced in the abstract.

axioms (2)

domain assumption The implication that cubulation of the Bruhat graph on [1,y] forces P_{x,y}=1 for all x≤y (Carrell-Peterson, Elias-Williamson).
Invoked as the starting point for investigating the converse.
domain assumption Normal form forests exist and can be used to construct cubulations of [1,w0] in finite types A and B/C.
Central to the positive constructions in those types.

pith-pipeline@v0.9.0 · 5833 in / 1686 out tokens · 33061 ms · 2026-05-22T21:23:00.105033+00:00 · methodology

Cubulation of Bruhat graphs

Core claim

What carries the argument

If this is right

Where Pith is reading between the lines

Load-bearing premise

What would settle it

discussion (0)