pith. sign in

arxiv: 2511.09653 · v2 · pith:VPN3YLPTnew · submitted 2025-11-12 · 🧮 math.CO

Region level via centralization for hyperplane arrangements and beyond

Finn Southerland , Lani Southern , Su Zhou This is my paper

Pith reviewed 2026-05-21 19:04 UTC · model grok-4.3

classification 🧮 math.CO
keywords hyperplane arrangementsgeometric semilatticescharacteristic polynomialregion levelscentralizationintersection posetbraid arrangements
0
0 comments X

The pith

The number of regions of each level in a hyperplane arrangement depends only on the intersection poset.

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

The paper restates Zaslavsky's enumeration of regions by level using a centralization construction on the arrangement and supplies a bijective proof of the restated formula. The formula involves only data from the intersection poset, so the level count and the centralization operation can be defined verbatim for any geometric semilattice. In that abstract setting the authors obtain an explicit general expression for the characteristic polynomial together with several corollaries. The same tools recover and extend known exponential generating-function identities for deformations of the braid arrangement.

Core claim

Centralization of an arrangement produces a new arrangement whose ordinary region count equals the number of original regions of any prescribed level; because the construction depends only on the intersection poset, both the level function and centralization extend to geometric semilattices, where they yield a closed-form expression for the characteristic polynomial of the semilattice.

What carries the argument

The centralization construction, which modifies an arrangement so that its total region count equals the number of regions of a fixed level in the original arrangement.

If this is right

  • r_ℓ(A) is determined entirely by the intersection poset L(A).
  • Both the level function and centralization are well-defined on every geometric semilattice.
  • A single general formula expresses the characteristic polynomial of any geometric semilattice.
  • Exponential generating functions for level counts on braid-arrangement deformations follow immediately.
  • The known expression relating the characteristic polynomial to the sequence r_ℓ applies to the same deformations.

Where Pith is reading between the lines

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

  • The poset dependence offers a uniform language for level phenomena across all geometric semilattices rather than only real hyperplane arrangements.
  • The characteristic-polynomial formula may simplify explicit computations whenever level data are easier to obtain than the full Möbius function.
  • The same centralization technique could be tested on other ranked posets that admit a notion of bounded regions.

Load-bearing premise

The centralization construction and the level function extend verbatim to arbitrary geometric semilattices while preserving both the bijection with level regions and the dependence solely on the intersection poset.

What would settle it

A geometric semilattice whose directly counted number of elements of each level disagrees with the value obtained from the characteristic-polynomial formula derived via centralization.

Figures

Figures reproduced from arXiv: 2511.09653 by Finn Southerland, Lani Southern, Su Zhou.

