The Chain Matrix of Bouquets of Geometric Lattices and its Determinant

Sophia Keip; Winfried Hochst\"attler

REVIEW 2 major objections 5 minor 13 references

The Chain Matrix of Bouquets of Geometric Lattices and its Determinant

T0 review · 2 major / 5 minor · reviewed 2026-08-12 · deepseek-v4-flash

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

Pith's one-line read The chain matrix of a bouquet of geometric lattices has a determinant that factorizes into a product of local weight terms.

desk verdict The main theorem is probably true, but the proof as written has a real gap: it applies the Brylawski–Varchenko determinant formula to blocks indexed only by neat chains, while that formula applies to all maximal flags. read the letter →

arxiv 2411.12529 v1 pith:NGOQFSI6 submitted 2024-11-19 math.CO

Winfried Hochstättler , Sophia Keip This is my paper · ORCID

classification math.CO MSC 05B3506C1052C35

keywords chainmatrixbouquetofgeometriclatticescomplexorientedmatroidsdeterminantfactorizationmatroidbilinearformflagcumulatedrhofunctionneatchains

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 determinant factorization for bouquets of geometric lattices: meet-semilattices in which every interval is the lattice of flats of a matroid. For a bouquet $P$, the chain matrix $C$, indexed by certain maximal chains called neat chains, is shown to satisfy $\det(C) = \pm \prod_{x \in P} w(x)^{\rho_P(x)}$, where $w(x)$ is the sum of atom weights below $x$ and $\rho_P(x)$ is the cumulated rho function built from the Möbius function and Crapo's $\beta$ function. This extends the Brylawski–Varchenko determinant formula from matroids to bouquets of geometric lattices, and as a corollary to complexes of oriented matroids (COMs) and bouquets of matroids. The factorization matters because it turns the determinant of a potentially large matrix into a product of simple local data, and it settles an open question about whether Varchenko's flag-space determinant formula has a COM analogue.

What carries the argument

