pith. sign in

arxiv: 1907.00858 · v1 · pith:DN3IUMYGnew · submitted 2019-07-01 · 🧮 math.CO · math.RT

Kazhdan-Lusztig R-polynomials for pircons

Mario Marietti This is my paper

Pith reviewed 2026-05-25 11:50 UTC · model grok-4.3

classification 🧮 math.CO math.RT
keywords kazhdan-lusztigr-polynomialspolynomialsanaloguesappearedcombinatorialcommonfixed
0
0 comments X

The pith

Introduces pircons as a unifying combinatorial structure for parabolic, zircon, and fixed-point-free-involution versions of Kazhdan-Lusztig R-polynomials.

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

Kazhdan-Lusztig R-polynomials encode information about representations of Weyl groups and related objects. Different authors have created special versions for parabolic subgroups, for zircons, and for involutions without fixed points. The paper proposes pircons, a new class of partially ordered sets, as a single structure on which all these versions can be defined uniformly. The claim is that the usual recursive definition of the R-polynomials extends naturally to this broader setting and recovers the earlier cases as special instances.

Core claim

Pircons provide a common combinatorial framework for parabolic Kazhdan-Lusztig R-polynomials, Kazhdan-Lusztig R-polynomials of zircons, and Kazhdan-Lusztig-Vogan polynomials for fixed point free involutions.

Load-bearing premise

That the recursive relations and positivity properties that define the R-polynomials on the earlier structures continue to hold verbatim once the ambient poset is replaced by a pircon.

Figures

Figures reproduced from arXiv: 1907.00858 by Mario Marietti.

