Exponents of 2-multiarrangements of three lines over fields of positive characteristic

Ryo Uchiumi; Shuhei Tsujie

REVIEW 2 major objections 4 minor 11 references

Exponents of 2-multiarrangements of three lines over fields of positive characteristic

T0 review · 2 major / 4 minor · reviewed 2026-08-07 · deepseek-v4-flash

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

Pith's one-line read This paper proves that exponents of every three-line multiarrangement over F_p are determined by a six-case p-adic digit rule, with explicit statements of periodicity, symmetry, and binomial-basis validity.

desk verdict A genuine but likely fixable gap in Proposition 2.11(2) undercuts the printed proof of the main algorithm; the rest of the paper—Frobenius scaling, periodicity, and the Lucas-based basis characterization—is solid and worth refereeing. read the letter →

arxiv 2506.07070 v3 pith:VPUCDJPW submitted 2025-06-08 math.CO

Shuhei Tsujie , Ryo Uchiumi This is my paper

classification math.CO MSC 52C3532S22

keywords multiarrangementderivationmoduleexponentspositivecharacteristicFrobeniusendomorphismmultiplicitylatticebinomialcoefficientsp-adic

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

In a field of characteristic p, this paper determines the exponents—the two degrees of a basis for the module of logarithmic derivations, i.e. polynomial vector fields tangent to the three lines with prescribed vanishing orders—for every multiarrangement of three lines in the plane. The authors prove that balanced multiplicity vectors organize themselves into disjoint balls whose radii are powers of p, centered at vectors obtained by p-adic scaling of odd centers, and turn this geometry into a six-case digit algorithm for the exponent gap. This is a real departure from characteristic zero, where the gap is only ever 0 or 1, and it accounts for examples where the classical bases collapse modulo p. The same self-similarity yields periodicity and symmetry of the exponent tables and a precise positive-characteristic validity criterion for the classical binomial-coefficient bases.

What carries the argument

The carrying object is the multiplicity lattice Λ=(Z_{\ge0})^3 together with the gap function Δ(μ), where the two exponents are (|μ|−Δ)/2 and (|μ|+Δ)/2. The lattice is organized by the known structure theorem: components with Δ>0 are balls B(ζ,Δ(ζ)) with a unique center. The new mechanism is the Frobenius endomorphism: the q-th power map multiplies Δ by q and sends centers of components to centers, forcing center radii to be powers of p. From this, the paper builds the algorithm around a p-adic digit decomposition μ=p^kα+β, comparing β against two tetrahedra T(p^k) and p^k1−T(p^k) to select one of six formulas. The periodicity and symmetry statements are carried by the basis maps Ψ_d(θ)=θ(x)$x^{{p^d}}$∂x−θ(y)$y^{{p^d}}$∂y and μ^∨=(p^d−μ2,p^d−μ1,μ3), while the binomial-basis analysis uses Lucas's theorem to decide which binomial coefficients vanish modulo p.

What would settle it

Take a small prime p and every balanced μ with |μ|≤$2p^{2}$−2, compute the module D(A,μ) by linear algebra over F_p, and test whether the lower-degree basis of each center with Δ>1 has all coefficients in F[x^p,y^p]. Finding one center whose lower-degree basis contains a monomial x^a y^b with p∤a or p∤b would falsify Proposition 2.11 and hence the p-power component structure; alternatively, a direct comparison of Theorem 3.6's output with brute-force Saito-criterion computations on the same range would falsify the algorithm if any entry disagreed.

Watch

Extended reading notes

Core claim

The paper's central claim is that over F_p the exponents of the three-line multiarrangement are controlled by a p-adic self-similarity of the multiplicity lattice. For balanced multiplicities μ=(μ1,μ2,μ3) with Δ(μ)>0, every connected component of the lattice is a ball B(ζ,p^k) whose center ζ lies in p^kΛ^bal_odd; the scale-one centers are exactly the odd balanced vectors not covered by any ball around a p-scaled odd vector. Theorem 3.6 converts this geometry into an effective algorithm: take the largest k with p^k≤|μ|/2 and μ∈B(p^kΛ^bal_odd,p^k), write μ=p^kα+β with 0≤β_i<p^k, and read Δ(μ) and exp(A,μ) from one of six formulas depending on the parity of α and on which of the tetrahedral regions T(p^k) or p^k1−T(p^k) (or their complement) contains β. The same self-similarity yields periodicity Δ(μ+(p^d,p^d,0))=Δ(μ) and symmetry Δ((p^d−μ2,p^d−μ1,μ3))=Δ(μ). In addition, the classical binomial-coefficient bases from characteristic zero are characterized exactly: over F_p they are bases precisely on the lower set Γ(m), whose boundary is governed by Lucas's theorem.

