pith. sign in

arxiv: 2604.14458 · v1 · submitted 2026-04-15 · 🧮 math.CO

Noncrossing Partitions From Hull Configurations

Michael Dougherty , Gina Root This is my paper

Pith reviewed 2026-05-10 12:22 UTC · model grok-4.3

classification 🧮 math.CO
keywords noncrossing partitionshull configurationsBoolean subposetssymmetric chain decompositionspoint configurationscombinatoricsposet theory
0
0 comments X

The pith

Hull configurations of points produce noncrossing partition lattices that are unions of maximal Boolean subposets.

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

The authors examine lattices formed by noncrossing partitions of points in the plane when the points lie on the boundary of their convex hull. They prove these lattices break into unions of the largest possible Boolean subposets. In some cases, the lattices also admit symmetric chain decompositions. This builds on the special cases of collinear points giving Boolean lattices and convex polygons giving the classical noncrossing partition lattice. A reader would care because it reveals structure in a geometric generalization of a well-studied combinatorial object.

Core claim

For hull configurations, defined as points either collinear or on the boundary of a convex polygon, the corresponding lattice of noncrossing partitions is a union of maximal Boolean subposets, and under certain circumstances has a symmetric chain decomposition.

What carries the argument

The noncrossing partition lattice induced by a finite point configuration in the plane, with the partial order based on refinement of partitions where crossings are forbidden.

If this is right

  • The structure reduces to the Boolean lattice when all points are collinear.
  • It generalizes the Kreweras noncrossing partition lattice for convex positions.
  • The lattices have symmetric chain decompositions in specific cases.
  • This provides a way to understand the poset structure through Boolean components.

Where Pith is reading between the lines

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

  • Such decompositions might facilitate counting or generating functions for noncrossing partitions in geometric settings.
  • The result could extend to other geometric constraints on point sets.
  • Connections to symmetric chain decompositions in other combinatorial lattices may be explored.

Load-bearing premise

The relation defining noncrossing partitions on an arbitrary finite point set yields a lattice whose structure for hull configurations consists exactly of unions of maximal Boolean subposets.

What would settle it

A specific hull configuration of points where the noncrossing partitions do not form a union of maximal Boolean subposets would disprove the main claim.

Figures

Figures reproduced from arXiv: 2604.14458 by Gina Root, Michael Dougherty.

