A Characterization of Functions on the Integer Lattice That Are L-Extendable through Local Convex Extensions
math.CO, cs.DM
Submitted: 2026-10-28
Updated: 2026-10-28
Comments: 17 pages, 3 figures
License: http://creativecommons.org/licenses/by-nc-nd/4.0/
The gist: L-extendable functions on the integer lattice are functions that admit a 12 UJ-convex relaxation; that is, values can be assigned to the additional half-integral points…
Abstract
L-extendable functions on the integer lattice are functions that admit a 12 UJ-convex relaxation; that is, values can be assigned to the additional half-integral points, while keeping the original values at integer points, so that the resulting function is 12 UJ-convex. Various examples of L-extendable functions and their applications are known. A general characterization of L-extendability for functions on the integer lattice, however, remains open. In this paper, we study the L-extendability of functions on the integer lattice. We first obtain a necessary condition: L-extendable functions are integrally convex. We then consider a special subclass of L-extendable functions, namely, those whose local convex extensions give L-convex relaxations. This subclass has a useful optimization property: the optimal value of the original function coincides with that of the 12 UJ-convex relaxation given by its local convex extension, a property not guaranteed for general 12 UJ-convex relaxations. We characterize this subclass by showing that a function is L-extendable through its local convex extension if and only if it is integrally convex and its restriction to every unit hypercube is D-convex, where D-convexity is a discrete convexity associated with reflected Freudenthal simplicial divisions. This subclass strictly contains the class of D-convex functions. We also give a combinatorial characterization of D-convex subsets of the vertices of a unit hypercube: a set X 0,1 n is D-convex if and only if it is majority-closed and contains a relative opposite pair.
Related papers
- Three-ends Furstenberg estimates and approximate rectangles
- Multicolor Ramsey numbers of ordered matchings
- Exponential random graph models with soft clique constraints
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph
- Ehrhart positivity for paving positroids
- Nonlinear lower-tail large deviations at criticality