Pith. sign in

REVIEW 3 major objections 5 minor 14 references

Bruhat operads

T0 review · 3 major / 5 minor · reviewed 2026-08-07 · deepseek-v4-flash

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

Pith's one-line read Fix a positive integer d. This paper claims that the higher Bruhat orders B(n,d) can be assembled into two planar operads: a small one whose n-th set is B(nd,d), and a big one that also allows arbitrary underlying sizes m>d.

desk verdict New operad structures on higher Bruhat orders, plausible and worth a referee, but the key interchange lemma is asserted without proof. read the letter →

arxiv 2505.22347 v3 pith:WM7SOQT3 submitted 2025-05-28 math.CO math.CT

Gleb Koshevoy , Vadim Schechtman , with Appendix by Daria Poliakova This is my paper
classification math.COmath.CT
keywords higherBruhatordersplanaroperadsinsertionoperationsinversionsetsZieglercriterionsmalloperadbigmolecules
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

Fix a positive integer d. The paper claims that the higher Bruhat orders B(n,d), posets on the d-subsets of {1,...,n}, can be organized into two planar operads: a small one whose n-th set is B(nd,d), and a big one that allows arbitrary m>d as the underlying size. The composition is built from an insertion operation on inversion sets, and the main theorems state that the associativity and unit axioms hold. The point is that higher Bruhat orders, which generalize the weak Bruhat order on permutations, now carry a coherent combinatorial composition law.

What carries the argument

The central object is the insertion operation \prec \circ_j \prec' on higher Bruhat orders, defined by specifying the inversion set in three steps: inversions wholly inside the inserted block, inversions coming from the outer order, and mixed inversions mapped back through a monotone bijection. The operation is justified by Ziegler's criterion, which characterizes exactly which subsets appear as inversion sets of higher Bruhat orders, and the operad axioms follow from the associativity and interchange identities for insertions, Lemmas 5.5 and 5.6.

What would settle it

For d=2, set k0=k1=0, n=5, and m=m'=3. Both sides of Lemma 5.6 then land in B(7,2), a finite set, so one can enumerate all triples of orders in B(5,2), B(3,2), and B(3,2) and compare the inversion sets of the two composed orders; any mismatch would disprove Theorem 6.1 and Theorem 6.2.

Watch

Extended reading notes

Core claim

Theorem 6.1 states that for each positive integer d, the collection $HB_d^{0}$ with $HB_d^{0}$(n)=B(nd,d), equipped with compositions defined by iterated insertions (((b0 \circ_0 b1) \circ_{dm1} ... ) \circ_{dm1+...+dmn-1} bn), forms a planar operad. Theorem 6.2 states that the big Bruhat operad HB^d, whose elements are triples (m,b,k) with b in B(m,d) and k a type with |k|=m, also forms a planar operad and contains $HB_d^{0}$ as a suboperad.

Load-bearing premise

The proof of the operad axioms leans on the interchange identity stated in Lemma 5.6, which the paper gives without proof; if that identity fails for some d, the planar operad structure collapses, even though the individual insertions are well defined.

Editorial extensions

If this is right

  • The small Bruhat operad makes the family {B(nd,d)} into a single algebraic object, allowing higher Bruhat orders of different sizes to be composed coherently.
  • The big Bruhat operad extends the same composition structure to all sizes m>d, with the type/molecule data controlling how the blocks are inserted.
  • Corollaries 5.3 and 5.4 imply that the operad compositions are monotone with respect to the higher Bruhat order, generalizing the compatibility of the symmetric group operad with the weak Bruhat order.
  • For d=1, the construction recovers operads built from symmetric groups and the weak Bruhat order, so the new operads are direct higher-dimensional generalizations of that classical case.

Reading between the lines

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

  • The unproved interchange identity, Lemma 5.6, is the delicate point of the whole construction; checking it computationally for small d is a cheap way to test whether the operad claims hold.
  • If the operad structure stands, the type/molecule description suggests a graded refinement in which the number of 'electrons' is recorded through composition, potentially yielding a filtration of the big Bruhat operad by finite suboperads.
  • A concrete description of the insertion maps for d=2 could connect these operads to known combinatorial operads built from configurations or wires, though the paper does not pursue that comparison.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

3 major / 5 minor

Summary. The paper proposes a family of planar (non-symmetric) operads whose components are higher Bruhat orders. For a fixed d, the small Bruhat operad HB_d^0 has arity-n set B(nd,d), with composition defined as an iterated insertion b0 ∘_0 b1 ∘_{d m1} b2 ... (equation 6.1). The big Bruhat operad HB^d includes all elements of all B(m,d) (with m not necessarily a multiple of d) packaged as triples (m,b,k) with a type k describing the amount of idle particles. The two main theorems (6.1 and 6.2) assert that these collections form planar operads. The proofs rest on a combinatorial insertion operation ○_j introduced in Section 5.6, whose validity is claimed in Proposition 5.2, and on associativity and interchange identities for insertions stated as Lemmata 5.5 and 5.6. The paper also proves that a monotonicity property holds, making the operads compatible with the higher Bruhat order, and gives a separate treatment of the d=1 case using permutations.