The machinery is the chain matrix together with a block-diagonalization lemma. A chain $C = [x_1 \lessdot x_2 \lessdot \cdots \lessdot x_k]$ is neat when each element is labeled by an atom below it that does not lie below the previous element; under a convex labeling such as the min-labeling, this means the elements carry distinct atom labels. The entry $C_{C,C'}$ is the signed sum $\sum \operatorname{sgn}(\sigma) w_{i_1} \cdots w_{i_k}$ over all atom tuples $(a_{i_1}, \dots, a_{i_k})$ whose joins generate $C$ and, after permutation $\sigma$, generate $C'$. Lemma 2.3 shows this entry is zero whenever $C$ and $C'$ end at different maximal elements, because the join of the generating atoms is the top element of the chain. Reordering rows and columns then puts the matrix into blocks, one per maximal element $r_i$; each block is exactly the flag matrix of the matroid whose flat lattice is the interval $[\hat{0}, r_i]$, and the Brylawski–Varchenko formula computes its determinant. The exponent $\rho_P(x)$ collects the contributions from all maximal elements above $x$.

What would settle it

For a small bouquet of geometric lattices with several maximal elements, such as the paper's running example, enumerate all labelings and compute the chain matrix for each; any labeling that is not convex and changes which maximal chains are neat should be checked against $\det(C) = \pm \prod_x w(x)^{\rho(x)}$. A single mismatch would show the theorem requires a labeling condition.

Watch

Extended reading notes

Core claim

The central claim is that, for any bouquet of geometric lattices $P$ and any assignment of weights to its atoms, the chain matrix $C$ satisfies $\det(C) = \pm \prod_{x \in P} w(x)^{\rho_P(x)}$. The chain matrix is the symmetric matrix whose rows and columns are the neat maximal chains of $P$, and whose entries are signed sums of products of atom weights over all tuples of atoms that generate the two chains. The exponent $\rho_P(x)$ is defined by $\rho_P(x) = \beta(x) \sum_{i=1}^k \mu^+(x, r_i)$, where the $r_i$ are the maximal elements above $x$, $\beta$ is Crapo's $\beta$ function, and $\mu^+$ is the unsigned Möbius function. The proof orders the matrix so that chains ending at different maximal elements form diagonal blocks, shows the off-diagonal blocks vanish because a chain's top element is the join of its generating atoms, and then applies the Brylawski–Varchenko flag-matrix determinant to each block, since each interval below a maximal element is the flat lattice of a matroid. The same block argument yields the factorization for the zero-set posets of complexes of oriented matroids and for the flag matrices of bouquets of matroids.

Load-bearing premise

The proof assumes that the labeling used to define 'neat' chains has the property that the neat chains ending at a maximal element are exactly the flags of the matroid on the interval below that maximal element; the theorem is stated without this hypothesis.

Editorial extensions

If this is right

For every complex of oriented matroids, the determinant of the chain matrix on its zero-set poset factorizes as $\pm \prod_{Y \in \mathcal{L}} w(z(Y))^{\rho(z(Y))}$, so the flag-space Varchenko determinant formula holds for COMs.
For every bouquet of matroids, the flag matrix determinant factorizes into the same product over its flats, generalizing the classical matroid flag-matrix formula.
The determinant can be read off from the poset and the weights without building the full matrix, since each exponent is a local statistic of the element $x$.
The block-diagonal structure shows that the chain matrix is nonsingular over generic weights exactly when the factors $w(x)^{\rho_P(x)}$ are nonzero, so invertibility is controlled by which weights vanish.

Reading between the lines

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

The block-diagonal mechanism suggests a general gluing principle: any meet-semilattice assembled from matroid flat lattices that share lower structure, with neat chains that do not mix maximal elements, should admit a product-form determinant; geometric semilattices are a natural next class to check.
The same block argument likely yields a chain-matrix proof of the determinant formula for the affine intersection matrix construction mentioned in the paper, since that construction is also built from Brylawski–Varchenko blocks.
Because the determinant is expressed through the cumulated rho function, any new combinatorial interpretation of $\rho_P$ would immediately give a new reading of the determinant, for instance as a product over circuits or roots when the bouquet comes from a realized matroid.

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.

Desk Editor's Note

read the letter

The paper answers an open question and the main result is likely correct, but the proof of Theorem 1.5 has a hole in exactly the step that matters.

What's new: the authors extend the Brylawski–Varchenko determinant factorization from matroids to bouquets of geometric lattices, and as corollaries to complexes of oriented matroids and bouquets of matroids. The block-diagonal lemma (Lemma 2.3) is correct and useful, the exposition is clear, and the worked example is helpful. The reliance on [3] as a black box is methodologically fine—there is no circularity.

The problem is in §2.2. The proof reorders the chain matrix into blocks B_{r_i} and then says that since [∅, r_i] is geometric, it is the flat lattice of a matroid, so the determinant of B_{r_i} can be computed by [3]. But B_{r_i} is indexed only by neat chains ending at r_i, which under the min-labeling are a proper subset of the maximal chains (flags) of the interval. The Brylawski–Varchenko theorem applies to the full flag matrix, not to this principal submatrix. In the rank-3 Boolean lattice, only one of six maximal chains is neat; in the rank-3 matroid on {1,2,3,4} with circuit {1,2,3} and free point 4, only two of nine flags are neat. So the cited theorem cannot be invoked as written. The determinant of the neat submatrix might still factor as claimed—the examples suggest it does—but that is a nontrivial property that is neither stated nor proved.

Related to this, Theorem 1.5 is stated without specifying the labeling that defines neat chains. Different convex labelings select different submatrices, and the proof never shows the determinant is independent of that choice. The corollaries for COMs and bouquets of matroids inherit these gaps.

This is not a fatal objection to the paper's thesis; it is a fixable gap. The authors need to either prove the determinant factorization for the neat-chain submatrix directly, or find a labeling for which neat chains coincide with all flags (which seems unlikely), or restate the theorem with a clearly specified labeling and tackle the submatrix problem. The paper is worth engaging with: it addresses a real open question and the structure is sound. I would send it to a serious referee rather than desk-reject it, and I'd expect the referee to ask for a proof of the neat-submatrix determinant before the result can be accepted as stated.

Referee Report

2 major / 5 minor

Summary. The paper introduces a 'chain matrix' for a bouquet of geometric lattices, indexed by neat maximal chains selected by a labeling of the poset, and claims that its determinant factorizes as ±∏_{x∈P} w(x)^{ρ_P(x)} (Theorem 1.5). The proof reorders the matrix into blocks indexed by the maximal elements r_i, notes that each interval [∅, r_i] is a geometric lattice, and invokes the Brylawski–Varchenko determinant formula for matroid flag matrices. The paper then derives the same factorization for the zero-set poset of a complex of oriented matroids and for bouquets of matroids.

Significance. The claimed result is a natural extension of a known determinant formula and, if correct, would unify results for bouquets of geometric lattices, COMs, and bouquets of matroids. The paper is clearly written, and the block decomposition in Lemma 2.3 is valid. The worked example is consistent with the formula. However, the central proof step identifying each block with the full Brylawski–Varchenko flag matrix is not demonstrated, and the statement of Theorem 1.5 omits a hypothesis on the labeling; these issues are load-bearing for the main claim.

major comments (2)

[§2.2, proof of Theorem 1.5] The sentence 'Since the interval [∅, r_i] is geometric... we can compute the determinant of B_{r_i} by [3]' is the core of the proof and is not justified. The block B_{r_i} is indexed only by neat chains ending at r_i, and with the min-labeling these are a proper subset of the maximal flags of [∅, r_i] already in the smallest cases: in the rank-3 Boolean lattice only one of the six maximal flags is neat. Theorem 2.2 is a formula for the full flag matrix, and the determinant of a principal submatrix is not generally equal to the full determinant. No lemma is supplied showing that the neat-chain block has the same determinant or is otherwise governed by Theorem 2.2. Since Theorem 1.5 and Corollaries 3.6 and 3.9 rest on this step, the proof is incomplete as written.
[Theorem 1.5 and §1.3] The chain matrix C is defined after choosing a labeling l, but Theorem 1.5 states no condition on l and the proof uses none. The neat-chain family C(r_i) depends on the labeling; different convex labelings select different submatrices of the full flag matrix, and the proof never explains why the determinant is independent of that choice. The manuscript either must prove labeling independence or state and prove the theorem under an explicit hypothesis, such as the min-labeling or a general convex labeling.

minor comments (5)

[Corollary 3.6] The exponent in the product is written as ρ_P(x), but x is not defined in the displayed formula; it should be ρ_Z(z(Y)), and the weight should be written as w(z(Y)) = Σ_{e∈z(Y)} w_e.
[Definition 1.4 and Lemma 2.3] The symbol C is used both for the set of neat chains and for the chain matrix itself, which makes statements such as 'the chain matrix C is a symmetric C × C-matrix' hard to parse. A different notation for the chain set would improve readability.
[§1.4] There is a typo: 'corrollary' should be 'corollary'.
[Proof of Theorem 3.5] There is a typo: 'Accourding' should be 'According'.
[§1.5] The final sentence of the related-work section is incomplete: 'whether their framework could also be to COMs' should read 'whether their framework could also be applied to COMs'.

Circularity Check

0 steps flagged · score 1.0 of 10

No circularity: Theorem 1.5 is proved from the external Brylawski–Varchenko determinant theorem; the only self-citation is motivational. The neat-chain submatrix issue is a proof gap, not a circular reduction.

full rationale

The derivation chain is not circular. Theorem 1.5 asserts a product factorization for the chain matrix of a bouquet of geometric lattices. The proof in Section 2.2 first proves Lemma 2.3, showing the chain matrix is block diagonal with blocks indexed by neat chains ending at each maximal element. It then invokes the Brylawski–Varchenko theorem (Theorem 2.2, from reference [3]) to evaluate each block: "Since the interval [∅, r_i] is geometric, it is the flat lattice for some matroid. So we can compute the determinant of B_{r_i} by [3]." This is an application of an independent, external determinant formula, not an assumption of the conclusion. The exponents ρ_P(x) are defined from Möbius and beta functions, not fitted to the determinant values, and no parameter is estimated from data and then renamed as a prediction. The authors' own prior work [7] appears only in the introduction as motivation ("we extended the formula further to complexes of oriented matroids (COMs), which generalize OMs, in [7]") and is not used in the proof of Theorem 1.5; the other cited sources, including [3], [9], and [2], are external. The main substantive concern in the paper is a correctness gap: the blocks B_{r_i} are indexed only by neat chains, which in the min-labeling can be a proper subset of all maximal flags, whereas the Brylawski–Varchenko theorem applies to the full flag matrix. That is an unsupported identification, potentially fixable by additional argument, but it is not circular—it does not reduce Theorem 1.5 to its own statement. The missing labeling hypothesis in Theorem 1.5 is likewise a precision condition, not a circularity. Overall, the paper's central claim has independent content and rests on an external theorem; the only blemish is a minor, non-load-bearing self-citation, so the circularity score is 1.

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

The central claim rests on the identification of the chain matrix blocks with the known Brylawski-Varchenko flag matrix, plus the standard assumption that the labeling defining neat chains yields the appropriate set of chains. No free parameters are fitted; the weights are formal indeterminates.

assumptions (3)

domain assumption The chain matrix of a matroid as defined in this paper is the same object for which Brylawski and Varchenko proved their determinant formula.
Invoked when computing each block determinant via [3]; the paper does not prove this correspondence for neat chains.
domain assumption The labeling used to define neat chains is such that the neat chain family C(r_i) is nonempty and matches the flag set in [3] for every maximal element r_i.
Theorem 1.5 is stated for any chain matrix, but a labeling that removes too many neat chains would change the matrix without a corresponding change in the claimed product.
standard math Standard facts about geometric lattices, matroid flat lattices, and locality of the Möbius function are correct.
Used to identify intervals and apply the classical determinant theorem.

how reviews work

0 comments

Cite this review

Pith. "Pith review of The Chain Matrix of Bouquets of Geometric Lattices and its Determinant." pith.science (2026). https://pith.science/paper/NGOQFSI6

@misc{pith2026241112529,
  author       = {Pith},
  title        = {Pith review of: The Chain Matrix of Bouquets of Geometric Lattices and its Determinant},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/NGOQFSI6}},
  note         = {Machine review of arXiv:2411.12529}
}

