Pith. sign in

REVIEW 1 major objections 5 minor 38 references

Modular Construction of Free Hyperplane Arrangements

T0 review · 1 major / 5 minor · reviewed 2026-08-14 · deepseek-v4-flash

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

Pith's one-line read The paper proves that every modularly extended matroid carries a divisional flag, so every hyperplane arrangement whose matroid is modularly extended is divisionally free.

desk verdict A new structural sufficient condition for divisional freeness, with a clean induction; the main risk is one load-bearing theorem quoted from an unpublished thesis. read the letter →

arxiv 1908.01535 v4 pith:QZ7KJU7D submitted 2019-08-05 math.CO

Shuhei Tsujie This is my paper · ORCID
classification math.CO MSC 52C3505B3505C2213N15
keywords hyperplanearrangementfreedivisionallydivisionalflagmodularjoinmodularlyextendedmatroidchordalgraphgain
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 proves a matroid-level generalization of the classical gluing construction of chordal graphs. It defines a class of simple matroids, called modularly extended, built from the empty matroid by repeatedly adding modular coatoms and by taking modular joins over round flats. The main theorem states that every modularly extended matroid admits a divisional flag, a chain of flats whose successive contractions have characteristic polynomials dividing the previous one. By the division theorem for arrangements, any hyperplane arrangement whose linear dependence matroid is modularly extended is therefore divisionally free and hence free. This gives a combinatorial sufficient condition for freeness that covers chordal graphic arrangements, several gain-graph arrangements, and some non-supersolvable matroids.

What carries the argument

The motor of the proof is the modular join $M=\mathcal P_X(M_1,M_2)$: two proper modular flats $E_1,E_2$ with $E=E_1\cup E_2$, glued along $X=E_1\cap E_2$. A divisional flag is a chain $\varnothing=X_0\subseteq X_1\subseteq\cdots\subseteq X_n=E$ of flats with $\operatorname{rk}(X_i)=i$ and $\chi(M/X_{i+1},t)\mid \chi(M/X_i,t)$; it is a flag whose contractions have dividing characteristic polynomials, so the division theorem turns it into freeness. The key intermediate objects are divisional atoms, single elements whose deletion has characteristic polynomial dividing that of the whole matroid, because a matroid has a divisional flag exactly when it has a divisional atom whose simplified contraction does. The proof shows that divisional atoms from one side survive in a modular join, using the product formula $\chi(M,t)=\chi(M_1,t)\chi(M_2,t)/\chi(M|X,t)$, and that contracting such an atom yields another modular join.

What would settle it

Search the smallest rank-5 non-supersolvable modularly extended matroids, for example modular joins of supersolvable rank-4 pieces over a round flat, and compute $\chi(M/e,t)$ for every atom $e$: if any such matroid has no atom whose characteristic polynomial divides $\chi(M,t)$, then the main theorem is false. Equivalently, find a modular join over a round flat whose simplified contraction at a divisional atom is not modularly extended.

Watch

Extended reading notes

Core claim

The central claim is Theorem 1.8: every matroid in the minimal class $\mathcal M_E$ generated by the empty matroid, modular-coatom extensions, and modular joins over round flats has a divisional flag. Consequently, if the linear dependence matroid $M(\mathcal A)$ of an arrangement $\mathcal A$ belongs to $\mathcal M_E$, then $\mathcal A$ is divisionally free. The construction generalizes the classical chordal-graph gluing theorem, because in a graphic matroid complete subgraphs are modular flats and the chordal condition becomes membership in $\mathcal M_E$. The paper also shows that $\mathcal M_E$ is the smallest class containing all supersolvable matroids and closed under modular joins over round flats, so the result is strictly broader than supersolvability.

Load-bearing premise

The load-bearing borrowed premise is that every modular flat inside a round matroid, one whose ground set cannot be split into two proper flats, is itself round; if this failed, the induction producing divisional atoms in modular joins would collapse.

Editorial extensions

If this is right

  • Every supersolvable matroid lies in $\mathcal M_E$, so the main theorem recovers the known divisional freeness of supersolvable arrangements.
  • A simple graphic matroid is modularly extended exactly when its graph is chordal, so the freeness criterion for graphic arrangements is the special case.
  • For finite gain groups, the frame matroid and extended lift matroid classes defined by recursive gluing over $\mathring K^G_n$ or $K^G_n$ produce divisionally free arrangements.
  • Modular joins over projective geometries $\operatorname{PG}(n,q)$ give divisionally free arrangements over finite fields, including non-supersolvable binary examples of rank 5.
  • Because divisional freeness implies freeness, every arrangement covered by the theorem is free, even when it is not supersolvable.

