Related papers: On a generalization of the Chvatal-Gomory closure

We show that one can enumerate the vertices of the convex hull of integer points in polytopes whose constraint matrices have bounded and nonzero subdeterminants, in time polynomial in the dimension and encoding size of the polytope. This…

Over finite fields, if the image of a polynomial map is not the entire field, then its cardinality can be bounded above by a significantly smaller value. Earlier results bound the cardinality of the value set using the degree of the…

We consider polynomials that are orthogonal over an analytic Jordan curve L with respect to a positive analytic weight, and show that each such polynomial of sufficiently large degree can be expanded in a series of certain integral…

Let $n$ be a positive integer. We show that a unit rational space vector whose multiple by $n$ is an integer vector can be extended to a rational orthonormal basis whose all members have the same property.

Any integral convex polytope $P$ in $\mathbb{R}^N$ provides a $N$-dimensional toric variety $X_P$ and an ample divisor $D_P$ on this variety. This paper gives an explicit construction of the algebraic geometric error-correcting code on…

The $\{0,\frac{1}{2}\}$-closure of a rational polyhedron $\{ x \colon Ax \le b \}$ is obtained by adding all Gomory-Chv\'atal cuts that can be derived from the linear system $Ax \le b$ using multipliers in $\{0,\frac{1}{2}\}$. We show that…

We study relaxations for linear programs with complementarity constraints, especially instances whose complementary pairs of variables are not independent. Our formulation is based on identifying vertex covers of the conflict graph of the…

From the paper of the first author it follows that upper and lower bounds for $\gamma$-vector of a simple polytope imply the bounds for its $g$-,$h$- and $f$-vectors. In the paper of the second author it was obtained unimprovable upper and…

Quantum theory imposes a strict limit on the strength of non-local correlations. It only allows for a violation of the CHSH inequality up to the value 2 sqrt(2), known as Tsirelson's bound. In this note, we consider generalized CHSH…

Faltings' theorem states that curves of genus $g \geq 2$ have finitely many rational points. Using the ideas of Faltings, Mumford, Parshin and Raynaud, one obtains an upper bound on the number of rational points, but this bound is too large…

This article generalizes the geometric quadratic Chabauty method, initiated over $\mathbb{Q}$ by Edixhoven and Lido, to curves defined over arbitrary number fields. The main result is a conditional bound on the number of rational points on…

In statistical physics, the multivariate hard-core model describes a system of particles, each of which receives its own fugacity. In graph-theoretic language, the partition function of the model translates to the multivariate independence…

We study the computational complexity of exact minimisation of rational-valued discrete functions. Let $\Gamma$ be a set of rational-valued functions on a fixed finite domain; such a set is called a finite-valued constraint language. The…

We introduce $\mathcal{V}$-polyhedral disjunctive cuts (VPCs) for generating valid inequalities from general disjunctions. Cuts are critical to integer programming solvers, but the benefit from many families is only realized when the cuts…

For a set $X$ of integer points in a polyhedron, the smallest number of facets of any polyhedron whose set of integer points coincides with $X$ is called the relaxation complexity $\mathrm{rc}(X)$. This parameter was introduced by Kaibel &…

In this paper, we investigate the polyhedral structure of two submodular sets with generalized upper bound (GUB) constraints, which arise as important substructures in various real-world applications. We derive a class of strong valid…

This article primarily aims to unify the various formalisms of multivariate coefficients of variation, leveraging advanced concepts of generalized means, whether weighted or not, applied to the eigenvalues of covariance matrices. We…

General error locator polynomials are polynomials able to decode any correctable syndrome for a given linear code. Such polynomials are known to exist for all cyclic codes and for a large class of linear codes. We provide some decoding…

If we fix the angles at the vertices of a convex planar $n$-gon, the lengths of its edges must satisfy two linear constraints in order for it to close up. If we also require unit perimeter, our vectors of $n$ edge lengths form a convex…

Let $P$ be a rational polyhedron in $\mathbb{R}^d$ and let $\mathcal{L}$ be a class of $d$-dimensional maximal lattice-free rational polyhedra in $\mathbb{R}^d$. For $L \in \mathcal{L}$ by $R_L(P)$ we denote the convex hull of points…