Significance. If the constructions are correct, the paper introduces a new source of planar operads from higher Bruhat orders, with a concrete combinatorial description of the composition maps. The use of Ziegler's criterion to certify that the insertion operations define valid Bruhat orders is natural, and the d=1 case is verified explicitly in terms of permutation insertion. The paper is self-contained relative to the cited literature and makes no use of fitted parameters or numerical checks. However, the central operad claim is not yet established as written, because the interchange law for insertions is stated without proof and the verification of the Ziegler criterion for the insertion is only sketched. These gaps are load-bearing for Theorems 6.1 and 6.2.

major comments (3)
  1. [Section 5.13, Lemma 5.6] Lemma 5.6, the interchange law for insertions, is stated without proof; the text preceding it says only 'The same arguments give the commutativity property.' This is exactly the identity needed to prove associativity of the iterated composition (6.1) and (6.2). The proofs of Theorems 6.1 and 6.2 cite Lemmata 5.5, 5.6, and the criterion of Section 2.2 (called Lemma 2.3 in the proofs). Since the composition laws γ in (6.1) and (6.2) are defined as iterated insertions, associativity of γ is equivalent to the interchange law: different bracketings of four factors must agree. If Lemma 5.6 fails for some d, k0, k1, then γ is not associative and neither HB_d^0 nor HB^d is an operad. The lemma must receive a complete proof, including a verification that the two sides have equal inversion sets, not merely an appeal to 'the same arguments.'
  2. [Section 5.12, Proposition 5.2] The proof of Proposition 5.2, which asserts that the insertion produces a valid Bruhat order, is a compressed case analysis. In the final paragraph, the argument reduces to the assertion that 'Obviously such a collection satisfies the Ziegler criterion if the packet P( L) satisfies it.' This is not obvious: the packet P(L) contains a repeated element L\g(l_{s+1}) in the middle, and the beginning/ending interval condition for P(L) must be checked against the inversion set I(≺ ∘_j ≺') whose third component is defined by the map g. A concrete adversarial case (e.g., when the repeated element falls in an interval that is neither the beginning nor the ending interval of packet P( L)) would make the need for a rigorous argument clear. Since Proposition 5.2 is the basis for defining the insertion operation at all, this gap is load-bearing.
  3. [Section 2.2 and proofs of Theorems 6.1, 6.2] The proofs of Theorems 6.1 and 6.2 refer to 'Lemma 2.3', but no such lemma is labeled in Section 2. The criterion that reduces associativity of a planar operad to associativity and commutativity of partial insertions is stated in prose at the end of Section 2.2. This is a presentational issue, but it matters because the cited lemma is the only bridge between insertions and operads; the authors should label the criterion explicitly and verify that the indexing in Lemma 5.6 matches the indexing required by the criterion (specifically, that the commutativity law (a ∘_i b) ∘_{k-1+m} c = (a ∘_k b) ∘_i c is the same as the identity stated as Lemma 5.6 after substituting the parameters used in (6.1) and (6.2)).
minor comments (5)
  1. [Section 5.13, Lemma 5.6 statement] The lemma statement uses the symbol m without defining it. It should say 'let ≺' be a Bruhat order on [m]' or otherwise specify which order has size m.
  2. [Section 5.12, case (iii-a)] The displayed set equality contains repeated entries and appears to be a typographical error. Please rewrite it to show the actual members of the packet P(L) and the claimed reduction to the Ziegler condition.
  3. [Section 1.2] The formula for the maximal length in S(n) reads 'n/(n−1)/2' and should presumably be 'n(n−1)/2'.
  4. [Section 5.9] The phrase 'an aritrary permutation' contains a typo; it should be 'an arbitrary permutation'.
  5. [Abstract] The abstract says 'planar operads build from higher Bruhat orders'; the participle should be 'built'.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the Bruhat-operad construction is an independent derivation from Ziegler's criterion; the unproven interchange lemma is a proof gap, not a circular reduction.

full rationale

The paper constructs planar operads from higher Bruhat orders, using insertions defined by inversion sets and justified by Ziegler's criterion (Theorem 5.1). The self-citations [MSF A] and [MS] are used only to recall the definition and basic poset properties of higher Bruhat orders; they are inputs, not the operad result, and they are not invoked to force the operad structure. The central claims Theorems 6.1 and 6.2 are proved from Proposition 5.2, Lemmata 5.5 and 5.6, and Lemma 2.3. Lemma 5.6, the interchange identity for insertions, is exactly what makes the iterated composition in (6.1) associative, and it is stated without a full proof: the text says only 'The same arguments give the commutativity property.' This is a genuine omitted verification and a correctness risk, but it is not circularity: Lemma 5.6 is not defined as the associativity identity, and the operad claim does not reduce to an input by construction. There are no fitted parameters, no empirically predicted quantity, and no imported uniqueness theorem that replaces an argument. The construction is self-contained relative to the quoted external theorem of Ziegler, which is independent of the authors' prior work. The appropriate finding is therefore no significant circularity, with score 0; the unproven Lemma 5.6 should be weighed separately as a proof gap.

Assumptions & free parameters 0 free parameters · 3 assumptions · 0 invented entities

This is a pure mathematics paper. It introduces no fitted parameters and no new postulates beyond the cited theory of higher Bruhat orders and Ziegler's theorem. The invented-entity list is empty; the molecule and nucleus terminology in Section 3 is combinatorial bookkeeping, not new mathematical entities.

assumptions (3)
  • standard math Ziegler's characterization of inversion sets of higher Bruhat orders (Theorem 5.1): I is an inversion set of a Bruhat order iff for every i, I intersects the packet P(i) in a beginning or ending interval.
    The insertion construction defines a candidate inversion set and then invokes this theorem to conclude it comes from a Bruhat order (Section 5.6).
  • domain assumption Existence and basic properties of higher Bruhat orders B(n,d) as defined in [MSF A], including unique minimal and maximal elements and maximal chains between them.
    The operad sets are B(nd,d); the paper cites [MSF A] and [MS] for these properties rather than proving them.
  • standard math The partial-composition criterion for planar operads (Lemma 2.3): an operad structure is equivalent to partial compositions satisfying the associativity and interchange identities.
    Used to reduce the verification of the operad axioms to Lemmata 5.5 and 5.6.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Bruhat operads." pith.science (2026). https://pith.science/paper/WM7SOQT3

@misc{pith2026250522347,
  author       = {Pith},
  title        = {Pith review of: Bruhat operads},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/WM7SOQT3}},
  note         = {Machine review of arXiv:2505.22347}
}
read the original abstract