Reading between the lines

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

  • Editorial: the natural converse, whether every matroid with a divisional flag is modularly extended, is not addressed; testing it on small rank-5 non-supersolvable modular joins would clarify how sharp the class $\mathcal M_E$ is.
  • Editorial: the same gluing scheme might work for other base classes besides supersolvable matroids, whenever the overlap flat is round and modular; the paper does not explore this.
  • Editorial: for extended Catalan and Shi arrangements the gain group is infinite, and the paper explicitly does not cover them; a modular-coatom classification for infinite gain groups would be the missing input for extending that application.
  • Editorial: the paper asks whether a modularly extended arrangement can fail to be inductively free; a positive example would show that the divisional-flag method reaches arrangements beyond the older inductive-freeness hierarchy.
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

1 major / 5 minor

Summary. The paper defines a class of simple matroids, ME, generated from the empty matroid by two operations: adding a modular coatom and taking modular joins over round flats. This is proposed as a matroid analogue of Dirac's construction of chordal graphs. The main result (Theorem 1.8) states that every matroid in ME has a divisional flag, so every hyperplane arrangement whose linear dependence matroid lies in ME is divisionally free. The proof is a rank induction (Theorem 3.2) supported by lemmas on modular flats and modular joins. Applications are given to frame matroids and extended lift matroids of gain graphs (Theorems 4.11 and 4.22) and to arrangements over finite fields (Theorem 4.27), including explicit non-supersolvable divisionally free examples.

Significance. If correct, the paper gives a substantial matroid-theoretic generalization of chordality that connects modular constructions with divisional freeness. The main theorem unifies known results for graphic arrangements and Dowling geometries and produces new examples of divisionally free but not supersolvable arrangements. The presentation is clear, the rank induction is elegant, and the applications to gain graphs and finite fields are natural. The proof is mostly self-contained; the only external load-bearing input is Proposition 2.9, attributed to an unpublished thesis, which is used essentially in Lemma 3.1 and Theorem 3.2.

major comments (1)
  1. [Section 2, Proposition 2.9] The proof of the main theorem depends crucially on Proposition 2.9, 'Every modular flat of a round matroid is round,' which is quoted without proof from Probert's unpublished PhD thesis [20, Corollary 4.2.8]. This result is used in Lemma 3.1 to conclude that X1∩X2 = X∩Y is round, and in Theorem 3.2 to upgrade minimality among round flats to minimality among all flats so that Proposition 2.17 can be applied. Since these steps are load-bearing for the central claim and the cited source is not readily verifiable from a peer-reviewed publication, I request that the author either provide a proof of Proposition 2.9 or replace the citation with a published reference.
minor comments (5)
  1. [Section 2, Proposition 2.19] In the displayed equation of the proof, the arguments of the characteristic polynomials in the denominator have misplaced parentheses: it should read χ([e,X∨e],t) and χ([0̂,X],t), not χ([e,X∨e]),t and χ([0̂,X]),t.
  2. [Section 4, Proposition 4.4] In the part of the proof treating n≥3, the text repeatedly writes 'M×(KG_2)' where 'M×(KG_n)' is clearly intended; these occur after 'Suppose that n≥3' and should be corrected.
  3. [Section 4, Example 4.23] The phrase 'we regard the gain group {±1} the additive group of F2' is problematic because the additive group of F2 is {0,1}, so it does not contain {±1} as a subgroup; presumably F3 is intended. Moreover, the listed hyperplanes such as {x1+z=0} do not obviously have the form {x_i−x_j=gz} required by the definition of A+(Γ); the example should be reconciled with that formula.
  4. [Section 4, Theorem 4.10] The note that one type of modular coatom is missing from Zaslavsky's classification is appreciated, but the text should clarify that only the sufficient direction (a bias-simplicial vertex gives a modular coatom) is used in the proof of Theorem 4.11, so the incomplete classification does not affect the argument.
  5. [Throughout] There are several minor language and typographical slips: 'The null graph is belongs to C' in Theorem 1.3; 'We will proof the following claims' in the proof of Theorem 3.2; 'An arrangement called divisionally free' in Definition 2.13 (missing 'is'); and 'Propositioin' in Remark 1.5.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the induction proving Theorem 1.8 is self-contained and the paper's self-citations are not load-bearing.