Figure 1
Figure 1. Figure 1: A pair of arrangements with the same characteristic polynomial, but different values of [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: The cone of the lattice of flats of the matroid [PITH_FULL_IMAGE:figures/full_fig_p008_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Shi(3) = {xi − xj = 0, 1 : 1 ≤ i < j ≤ 3} i and j are in the same part of B. This lattice has a self-similarity with its principal order filters such that (Πn) B ≃ Π|B| . Therefore we have L(Braid(n) F ) ≃ L(Braid(dim(F))) for any flat F. Principal order ideals of Πn also have the nice property that they are a product of smaller copies: (Πn)B ≃ Q|B| i=1 Π|Bi| . Therefore the intersection poset of a localiz… view at source ↗
read the original abstract

In "Faces of a Hyperplane Arrangement Enumerated by Ideal Dimension, with Applications to Plane, Plaids, and Shi," Zaslavsky showed how to compute the number $r_\ell(\mathcal{A})$ of regions of a real hyperplane arrangement $\mathcal{A}$ with a given level, refining his well known enumeration of regions and relatively bounded regions. We restate this theorem in terms of a construction called the centralization of $\mathcal{A}$, give a bijective proof, and then apply it in two ways to answer questions concerning the concept of level. Firstly, a consequence of this enumeration is that $r_\ell(\mathcal{A})$ depends only on the intersection poset $\mathcal{L}(\mathcal{A})$, such that both $r_\ell$ and centralization can be defined in the more general setting of geometric semilattices. In this context we derive a very general expression for the characteristic polynomial of a geometric semilattice with several interesting corollaries. Secondly, recent investigations into the phenomenon of level have made little use of Zaslavsky's level-counting theorem, but it can be applied to obtain or generalize many of their results. In particular we show how exponential generating function identities (arXiv:2410.10198, arXiv:2411.02971) and an expression giving the characteristic polynomial in terms of $r_\ell$ (arXiv:2411.03756) can be derived for deformations of the braid arrangement.

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

1 major / 1 minor

Summary. The paper restates Zaslavsky's theorem on enumerating regions of a given level in a real hyperplane arrangement, providing a bijective proof via a new centralization construction. It argues that the level count r_ℓ(A) depends only on the intersection poset L(A), which permits defining both r_ℓ and centralization for geometric semilattices and yields a general expression for the characteristic polynomial of such a semilattice. The results are then applied to deformations of the braid arrangement to recover or generalize exponential generating function identities and characteristic polynomial formulas from recent works (arXiv:2410.10198, arXiv:2411.02971, arXiv:2411.03756).

Significance. If the poset-only dependence and the extension of centralization hold, the work supplies a bijective proof for a known enumeration, unifies level counting with intersection-poset data, and produces a broad formula for characteristic polynomials of geometric semilattices together with concrete applications to braid deformations. The explicit credit to machine-checkable or parameter-free aspects is not present, but the combinatorial unification and the recovery of recent identities constitute the main value.

major comments (1)
  1. [geometric semilattices section] § on geometric semilattices (following the bijective proof for arrangements): The central claim that r_ℓ depends only on L(A) and that centralization extends verbatim to arbitrary geometric semilattices rests on the assertion that the level-preserving bijection can be defined purely from poset data while preserving the enumeration. The bijective argument is supplied only for real hyperplane arrangements (via geometric separation and boundedness); no explicit combinatorial re-definition of centralization from the semilattice axioms or separate verification that the bijection survives abstraction is given. This step is load-bearing for the general characteristic-polynomial expression and its corollaries.
minor comments (1)
  1. [abstract/introduction] The abstract and introduction could more clearly distinguish the new bijective proof from the subsequent poset generalization; a short diagram or table contrasting the real-arrangement and semilattice settings would improve readability.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the careful reading and for pointing out the need for greater explicitness in extending the centralization construction to geometric semilattices. We address the comment below and will revise the manuscript to strengthen this part of the argument.

read point-by-point responses

  1. Referee: [geometric semilattices section] § on geometric semilattices (following the bijective proof for arrangements): The central claim that r_ℓ depends only on L(A) and that centralization extends verbatim to arbitrary geometric semilattices rests on the assertion that the level-preserving bijection can be defined purely from poset data while preserving the enumeration. The bijective argument is supplied only for real hyperplane arrangements (via geometric separation and boundedness); no explicit combinatorial re-definition of centralization from the semilattice axioms or separate verification that the bijection survives abstraction is given. This step is load-bearing for the general characteristic-polynomial expression and its corollaries.

    Authors: We agree that the current text derives the poset dependence as a consequence of the arrangement case and does not supply a standalone combinatorial definition of centralization from the semilattice axioms. In the revised version we will insert a new subsection that defines centralization directly on an arbitrary geometric semilattice L: fix a minimal element e of rank 1 and, for each element x, let c(x) be the unique element of rank r(x) that is the join of x with a fixed central atom chosen so that the map preserves the covering relations and the graded rank function. We will then prove, using only the semilattice join operation, the atomicity axiom, and the fact that every interval is a geometric lattice, that this map induces a level-preserving bijection on the set of maximal chains (or coatoms). The argument relies on a combinatorial matching of chains that does not invoke Euclidean separation or boundedness. This will render the subsequent expression for the characteristic polynomial of a geometric semilattice self-contained and independent of the geometric proof. revision: yes

Circularity Check

0 steps flagged

No significant circularity; derivation rests on external combinatorial facts and new bijective proof

full rationale

The paper restates Zaslavsky's known enumeration theorem for regions of given level in real hyperplane arrangements, supplies a bijective proof via centralization, and observes that the count depends only on the intersection poset. This observation permits the standard combinatorial extension to geometric semilattices, from which a general expression for the characteristic polynomial is derived. The steps rely on the external theorem and the new bijection rather than any self-definitional loop, fitted parameter renamed as prediction, or load-bearing self-citation chain. The cited works on deformations are treated as external inputs to which the result is applied. The derivation chain is therefore self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 1 invented entities

The central claims rest on standard facts about hyperplane arrangements and posets together with the newly introduced centralization construction; no numerical parameters are fitted and no new physical entities are postulated.

axioms (2)
  • standard math Zaslavsky's original enumeration of regions and relatively bounded regions for real hyperplane arrangements
    Invoked as the theorem being restated and proved bijectively.
  • domain assumption The intersection poset L(A) determines all combinatorial invariants of the arrangement
    Used to justify extending r_ℓ and centralization to geometric semilattices.
invented entities (1)
  • Centralization of a hyperplane arrangement no independent evidence
    purpose: To restate Zaslavsky's level-counting theorem in a form that admits a bijective proof and extends to semilattices
    New construction introduced to rephrase and prove the enumeration; no independent evidence outside the paper is supplied.

pith-pipeline@v0.9.0 · 5796 in / 1551 out tokens · 80124 ms · 2026-05-21T19:04:59.037257+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

5 extracted references · 5 canonical work pages · 1 internal anchor

  1. [1]

    On geometric semilattices

    [WW85] Michelle L. Wachs and James W. Walker. “On geometric semilattices”. In:Order2.4 (Dec. 1985), pp. 367–385.issn: 1572-9273.doi:10.1007/BF00367425.url:https://doi.org/10.1007/ BF00367425. [OT92] Peter. Orlik and Hiroaki. Terao.Arrangements of Hyperplanes. eng. Grundlehren der mathematis- chen Wissenschaften, A Series of Comprehensive Studies in Mathematics,

    work page doi:10.1007/bf00367425.url:https://doi.org/10.1007/ 1985

  2. [2]

    Eyert, A comparative study on methods for convergence acceleration of iter- ative vector sequences , Journal of Computational Physics 124(2), 271 (1996), doi:10.1006/jcph.1996.0059

    Berlin, Heidelberg: Springer Berlin Heidelberg, 1992.isbn: 9783662027721.url:https://openurl.ac.uk/ukfed: bat?u.ignore_date_coverage=true&rft.mms_id=991003560614302761. [Ath96] Christos A. Athanasiadis. “Characteristic Polynomials of Subspace Arrangements and Finite Fields”. In:Advances in Mathematics122.2 (1996), pp. 193–233.issn: 0001-8708.doi:https: //...

    work page doi:10.1006/aima.1996.0059.url:https://www.sciencedirect.com/science/ 1992

  3. [3]

    Semimatroids and their Tutte polynomials

    arXiv:math/0409003 [math.CO]. url:https://arxiv.org/abs/math/0409003. [Sta+07] Richard P Stanley et al. “An introduction to hyperplane arrangements”. In:Geometric combi- natorics13 (2007), pp. 389–496. [AR11] Drew Armstrong and Brendon Rhoades. “The Shi Arrangement and the Ish Arrangement”. In: Discrete Mathematics &amp; Theoretical Computer ScienceDMTCS ...

    work page internal anchor Pith review Pith/arXiv arXiv doi:10.46298/dmtcs.2890 2007

  4. [4]

    Counting faces in the extended Shi arrangement

    15 [Ehr19] Richard Ehrenborg. “Counting faces in the extended Shi arrangement”. In:Advances in Ap- plied Mathematics109 (2019), pp. 55–64.issn: 0196-8858.doi:https://doi.org/10.1016/ j . aam . 2019 . 05 . 002.url:https : / / www . sciencedirect . com / science / article / pii / S0196885819300855. [BT22] Nero Budur and Tran Quang Tue. “On contact loci of h...

    work page arXiv 2019

  5. [5]

    Level of regions for deformed braid arrangements

    arXiv: 2410.10198 [math.CO].url:https://arxiv.org/abs/2410.10198. [Che+26] Yanru Chen et al. “Level of regions for deformed braid arrangements”. In:Journal of Combi- natorial Theory, Series A217 (2026), p. 106077.issn: 0097-3165.doi:https://doi.org/10. 1016/j.jcta.2025.106077.url:https://www.sciencedirect.com/science/article/pii/ S009731652500072X. 16

    work page arXiv 2026