Separating trees and simple congruences of the weak order

Emily Barnard; Jean-Christophe Novelli; Vincent Pilaud

arxiv: 2503.15053 · v2 · submitted 2025-03-19 · 🧮 math.CO

Separating trees and simple congruences of the weak order

Emily Barnard , Jean-Christophe Novelli , Vincent Pilaud This is my paper

Pith reviewed 2026-05-22 23:53 UTC · model grok-4.3

classification 🧮 math.CO

keywords weak ordercongruencesquotientopesseparating treessimple polytopescombinatoricsquiver representations

0 comments

The pith

Separating trees describe the vertices of quotientopes for simple congruences of the weak order.

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

The paper supplies an elementary proof that a congruence on the weak order is simple precisely when its quotientope is a simple polytope, which holds exactly when the congruence avoids certain up and down arcs. The proof proceeds by exhibiting a direct bijection between the vertices of each such quotientope and a class of combinatorial objects called separating trees. The same objects also index all faces of the quotientope and carry algebraic structure visible in quiver representations.

Core claim

Simple congruences of the weak order are exactly those avoiding forbidden up and down arcs, and the vertices of the associated quotientopes are in bijection with separating trees; these trees likewise label all faces of the polytopes and admit connections to quiver representation theory.

What carries the argument

Separating trees, which provide a combinatorial encoding of the vertices (and faces) of quotientopes arising from simple congruences.

If this is right

The characterization of simple congruences reduces to the absence of forbidden up and down arcs.
All faces of the corresponding quotientopes admit a uniform combinatorial description via substructures of separating trees.
Separating trees carry algebraic data visible through their links to quiver representations.

Where Pith is reading between the lines

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

The tree model may extend to give vertex descriptions for quotientopes of other congruence classes beyond the simple ones.
The quiver connections suggest that representation-theoretic invariants could be computed directly from the separating trees.
An explicit recursive construction of separating trees might yield an efficient enumeration algorithm for the faces of these polytopes.

Load-bearing premise

The standard definitions and basic properties of the weak order, its congruences, and the associated quotientopes are taken as given.

What would settle it

A simple congruence whose quotientope vertex set is not in bijection with any family of separating trees, or a separating tree that fails to produce a vertex of the expected quotientope.

read the original abstract

A congruence of the weak order is simple if its quotientope is a simple polytope. We provide an alternative elementary proof of the characterization of the simple congruences in terms of forbidden up and down arcs. For this, we provide a combinatorial description of the vertices of the corresponding quotientopes in terms of separating trees. This also yields a combinatorial description of all faces of the corresponding quotientopes. We finally explore algebraic aspects of separating trees, in particular their connections with quiver representation theory.

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 supplies a separating-tree model for vertices and faces of simple quotientopes plus an elementary alternative proof of the forbidden-arc characterization.

read the letter

The core advance here is the explicit description of quotientope vertices via separating trees, which also covers the faces and gives a direct combinatorial proof that simple congruences are exactly those avoiding certain up and down arcs. That model looks cleaner than earlier approaches and makes the structure of these polytopes easier to handle by hand. The algebraic remarks tying separating trees to quiver representations are a natural next step, though they stay at the level of observations rather than deep theorems. The argument rests on standard facts about the weak order and quotientopes, with no visible circularity or hidden parameters. The only real limitation is the narrow scope: this organizes a known class inside combinatorial poset theory and polytope geometry but does not reach outside that circle. For someone already working on weak-order congruences or realizations of Cambrian lattices, the trees and the shorter proof are concrete tools worth having. A reader outside the subfield will find the definitions heavy and the payoff specialized. The work shows clear, honest engagement with the literature and supplies reproducible combinatorial objects rather than fitted abstractions. It is worth sending to a serious referee who knows the area; the elementary proof and new model are the sort of incremental but usable contribution that deserves checking in detail.

Referee Report

0 major / 3 minor

Summary. The paper provides an alternative elementary proof of the characterization of simple congruences of the weak order via forbidden up and down arcs. It introduces separating trees as a combinatorial model for the vertices of the associated quotientopes, extends this to a description of all faces, and explores algebraic connections to quiver representation theory.

Significance. If the derivations hold, the work supplies a new combinatorial language for simple congruences and quotientopes that may streamline proofs and open connections to representation theory; the alternative proof and explicit tree model are concrete strengths.

minor comments (3)

The abstract and introduction should explicitly state the precise statement of the forbidden-arc characterization being reproved (e.g., the exact conditions on up-arcs and down-arcs) so readers can immediately compare with prior literature.
Notation for separating trees (e.g., the precise definition of “separating” and the encoding of vertices) should be introduced with a small illustrative example in §2 or §3 before the main theorems.
The algebraic section on quiver representations would benefit from a short dictionary relating the combinatorial operations on separating trees to the representation-theoretic operations being invoked.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive summary of the paper, the assessment of its significance, and the recommendation for minor revision. No major comments were provided in the report, so we have no specific points to address point-by-point. We will incorporate any minor editorial suggestions in the revised version.

Circularity Check

0 steps flagged

No significant circularity

full rationale

The paper offers an alternative elementary proof of an existing characterization of simple congruences (via forbidden arcs) together with a new combinatorial description of quotientope vertices and faces using separating trees. These rest on standard background definitions of the weak order, congruences, and quotientopes taken as given from prior literature; the new objects and proof steps are presented as independent combinatorial constructions rather than reductions to fitted parameters or self-referential definitions. No load-bearing self-citation chains, ansatz smuggling, or renaming of known results appear in the supplied abstract or assessment. The derivation chain is therefore self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

No free parameters or invented entities appear; the paper relies on standard combinatorial axioms about the weak order and polytopes.

axioms (1)

standard math Standard properties of the weak order on permutations or words and the definition of congruences and quotientopes
Invoked throughout as background for the characterization and tree construction

pith-pipeline@v0.9.0 · 5601 in / 1195 out tokens · 28203 ms · 2026-05-22T23:53:44.032076+00:00 · methodology

Separating trees and simple congruences of the weak order

Core claim

What carries the argument

If this is right

Where Pith is reading between the lines

Load-bearing premise

What would settle it

discussion (0)