Paper of the DayPreprint, not yet peer reviewed
Minimum cores in lattice graphs: zonotope structure and quartic growth
Picture an endless grid where each point is linked to every point within a set distance.
Why it matters On grids, groups where every member has most of its links inside the group must be large, growing with the fourth power of link range.
A core is a group of points in which every member has at least as many links inside the group as outside it, and the question is how small such a group can be. The author shows that every core's outline must include a particular many-sided shape fixed by the grid, and that on a flat grid the smallest core grows with the fourth power of the linking distance. When each point is linked only to its eight surrounding points, the smallest core has exactly 12 points. Finding cores in general networks is also shown to be computationally hard, settling an earlier conjecture.
Mehrdad, arXiv cs.AI, 17 November 2026.
Read the paper: Minimum cores in lattice graphs: zonotope structure and quartic growth





