Search arXivSearch

arXiv · 2604.03718

Magnitude homology of real hyperplane arrangements

Abstract

We define and study the magnitude and magnitude homology of a real hyperplane arrangement by regarding its tope graph as a metric space. We prove several structural results for the magnitude of arrangements, including a symmetry formula, palindromicity of the numerator and denominator, a face decomposition formula, and results on the sign pattern of the magnitude power series. For the magnitude homology of arrangements, we obtain combinatorial formulas for small lengths and show that it detects Boolean arrangements. We also lift the face decomposition formula to a homological decomposition and derive explicit formulas for the diagonal magnitude Betti numbers. Another notable feature is that the magnitude Euler characteristic satisfies a reciprocity theorem analogous to Ehrhart--Macdonald reciprocity. We conclude by presenting several conjectures. In particular, we conjecture that the magnitude homology of an arrangement is torsion-free and is determined by the intersection lattice.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Junnosuke Koizumi, Ye Liu. 2026-05-12. Magnitude homology of real hyperplane arrangements. https://arxiv.org/abs/2604.03718

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO