pith. sign in

arxiv: 2605.01408 · v2 · submitted 2026-05-02 · 🧮 math.AG

Combinatorial Nonresonance Theorems for Hyperplane Arrangement Complements

Pith reviewed 2026-05-11 00:52 UTC · model grok-4.3

classification 🧮 math.AG
keywords hyperplane arrangementsnonresonancelocal systemscombinatorial conditionsline arrangementsrestriction and liftingCohen-Dimca-Orlik method
0
0 comments X

The pith

A refined combinatorial criterion provides a sufficient condition for nonresonance of rank-one local systems on hyperplane arrangement complements.

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

The paper refines the Cohen-Dimca-Orlik method to derive a purely combinatorial sufficient condition that guarantees nonresonance for complex rank-one local systems on the complements of hyperplane arrangements. This condition requires no additional hypotheses beyond the combinatorial data of the arrangement. It is applied to strengthen an earlier theorem by Bailet, Dimca, and Yoshinaga through removal of one of its conditions. Restriction and lifting constructions are developed to prove a corresponding nonresonance result for the special case of line arrangements.

Core claim

By refining the method of Cohen, Dimca, and Orlik, we obtain a combinatorial sufficient condition for nonresonance. This strengthens the theorem of Bailet, Dimca, and Yoshinaga by removing one of its conditions. We also develop restriction and lifting techniques to prove a nonresonance theorem for line arrangements.

What carries the argument

The refined combinatorial sufficient condition obtained from the Cohen-Dimca-Orlik method, which detects nonresonance of local systems using only arrangement combinatorics.

If this is right

  • Nonresonance can be verified for many arrangements using only combinatorial data such as the intersection lattice.
  • The strengthened Bailet-Dimca-Yoshinaga theorem applies to a broader class of hyperplane arrangements.
  • Nonresonance statements for line arrangements follow directly from the restriction and lifting constructions.
  • The techniques allow nonresonance properties to be transferred between an arrangement and its restrictions or lifts.

Where Pith is reading between the lines

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

  • The criterion may support algorithms that decide nonresonance directly from combinatorial input without computing cohomology.
  • Similar combinatorial refinements could apply to resonance questions on other varieties or for local systems of higher rank.
  • Explicit checks on known families of arrangements would clarify the range of cases covered by the new condition.

Load-bearing premise

The refinement of the Cohen-Dimca-Orlik method yields a valid combinatorial criterion that applies without additional hypotheses, and the restriction and lifting constructions correctly transfer nonresonance statements for line arrangements.

What would settle it

An explicit hyperplane arrangement together with a rank-one local system where the new combinatorial condition holds but the cohomology of the local system fails to vanish in the expected degrees.

read the original abstract

We study the nonresonance phenomenon for complex rank-one local systems on complements of hyperplane arrangements. We refine the method of Cohen, Dimca, and Orlik and obtain a combinatorial sufficient condition for nonresonance. As an application, we strengthen a theorem of Bailet, Dimca, and Yoshinaga by removing one of its conditions. We also develop restriction and lifting techniques to prove a nonresonance theorem for line arrangements.

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 / 0 minor

Summary. The paper refines the Cohen-Dimca-Orlik method to derive a combinatorial sufficient condition for nonresonance of complex rank-one local systems on hyperplane arrangement complements. It applies this refinement to strengthen a theorem of Bailet, Dimca, and Yoshinaga by removing one of its conditions, and develops restriction and lifting techniques to establish a nonresonance theorem for line arrangements.

Significance. If the combinatorial criterion holds and the restriction/lifting constructions correctly preserve nonresonance without extra hypotheses, the work would supply practical combinatorial tests that simplify verification of nonresonance for arrangement complements, with particular utility for line arrangements. The strengthening of the Bailet-Dimca-Yoshinaga result is a direct improvement.

major comments (1)
  1. [restriction and lifting techniques] The restriction and lifting constructions (detailed after the combinatorial criterion) are load-bearing for the line-arrangement theorem. It is not evident that these operations are functorial enough to transfer the combinatorial sufficient condition while correctly transforming the local system data, without missing resonance loci or introducing unstated hypotheses. Explicit compatibility statements or a worked example verifying that nonresonance on the restricted/lifted arrangement implies the original case would be required to support the claim.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the careful reading of the manuscript and for identifying the need to make the functoriality of the restriction and lifting constructions more explicit. We address the major comment below and will revise the manuscript accordingly.

read point-by-point responses
  1. Referee: [restriction and lifting techniques] The restriction and lifting constructions (detailed after the combinatorial criterion) are load-bearing for the line-arrangement theorem. It is not evident that these operations are functorial enough to transfer the combinatorial sufficient condition while correctly transforming the local system data, without missing resonance loci or introducing unstated hypotheses. Explicit compatibility statements or a worked example verifying that nonresonance on the restricted/lifted arrangement implies the original case would be required to support the claim.

    Authors: We appreciate the referee's observation that the restriction and lifting steps require clearer justification to confirm they preserve the combinatorial nonresonance criterion without gaps. In the manuscript, the restriction to a generic line is defined by intersecting the arrangement with a generic hyperplane, which induces a map on the Orlik-Solomon algebra and on the weights of the rank-one local system; the lifting is the inverse operation that extends the local system while preserving the intersection lattice data used in the sufficient condition. Because the combinatorial criterion depends only on the matroid and the linear dependence relations among the weights, these operations map resonant data to resonant data and nonresonant data to nonresonant data. To make this fully transparent, we will insert an explicit compatibility proposition immediately after the definition of the constructions, stating that if the restricted (respectively lifted) arrangement and local system satisfy the combinatorial nonresonance condition, then so does the original (respectively restricted) pair. We will also add a short worked example with a concrete arrangement of four lines in the plane, explicitly computing the restricted local system, verifying the criterion, and confirming that nonresonance lifts back without additional hypotheses or missed resonance loci. revision: yes