Load-bearing premise

The argument hinges on an unproved cited remark about p-th power coefficients of lower-degree bases; if that remark is wrong, the p-power ball structure and the whole algorithm would not follow.

Editorial extensions

If this is right

Every 2-multiarrangement of three lines over F_p is now computable in finite terms: p-adic digit decomposition plus the six formulas of Theorem 3.6 give Δ(μ) and exp(A, μ) directly.
The zero-gap locus is explicitly characterized as Λ^bal minus the union of all p-scaled odd balls, so the pairs of equal exponents form a p-adic Sierpinski-type pattern.
Exponent gaps are periodic under adding (p^d,p^d,0) and invariant under the cube symmetry μ^∨, so the whole multiplicity lattice can be tiled from finitely many fundamental blocks.
The classical binomial bases remain valid over F_p exactly on the lower set Γ(m), with boundary described by Lucas's theorem; outside that range they fail and must be replaced.
Explicit bases exist at the outer component centers via binomial sums, giving concrete derivations realizing the computed exponents on those components.

Reading between the lines

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

The same p-power ball argument, if the cited remark is supplied, should extend to 2-multiarrangements of any finite set of lines over F_p, with the bound #A−2 replacing 1; the three-line case is the prototype of a general p-adic component structure.
Because Δ^{-1}(0) follows Pascal's triangle modulo p, exact counts of balanced multiplicities of fixed size with equal exponents can likely be obtained from digit-sum statistics of Sierpinski gaskets; this counting question is not addressed in the paper.
The periodicity and symmetry maps are basis-preserving, so one could use them to assemble explicit bases on large components from small ones, potentially producing closed-form bases beyond the outer centers the paper handles.
A direct implementation of Theorem 3.6 would generate exponent tables for arrangements over small fields, which could be used to test whether ordinary 3-arrangement freeness in positive characteristic follows Terao-type lattice rules.

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

Colleague,

Quick take: this paper gives the first systematic account of exponents for three-line multiarrangements over F_p, including an effective p-adic algorithm and a clean Lucas-based description of when the binomial bases work. The main arc is sound in spirit, but there is a real proof gap in Proposition 2.11(2) that needs fixing before Theorem 3.6 is fully supported.

What is new and good: The Frobenius basis preservation (Theorem 2.2) is a nice observation and it drives everything. The stratification of the multiplicity lattice into p-power balls with centers in p^k Λ^bal_odd is a genuinely new structural statement for positive characteristic. The periodicity and symmetry maps in Section 4 are explicit and constructive, and the Section 5 characterization of Γ(m) via Lucas' theorem is clean and checkable. The paper is honest: no free parameters, no fitting to examples, and the tables match the formulas.

The soft spot: the proof of Proposition 2.11(2) as printed is not valid. The step 'θ_ζ(x) ∈ x^{p^k}S' does not follow from f,g ∈ F[x^p,y^p] when k is the smallest power of p above ζ(H). The stress-test counterexample is right: p=3, ζ=(6,6,3), lower basis x^6 dx - y^6 dy, so θ_ζ(x)=x^6 and p^k=9; x^6 is not in x^9S. The intended claim that ζ(H) is a p-power is likely still true, and the standard fix is to use divisibility by x^{p ceil(ζ(H)/p)} instead of x^{p^k}. But as written, the lemma has a genuine gap, and since Theorem 3.1 and Theorem 3.6 build on it, the main algorithm needs a corrected proof. This is serious but likely repairable. There are also minor issues like the variable slip in Lemma 5.17 and the ambiguous 'pk' notation. The reliance on Abe's remark for part (1) is acceptable if that result is indeed published and correct; citing prior work for a side fact is normal.

Verdict: This is a paper for arrangement theorists and people who compute with multiarrangements. The core contribution is useful and mostly well argued; the gap is narrow and fixable. I would not desk reject it. Send it to a competent referee, ask for a corrected Proposition 2.11, and it should be publishable.

Referee Report

2 major / 4 minor