full rationale

The central claim, Theorem 1.8, says every modularly extended matroid has a divisional flag. The class M_E is defined in Definition 1.7 by matroid operations (modular coatom extensions and modular joins over round flats) with no mention of divisionality, and divisional flags and divisional atoms are defined independently in Definitions 2.12-2.14 via characteristic-polynomial divisibility. The proof is a genuine rank induction: Lemma 3.1 shows that M_E is closed under restrictions to modular flats, Theorem 3.2 produces a divisional atom e with si(M/e) in M_E, Lemma 2.20 transfers divisional atoms from a summand of a modular join, Proposition 2.19 describes contractions of modular joins, and Proposition 2.15 assembles a divisional flag. None of these steps assumes the conclusion of Theorem 1.8, and no equation is equal to its input by construction. The paper's self-citations ([16], [25], [29]) appear only in the introduction and in contextual application remarks, such as Remark 4.16, and are not used in the proof of Theorem 1.8, so they do not carry the argument. The one genuinely load-bearing imported statement is Proposition 2.9, attributed to Probert's unpublished thesis, that every modular flat of a round matroid is round; the paper gives no proof of it, and the induction would collapse if it failed. That is a correctness and verification risk rather than circularity, because the statement is external and is not a renamed version of the target result or a fitted parameter. Overall, no fitted input is renamed as a prediction and no self-citation chain forces the conclusion, so the circularity score is 0.

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

The central theorem has no fitted constants or hand-chosen parameters. The new mathematical definitions (modularly extended matroids, divisional flags, divisional atoms) are construction tools, not empirical entities. The proof's load-bearing inputs are standard external theorems: Abe's division theorem, Brylawski's modular-join and short-circuit results, Stanley's modular element theorem, Probert's round-flat theorem, and Zaslavsky's gain-graph classifications.

assumptions (6)
  • standard math Abe's division theorem: an arrangement A is free if there exists H in A such that the restriction A^H is free and chi(A^H,t) divides chi(A,t).
    Theorem 2.11 is the bridge that turns divisional flags into freeness of arrangements; it is cited, not proved.
  • standard math Brylawski's modular short-circuit axiom and modularity criteria.
    Used to prove modularity of constructed flats in Lemma 3.3 and in the gain-graph applications.
  • standard math Brylawski's characteristic polynomial formula for modular joins: chi(M,t) = chi(M1,t) chi(M2,t) / chi(M|X,t).
    Theorem 2.18 is used in Proposition 2.19 to compute chi(si(M/e),t), which is the key divisibility step for divisional atoms.
  • standard math Every modular flat of a round matroid is round (Probert).
    Load-bearing in Lemma 3.1 and Theorem 3.2; see the weakest_assumption field.
  • standard math Stanley's modular element theorem: the characteristic polynomial of the interval below a modular element divides the full characteristic polynomial.
    Theorem 2.10 is used in Lemma 2.16 to show atoms outside a modular coatom are divisional.
  • standard math Zaslavsky's classifications for frame and extended lift matroids: circuit descriptions, flat descriptions, and modular coatom characterizations.
    These external results carry the applications in Section 4; they do not affect the proof of Theorem 1.8.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Modular Construction of Free Hyperplane Arrangements." pith.science (2026). https://pith.science/paper/QZ7KJU7D

@misc{pith2026190801535,
  author       = {Pith},
  title        = {Pith review of: Modular Construction of Free Hyperplane Arrangements},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/QZ7KJU7D}},
  note         = {Machine review of arXiv:1908.01535}
}
read the original abstract

In this article, we study freeness of hyperplane arrangements. One of the most investigated arrangement is a graphic arrangement. Stanley proved that a graphic arrangement is free if and only if the corresponding graph is chordal and Dirac showed that a graph is chordal if and only if the graph is obtained by "gluing" complete graphs. We will generalize Dirac's construction to simple matroids with modular joins introduced by Ziegler and show that every arrangement whose associated matroid is constructed in the manner mentioned above is divisionally free. Moreover, we apply the result to arrangements associated with gain graphs and arrangements over finite fields.

Figures

Figures reproduced from arXiv: 1908.01535 by the authors.

