arxiv: 2605.11449 · v1 · submitted 2026-05-12 · 🧮 math.CO

Recognition: no theorem link

Weyl Groups and the Modified Kostant Game

Alexander Caviedes Castro, Juan Sebasti\'an Cort\'es-Cruz

Pith reviewed 2026-05-13 01:48 UTC · model grok-4.3

classification 🧮 math.CO

keywords Kostant gameWeyl groupsparabolic quotientsreduced wordsCoxeter groupsMukai conjectureYoung tableauxfinite automata

0 comments

The pith

A generalization of the Kostant game via multi-vertex modifications establishes a bijection between game configurations and minimal length representatives of parabolic quotients in Weyl groups.

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

The paper generalizes the Kostant game by allowing moves that modify multiple vertices simultaneously according to chosen rules. It proves that the set of reachable configurations under these rules stands in natural bijection with the shortest elements of the cosets in W/W_J, where W is the Weyl group and W_J the parabolic subgroup. This correspondence equips the study of reduced words with a dynamical, game-based interpretation. The authors then leverage the framework to derive a root counting identity and to construct Standard Young Tableaux through sequences of game moves.

Core claim

The configurations obtained from the modified Kostant game with arbitrary multi-vertex rules are in one-to-one correspondence with the minimal-length representatives of the parabolic quotients W/W_J. The bijection respects the length function on the Weyl group and is compatible with the Bruhat order, thereby giving an algorithmic and dynamical perspective on reduced words and their properties.

What carries the argument

the multi-vertex modified Kostant game, a combinatorial process on the positive roots where each configuration represents a set of roots and moves update multiple components while preserving positivity and length conditions

If this is right

The game enumerations produce a novel identity for counting roots in the root system.
The framework formalizes a Coxeter-theoretic basis for combinatorial attacks on the Mukai conjecture.
Reduced word languages in these groups are regular and can be recognized by finite state automata.
Standard Young Tableaux arise dynamically as sequences of moves in the game for appropriate choices of the modification rules.

Where Pith is reading between the lines

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

The bijection suggests that termination conditions or winning strategies in the game correspond to algebraic properties of the parabolic quotients.
Similar modifications to other root games could yield analogous bijections for different poset structures in representation theory.
The automata construction opens the possibility of using language theory tools to analyze word problems in Coxeter groups.
The dynamic tableau construction may lead to new recursive algorithms for generating tableaux in type A cases.

Load-bearing premise

The specific rules chosen for the multi-vertex modifications must maintain the key combinatorial invariants, including the length function and Bruhat order relations, so that the bijection holds for any parabolic subgroup.

What would settle it

Construct a counterexample by selecting a small Weyl group such as the symmetric group S_4, a nontrivial parabolic subgroup, and a multi-vertex rule for which the number or structure of reachable game configurations differs from the known number of minimal coset representatives.

Figures

Figures reproduced from arXiv: 2605.11449 by Alexander Caviedes Castro, Juan Sebasti\'an Cort\'es-Cruz.