read the original abstract

This work builds on Varchenko et al's introduction of bilinear forms for hyperplane arrangements, where the determinant of the associated matrices factorizes into simple components. While one of the determinant formula developed by Varchenko has been generalized to complexes of oriented matroids (COMs) already, this question was open for another, distinct form. Motivated by work from Varchenko and Brylawski, who generalized the alternative bilinear form and its determinant formula from hyperplane arrangements to matroids, we examine whether this formula can similarly be generalized to COMs. Our findings affirm this generalization, and we further extend the determinant formula to bouquets of geometric lattices as introduced by Laurent et al.

Figures

Figures reproduced from arXiv: 2411.12529 by the authors.

**Figure 1.** Examples of a lattices with a ˆ1 and a ˆ0 element. The lattice to the left is geometric. The lattice to the right is not geometric, since semimodularity is not fulfilled for x and y. It is neither a bouquet of geometric lattices. ˆ0 [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗

**Figure 2.** Example of a bouquet of geometric lattices. For µ(ˆ0, x) we write µ(x) and we denote the unsigned version by µ +(x, y) = |µ(x, y)|. Crapo’s beta function β [5] of a poset element is defined by β(x) = (−1)r(x) X y:y≤x µ(y)r(y). We now have all the necessary components to define the cumulated rho function, a key element in our factorization formula. Let r1, . . . , rk denote the maximal elements of P such that x ≤ ri … view at source ↗

**Figure 3.** Bouquet of geometric lattices with atoms a1, . . . , a5. With the min-labeling we get l(ai) = ai , i = 1, . . . , 5 for all atoms and l(r1) = a1, l(r2) = a1, l(r3) = a2 and l(r4) = a4 for the other elements. The neat chains are [a5 ⋖ r4], [a5 ⋖ r3], [a5 ⋖ r2], [a4 ⋖ r1] and [a3 ⋖ r3] since there all elements have distinct labels. Consistent with Example 1.3, let r1, . . . , rn be the maximal elements of P. We call t… view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

13 extracted references · 12 canonical work pages

[3]

The determinant formula for a matroid bilinear form

T Brylawski and A Varchenko. The determinant formula for a matroid bilinear form. advances in mathematics, 129(1):1–24, 1997

work page 1997
[1]

Coms: complexes of oriented matroids

Hans-J¨ urgen Bandelt, Victor Chepoi, and Kolja Knauer. Coms: complexes of oriented matroids. Journal of Combinatorial Theory, Series A, 156:195–237, 2018

work page 2018
[2]

Number 46

Anders Bj¨ orner.Oriented matroids. Number 46. Cambridge University Press, 1999

work page 1999
[4]

A m¨ obius identity arising from modularity in a matroid bilinear form

Tom Brylawski. A m¨ obius identity arising from modularity in a matroid bilinear form. Journal of Combinatorial Theory, Series A, 91(1-2):622–639, 2000

work page 2000
[5]

A higher invariant for matroids

Henry H Crapo. A higher invariant for matroids. Journal of Combinatorial Theory, 2(4):406–417, 1967

work page 1967
[6]

An Intersection Matrix for Affine Hyperplane Arrangements

Jens Niklas Eberhardt and Carl Mautner. An intersection matrix for affine hyperplane arrangements. arXiv preprint arXiv:2407.06008, 2024

work page Pith review arXiv 2024
[7]

The signed Varchenko Determinant for Complexes of Oriented Matroids

Winfried Hochst¨ attler, Sophia Keip, and Kolja Knauer. The signed varchenko determinant for com- plexes of oriented matroids. arXiv preprint arXiv:2211.13986, 2022

work page Pith review arXiv 2022
[8]

The varchenko determinant for oriented matroids.Math- ematische Zeitschrift, 293:1415–1430, 2019

Winfried Hochst¨ attler and Volkmar Welker. The varchenko determinant for oriented matroids.Math- ematische Zeitschrift, 293:1415–1430, 2019

work page 2019

Show all 13 references

[9]

Bouquets of geometric lattices: some algebraic and topological aspects

Monique Laurent and Michel Deza. Bouquets of geometric lattices: some algebraic and topological aspects. In Annals of Discrete Mathematics, volume 43, pages 279–313. Elsevier, 1989

1989
[10]

Arrangements of hyperplanes and lie algebra homology

Vadim V Schechtman and Alexander N Varchenko. Arrangements of hyperplanes and lie algebra homology. Inventiones mathematicae, 106(1):139–194, 1991

1991
[11]

Multidimensional hypergeometric functions the representation theory of Lie Algebras and quantum groups, volume 21

Alexander Varchenko. Multidimensional hypergeometric functions the representation theory of Lie Algebras and quantum groups, volume 21. World Scientific, 1995

1995
[12]

Poset topology: tools and applications

Michelle L Wachs. Poset topology: tools and applications. arXiv preprint math/0602226, 2006

2006 arXiv
[13]

On geometric semilattices

Michelle L Wachs and James W Walker. On geometric semilattices. Order, 2(4):367–385, 1985. FernUniversit¨at in Hagen, F akult¨at f¨ur Mathematik und Informatik, 58084 Hagen, Ger- many Email address: winfried.hochstaettler@fernuni-hagen.de FernUniversit¨at in Hagen, F akult¨at ...

1985

Pith tools

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

[1] [3]

The determinant formula for a matroid bilinear form

T Brylawski and A Varchenko. The determinant formula for a matroid bilinear form. advances in mathematics, 129(1):1–24, 1997

work page 1997

[2] [1]

Coms: complexes of oriented matroids

Hans-J¨ urgen Bandelt, Victor Chepoi, and Kolja Knauer. Coms: complexes of oriented matroids. Journal of Combinatorial Theory, Series A, 156:195–237, 2018

work page 2018

[3] [2]

Number 46

Anders Bj¨ orner.Oriented matroids. Number 46. Cambridge University Press, 1999

work page 1999

[4] [4]

A m¨ obius identity arising from modularity in a matroid bilinear form

Tom Brylawski. A m¨ obius identity arising from modularity in a matroid bilinear form. Journal of Combinatorial Theory, Series A, 91(1-2):622–639, 2000

work page 2000

[5] [5]

A higher invariant for matroids

Henry H Crapo. A higher invariant for matroids. Journal of Combinatorial Theory, 2(4):406–417, 1967

work page 1967

[6] [6]

An Intersection Matrix for Affine Hyperplane Arrangements

Jens Niklas Eberhardt and Carl Mautner. An intersection matrix for affine hyperplane arrangements. arXiv preprint arXiv:2407.06008, 2024

work page Pith review arXiv 2024

[7] [7]

The signed Varchenko Determinant for Complexes of Oriented Matroids

Winfried Hochst¨ attler, Sophia Keip, and Kolja Knauer. The signed varchenko determinant for com- plexes of oriented matroids. arXiv preprint arXiv:2211.13986, 2022

work page Pith review arXiv 2022

[8] [8]

The varchenko determinant for oriented matroids.Math- ematische Zeitschrift, 293:1415–1430, 2019

Winfried Hochst¨ attler and Volkmar Welker. The varchenko determinant for oriented matroids.Math- ematische Zeitschrift, 293:1415–1430, 2019

work page 2019