Figure 1
Figure 1. The flat corresponding to KG 2 is not modular. loop and the edge between the left and middle vertices, which is a circuit by Theorem 4.1(b). Using Theorem 2.4, we can conclude that the flat corresponding to KG 2 is not modular. In a similar way, we can construct a frame matroid in which the flat corresponding to KG n (n ≥ 3) is not modular. Next, we introduce bias-simplicial vertices, which is a generalization of si… view at source ↗
Figure 2
Figure 2. The signed graph ./ (Dashed line segments denote negative edges). Then for every Γ ∈ CG × the corresponding arrangement A×(Γ) is divisionally free. Proof . By Propositions 4.4, 4.7, and Theorem 4.10, the frame matroid M×(Γ) is modularly extended. By Theorems 1.8 and 4.3 we can conclude that A×(Γ) is divisionally free.  Example 4.12. Let ./ be a signed graph described in [PITH_FULL_IMAGE:figures/full_fig_p014_2.png] view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

38 extracted references · 38 canonical work pages

  1. [1]

    Abe T., Divisionally free arrangements of hyperplanes, Invent. Math. 204 (2016), 317–346, arXiv:1502.07520

    work page Pith review arXiv 2016

  2. [2]

    Abe T., Restrictions of free arrangements and the division theorem, in Perspectives in Lie Theory, Springer INdAM Ser. , Vol. 19, Editors F. Callegaro, G. Carnovale, F. Caselli, C. De Concini, A. De Sole, Springer, Cham, 2017, 389–401, arXiv:1603.03863

    work page Pith review arXiv 2017

  3. [3]

    Athanasiadis C.A., On free deformations of the braid arrangement, European J. Combin. 19 (1998), 7–18

    work page 1998

  4. [4]

    Bj¨ orner A., Edelman P.H., Ziegler G.M., Hyperplane arrangements with a lattice of regions, Discrete Com- put. Geom. 5 (1990), 263–288

    work page 1990

  5. [5]

    Borissova S., Regular round matroids, Master Thesis, California State University, 2016, available at https: //scholarworks.lib.csusb.edu/etd/423

    work page 2016

  6. [6]

    Brylawski T., Modular constructions for combinatorial geometries, Trans. Amer. Math. Soc. 203 (1975), 1–44

    work page 1975

  7. [7]

    Dirac G.A., On rigid circuit graphs, Abh. Math. Sem. Univ. Hamburg 25 (1961), 71–76

    work page 1961

  8. [8]

    Dowling T.A., A class of geometric lattices based on finite groups, J. Combin. Theory Ser. B 14 (1973), 61–86

    work page 1973