**Figure 1.** Figure 1: The set of possible configurations of the Kostant game on D4. Example 3.4 (Infinite game on the affine graph D˜ 4). To contrast with the finite behavior on classical Dynkin diagrams, we illustrate the divergence of the game on the affine graph D˜ 4. The graph D˜ 4 consists of a central vertex v0 connected to four peripheral vertices v1, v2, v3, and v4. v0 v1 v2 v3 v4 [PITH_FULL_IMAGE:figures/full_fig_p004… view at source ↗

**Figure 2.** Figure 2: The structure of the affine graph D˜ 4 [PITH_FULL_IMAGE:figures/full_fig_p004_2.png] view at source ↗

**Figure 3.** Figure 3: A diverging transition of the Kostant game on D˜ 4. In configuration cB = (3, 1, 1, 1, 1), the dynamics unfold as follows: • Central vertex v0: Its value is 3. The sum of its neighbors is 1 + 1 + 1 + 1 = 4. Since 3 ̸< 4/2 = 2, v0 is no longer sad. • Peripheral vertices v1, . . . , v4: Each has a value of 1. Their only neighbor is v0, which has a value of 3. Since 1 < 3/2 = 1.5, all four peripheral vertices… view at source ↗

**Figure 4.** Figure 4: Two paths in the Kostant Game on the F4 diagram ending in different configurations. 3.3. Definition with External Sources. Let Φ be a root system with simple roots ∆ = {α1, . . . , αn} and Cartan matrix A. We select a subset of vertices I ⊆ {1, . . . , n} to act as modified nodes or “external sources”. The corresponding parabolic subgroup will be determined by the unmodified vertices J = S \ I. Definition… view at source ↗

**Figure 5.** Figure 5: Two instances of the Modified Kostant Game on A4: on the left with active set I = {1}, on the right with I = {2}. 3.4. Bijection with Minimal Coset Representatives. The central result of our work is that this modified game completely models the structure of parabolic quotients. Let J = S \ I be the set of unmodified vertices. Theorem 3.8. There exists a canonical bijection between the set of all reachable … view at source ↗

**Figure 6.** Figure 6: The Modified Kostant Game on A2 altering two vertices. 3.5. Root Counting Identity. In previous work [2], it was shown that for a single active vertex (I = {j}), the total number of chips in the final configuration of the Modified Kostant Game equals the sum of the j-th coefficients of the positive roots outside the corresponding maximal parabolic subgroup. Using the bijection established in Theorem 3.8, w… view at source ↗

**Figure 7.** Figure 7: DFA for L(W{s1} ) = {ε, s2, s2s1} [PITH_FULL_IMAGE:figures/full_fig_p015_7.png] view at source ↗

**Figure 8.** Figure 8: Two valid games on A3 modified at s2. Both correspond to different reduced expressions of the element w = s2s1s3s2 and construct the two SYTs of shape λ = (2, 2). Theorem 3.16. Let w ∈ WJ be a Grassmannian permutation for J = S \ {k}, and let λ = λ(w) be its associated shape. The step-by-step filling mechanism that assigns to each sequence of valid moves (i1, i2, . . . , im) a placement of the integer j in… view at source ↗

read the original abstract

This paper presents a generalization of the Kostant game, a combinatorial framework originally for generating positive roots in Lie algebras. By introducing an arbitrary multi-vertex modification, we prove that the resulting game configurations naturally biject with the minimal length representatives of parabolic quotients W/W_J. This yields a dynamical and algorithmic perspective on reduced words. Finally, we apply this framework to derive a novel root counting identity, formalize the Coxeter-theoretic foundation for combinatorial approaches to the Mukai conjecture, establish the regularity of reduced word languages via finite state automata, and dynamically construct Standard Young Tableaux.

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

The paper generalizes the Kostant game via arbitrary multi-vertex moves and claims a direct bijection to minimal-length coset representatives in W/W_J, plus some applications, but the exact rules and invariance proofs are what matter most.

read the letter

The core new element is the multi-vertex version of the Kostant game and the explicit bijection it sets up with shortest representatives in parabolic quotients. That gives a game-based way to generate reduced words and leads to the claimed root-counting identity plus the Coxeter framing for the Mukai conjecture. The automata regularity result and the dynamic construction of standard Young tableaux are presented as direct consequences, which is a clean way to tie several threads together in one framework. If the proofs go through, this supplies a concrete algorithmic handle on things that are usually handled by more static combinatorial arguments. The abstract does a reasonable job sketching how the game configurations correspond to minimal coset reps and why that perspective might be useful for root systems and tableaux. The potential soft spot is exactly the one the stress test flags: the modification rules are described as arbitrary, yet the bijection requires that length and Bruhat covering relations stay intact for every parabolic J. If the rules can be chosen freely enough to produce non-reduced sequences or skip some minimal representatives, the correspondence breaks. The abstract does not spell out the precise constraints that prevent this, so the generality of the claim rests on an invariance property that needs explicit verification in the body. Without seeing the full definitions and the proof that every legal game path stays reduced and hits every shortest rep exactly once, it is hard to judge how robust the central result is. This is aimed at people already working with Coxeter groups, reduced words, and combinatorial aspects of Weyl groups or the Mukai conjecture. A reader who likes game or automata models for algebraic combinatorics would find the perspective worth looking at. I would send it to peer review. The topic is focused, the claims are specific enough to check, and the applications are stated clearly enough that referees can evaluate the bijection and the new identity directly.

Referee Report

1 major / 1 minor

Summary. The paper generalizes the Kostant game on positive roots by introducing an arbitrary multi-vertex modification. It claims to prove that the legal configurations of this modified game are in natural bijection with the minimal-length coset representatives of parabolic quotients W/W_J in a Weyl group W. The framework is then used to give a dynamical view of reduced words, derive a root-counting identity, supply a Coxeter-theoretic basis for combinatorial attacks on the Mukai conjecture, prove that the language of reduced words is regular via finite-state automata, and construct standard Young tableaux dynamically.

Significance. If the central bijection is established with the claimed generality, the work supplies a new combinatorial dynamical system for studying parabolic quotients and reduced words. The applications to automata regularity and to the Mukai conjecture would be of interest to specialists in Coxeter combinatorics and representation theory, provided the invariance properties under the modification are rigorously verified.

major comments (1)

[Abstract and game-definition section] Abstract and the section defining the modified game: the claim that the multi-vertex modification may be chosen arbitrarily while still preserving a bijection with W/W_J for every parabolic J is load-bearing. The rules must leave the length function and the covering relations of the induced Bruhat order invariant; otherwise non-reduced sequences or missing minimal representatives can appear. The manuscript must state the precise constraints on the allowed modifications and prove that every such choice satisfies the required invariance (length additivity and Bruhat compatibility). Without this, the generality asserted in the central theorem does not follow.

minor comments (1)

[Abstract] The abstract lists four applications; each should be cross-referenced to the corresponding theorem or proposition so that readers can locate the precise statements.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the careful and constructive report. The single major comment identifies a genuine need for greater precision regarding the scope of admissible modifications, and we will revise the manuscript accordingly to strengthen the central claims.

read point-by-point responses

Referee: [Abstract and game-definition section] Abstract and the section defining the modified game: the claim that the multi-vertex modification may be chosen arbitrarily while still preserving a bijection with W/W_J for every parabolic J is load-bearing. The rules must leave the length function and the covering relations of the induced Bruhat order invariant; otherwise non-reduced sequences or missing minimal representatives can appear. The manuscript must state the precise constraints on the allowed modifications and prove that every such choice satisfies the required invariance (length additivity and Bruhat compatibility). Without this, the generality asserted in the central theorem does not follow.

Authors: We agree that the modifications cannot be completely arbitrary and that the manuscript should explicitly delineate the admissible class together with a proof of the required invariance. In the revised version we will insert a dedicated subsection immediately after the game definition that (i) states the precise constraints (compatibility with the root poset, preservation of length under each move, and retention of the covering relations of the induced Bruhat order on the quotient), (ii) proves that any modification obeying these constraints yields configurations in bijection with the minimal-length coset representatives of W/W_J, and (iii) verifies that the length function and Bruhat covering relations remain invariant. These additions will be cross-referenced in the abstract and will underpin all subsequent applications (reduced-word dynamics, root-counting identity, automata regularity, and the Mukai-conjecture foundation). The main theorems themselves are unaffected; only their supporting hypotheses are made fully explicit. revision: yes

Circularity Check

0 steps flagged

No circularity: bijection derived from explicit combinatorial rules

full rationale

The paper defines an arbitrary multi-vertex modification to the Kostant game and then proves (rather than assumes) that the resulting configurations are in bijection with minimal-length coset representatives in W/W_J. The derivation relies on verifying that the modified moves preserve length and Bruhat order compatibility, which is an independent combinatorial check rather than a self-definition, fitted parameter, or self-citation chain. No step reduces the claimed bijection to its own inputs by construction; the result is a theorem whose hypotheses are stated separately from its conclusion.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central bijection rests on standard facts about Weyl groups, length functions, and parabolic subgroups; no free parameters or invented entities are visible from the abstract.

axioms (1)

standard math Standard properties of Weyl groups, parabolic subgroups, and the length function on cosets
The bijection statement presupposes the usual Coxeter-theoretic definitions of W, W_J, and minimal-length representatives.

pith-pipeline@v0.9.0 · 5387 in / 1230 out tokens · 34652 ms · 2026-05-13T01:48:51.540886+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

11 extracted references · 11 canonical work pages

[1]

(2005).Combinatorics of Coxeter Groups

Björner, A., & Brenti, F. (2005).Combinatorics of Coxeter Groups. Graduate Texts in Mathematics, vol

work page 2005
[2]

Springer, Berlin, Heidelberg

work page
[3]

Pure and Applied Mathematics Quarterly19(2023), no

CaviedesCastro, A., Pabiniak, M., &Sabatini, S.(2023).GeneralizingtheMukaiConjecturetothesymplectic category and the Kostant game. Pure and Applied Mathematics Quarterly19(2023), no. 4, 1803–1837

work page 2023
[4]

Casagrande,The number of vertices of a Fano polytope, Annales de l’Institut Fourier56(2006), no

C. Casagrande,The number of vertices of a Fano polytope, Annales de l’Institut Fourier56(2006), no. 1, 121–130

work page 2006
[5]

(2017).Topics in Combinatorics; Lecture Notes (Taught by Alexander Postnikov)

Chen, E. (2017).Topics in Combinatorics; Lecture Notes (Taught by Alexander Postnikov). MIT Lecture notes

work page 2017
[6]

J. E. Hopcroft & J. D. Ullman,Introduction to Automata Theory, Languages, and Computation, Addison- Wesley, 1979

work page 1979
[7]

Humphreys, J. E. (1972).Introduction to Lie Algebras and Representation Theory. Graduate Texts in Math- ematics, vol. 9. Springer-Verlag, New York

work page 1972
[8]

S. Mukai,Problems on characterization of the complex projective space, Birational Geometry of Algebraic Varieties, Open Problems, Proceedings of the 23rd Symposium of the Taniguchi Foundation at Katata, Japan (1988), 57–60

work page 1988
[9]

Pasquier,Variétés horosphériques de Fano,Bull

B. Pasquier,Variétés horosphériques de Fano,Bull. Soc. Math. France,136, (2008), no. 2, 195–225

work page 2008
[10]

Reineke,The Mukai Conjecture for Fano Quiver Moduli, Algebras and Representation Theory, Vol

M. Reineke,The Mukai Conjecture for Fano Quiver Moduli, Algebras and Representation Theory, Vol. 27, pp. 1641–1644, 2024. Doi 10.1007/s10468-024-10268-8

work page doi:10.1007/s10468-024-10268-8 2024
[11]

Winkel,A combinatorial bijection between standard Young tableaux and reduced words of Grassmannian permutations, Séminaire Lotharingien de Combinatoire36(1996), Article B36h

R. Winkel,A combinatorial bijection between standard Young tableaux and reduced words of Grassmannian permutations, Séminaire Lotharingien de Combinatoire36(1996), Article B36h. Department of Mathematics, Universidad Nacional de Colombia Email address:acaviedesc@unal.edu.co Department of Mathematics, Universidad Nacional de Colombia Email address:juascort...

work page 1996