Pith. sign in

REVIEW 4 major objections 4 minor 34 references

Brion atoms for classical types

T0 review · 4 major / 4 minor · reviewed 2026-08-03 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Brion's orbit-closure formula becomes an explicit finite algorithm for every classical symmetric pair, with type D finally included. The paper proves that each Brion atom set decomposes into principal filters generated by explicitly defined

desk verdict A complete and mostly convincing type-D extension of the Brion-atom program, but the key weak-order edge criterion is imported from Wyser's thesis without proof and deserves close scrutiny. read the letter →

arxiv 2512.19034 v2 pith:ZUU3QR6R submitted 2025-12-22 math.RT math.CO

Eric Marberg This is my paper · ORCID
classification math.RTmath.CO MSC 14M1505E0522E46
keywords BrionatomssymmetricpairsorbitclosuresflagvarietiesSchubertclassestypeDweakordergraphinvolutionpolynomials
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

This paper gives a uniform combinatorial description of the sets of Weyl group elements, called Brion atoms, that index the nonzero terms in Brion's cohomology formula for symmetric subgroup orbit closures in flag varieties, covering all classical types including the previously untreated type D. It proves that each Brion atom set is a disjoint union of intervals in an explicit partial order, each interval generated by a single Weyl group element attached to a noncrossing matching. If correct, Brion's abstract formula becomes a finite, concrete algorithm for computing the cohomology class of every K-orbit closure in classical types. The main novelty is a thorough treatment of type D, where new edge rules and doubled edges appear.

What carries the argument

The engine is the weak order graph on K-orbit indices (clans), whose edges are labeled by simple generators and carry a degree of 1 or 2. The paper translates this graph into explicit combinatorial data: for each twisted involution z, a set of noncrossing perfect matchings on the negated points, a shape operator assigning each atom to a matching, and a transitive relation ≾ on the Weyl group. The generator gen(z,M) is the minimal element of the atom interval of shape M, built from the cycles of z and the matching M via one-line representations and Demazure conjugation formulas.

What would settle it

Compute the weak order graph for a small type D example, such as SO(8) with the symmetric pair of type DI, directly from the orbit parametrization and compare the t_{-1} edge and doubling rules in Theorem 2.15 against the explicit list; any mismatch in edge presence or doubling would falsify the claimed description.

Watch

Extended reading notes

Core claim

For every classical symmetric pair (G,K), each Brion atom set W^G_K(gamma) decomposes as the disjoint union over aligned shapes M of the sets E^G_K(z,M), and each E^G_K(z,M) is exactly the principal filter {w : gen^G_K(z,M) ≾ w} in a graded partial order. The paper constructs the matchings, shape operators, aligned shapes, generators, and partial orders uniformly across types A, B, C, and D, and proves the decomposition theorems (Theorems 1.3 and 1.4). Consequently, Brion's formula becomes an explicit finite sum over pairs (M,w) satisfying the generator inequality, with the coefficient determined by a rank function that depends only on z and w.

Load-bearing premise

The type D edge rules in Theorem 2.15 are asserted to follow by carefully comparing Wyser's thesis rather than being fully derived, so if that translation contains an error, the type D Brion atom formulas collapse.

Editorial extensions

If this is right

  • Brion's cohomology formula (1.4) becomes an explicit finite algorithm in all classical types, making it straightforward to test multiplicity-free criteria and single-term expansions.
  • The paper classifies when orbit closures are multiplicity-free in terms of the parameters of the symmetric pair (Proposition 8.1) and when the Brion atom set equals the full extended atom set (Proposition 8.6).
  • A notion of involution Schubert polynomials is introduced for all classical types, and several conjectures about their Stanley symmetric function expansions are stated.
  • The balanced-type cases produce explicit identities such as F_DI = S_{delta} at the longest element, unifying earlier type A results.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • If the type D edge criterion in Theorem 2.15 passes an independent check, the same decomposition machinery may extend to orbit closures in other spherical varieties whose weak order graphs are known.
  • The explicit interval description suggests a fast algorithm for computing the Schubert class of any orbit closure by generating the interval bottom-up rather than traversing the full weak order graph.
  • The conjectured Stanley symmetric function identities for types DI, DII, DIII, and DIV could be tested by computer up to rank 8, providing a direct check of the theorem independent of the proof.
  • The graded partial orders defined here may have applications to Kazhdan-Lusztig theory or to the study of Hessenberg varieties attached to symmetric orbits.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 4 minor

