Related papers: On a generalization of the Chvatal-Gomory closure
We study the general integer programming problem where the number of variables $n$ is a variable part of the input. We consider two natural parameters of the constraint matrix $A$: its numeric measure $a$ and its sparsity measure $d$. We…
A well-known conjecture of McMullen, proved by Billera, Lee and Stanley, describes the face numbers of simple polytopes. The necessary and sufficient condition is that the toric g-vector of the polytope is an M-vector, that is, the vector…
The constraint satisfaction problem (CSP) can be formulated as a homomorphism problem between relational structures: given a structure $\mathcal{A}$, for any structure $\mathcal{X}$, whether there exists a homomorphism from $\mathcal{X}$ to…
In this note, we derive non trivial sharp bounds related to the weighted harmonic-geometric-arithmetic means inequalities, when two out of the three terms are known. As application, we give an explicit bound for the trace of the inverse of…
We consider the nonlinear integer programming problem of minimizing a quadratic function over the integer points in variable dimension satisfying a system of linear inequalities. We show that when the Graver basis of the matrix defining the…
We investigate three competing notions that generalize the notion of a facet of finite-dimensional polyhedra to the infinite-dimensional Gomory-Johnson model. These notions were known to coincide for continuous piecewise linear functions…
We give short, closure-theoretic proofs for uniform bounds on the growth of symbolic powers of ideals in regular rings. The author recently proved these bounds in mixed characteristic using various versions of perfectoid/big Cohen-Macaulay…
In the field of categorical probability, one uses concepts and techniques from category theory, such as monads and monoidal categories, to study the structures of probability and statistics. In this paper, we connect some ideas from…
The codegree ${\rm codeg}(\mathcal{P})$ of a lattice polytope $\mathcal{P}$ is a fundamental invariant in discrete geometry. In the present paper, we investigate the codegree of the stable set polytope $\mathcal{P}_G$ associated with a…
Given any finite set of nonnegative integers, there exists a closed convex set whose facial dimension signature coincides with this set of integers, that is, the dimensions of its nonempty faces comprise exactly this set of integers. In…
The cutting-plane approach to integer programming was initiated more that 40 years ago: Gomory introduced the corner polyhedron as a relaxation of a mixed integer set in tableau form and Balas introduced intersection cuts for the corner…
We give an elementary introduction to some recent polyhedral techniques for understanding and solving systems of multivariate polynomial equations. We provide numerous concrete examples and illustrations, and assume no background in…
An elimination tree of a connected graph $G$ is a rooted tree on the vertices of $G$ obtained by choosing a root $v$ and recursing on the connected components of $G-v$ to obtain the subtrees of $v$. The graph associahedron of $G$ is a…
Using the variational method, it is shown that the set of all strong peak functions in a closed algebra $A$ of $C_b(K)$ is dense if and only if the set of all strong peak points is a norming subset of $A$. As a corollary we can induce the…
We formulate new boundary conditions that prove well defined variational principle and finite response functions for conformal gravity (CG). In the Anti--de Sitter/conformal field theory framework, gravity theory that is considered in the…
Let $X$ be a centered random vector in a finite dimensional real inner product space $\mathcal{E}$. For a subset $C$ of the ambient vector space $V$ of $\mathcal{E}$ and $x,\,y\in V$, write $x\preceq_C y$ if $y-x\in C$. When $C$ is a closed…
We investigate inequalities for partial sums of complex numbers with bounded modulus and zero total sum, a topic referred to as "polygonal confinement". Starting from Steinitz's classical result, we provide detailed constructions yielding…
This paper presents a framework for abstracting uncertain or non-polynomial components of dynamical systems using polynomial constraints. This enables the application of polynomial-based analysis tools, such as sum-of-squares programming,…
This article presents a strongly polynomial-time algorithm for the general linear programming problem. This algorithm is an implicit reduction procedure that works as follows. Primal and dual problems are combined into a special system of…
We develop a spatial branch-and-cut approach for nonconvex Quadratically Constrained Quadratic Programs with bounded complex variables (CQCQP). Linear valid inequalities are added at each node of the search tree to strengthen semidefinite…