Show all 38 references
  1. [9]

    Edelman P.H., Reiner V., Free hyperplane arrangements between An−1 and Bn, Math. Z. 215 (1994), 347–365

    1994

  2. [10]

    Edelman P.H., Reiner V., Free arrangements and rhombic tilings, Discrete Comput. Geom. 15 (1996), 307– 340

    1996

  3. [11]

    Jambu M., Papadima S., A generalization of fiber-type arrangements and a new deformation method, Topology 37 (1998), 1135–1164

    1998

  4. [12]

    Jambu M., Terao H., Free arrangements of hyperplanes and supersolvable lattices, Adv. Math. 52 (1984), 248–258

    1984

  5. [13]

    Supersolvable frame-matroid and graphic-lift lattices

    Koban L., Comments on: “Supersolvable frame-matroid and graphic-lift lattices” [ European J. Combin. 22 (2001), 119–133] by T. Zaslavsky, European J. Combin. 25 (2004), 141–144

    2001

  6. [14]

    Dedicata 21 (1986), 85–105

    Kung J.P.S., Numerically regular hereditary classes of combinatorial geometries, Geom. Dedicata 21 (1986), 85–105

    1986

  7. [15]

    Lindstr¨ om B., On strong joins and pushout of combinatorial geometries, J. Combin. Theory Ser. A 25 (1978), 77–79

    1978

  8. [16]

    Modular Construction of Free Hyperplane Arrangements 19

    Nakashima N., Tsujie S., Enumeration of flats of the extended Catalan and Shi arrangements with species, arXiv:1904.09748. Modular Construction of Free Hyperplane Arrangements 19

    1904 arXiv

  9. [17]

    300, Springer-Verlag, Berlin, 1992

    Orlik P., Terao H., Arrangements of hyperplanes, Grundlehren der Mathematischen Wissenschaften , Vol. 300, Springer-Verlag, Berlin, 1992

    1992

  10. [18]

    21, Oxford University Press, Oxford, 2011

    Oxley J., Matroid theory, 2nd ed., Oxford Graduate Texts in Mathematics , Vol. 21, Oxford University Press, Oxford, 2011

    2011

  11. [19]

    Postnikov A., Stanley R.P., Deformations of Coxeter hyperplane arrangements, J. Combin. Theory Ser. A 91 (2000), 544–597, arXiv:math.CO/9712213

    2000

  12. [20]

    Thesis, Victoria University of Wellington, 2018

    Probert A.M., Chordality in matroids: in search of the converse to Hlinˇ en´ y’s theorem, Ph.D. Thesis, Victoria University of Wellington, 2018

    2018

  13. [21]

    287, Res

    Saito K., On the uniformization of complements of discriminant loci, in Hyperfunction and Linear Differential Equations, RIMS Kˆ okyˆ uroku, Vol. 287, Res. Inst. Math. Sci. (RIMS), Kyoto, 1977, 117–137

    1977

  14. [22]

    Saito K., Theory of logarithmic differential forms and logarithmic vector fields, J. Fac. Sci. Univ. Tokyo Sect. IA Math. 27 (1980), 265–291

    1980

  15. [23]

    Stanley R.P., Modular elements of geometric lattices, Algebra Universalis 1 (1971), 214–217

    1971

  16. [24]

    Stanley R.P., Supersolvable lattices, Algebra Universalis 2 (1972), 197–217

    1972

  17. [25]

    342 (2019), 233–249, arXiv:1707.01967

    Suyama D., Torielli M., Tsujie S., Signed graphs and the freeness of the Weyl subarrangements of type B𝓁, Discrete Math. 342 (2019), 233–249, arXiv:1707.01967

    2019 arXiv

  18. [26]

    Terao H., Generalized exponents of a free arrangement of hyperplanes and Shepherd–Todd–Brieskorn for- mula, Invent. Math. 63 (1981), 159–179

    1981

  19. [27]

    Terao H., Modular elements of lattices and topological fibration, Adv. Math. 62 (1986), 135–154

    1986

  20. [28]

    Algebraic Combin

    Torielli M., Palezzato E., Free hyperplane arrangements over arbitrary fields, J. Algebraic Combin. 52 (2020), 237–249, arXiv:1803.09908

    2020 arXiv

  21. [29]

    Torielli M., Tsujie S., Freeness of Hyperplane arrangements between Boolean arrangements and Weyl ar- rangements of type B𝓁, Electron. J. Combin. 27 (2020), P3.10, 15 pages, arXiv:1807.02432

    2020 arXiv

  22. [30]

    Welsh D.J.A., Matroid theory, Dover Books on Mathematics , Dover Publications, Mineola, N.Y., 2010

    2010

  23. [31]

    Yoshinaga M., Characterization of a free arrangement and conjecture of Edelman and Reiner, Invent. Math. 157 (2004), 449–454

    2004

  24. [32]

    Japan Acad

    Yoshinaga M., Free arrangements over finite field, Proc. Japan Acad. Ser. A Math. Sci. 82 (2006), 179–182, arXiv:math.CO/0606005

    2006

  25. [33]

    Zaslavsky T., Biased graphs. I. Bias, balance, and gains, J. Combin. Theory Ser. B 47 (1989), 32–52

    1989

  26. [34]

    Zaslavsky T., Biased graphs. II. The three matroids, J. Combin. Theory Ser. B 51 (1991), 46–72

    1991

  27. [35]

    Zaslavsky T., Supersolvable frame-matroid and graphic-lift lattices, European J. Combin. 22 (2001), 119– 133

    2001

  28. [36]

    Zaslavsky T., Biased graphs. IV. Geometrical realizations, J. Combin. Theory Ser. B 89 (2003), 231–297

    2003

  29. [37]

    Ziegler G.M., Matroid representations and free arrangements, Trans. Amer. Math. Soc. 320 (1990), 525–541

    1990

  30. [38]

    Ziegler G.M., Binary supersolvable matroids and modular constructions, Proc. Amer. Math. Soc. 113 (1991), 817–829

    1991

Pith tools

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