Figure 1
Figure 1. Figure 1: A special partial matching. For a proof of the following result, see [1, Lemma 5.2]. Lemma 2.4 (Lifting property of special partial matchings). Let P be a finite poset with ˆ1P , and M be a special partial matching of P. If x, y ∈ P with x < y and M(y) ≤ y, then (i) M(x) ≤ y, (ii) M(x) ≤ x =⇒ M(x) < M(y), and (iii) M(x) ≥ x =⇒ x ≤ M(y). Given a finite poset P, we denote by ∆(P) its order complex, which is … view at source ↗
Figure 2
Figure 2. Figure 2: Dihedral intervals of rank 1,2,3,4 [PITH_FULL_IMAGE:figures/full_fig_p006_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: A rank 7 dihedral orbit and a rank 6 chain-like orbit of hM, Ni, where M and N are colored in solid and dashed black Note that an orbit with two elements w and N(w) = M(w) 6= w is dihedral, whereas an orbit with two elements w = N(w) and M(w) = NM(w) 6= w is chain-like (see [PITH_FULL_IMAGE:figures/full_fig_p006_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: A dihedral orbit of rank 1 and a chain-like orbit of rank 1 by the definition of a special partial matching. We iterate this argument and obtain a dihedral orbit of rank r, where r is the smallest number such that · · · | MNM {z } r letters (z) = | · · ·NMN {z } r letters (z). Suppose that one of the two matching fixes z, say z = M(z). If z = N(z) then O is a chain of rank 0; otherwise z ✄N(z). If N(z) = M… view at source ↗
Figure 5
Figure 5. Figure 5: A pircon and two of its special partial matchings Definition 5.4. Let (P,M) be a refined pircon and w ∈ P. We say that a special partial matching M of w is strongly calculating provided that the restriction of M to P≤z is calculating for all z ∈ P such that z ≤ w and M(z) ✁ z. Notice that, by Lemma 3.1, the restriction of M to P≤z is indeed a special partial matching for all z ∈ P such that M(z) ✁ z. Theor… view at source ↗
Figure 6
Figure 6. Figure 6: Orbits when m(si , sj ) = 2 [PITH_FULL_IMAGE:figures/full_fig_p016_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: Orbits when m(si , sj ) = 3 Proposition 6.4. Let w ∈ ι \ e, and M and N be two distinct conjugation special partial matchings of w. Then M and N are strictly coherent if and only if M(w) 6= N(w). Proof. Straightforward by Lemma 6.3. Proof of Theorem 6.2. Let w ∈ ι\e and M, N ∈ SPMw: we need to show that M and N are coherent. Clearly, we may assume ρ(w) > 1 (ρ being the rank function of ι). If M is not a co… view at source ↗
Figure 8
Figure 8. Figure 8: A refined pircon. Using the recursive formula (5.1), we can compute all Kazhdan–Lusztig Rx -polynomials of this refined pircon. In particular, (R x · Rx)e,ˆ1 = X z:e≤z R x e,z(q) q 5−ρ(z) R x z,ˆ1 ( 1 q ) = −q(q − 1)2 6= 0, [PITH_FULL_IMAGE:figures/full_fig_p022_8.png] view at source ↗
read the original abstract

The purpose of this work is to provide a common combinatorial framework for some of the analogues and generalizations of Kazhdan-Lusztig R-polynomials that have appeared since the introduction of these remarkable polynomials (e.g., parabolic Kazhdan-Lusztig R-polynomials, Kazhdan-Lusztig R-polynomials of zircons, and Kazhdan-Lusztig-Vogan polynomials for fixed point free involutions).

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.

Referee Report

2 major / 1 minor

Summary. The manuscript introduces the class of pircons (a poset generalization encompassing zircons and certain parabolic quotients) and defines Kazhdan-Lusztig R-polynomials on them via a recursion that is asserted to recover the parabolic R-polynomials, the R-polynomials of zircons, and the Kazhdan-Lusztig-Vogan polynomials attached to fixed-point-free involutions.

Significance. If the claimed recovery holds, the construction supplies a single combinatorial setting in which several existing generalizations of R-polynomials can be compared and potentially extended; the paper supplies the necessary poset axioms and the recursive definition.

major comments (2)
  1. [§2] §2 (Definition of pircon and the R-polynomial recursion): the listed pircon axioms do not visibly guarantee the unique maximal chains or the length-parity constraints that are required for the classical recursion (sum over covering relations with the usual degree condition) to be well-defined; without an explicit lemma showing these properties follow from the axioms, it is unclear that the recursion is unambiguous on an arbitrary pircon.
  2. [§4] §4 (Recovery statements): the claims that the pircon R-polynomials coincide with the parabolic, zircon, and Vogan cases are stated but no explicit isomorphism or restriction argument is supplied that preserves the covering relations and the base case at the identity element; this verification is load-bearing for the unification claim.
minor comments (1)
  1. Notation for the rank function and the length function on the pircon should be distinguished from the standard Coxeter length to avoid confusion when specializing to the classical cases.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading and the constructive major comments. We address each point below and indicate the revisions we will make.

read point-by-point responses

  1. Referee: [§2] §2 (Definition of pircon and the R-polynomial recursion): the listed pircon axioms do not visibly guarantee the unique maximal chains or the length-parity constraints that are required for the classical recursion (sum over covering relations with the usual degree condition) to be well-defined; without an explicit lemma showing these properties follow from the axioms, it is unclear that the recursion is unambiguous on an arbitrary pircon.

    Authors: We agree that the well-definedness of the recursion requires explicit verification. The pircon axioms were chosen precisely to ensure unique maximal chains between comparable elements and the necessary length-parity conditions, but we acknowledge that this is not stated as a separate lemma. In the revised manuscript we will insert a short lemma in §2 proving these properties directly from the axioms, thereby confirming that the recursion is unambiguous. revision: yes

  2. Referee: [§4] §4 (Recovery statements): the claims that the pircon R-polynomials coincide with the parabolic, zircon, and Vogan cases are stated but no explicit isomorphism or restriction argument is supplied that preserves the covering relations and the base case at the identity element; this verification is load-bearing for the unification claim.

    Authors: The referee is correct that the recovery statements are central to the paper’s contribution and that the current text only asserts the coincidences without supplying the detailed arguments. We will expand §4 with three short subsections, each exhibiting the explicit restriction (or isomorphism) of a pircon to the corresponding classical poset while verifying that covering relations and the base case at the identity are preserved. revision: yes

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 1 invented entities

The central claim rests on the existence and properties of the newly introduced pircons; no free parameters or external axioms are visible from the abstract.

invented entities (1)
  • pircons no independent evidence
    purpose: A new class of posets that simultaneously generalizes zircons and supports the listed variants of R-polynomials
    Introduced in the paper to serve as the common framework; no independent existence proof or external evidence supplied in the abstract.

pith-pipeline@v0.9.0 · 5583 in / 1035 out tokens · 27418 ms · 2026-05-25T11:50:25.015616+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

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

20 extracted references · 20 canonical work pages

  1. [1]

    Abdallah, M

    N. Abdallah, M. Hansson, A. Hultman, Topology of posets with special partial matchings , Advances in Math. 348 (2019), 255-276

    work page 2019

  2. [2]

    Abdallah, A

    N. Abdallah, A. Hultman, Combinatorial invariance of KazhdanLusztigVogan polynom ials for fixed point free involutions, J. Algebr. Comb. 47 (2018), 543-560

    work page 2018

  3. [3]

    Bj¨ orner, F

    A. Bj¨ orner, F. Brenti, Combinatorics of Coxeter Groups , Graduate Texts in Mathematics 231, Springer-Verlag, New York, 2005

    work page 2005

  4. [4]

    Brenti, P -kernels, IC bases and Kazhdan–Lusztig polynomials , J

    F. Brenti, P -kernels, IC bases and Kazhdan–Lusztig polynomials , J. Algebra 259 (2003), 613-627

    work page 2003

  5. [5]

    Brenti, F

    F. Brenti, F. Caselli, M. Marietti, Special Matchings and Kazhdan–Lusztig polynomials , Advances in Math. 202 (2006), 555-601

    work page 2006

  6. [6]

    Brenti, F

    F. Brenti, F. Caselli, M. Marietti, Diamonds and Hecke algebra representations , Int. Math. Res. Not., V olume 2006, Article ID 29407, 1-34

    work page 2006

  7. [7]

    Caselli, M

    F. Caselli, M. Marietti, Special matchings in Coxeter groups , Europ. J. Combin. 61 (2017), 151-166

    work page 2017

  8. [8]

    Caselli, M

    F. Caselli, M. Marietti, A simple characterization of special matchings in lower Bru hat intervals , Discrete Math. 341 (2018), 851-862

    work page 2018

  9. [9]

    V. V. Deodhar, Some characterizations of Bruhat ordering on a Coxeter grou p and determination of the relative M¨ obius function, Invent. Math., 39 (1977), 187-198

    work page 1977

  10. [10]

    Deodhar, On some geometric aspects of Bruhat orderings

    V. Deodhar, On some geometric aspects of Bruhat orderings. II. The parab olic analogue of Kazhdan–Lusztig polynomials, J. Algebra, 111 (1987), 483-506

    work page 1987

  11. [11]

    M. J. Dyer, Hecke algebras and reflections in Coxeter groups , Ph. D. Thesis, University of Sydney, 1987

    work page 1987

  12. [12]

    Hultman, Criteria for rational smoothness of some symmetric orbit cl osures, Adv

    A. Hultman, Criteria for rational smoothness of some symmetric orbit cl osures, Adv. in Math. 229 (2012), 183-200

    work page 2012

  13. [13]

    Hultman, Fixed Points of Zircon Automorphisms , Order 25 (2008), 85-90

    A. Hultman, Fixed Points of Zircon Automorphisms , Order 25 (2008), 85-90

    work page 2008

  14. [14]

    Humphreys, Reflection Groups and Coxeter Groups , Cambridge Studies in Advanced Mathematics, no.29, Cambridge Univ

    J.E. Humphreys, Reflection Groups and Coxeter Groups , Cambridge Studies in Advanced Mathematics, no.29, Cambridge Univ. Press, Cambridge, 1990

    work page 1990

  15. [15]

    Kazhdan, G

    D. Kazhdan, G. Lusztig, Representations of Coxeter groups and Hecke algebras , Invent. Math. 53 (1979), 165-184

    work page 1979

  16. [16]

    Marietti, Algebraic and combinatorial properties of zircons , J

    M. Marietti, Algebraic and combinatorial properties of zircons , J. Algebraic Combin., 26 (2007), 363-382

    work page 2007

  17. [17]

    Marietti, Special matchings and parabolic Kazhdan–Lusztig polynomi als, Trans

    M. Marietti, Special matchings and parabolic Kazhdan–Lusztig polynomi als, Trans. Amer. Math. Soc. 368 (2016), no. 7, 5247-5269

    work page 2016

  18. [18]

    Marietti, The combinatorial invariance conjecture for parabolic Kaz hdan–Lusztig polynomials of lower inter- vals, Advances in Math

    M. Marietti, The combinatorial invariance conjecture for parabolic Kaz hdan–Lusztig polynomials of lower inter- vals, Advances in Math. 335 (2018), 180-210

    work page 2018

  19. [19]

    Stanley, Enumerative Combinatorics , vol.1, Wadsworth and Brooks/Cole, Monterey, CA, 1986

    R.P. Stanley, Enumerative Combinatorics , vol.1, Wadsworth and Brooks/Cole, Monterey, CA, 1986

    work page 1986

  20. [20]

    Stanley, Subdivisions and local h-vectors, J

    R.P. Stanley, Subdivisions and local h-vectors, J. Amer. Math. Soc. 5 (1992), 805851. Dipartimento di Ingegneria Industriale e Scienze Matemati che, Universit `a Politecnica delle Marche, Via Brecce Bianche, 60131 Ancona, Italy E-mail address : m.marietti@univpm.it

    work page 1992