Summary. The paper studies the exponents of 2-multiarrangements of three lines over fields of positive characteristic, complementing Wakamiko's characteristic-zero classification. It develops a p-adic recursive algorithm (Theorem 3.6) that determines Δ(μ) and exp(A,μ) for balanced μ from membership of μ in balls around p^mΛ^bal_odd, proves a Frobenius-based self-similarity of the multiplicity lattice (Theorem 3.2, Corollary 3.3), establishes periodicity and symmetry of exponents via explicit basis-preserving operators Ψ_d and ∨, and characterizes the validity range of Wakamiko's binomial bases using Lucas' theorem (Theorem 5.3, Corollary 5.11). Worked examples (3.7, 5.19, 5.20) illustrate the algorithm.

Significance. If the structure theorem is correct, the paper gives a complete, parameter-free computation of exponents for all three-line multiarrangements over finite prime fields, which is a substantial and nontrivial contrast with characteristic zero. The Frobenius-based description of centers and the periodicity/symmetry theorems are clean and of independent interest, and the binomial-basis section is a nice self-contained application of Lucas' theorem. The paper introduces no free parameters and provides explicit, falsifiable formulas and examples. The main caveat is a load-bearing proof gap in Proposition 2.11(2), which is discussed below.

major comments (2)

[§2.2, Proposition 2.11(2)] The inference 'By (1), we have θζ(x) ∈ x^{p^k}S' in the proof of (2) is not justified. Statement (1) gives only f,g∈F[x^p,y^p]; this forces the x-exponent of each monomial of f to be divisible by p, not to be at least p^k. A concrete counterexample to the implication is p=3, ζ=(6,6,3), whose lower basis is x^6∂x−y^6∂y (the Frobenius image of the balanced center (2,2,1) with lower basis x^2∂x−y^2∂y); here ζ(H)=6<9=p^k but θζ(x)=x^6∉x^9S. The contradiction in the proof therefore does not follow. This is load-bearing: Proposition 2.11(2) is used in Theorem 3.1 to conclude that every connected component of Λ^bal_{>0} has radius p^k, and Theorem 3.6 and Corollaries 3.3–3.4 inherit that conclusion. The authors should supply a corrected proof of Proposition 2.11(2), or replace it by a precise lemma that yields ζ∈pΛ^bal_{>0}, and then re-verify Theorem 3.1.
[§2.2, Proposition 2.11(1)] Proposition 2.11(1), which is the actual source of the p-adic divisibility of the lower-degree basis, is not proved in the manuscript; it is cited to Abe [1, Remark 3.2]. Since the entire structure theorem depends on this statement, please either reproduce a proof or give a complete statement of the cited result, including the coefficient-field and degree hypotheses, so that the divisibility step can be checked independently.

minor comments (4)

[§5, Lemma 5.17] In the proof of Lemma 5.17 the element adjacent to κ is first called ν and then µ within the same sentence; please choose one variable for consistency.
[§5, Lemma 5.17] The word 'unimordal' should be 'unimodal'.
[§2.2, Proposition 2.11] The notation 'pk' in the proof of Proposition 2.11 is ambiguous; it should be typeset unambiguously as p^k throughout.
[§2.2, Theorem 2.4] Theorem 2.4 contains the typo 'state-memts' for 'statements'.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity found; the main algorithm reduces to explicit lattice-ball membership and external theorems, not to its own output.

full rationale

After walking the derivation chain, I find no circular step. The main algorithm (Theorem 3.6) computes Delta(mu) and exp(A,mu) from the explicit membership condition mu in B(p^m Lambda^bal_odd, p^m) and the p-adic cube decomposition of Lemma 3.5; here Lambda^bal_odd is defined by parity of |mu| (equivalently by parity of Delta), not by the exponents being computed. The ball description of centers (Theorems 3.1 and 3.2) derives from the Abe-Numata characterization (Theorem 2.5), Frobenius scaling (Theorem 2.2 and Proposition 2.9), and the cited Abe remark; none of these citations is self-citational, and they do not assume the target conclusion. Section 5's characterization of Gamma(m) is proved directly from Saito's criterion, Lucas's theorem, and the Wakamiko basis, with no fitted parameters. I do note a non-circular correctness gap in the proof of Proposition 2.11(2): from f,g in F[x^p,y^p] the text infers theta_zeta(x) in x^{p^k}S for k = min{k | zeta(H) <= p^k}, which is false in general (e.g., p=3, zeta=(6,6,3), theta = x^6 partial_x - y^6 partial_y, zeta(H)=6 <= 9 but x^6 is not in x^9 S). This gap affects the proof of Theorem 3.1 and hence the main theorem, but it is a proof gap rather than a circular definition, fit, or self-citation chain, and the intended conclusion can be repaired by a divisibility argument using ceil(zeta(H)/p). Therefore the circularity score is 0.

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

