The conjecture on torsion in first homology of Milnor fiber boundaries

At least 1 year old · documented by

Let A\mathcal{A} be a central hyperplane arrangement in C3\mathbb{C}^{3} with nn hyperplanes, and let ∂F‾\partial \overline{F} be its Milnor fiber boundary. For X∈L2(A)X\in L_{2}(\mathcal{A}), write AX\mathcal{A}_{X} for the subarrangement of hyperplanes containing XX. The projectivized complement is CP2∖⋃H∈AH‾\mathbb{C}P^{2}\setminus\bigcup_{H\in\mathcal{A}}\overline{H}.

Torsion conjecture for Milnor fiber boundaries. (1) If

(∣AX∣−2)(gcd⁡(∣AX∣,n)−1)=0(|\mathcal{A}_{X}|-2)(\gcd(|\mathcal{A}_{X}|,n)-1)=0

for every X∈L2(A)X\in L_{2}(\mathcal{A}), then the torsion subgroup of H1(∂F‾;Z)H_{1}(\partial\overline{F};\mathbb{Z}) is a direct sum of Zn\mathbb{Z}_{n}, with the number of summands equal to

χ(CP2∖⋃H∈AH‾).\chi\left(\mathbb{C}P^{2}\setminus\bigcup_{H\in\mathcal{A}}\overline{H}\right).

In particular, for any arrangement with nn prime, the torsion subgroup is a direct sum of copies of Zn\mathbb{Z}_{n}. (2) If Zm\mathbb{Z}_{m} is contained in the torsion subgroup of H1(∂F‾;Z)H_{1}(\partial\overline{F};\mathbb{Z}), then mm divides nn. (3) H1(∂F‾;Z)H_{1}(\partial\overline{F};\mathbb{Z}) is torsion free if and only if A\mathcal{A} is either a pencil or a near pencil.

The conjecture seeks a combinatorial description of the torsion in the first homology of Milnor fiber boundaries. Its first part gives an explicit formula under a local multiplicity and divisibility condition and includes the prime-nn case; the remaining assertions constrain possible torsion orders and characterize torsion-free examples. The problem is open, and the paper presents a theorem for generic arrangements rather than resolving this conjecture in full.

References

Primary source

Sakumi Sugawara, “First homology groups of the Milnor fiber boundary for generic hyperplane arrangements in C^3”, arXiv:2404.01555 (2025).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.