Figure 1
Figure 1. Figure 1: An elementary collapse m from a hull configuration Q (left) to another hull configuration m(Q) = P (right) is no R ∈ C(n) with P < R < Q), we say that the deformation transforming Q into P is an elementary collapse; see [PITH_FULL_IMAGE:figures/full_fig_p004_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: An illustration of our labeling conventions for a hull configuration with shape [0; 3; 2; 1; 2]. One can quickly see that H(n), like C(n), has n!/2 minimal elements, each of which corresponds to a unique way of linearly ordering n points up to reversal. In higher ranks, the number of elements is counted as follows. Proposition 1.5. Let 3 ≤ k ≤ n. The number of elements of rank k in H(n) is (n − 1)!n k  . … view at source ↗
Figure 3
Figure 3. Figure 3: The lower set for a maximal element of C(4), the poset of convexity classes with four points. 1 2 4 3 2 3 1 4 3 4 2 1 4 1 3 2 2 1 3 4 1 2 4 3 1 4 2 3 2 1 3 4 3 2 4 1 4 3 1 2 1 2 3 4 2 3 4 1 3 4 1 2 4 1 2 3 1 4 3 2 2 1 4 3 3 2 1 4 4 3 2 1 1 2 3 4 [PITH_FULL_IMAGE:figures/full_fig_p006_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: The upper set for a minimal element of C(4), the poset of convexity classes with four points. Note that only two of the ten maximal elements also belong to H(4), the poset of hull con￾figurations with four points. Proof. Suppose that P ≤ Q and rk(Q) − rk(P) = k. Then there is a motion which takes Q to P while preserving all existing internal collinearities in Q and adding k new ones. These new collineariti… view at source ↗
Figure 5
Figure 5. Figure 5: Elements α3,2 (left) and β3,2 (right) for the configura￾tion P depicted in [PITH_FULL_IMAGE:figures/full_fig_p008_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: Subsets A3,2 and B3,2 of the configuration P depicted in [PITH_FULL_IMAGE:figures/full_fig_p008_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: On the left, a tree on the vertex set {p, q, r}; on the right, the result of sliding the edge {p, q} along the edge {q, r}. z2,0 z1,0 z3,0 z4,0 z5,0 z− v1 v2 vj vh z+ [PITH_FULL_IMAGE:figures/full_fig_p012_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: A noncrossing tree τ on a hull configuration Q, with the geodesic between vertices z− and z+ highlighted. with unique non-singleton block {p, q} and {p, r}, respectively. If πpq ̸∈ A, then π remains in Bool(τ ′ ) since all elements of A remain in the new poset. Note that this corresponds to the case where p belongs to a distinct block from the block (or blocks) containing q and r, since πpq ̸≤ π and πpr ̸≤… view at source ↗
Figure 9
Figure 9. Figure 9: This noncrossing partition with vertex set P cannot be expressed as Part(µ) where µ is a subforest of a noncrossing tree with convex geodesics on P, so it does not belong to any maximal Boolean subposet of NC(P). for helpful conversations. The first author is partially supported by NSF grant DMS-2532608. References [BBG+19] B. Baumeister, K.-U. Bux, F. G¨otze, D. Kielak, and H. Krause, Non-crossing parti￾t… view at source ↗
read the original abstract

Each finite configuration of points in the plane determines a corresponding lattice of noncrossing partitions. When these points form the vertex set of a convex polygon, the associated lattice is the classical noncrossing partition lattice (introduced by Kreweras in 1972), which makes many appearances in combinatorics and geometric group theory. If, on the other hand, all points of the configuration lie on a common line segment, the result is a Boolean lattice. In this article, we examine the more general class of hull configurations, which we define to be those which lie either on a line segment or on the boundary of a convex polygon. We prove that the corresponding lattices of noncrossing partitions are unions of maximal Boolean subposets and, under certain circumstances, have symmetric chain decompositions.

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

0 major / 3 minor

Summary. The manuscript defines lattices of noncrossing partitions associated to arbitrary finite point configurations in the plane. It specializes to hull configurations (points lying on a line segment or on the boundary of a convex polygon) and proves that the resulting posets are unions of maximal Boolean subposets; under additional conditions they admit symmetric chain decompositions. This extends the Boolean lattice realized by collinear points and the classical Kreweras noncrossing partition lattice realized by convex position.

Significance. If the stated proofs hold, the work supplies a geometric unification of two extremal cases in noncrossing partition theory via a direct combinatorial construction that introduces no free parameters or self-referential reductions. The explicit derivation of lattice properties from the hull-configuration axioms is a methodological strength that may facilitate further study of symmetric chain decompositions and Boolean subposet decompositions in geometrically defined posets.

minor comments (3)
  1. [Section 2] Definition 2.3 (hull configuration) and the subsequent noncrossing relation would benefit from an explicit small example (e.g., four points with three on the convex hull and one interior to an edge) together with the resulting poset diagram to illustrate the claimed union-of-Boolean-subposets structure.
  2. [Section 5] The proof of the symmetric-chain-decomposition claim in Theorem 5.2 is asserted to hold “under certain circumstances”; the precise hypotheses on the hull configuration (e.g., number of interior points on edges) should be stated as a numbered hypothesis before the theorem.
  3. [References] The bibliography entry for Kreweras (1972) is referenced in the introduction but the full citation is missing; add it in standard format.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive summary of the manuscript and for recognizing the methodological strength of deriving lattice properties directly from hull-configuration axioms. The recommendation of minor revision is noted; we will incorporate any necessary minor changes in the revised version.

Circularity Check

0 steps flagged

No significant circularity; derivation self-contained from definitions

full rationale

The paper introduces hull configurations by explicit definition (points on a line segment or convex polygon boundary) and derives lattice properties (unions of maximal Boolean subposets, symmetric chain decompositions under conditions) directly from the combinatorial noncrossing partition relation. It extends the known Boolean lattice (collinear case) and Kreweras noncrossing partition lattice (convex case) via standard poset arguments without fitted parameters, self-definitional reductions, or load-bearing self-citations. No step reduces a claimed result to its own inputs by construction; the central claims remain independent of the definitions.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claim rests on the standard definition of noncrossing partitions for point configurations in the plane and the geometric classification of hull configurations; no free parameters or new entities are introduced.

axioms (2)
  • standard math Noncrossing partitions of a finite point set in the plane form a lattice under the usual refinement order.
    Invoked implicitly when associating a lattice to each configuration; builds on Kreweras 1972 for the convex case.
  • domain assumption Hull configurations are exactly the point sets lying on a line segment or on the boundary of their convex hull.
    This is the paper's definitional restriction that enables the Boolean-union claim.

pith-pipeline@v0.9.0 · 5415 in / 1314 out tokens · 31997 ms · 2026-05-10T12:22:44.771725+00:00 · methodology

discussion (0)

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

Reference graph

Works this paper leans on

4 extracted references · 4 canonical work pages

  1. [1]

    Baumeister, K.-U

    [BBG+19] B. Baumeister, K.-U. Bux, F. G¨ otze, D. Kielak, and H. Krause,Non-crossing parti- tions, Spectral structures and topological methods in mathematics, EMS Ser. Congr. Rep., EMS Publ. House, Z¨ urich, 2019, pp. 235–274. [BM10] Tom Brady and Jon McCammond,Braids, posets and orthoschemes, Algebr. Geom. Topol.10(2010), no. 4, 2277–2314. MR 2745672 [CD...

    work page 2019

  2. [2]

    1, 263–286

    [HKS16] Thomas Haettel, Dawid Kielak, and Petra Schwer,The 6-strand braid group is CAT(0), Geometriae Dedicata182(2016), no. 1, 263–286. [HS18] Julia Heller and Petra Schwer,Generalized non-crossing partitions and buildings, Electron. J. Combin.25(2018), no. 1, Paper No. 1.24,

    work page 2016

  3. [3]

    3-4, 563–581

    [Jeo23] Seong Gu Jeong,The seven-strand braid group isCAT(0), Manuscripta Math.171 (2023), no. 3-4, 563–581. MR 4597707 [Kre72] G. Kreweras,Sur les partitions non crois´ ees d’un cycle, Discrete Math.1(1972), no. 4, 333–350. [McC06] Jon McCammond,Noncrossing partitions in surprising locations, Amer. Math. Monthly113(2006), no. 7, 598–610. [McC17] ,Noncros...

    work page 2023

  4. [4]

    3, 193–206

    [SU91] Rodica Simion and Daniel Ullman,On the structure of the lattice of noncrossing partitions, Discrete Math.98(1991), no. 3, 193–206

    work page 1991