No constants are fitted to data and no new entities are postulated. The central results are derivations from cited theorems in arrangement theory; the only specialized input not proved here is Abe's remark on the positive-characteristic lower-degree basis.

assumptions (6)

standard math Saito's criterion for freeness of multiarrangements (Theorem 1.1)
Used throughout to convert determinant equality into a basis statement; cited from Saito and Ziegler.
standard math Abe-Numata multiplicity lattice theorems (Lemma 2.3, Theorems 2.4 and 2.5, Corollary 2.6)
Provides connected components, centers, and the exact formula Δ(μ) = Δ(ζ) - |μ - ζ| within a component; cited, not reproved.
standard math Lucas' theorem on binomial coefficients modulo p (Lemma 5.1)
Characterizes vanishing of binomial coefficients modulo p; the basis-validity range in Theorems 5.3 and 5.8 depends on it.
standard math Wakamiko's characteristic-zero basis and exponents (Theorem 1.2)
Serves as the starting point for the binomial basis and as a comparison; cited from Wakamiko.
standard math Every 2-multiarrangement is free (Ziegler Corollary 7)
Guarantees existence of exponents and of the function Δ; used in Section 2.2 to define the multiplicity lattice function.
domain assumption Abe's remark on the positive-characteristic lower-degree basis (Abe [1, Remark 3.2])
Unproved in this paper; it implies coefficients of the lower-degree basis at a high-radius center lie in F[x^p, y^p], which drives Proposition 2.11 and Theorem 3.1.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Exponents of 2-multiarrangements of three lines over fields of positive characteristic." pith.science (2026). https://pith.science/paper/VPUCDJPW

@misc{pith2026250607070,
  author       = {Pith},
  title        = {Pith review of: Exponents of 2-multiarrangements of three lines over fields of positive characteristic},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/VPUCDJPW}},
  note         = {Machine review of arXiv:2506.07070}
}

read the original abstract

Wakamiko determined bases and the exponents for multiarrangements of three lines over a field of characteristic zero. In this paper, we study the exponents of multiarrangements of three lines for the case of positive characteristic. We provide an effective algorithm for computing the exponents. Furthermore, we prove that the multiplicity lattice has plenty of symmetries. We also discuss the validity of bases constructed from binomial expansions in the case of positive characteristic.

Figures

Figures reproduced from arXiv: 2506.07070 by the authors.

**Figure 2.** p = 3, |µ| = 2 · 3 3 − 2 10 [PITH_FULL_IMAGE:figures/full_fig_p010_2.png] view at source ↗

**Figure 3.** The tetrahedron p kα + T(p k ) p kα p kα + p ke1 p kα + p ke2 p kα + p ke3 p kα + p k1 [PITH_FULL_IMAGE:figures/full_fig_p014_3.png] view at source ↗

Figures from the paper (1 more)