Summary. The paper gives a uniform combinatorial description of the sets of Weyl-group elements (Brion atoms) that appear in Brion's cohomology formula for closures of symmetric-subgroup orbits on flag varieties, for all classical types. The authors define extended Brion atoms E^G_K(z), decompose them into shape blocks E^G_K(z,M) indexed by noncrossing symmetric perfect matchings, and identify each block with the principal filter of an explicit generator under an explicit partial order (Theorems 1.3 and 1.4). Types A, B, and C are largely reformulated from prior work; the main new content is type D, developed in Sections 6 and 7. The paper also proves classifications of multiplicity-free orbit closures and introduces involution Schubert polynomials and Stanley symmetric functions with several conjectures.

Significance. If the main theorems are correct, they turn Brion's abstract formula (1.4) into a concrete finite algorithm for all classical symmetric pairs, and they unify and extend earlier work on types A/B/C. The explicit matchings, generators, rank functions, and the detailed type-D propositions are substantial contributions. The paper also provides falsifiable conjectures about Schur P/Q expansions. It is not accompanied by machine-checked proofs or code; the strengths are the explicit combinatorial framework, the detailed structural lemmas in Section 7, and the concrete applications in Section 8. However, several load-bearing steps are delegated to external sources or to 'easy to check' assertions, so the result is not yet established to the standard required for acceptance.

major comments (4)
  1. [Section 2.6, Theorem 2.15] This theorem is the explicit edge criterion for the weak-order graph that underlies Lemma 2.21 and hence all type-D propositions in Section 7. Its proof consists solely of the statement that the criterion 'follows by carefully comparing Wyser's description of the weak order' [31]. In type D the new conditions—the C(s)⊆M(β) case for t_{-1}, the doubled-edge conditions governed by Fix(t0 z) rather than Fix(z), and the sign-restriction conditions in (b)–(c)—have no derivation and no case-by-case translation table. A single mis-translated condition would propagate immediately into W^G_K(γ) and invalidate Theorems 1.3 and 1.4. Please supply a proof, or at least a complete type-by-type comparison table for Section 2.5, before the result can be regarded as verified.
  2. [Section 7.1, Theorem 7.4] The foundational description of E_D(z) rests on Theorem 7.4, whose proof invokes [16, Thm. 3.17] and then says it is a 'straightforward but somewhat tedious exercise' to translate the reduced-word relations (7.4)–(7.5) into the word relation ≪_D. This is not a local remark: Proposition 7.13, Corollary 7.14, and all subsequent shape results for types DI–DIV depend on Theorem 7.4. The missing translation is load-bearing for the main type-D claims and should be written out, or at least organized into a table of cases, rather than left as an exercise.
  3. [Section 2.7, Proposition 2.26 and Section 7] The equality E^G_K(z) = (the set listed in Table 4) is deferred. The proof of Proposition 2.26 says the converse containment 'will also follow from our proof of Theorem 1.3 in Sections 4, 5, and 7,' and that one must observe every matching occurs as an aligned shape for some γ. In type A this existence observation is Lemma 4.6, and for types B/C it is supplied by the cited results in [10]. For type D, however, no analogous lemma is stated or proved: Propositions 7.22, 7.32, and 7.38 show that each matching has a generator in E_D(z), but they do not show that for every matching M there is some γ with ψ(γ)=z and M∈Aligned(γ). Without that lemma, the first displayed disjoint-union equality in Theorem 1.3 is not fully established for type D.
  4. [Section 2.6, Lemma 2.21] The equivalence between (a) and (c) is the bridge from weak-order paths to the matching-alignment condition used in Theorem 1.3. Its proof invokes [10, Lem. 7.4] and compresses the obstruction analysis into the phrase 'we see that P fails to lift to a path ... if and only if ...'. Given how much of Section 7 depends on this lemma, a fuller verification of the obstruction cases—especially the type-BI alternation and the type-CI/DIII/DIV sign conditions—would be appropriate. This is less severe than the previous points but still a significant proof gap.
minor comments (4)
  1. [Example 2.2] The claimed list of 14 distinct clans for base set {1,2,3} contains the entry (-,-,+) twice and omits (-,-,-). The count should be 14, but the displayed list is incorrect.
  2. [Abstract and Section 1.1] Typo: 'subroups' should be 'subgroups'. In the abstract, 'as a linear combinations' should be 'as linear combinations.'
  3. [Section 7.4, proof of Proposition 7.29] The map from W_n^+ to W_{n+1}^+ is called embed_{n,k}^{DII} in Lemma 7.27, but the proof of Proposition 7.29 refers to it as embed_{n,k}^{DI}. This appears to be a notational slip.
  4. [Section 8.1] Typo: 'multiplicy-free' should be 'multiplicity-free' in the first sentence of Section 8.1.

