Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2407.02201

Dual Bounded Generation: Polynomial, Second-order Cone and Positive Semidefinite Matrix Inequalities

Khaled Elbassioni
View original source ↗Read source document ↗Export metadata ↓

Abstract

In the monotone integer dualization problem, we are given two sets of vectors in an integer box such that no vector in the first set is dominated by a vector in the second. The question is to check if the two sets of vectors cover the entire integer box by upward and downward domination, respectively. It is known that the problem is (quasi-)polynomially equivalent to that of enumerating all maximal feasible solutions of a given monotone system of linear/separable/supermodular inequalities over integer vectors. The equivalence is established via showing that the dual family of minimal infeasible vectors has size bounded by a (quasi-)polynomial in the sizes of the family to be generated and the input description. Continuing in this line of work, in this paper, we consider systems of polynomial, second-order cone, and semidefinite inequalities. We give sufficient conditions under which such bounds can be established and highlight some applications.

Explore related subjects

cs.DM

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Khaled Elbassioni. 2024-08-13. Dual Bounded Generation: Polynomial, Second-order Cone and Positive Semidefinite Matrix Inequalities. https://arxiv.org/abs/2407.02201

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Pimp my fixpoint: sofic realization of multidimensional substitution-based shift spaces

In symbolic dynamics, the fixed-point construction from arXiv:0910.2415 defines shift spaces of finite type whose configurations embed infinite hierarchies of tilings. This article provides a "black box" abstraction of this method phrased in terms of substitutions and $S$-adic limit spaces operating over sequences of increasingly large alphabets. By quantifying the amount of information computed by the substitutions at each level, and using a suitable parallel model of computation, we provide a simple positive criterion of multidimensional soficity that generalizes classical examples from the literature.

cs.DM↗
arXiv2026

Flip Dynamics for Sampling Colorings: Improving $(11/6-ε)$ Using a Simple Metric

We present improved bounds for randomly sampling $k$-colorings of graphs with maximum degree $Δ$; our results hold without any further structural assumptions on the graph. The Glauber dynamics is a simple single-site update Markov chain. Jerrum (1995) proved an optimal $O(n\log{n})$ mixing-time bound for Glauber dynamics whenever $k>2Δ$ where $Δ$ is the maximum degree of the input graph. This bound was improved by Vigoda (1999) to $k>(11/6)Δ$ using a "flip" dynamics which recolors (small) maximal two-colored components in each step. Vigoda's result was the best known for general graphs for 20 years until Chen et al. (2019) established optimal mixing of the flip dynamics for $k>(11/6-\varepsilon)Δ$ where $\varepsilon\approx 10^{-5}$. We present the first substantial improvement over these results. We prove an optimal mixing-time bound of $O(n\log{n})$ for the flip dynamics when $Δ\geq125$ and $k\geq1.809Δ$. This yields, through recent spectral independence results, an optimal $O(n\log{n})$ mixing time for the Glauber dynamics for every fixed $Δ\geq125$ in the same range of $k/Δ$. Our proof utilizes path coupling with a simple weighted Hamming distance for "unblocked" neighbors.

cs.DM↗