**Figure 4.** Figure 4: The tetrahedron p kα + p k1 − T(p k ) Proof. Consider the following representation for β: β = x1(e2 + e3) + x2(e1 + e3) + x3(e1 + e2) = (x2 + x3, x1 + x3, x1 + x2). (1) Take µ ∈ Λ \ B(p kΛodd, pk ). First, suppose that α ∈ Λeven. Then we have C(α, pk ) \ B(p kΛodd, pk …

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

11 extracted references · 11 canonical work pages

[1]

Abe, Chambers of 2-affine arrangements and freeness of 3-arrangements, Journal of Algebraic Combinatorics 38 (2013), 65–78

T. Abe, Chambers of 2-affine arrangements and freeness of 3-arrangements, Journal of Algebraic Combinatorics 38 (2013), 65–78

work page 2013
[2]

Abe and Y

T. Abe and Y. Numata, Exponents of 2-multiarrangements and multiplicity lattices, Journal of Algebraic Combinatorics 35 (2012), no. 1, 1–17

work page 2012
[3]

Abe and M

T. Abe and M. Yoshinaga, Free arrangements and coefficients of characteristic poly- nomials, Mathematische Zeitschrift 275 (2013), no. 3-4, 911–919

work page 2013
[4]

Feigin, Z

M. Feigin, Z. Wang, and M. Yoshinaga, Integral expressions for derivations of mul- tiarrangements, International Journal of Mathematics 36 (2025), no. 04, 2450085, Publisher: World Scientific Publishing Co

work page 2025
[5]

An Algorithm to Construct A Basis for the Module of Logarithmic Vector Fields

Y. Numata, An Algorithm to Construct A Basis for the Module of Logarithmic Vector Fields, June 2007, arXiv:0707.0004 [math]

work page Pith review arXiv 2007
[6]

Saito, Theory of logarithmic differential forms and logarithmic vector fields, Jour- nal of the Faculty of Science

K. Saito, Theory of logarithmic differential forms and logarithmic vector fields, Jour- nal of the Faculty of Science. University of Tokyo. Section IA. Mathematics 27 (1980), no. 2, 265–291

work page 1980
[7]

Terao, The exponents of a free hypersurface, Singularities, Part 2 (Arcata, Calif., 1981), Proc

H. Terao, The exponents of a free hypersurface, Singularities, Part 2 (Arcata, Calif., 1981), Proc. Sympos. Pure Math., vol. 40, Amer. Math. Soc., Providence, RI, 1983, pp. 561–566

work page 1981
[8]

Wakamiko, On the Exponents of 2-Multiarrangements , Tokyo Journal of Math- ematics 30 (2007), no

A. Wakamiko, On the Exponents of 2-Multiarrangements , Tokyo Journal of Math- ematics 30 (2007), no. 1, 99–116

work page 2007

Show all 11 references

[9]

Yoshinaga, Characterization of a free arrangement and conjecture of Edelman and Reiner, Inventiones mathematicae 157 (2004), no

M. Yoshinaga, Characterization of a free arrangement and conjecture of Edelman and Reiner, Inventiones mathematicae 157 (2004), no. 2, 449–454

2004
[10]

01, 126–134

, On the freeness of 3-arrangements , Bulletin of the London Mathematical Society 37 (2005), no. 01, 126–134

2005
[11]

G. M. Ziegler, Multiarrangements of hyperplanes and their freeness , Contemporary Mathematics 90 (1989), 345–359. 30

1989

Pith tools

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

[1] [1]

Abe, Chambers of 2-affine arrangements and freeness of 3-arrangements, Journal of Algebraic Combinatorics 38 (2013), 65–78

T. Abe, Chambers of 2-affine arrangements and freeness of 3-arrangements, Journal of Algebraic Combinatorics 38 (2013), 65–78

work page 2013

[2] [2]

Abe and Y

T. Abe and Y. Numata, Exponents of 2-multiarrangements and multiplicity lattices, Journal of Algebraic Combinatorics 35 (2012), no. 1, 1–17

work page 2012

[3] [3]

Abe and M

T. Abe and M. Yoshinaga, Free arrangements and coefficients of characteristic poly- nomials, Mathematische Zeitschrift 275 (2013), no. 3-4, 911–919

work page 2013

[4] [4]

Feigin, Z

M. Feigin, Z. Wang, and M. Yoshinaga, Integral expressions for derivations of mul- tiarrangements, International Journal of Mathematics 36 (2025), no. 04, 2450085, Publisher: World Scientific Publishing Co

work page 2025

[5] [5]

An Algorithm to Construct A Basis for the Module of Logarithmic Vector Fields

Y. Numata, An Algorithm to Construct A Basis for the Module of Logarithmic Vector Fields, June 2007, arXiv:0707.0004 [math]

work page Pith review arXiv 2007

[6] [6]

Saito, Theory of logarithmic differential forms and logarithmic vector fields, Jour- nal of the Faculty of Science

K. Saito, Theory of logarithmic differential forms and logarithmic vector fields, Jour- nal of the Faculty of Science. University of Tokyo. Section IA. Mathematics 27 (1980), no. 2, 265–291

work page 1980

[7] [7]

Terao, The exponents of a free hypersurface, Singularities, Part 2 (Arcata, Calif., 1981), Proc

H. Terao, The exponents of a free hypersurface, Singularities, Part 2 (Arcata, Calif., 1981), Proc. Sympos. Pure Math., vol. 40, Amer. Math. Soc., Providence, RI, 1983, pp. 561–566

work page 1981

[8] [8]

Wakamiko, On the Exponents of 2-Multiarrangements , Tokyo Journal of Math- ematics 30 (2007), no

A. Wakamiko, On the Exponents of 2-Multiarrangements , Tokyo Journal of Math- ematics 30 (2007), no. 1, 99–116

work page 2007