Ideal Decomposition of Hyperplane Arrangements
Combinatorics
2026-02-03 v2
Abstract
Let be an affine hyperplane arrangement, its intersection poset, and its characteristic polynomial. This paper aims to propose combinatorial structures for the factorization of . To this end, we introduce the notion of an ideal decomposition of and use the M\"{o}bius algebra as a key tool to derive such a factorization. This concept provides a unified and substantial generalization of both the modular elements proposed by Stanley (1971) and the nice partitions proposed by Terao (1992). We also define modular ideals of , which yield a tensor decomposition of the Orlik-Solomon algebra of . We further show that every modular ideal can be realized as the intersection poset of some hyperplane arrangement.
Cite
@article{arxiv.2504.12226,
title = {Ideal Decomposition of Hyperplane Arrangements},
author = {Yanru Chen and Weikang Liang and Suijie Wang and Chengdong Zhao},
journal= {arXiv preprint arXiv:2504.12226},
year = {2026}
}