Circularity Check

1 steps flagged · score 3.0 of 10

Proposition 2.26 defers the equality E^G_K(z)=Table 4 to the proof of Theorem 1.3, while the type-D proof works directly with the Table 4 models; this creates a mild mutual-reference loop.

  1. other [Section 2.7, Proposition 2.26 proof; type-D proofs in Sections 7.3-7.6]
    "While it is not infeasible to show directly that each of these containments is equality, this will also follow from our proof of Theorem 1.3 in Sections 4, 5, and 7. Specifically, if we use the formulas in Table 3 to define E^G_K(z), then to deduce (1.6) from Theorem 1.3 it will suffice to observe that for any z∈I^G_K and M∈Matchings^G_K there exists some γ∈Γ^G_K with ψ^G_K(γ)=z and M∈Aligned^G_K(γ). This claim will be evident from the definitions in Sections 4, 5, and 6."

    Proposition 2.26 asserts that the union-defined sets E^G_K(z) from (1.6) equal the Table 4 models, but its proof only gives one containment and explicitly defers equality to the proof of Theorem 1.3. In type D, that proof consists of propositions stated entirely about E_DI(z), E_DII(z), E_DIII(z), E_DIV(z) — i.e. the Table 4 objects of Definitions 2.24-2.25 — and never proves they coincide with the union (1.6). Thus the proof of Theorem 1.3 presupposes the equality that Proposition 2.26 says will follow from Theorem 1.3. The cited sufficient condition, existence of a γ with M∈Aligned^G_K(γ) for every matching, is asserted as 'evident' but no type-D analogue of Lemma 4.6 is supplied in Sections 7.3-7.6, leaving a genuine deferred/mutual-reference gap rather than a closed derivation.

full rationale

The core combinatorial data — NCSP matchings, shape operators, Aligned sets, generators, and the word partial orders — are defined independently of Brion's formula and of the quantities they are used to describe; no fitted parameter is renamed as a prediction, and the final principal-filter description E(z,M)={w : gen(z,M)≾w} has independent content. The heavy reliance on the author's earlier papers [6,7,10,11,21] for types A, B, and C is normal reliance on published prior work, including work by Marberg himself, and is not load-bearing circularity because those results are external and not derived from the present theorem. The type-D edge criterion (Theorem 2.15) is imported from Wyser's thesis by citation; that is an external dependence and a terseness concern, not a self-citation circularity. The one real circularity-type issue is Proposition 2.26: the equality E^G_K(z)=Table 4 is deferred to the proof of Theorem 1.3, while the type-D portion of that proof works directly with the Table 4 sets and never discharges the promised equality for the original union (1.6). This is a logical-loop/omitted-proof issue rather than a full reduction of the main theorem to its assumptions, so the overall circularity score is modest.

Assumptions & free parameters 0 free parameters · 6 assumptions · 2 invented entities

No numeric constants are fitted; all parameters p,q,k are inputs of the symmetric pair. The work rests on standard Coxeter-group facts and on the cited classification/parametrization of symmetric-orbit data (Matsuki-Oshima, Yamamoto, Wyser), on Brion's cohomology formula, and on the author's prior atomic results in types A/B/C. The main new dependence is Hu-Zhang's word property used to prove well-nestedness in type D.

assumptions (6)
  • domain assumption Brion's cohomology formula (1.4) and the weak order graph construction are accepted as a black box.
    Used throughout; the paper's goal is to make Brion's general formula explicit, not to prove it.
  • domain assumption The classification and clan parametrization of K-orbits from Matsuki-Oshima [25], Yamamoto [34], and Wyser [31] are correct and adopted verbatim.
    Tables 2 and 3 rely on these; an error in the parametrization would propagate to all orbit and atom formulas.
  • domain assumption Wyser's weak-order-graph description is faithfully translated into clan conditions in Theorem 2.15.
    The proof is a comparison with [31] rather than a fully written case-check for type D; this is the load-bearing input for all Brion atom computations.
  • standard math Demazure product identities and the exchange condition for twisted involutions from Humphreys [18] and Hultman [17] are used without proof.
    Used in Section 2.5 to derive the Demazure conjugation formulas that feed into the weak-order results.
  • domain assumption Prior atomic descriptions for types A/B/C from [6,7,10,11] are correct and used as black boxes.
    The type A/B/C parts of Theorems 1.3 and 1.4 reduce directly to these references; one cited formula in [10] is acknowledged to be corrected only in the arXiv version.
  • domain assumption Hu-Zhang's word property [16, Thm. 3.17] for involutions in W_n^+ is accepted and used to prove well-nestedness of E_D(z).
    Invoked in Theorem 7.4, which is a central tool for the type D proofs.
invented entities (2)
  • Extended Brion atoms E^G_K(z,M)
    purpose: Index the terms in Brion's orbit-closure cohomology formula with fixed Richardson-Springer image and fixed shape.
    These are new combinatorial sets defined in this paper and are the object of the main theorems; they do not carry an external falsifiable handle beyond the paper's own examples and conjectural tests.
  • Involution Schubert polynomials and involution Stanley symmetric functions
    purpose: Lift Brion's formula for alternating orbit closures to polynomial and symmetric-function representatives in all classical types.
    Introduced in Section 8; several of their asserted properties are conjectural, so independent confirmation is not yet available.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Brion atoms for classical types." pith.science (2026). https://pith.science/paper/ZUU3QR6R

@misc{pith2026251219034,
  author       = {Pith},
  title        = {Pith review of: Brion atoms for classical types},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/ZUU3QR6R}},
  note         = {Machine review of arXiv:2512.19034}
}
abstract

Let $G$ be a classical group defined over the complex numbers with a Borel subgroup $B$. Choose a holomorphic involution of $G$ and let $K$ be its set of fixed points. The group $K$ acts on the flag variety $G/B$ with finitely many orbits and Brion has derived a general formula for the cohomology classes of the corresponding orbit closures as linear combinations of Schubert classes. This article provides a uniform description of the sets of Weyl group elements (which we refer to as Brion atoms) that index the terms in this formula. This builds on prior work addressing types A, B, and C. The main novelty of our results is a thorough treatment of type D. As one application, we introduce a notion of involution Schubert polynomials for all classical types and present several conjectures related to these objects.

Figures

Figures reproduced from arXiv: 2512.19034 by the authors.

Figure 1
Figure 1. Paths in weak order for types BI (left) and CI (right) lifting the sequence [PITH_FULL_IMAGE:figures/full_fig_p018_1.png] view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

34 extracted references · 3 linked inside Pith

  1. [31]

    B. J. Wyser,Symmetric subgroup orbit closures on flag varieties: Their equivariant geometry, combinatorics, and connections with degeneracy loci, PhD thesis (2012),arXiv:1201.4397

    arXiv 2012

  2. [10]

    Hamaker and E

    Z. Hamaker and E. Marberg, Atoms for signed permutations,European J. Combin.94(2021), 103288

    2021

  3. [1]

    Billey, Transition equations for isotropic flag manifolds,Discrete Math.193, 69–84

    S. Billey, Transition equations for isotropic flag manifolds,Discrete Math.193, 69–84

  4. [2]

    Billey and M

    S. Billey and M. Haiman, Schubert polynomials for the classical groups,J. Am. Math. Soc.8 (1995), 443–482

    1995

  5. [3]

    S. C. Billey, W. Jockusch, and R. P. Stanley, Some Combinatorial Properties of Schubert Polynomials,J. Algebr. Combin.2(1993), 345–374

    1993

  6. [4]

    Billey and T

    S. Billey and T. K. Lam, Vexillary elements in the hyperoctahedral group,J. Alg. Combin.8 (1998), no. 2, 139–152

    1998

  7. [5]

    Brion, On orbit closures of spherical subgroups in flag varieties,Comment

    M. Brion, On orbit closures of spherical subgroups in flag varieties,Comment. Math. Helv.76 (2001), no. 2, 263–299

    2001

  8. [6]

    Burks and B

    B. Burks and B. Pawlowski, Reduced words for clans, preprint (2018),arXiv:1806.05247

    arXiv 2018

Show all 34 references
  1. [7]

    M. B. Can, M. Joyce, and B. Wyser, Chains in Weak Order Posets Associated to Involutions, J. Combin. Theory Ser. A137(2016), 207–225

    2016

  2. [8]

    M. B. Can and ¨O. U˘ gurlu, Counting Borel Orbits in Symmetric Varieties of Types BI and CII, Arnold Math. J.4(2018), no. 2, 213–250

    2018

  3. [9]

    M. B. Can and ¨O. U˘ gurlu, The genesis of involutions, polarizations and lattice paths,Discrete Math.342(2019) 201–216

    2019

  4. [11]

    Hamaker, E

    Z. Hamaker, E. Marberg, and B. Pawlowski, Involution words II: braid relations and atomic structures,J. Algebr. Comb.45(2017), 701-743

    2017

  5. [12]

    Hamaker, E

    Z. Hamaker, E. Marberg, and B. Pawlowski, SchurP-positivity and involution Stanley sym- metric functions,IMRN(2017), rnx274

    2017

  6. [13]

    Hamaker, E

    Z. Hamaker, E. Marberg, and B. Pawlowski, Fixed-point-free involutions and SchurP- positivity,Journal of Combinatorics11(2020), no. 1, 65–110

    2020

  7. [14]

    Hamaker, E

    Z. Hamaker, E. Marberg, and B. Pawlowski, Involution pipe dreams,Canad. J. Math.74 (2022), no. 5, 1310–1346

    2022

  8. [15]

    Hansson and A

    M. Hansson and A. Hultman, A word property for twisted involutions in Coxeter groups,J. Combin. Theory Ser. A161(2019), 220–235

    2019

  9. [16]

    Hu and J

    J. Hu and J. Zhang, On involutions in Weyl groups,J. Lie Theory27(2017), 617–706

    2017

  10. [17]

    Hultman, The combinatorics of twisted involutions in Coxeter groups,Trans

    A. Hultman, The combinatorics of twisted involutions in Coxeter groups,Trans. Amer. Math. Soc.359(2007), 2787–2798

    2007

  11. [18]

    J. E. Humphreys,Reflection groups and Coxeter groups, Cambridge University Press, Cam- bridge, 1990. 64

    1990

  12. [19]

    Knutson, Frobenius splitting and M¨ obius inversion, preprint (2009),arXiv:0902.1930

    A. Knutson, Frobenius splitting and M¨ obius inversion, preprint (2009),arXiv:0902.1930

    2009 arXiv

  13. [20]

    T. K. Lam,B n Stanley symmetric functions,Discrete Math.157(1996), 241–270

    1996

  14. [21]

    Marberg, On some actions of the 0-Hecke monoids of affine symmetric groups,J

    E. Marberg, On some actions of the 0-Hecke monoids of affine symmetric groups,J. Combin. Theory Ser. A161(2019), 178–219

    2019

  15. [22]

    Marberg, A symplectic refinement of shifted Hecke insertion,J

    E. Marberg, A symplectic refinement of shifted Hecke insertion,J. Combin. Theory Ser. A 173(2020), 105216

    2020

  16. [23]

    Marberg and B

    E. Marberg and B. Pawlowski, Stanley symmetric functions for signed involutions,J. Combin. Theory Ser. A168(2019), 288–217

    2019

  17. [24]

    Matsuki, The orbits of affine symmetric spaces under the action of minimal parabolic subgroups,J

    T. Matsuki, The orbits of affine symmetric spaces under the action of minimal parabolic subgroups,J. Math. Soc. Japan31(1979), no. 2, 331–357

    1979

  18. [25]

    The orbit method in representation theory,

    T. Matsuki and T. Oshima, Embeddings of discrete series into principal series, in “The orbit method in representation theory,” edited by M. Duflo, M. Vergne, and N. V. Pedersen, 147–175, Springer, 1990

    1990

  19. [26]

    W. M. McGovern and P. E. Trapa, Pattern avoidance and smoothness of closures for orbits of a symmetric subgroup in the flag variety,J. Algebra322(2009), no. 8, 2713–2730

    2009

  20. [27]

    Pawlowski, Universal graph Schubert varieties,Transform

    B. Pawlowski, Universal graph Schubert varieties,Transform. Groups26(2021), 1417–1461

    2021

  21. [28]

    R. W. Richardson and T. A. Springer, The Bruhat order on symmetric varieties,Geom. Ded- icata35(1990), 389–436

    1990

  22. [29]

    N. J. A. Sloane, editor (2003), The On-Line Encyclopedia of Integer Sequences, published electronically athttp://oeis.org/

    2003

  23. [30]

    R. P. Stanley, On the number of reduced decompositions of elements of Coxeter groups.Eu- ropean J. Combin.5(1984), 359–372

    1984

  24. [32]

    B. J. Wyser and A. Yong, Polynomials for GL p ×GL q orbit closures in the flag variety,Selecta Math. (N.S.)20(2014), 1038–1110

    2014

  25. [33]

    B. J. Wyser and A. Yong, Polynomials for symmetric orbit closures in the flag variety,Trans- form. Groups22(1) (2017), 267–290

    2017

  26. [34]

    Yamamoto, Orbits in the flag variety and images of the moment map for classical groups I,Represent

    A. Yamamoto, Orbits in the flag variety and images of the moment map for classical groups I,Represent. Theory1(1997), 329–404. 65

    1997

Pith tools

Reviewed August 3, 2026 · model on record in the stance chip above.