Circularity Check

0 steps flagged

No circularity: derivation builds on external cited methods with independent constructions

full rationale

The paper refines the Cohen-Dimca-Orlik method to derive a combinatorial sufficient condition for nonresonance, strengthens the Bailet-Dimca-Yoshinaga theorem by removing a hypothesis, and introduces restriction/lifting techniques for line arrangements. These steps cite prior external results without self-citation chains, do not define the new condition in terms of itself, and do not rename fitted parameters as predictions. The load-bearing claims rest on explicit combinatorial criteria and functorial constructions that are not tautological reductions of the inputs. The derivation chain is self-contained against the cited benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The work rests on standard facts about hyperplane arrangements and local systems from the literature it cites; no new free parameters, invented entities, or ad-hoc axioms are visible in the abstract.

axioms (2)
  • standard math Hyperplane arrangements are finite collections of hyperplanes in complex affine or projective space whose complements carry natural stratifications.
    Invoked implicitly when discussing complements and local systems.
  • domain assumption Rank-one local systems on arrangement complements are determined by characters of the fundamental group.
    Standard setup for the nonresonance question in the cited literature.

pith-pipeline@v0.9.0 · 5353 in / 1317 out tokens · 62485 ms · 2026-05-11T00:52:33.044812+00:00 · methodology

discussion (0)

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

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

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

  1. [1]

    Artal, J

    E. Artal, J. Carmona, J. I. Cogolludo, and M. Marco. Topology and combinatorics of real line arrangements.Compos. Math., 141(6):1578–1588, 2005

  2. [2]

    P.Bailet, A.Dimca, andM.Yoshinaga.Avanishingresultforthefirsttwistedcohomologyofaffinevarietiesandapplications to line arrangements.Manuscripta Math., 157(3-4):497–511, 2018

  3. [3]

    D. C. Cohen, A. Dimca, and P. Orlik. Nonresonance conditions for arrangements.Ann. Inst. Fourier (Grenoble), 53(6):1883–1896, 2003

  4. [4]

    D. C. Cohen and A. I. Suciu. On Milnor fibrations of arrangements.J. London Math. Soc. (2), 51(1):105–119, 1995

  5. [5]

    De Concini and C

    C. De Concini and C. Procesi. Hyperplane arrangements and holonomy equations.Selecta Mathematica, 1(3):495–535, 1995

  6. [6]

    De Concini and C

    C. De Concini and C. Procesi. Wonderful models of subspace arrangements.Selecta Mathematica, 1(3):459–494, 1995

  7. [7]

    P. Deligne. Equations différentielles à points singuliers réguliers.Lecture Notes in Math, 163, 1970

  8. [8]

    Esnault, V

    H. Esnault, V. Schechtman, and E. Viehweg. Cohomology of local systems on the complement of hyperplanes.Inventiones mathematicae, 109(1):557–561, 1992

  9. [9]

    Esnault and E

    H. Esnault and E. Viehweg.Lectures on vanishing theorems, volume 20. Springer, 1992. 21

  10. [10]

    Hotta and T

    R. Hotta and T. Tanisaki.D-modules, perverse sheaves, and representation theory, volume 236. Springer Science & Business Media, 2007

  11. [11]

    T. Kohno. Homology of a local system on the complement of hyperplanes.Proc. Japan Acad. Ser. A Math. Sci., 62(4):144– 147, 1986

  12. [12]

    Orlik and L

    P. Orlik and L. Solomon. Combinatorics and topology of complements of hyperplanes.Invent. Math., 56(2):167–189, 1980

  13. [13]

    Papadima and A

    S. Papadima and A. I. Suciu. The Milnor fibration of a hyperplane arrangement: from modular resonance to algebraic monodromy.Proc. Lond. Math. Soc. (3), 114(6):961–1004, 2017

  14. [14]

    Rybnikov

    G.L. Rybnikov. On the fundamental group of the complement of a complex hyperplane arrangement.Functional Analysis and Its Applications, 45(2):137–148, 2011

  15. [15]

    Schechtman, H

    V. Schechtman, H. Terao, and A. Varchenko. Local systems over complements of hyperplanes and the Kac–Kazhdan conditions for singular vectors.Journal of Pure and Applied Algebra, 100(1-3):93–102, 1995

  16. [16]

    Williams

    K. Williams. The homology groups of the Milnor fiber associated to a central arrangement of hyperplanes inC3.Topology Appl., 160(10):1129–1143, 2013

  17. [17]

    Homology of Local Systems on Real Line Arrangement Complements

    B. Xie and C. Yu. Homology of local systems on real line arrangement complements.arXiv preprint arXiv:2512.21531, 2025

  18. [18]

    Xie and C

    B. Xie and C. Yu. The{N/D}-conjecture for nonresonant hyperplane arrangements.arXiv preprint arXiv:2501.05189, 2025

  19. [19]

    Yoshinaga

    M. Yoshinaga. Milnor fibers of real line arrangements.J. Singul., 7:220–237, 2013

  20. [20]

    Yoshinaga

    M. Yoshinaga. Resonant bands and local system cohomology groups for real line arrangements.Vietnam J. Math., 42(3):377–392, 2014. Qiuzhen College, Tsinghua University, China Email address:xbt23@mails.tsinghua.edu.cn 22