A penalised Saito functional for heuristic search of free line arrangements
arXiv:2604.02995
Abstract
We introduce the penalised Saito functional for a reduced arrangement of lines and a prescribed pair . It measures the alignment of a candidate Saito determinant with the defining polynomial while penalising the failure of the candidate derivations to be logarithmic. We prove that the functional takes values in , vanishes exactly when is free with exponents , and lies strictly between and otherwise. For fixed , it is upper semicontinuous on the reduced configuration space, continuous at arrangements free with the prescribed pair, and converges as to the corresponding binary freeness test. We use a numerical approximation of this functional, together with a small -shell term, to guide fixed-cardinality line-replacement searches over and selected quadratic extensions. Numerical values are used only to select candidates; every reported arrangement is certified in exact arithmetic using Saito's criterion. At the current snapshot, the certified database contains representatives with distinct Weisfeiler--Leman fingerprints and cardinalities up to . Among them, have multiplicity gap , including lower-bound-extremal examples with . These non-supersolvable arrangements provide test cases for studying realisation spaces and the persistence of freeness among realisations of the same intersection lattice, in connection with Terao's conjecture.
Substantially revised, with a new title. The former angular functional is replaced by a penalised Saito functional, with new proofs of its zero locus and semicontinuity. Section 3 and the search framework are rewritten. Results now include 6,146 exactly certified arrangements of up to 28 lines, including examples with multiplicity gap