Fixed vertex activities and extremal independent-set counts: Exact optimization and quadratic square-free codes
Year: 2026
Type: preprint
Abstract: For fixed positive vertex activities, we maximize the independent-set partition function over labelled graphs with a prescribed number of edges. After ordering the activities, a weighted Kelmans identity reduces the optimization to graphs obtained by deleting a smallest universal vertex or a largest isolated vertex. An interval dynamic program computes the optimum for every edge budget using O(m^4) arithmetic operations on m vertices. Exact equality conditions for each compression and maximizing paths in the dynamic program give a polynomial criterion recognizing every optimal graph. The result determines the complete generalized Hamming weight hierarchy of homogeneous square-free quadratic evaluation codes on Cartesian sets containing zero with two alphabet sizes, and characterizes all optimal monomial subspaces.
Author: Xu, Zihuan
Institution: Capital Normal University
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7233602184
Cites:
Cited by:
Related to:
