Random permutations from q-Demazure products
Pith reviewed 2026-05-10 18:47 UTC · model grok-4.3
The pith
Random permutations from q-Demazure products on deleted transpositions converge to a deterministic permuton as n grows large.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
Applying the q-Demazure product to the subsequence of transpositions retained after independent deletions with probability 1-p from any reduced word of the longest element w0 produces a random permutation whose law converges to a deterministic permuton as n tends to infinity. This permuton is the same as the one arising in the q=0 case when the retention probability is replaced by p(1-q)/(1-qp).
What carries the argument
The q-Demazure product applied to the randomly retained subsequence of a reduced word for w0, which absorbs the deformation q into a simple rescaling of the retention probability p.
If this is right
- The limiting permuton exists and is deterministic for every fixed q and p in (0,1).
- The effect of the deformation q on the macroscopic statistics is fully captured by replacing p with p(1-q)/(1-qp).
- The convergence statement extends from the ordinary Demazure product to its q-deformed version without changing the form of the limit object.
Where Pith is reading between the lines
- The explicit adjustment formula indicates that q-deformations of the product operation can be reinterpreted as a change of measure on the underlying deletion process.
- One could examine the speed of convergence by tracking the total variation or Wasserstein distance to the predicted permuton for finite but growing n.
- Similar deletion-plus-product constructions applied to other q-analogs on the symmetric group may yield limits governed by the same rescaling rule.
Load-bearing premise
The q-Demazure product acts associatively on arbitrary subsequences of transpositions and the deletions are chosen independently for each position in the reduced word.
What would settle it
Numerical computation of the empirical distribution of the generated permutation for successively larger n, checking whether the measure stabilizes to the permuton predicted by the rescaled probability p(1-q)/(1-qp) rather than the original p.
Figures
read the original abstract
We study the $q$-deformation of the Demazure product model from arXiv:2407.21653. Consider the longest element $w_0$ in $S_n$ written as a reduced word in simple transpositions. Independently delete each transposition with probability $1-p$ and apply the $q$-Demazure product to the remaining ones. We show that the law of the resulting permutation converges as $n \to \infty$ to a deterministic permuton, which coincides with the $q=0$ case studied in arXiv:2407.21653 for adjusted probability $p'=p(1-q)/(1-qp)$. This resolves Conjecture 1.13 from arXiv:2407.21653 and identifies the limiting permuton explicitly.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript studies the q-deformation of the Demazure product model introduced in arXiv:2407.21653. A reduced word for the longest element w_0 in S_n is formed; each simple transposition is retained independently with probability p and the q-Demazure product is applied to the retained sequence. The central claim is that the law of the resulting permutation converges weakly as n→∞ to a deterministic permuton that coincides exactly with the q=0 limiting permuton of the earlier work upon the substitution p′=p(1−q)/(1−qp). This identification is asserted to resolve Conjecture 1.13 of arXiv:2407.21653.
Significance. If the derivation is complete, the result supplies an explicit, parameter-adjusted identification of the limiting object for the entire one-parameter family of q-Demazure models. It thereby furnishes a concrete bridge between q-analogues in Coxeter combinatorics and the theory of permutons while resolving the stated conjecture. The absence of additional fitted constants in the limit expression is a positive feature.
major comments (2)
- [Abstract and the proof of the main convergence result (likely §3–4)] The argument that the q-Demazure product preserves the associativity and deletion properties required for the convergence proof when applied to a random subsequence of the reduced word for w_0 is stated to be inherited from arXiv:2407.21653 without re-derivation or explicit verification for q>0. Because the convergence in the base case relies on specific algebraic identities (braid relations, length-additivity under deletion), it is necessary to confirm that these identities survive the q-deformation on the randomly thinned word; otherwise the reduction to the q=0 case with adjusted p′ does not go through. This assumption is load-bearing for the main theorem.
- [Statement of the main theorem] No quantitative error bounds, rate of convergence, or explicit control on the total variation distance to the limiting permuton appear in the stated result. Without such estimates it is difficult to confirm that the identification with the adjusted-p′ permuton holds uniformly in q for finite n.
minor comments (2)
- [§1] The precise definition of the q-Demazure product (including the parameter q in the multiplication rule) should be recalled explicitly in the introduction for readers unfamiliar with the q-analogue.
- [Introduction] A short comparison table or remark contrasting the q=0 and q>0 cases (e.g., the adjusted probability formula) would improve readability.
Simulated Author's Rebuttal
We thank the referee for their careful reading and valuable comments on the q-deformed Demazure product model. We address the major concerns point by point below.
read point-by-point responses
-
Referee: The argument that the q-Demazure product preserves the associativity and deletion properties required for the convergence proof when applied to a random subsequence of the reduced word for w_0 is stated to be inherited from arXiv:2407.21653 without re-derivation or explicit verification for q>0. Because the convergence in the base case relies on specific algebraic identities (braid relations, length-additivity under deletion), it is necessary to confirm that these identities survive the q-deformation on the randomly thinned word; otherwise the reduction to the q=0 case with adjusted p′ does not go through. This assumption is load-bearing for the main theorem.
Authors: We agree that explicit verification strengthens the argument. The q-Demazure product is defined so that it remains associative and satisfies the deletion property for any fixed q in [0,1) whenever the input is a subsequence of a reduced word; these follow directly from the q-analogue of the length function and the preservation of Coxeter braid relations under the deformation. Nevertheless, to make the reduction to the adjusted-p' model fully rigorous and self-contained, we will insert a short lemma in Section 3 that confirms the key algebraic identities carry over verbatim to the q-case. This addresses the load-bearing assumption. revision: yes
-
Referee: No quantitative error bounds, rate of convergence, or explicit control on the total variation distance to the limiting permuton appear in the stated result. Without such estimates it is difficult to confirm that the identification with the adjusted-p′ permuton holds uniformly in q for finite n.
Authors: The main theorem concerns weak convergence in law to a deterministic permuton as n→∞, which suffices to identify the limit and resolve Conjecture 1.13. In the permuton literature, such statements are standard without explicit rates; obtaining uniform quantitative bounds (e.g., total-variation or Wasserstein distance) uniform in both n and q would require separate analytic tools and lies outside the scope of the present work. The identification with p' is exact in the limit for each fixed q, and we therefore retain the current statement without adding error estimates. revision: no
Circularity Check
No circularity; explicit parameter adjustment extends independent prior result
full rationale
The paper proves convergence of the random permutation law to a deterministic permuton by direct algebraic identification with the q=0 case from the cited prior work, using the explicit adjustment p' = p(1-q)/(1-qp). This identification is stated as a theorem resolving an open conjecture and does not reduce any derived quantity to a fitted input or self-definition within the present paper. Properties such as associativity of the q-Demazure product on random subsequences are cited as inherited from the prior independent result rather than re-derived, but this is standard mathematical extension and does not constitute a load-bearing self-citation chain or ansatz smuggling that forces the outcome by construction. The central claim remains externally falsifiable via the prior paper's proofs and the explicit p-adjustment formula, with no self-referential predictions or renamings of known results.
Axiom & Free-Parameter Ledger
axioms (2)
- standard math The q-Demazure product is well-defined on subsequences of a reduced word for the longest element w0 and yields a permutation.
- domain assumption Deletions of transpositions occur independently with fixed probability 1-p.
Lean theorems connected to this paper
-
IndisputableMonolith/Cost/FunctionalEquation.leanwashburn_uniqueness_aczel unclear?
unclearRelation between the paper passage and the cited Recognition theorem.
We study the q-deformation of the Demazure product model... law of the resulting permutation converges... to deterministic permuton... adjusted probability p' = p(1-q)/(1-qp)
-
IndisputableMonolith/Foundation/AlexanderDuality.leanalexander_duality_circle_linking unclear?
unclearRelation between the paper passage and the cited Recognition theorem.
hydrodynamic limit theorem of Aggarwal... entropy solution... flux φ(z) = κz/((κ-1)z+1) with κ=(1-qp)/(1-p)
What do these tags mean?
- matches
- The paper's claim is directly supported by a theorem in the formal canon.
- supports
- The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
- extends
- The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
- uses
- The paper appears to rely on the theorem as machinery.
- contradicts
- The paper's claim conflicts with a theorem or certificate in the canon.
- unclear
- Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.
Reference graph
Works this paper leans on
-
[1]
Aggarwal,Limit Shapes and Local Statistics for the Stochastic Six-Vertex Model, Commun
[Agg20] A. Aggarwal,Limit Shapes and Local Statistics for the Stochastic Six-Vertex Model, Commun. Math. Phys.376(2020), no. 1, 681–746. arXiv:1902.10867 [math.PR]. [BB21] A. Borodin and A. Bufetov,Color-position symmetry in interacting particle systems, Ann. Probab.49 (2021), no. 4, 1607–1632. arXiv:1905.04692 [math.PR]. [BCG16] A. Borodin, I. Corwin, an...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.