We describe some planar operads built from the higher Bruhat orders and show that they admit a multiplication.

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

14 extracted references · 14 canonical work pages

  1. [1]

    Ziegler, Higher Bruhat orders and cyclic hyperplane arrangements, Topology 32 (1993) 259--279

    G. Ziegler, Higher Bruhat orders and cyclic hyperplane arrangements, Topology 32 (1993) 259--279

    work page 1993

  2. [2]

    Danilov, A.V

    V.I. Danilov, A.V. Karzanov and G.A. Koshevoy, On Manin--Schechtman orders related to directed graphs, arXiv:

    work page

  3. [3]

    Danilov, A.V

    V.I. Danilov, A.V. Karzhanov and G.A. Koshevoy, Cubillages of cyclic zonotopes, Uspekhi Matematicheskikh Nauk 74 (6) (2019) 55--118, in Russian. (English Translation in Russian Math. Surveys 74 (6) (2019) 1013--1074.)

    work page 2019

  4. [4]

    Purity and separation for oriented matroids

    P. Galashin and A. Postnikov, Purity and separation for oriented matroids, ArXiv :1708.01329[math.CO], 2017

    work page Pith review arXiv 2017

  5. [5]

    Kapranov and V

    M. Kapranov and V. Schechtman, Contingency tables with variable margins

    work page

  6. [6]

    Kowalzig and Fr

    N. Kowalzig and Fr. Pratali, Higher structures on homology groups,

    work page

  7. [7]

    Loday and Br

    J-L. Loday and Br. Valette, Algebraic operads, Springer-Verlag, 2012

    work page 2012

  8. [8]

    Higher Bruhat orders related to the symmetric group

    Yu. Manin and V. Schechtman, “Higher Bruhat orders related to the symmetric group”, Funct. Anal. Appl. 20 , no. 2 (1986), 148–-150

    work page 1986

Show all 14 references
  1. [9]

    Manin and V

    Yu. Manin and V. Schechtman, Arrangements of hyperplanes, higher braid groups and higher Bruhat orders, in: Algebraic Number Theory -- in Honour of K. Iwasawa , Advances Studies in Pure Math. 17, Academic Press, NY, 1989, pp. 289--308

    1989

  2. [10]

    Markl, S

    M. Markl, S. Shnider, and J. Stasheff. Operads in Algebra, Topology and Physics , Math. Surveys and Monographs, AMS, 2002

    2002

  3. [11]

    May, The geometry of iterated loop spaces, Lect

    J.P. May, The geometry of iterated loop spaces, Lect. Notes in Math. 271 , Springer, 1972

    1972

  4. [12]

    Voevodsky and M

    V. Voevodsky and M. Kapranov, Free n -category generated by a cube, oriented matroids and higher Bruhat orders, Functional Anal. Appl. 2 (1991) 50--52

    1991

  5. [13]

    Schrijver, Combinatorial Optimization, Vol

    A. Schrijver, Combinatorial Optimization, Vol. A , Springer, 2003

    2003

  6. [14]

    Ziegler, Higher Bruhat orders and cyclic hyperplane arrangements, Topology 32 (2) (1993) 259--279

    G.M. Ziegler, Higher Bruhat orders and cyclic hyperplane arrangements, Topology 32 (2) (1993) 259--279

    1993

Pith tools

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