Related papers: Intersection Cuts with Infinite Split Rank
An infinite set is orbit-finite if, up to permutations of the underlying structure of atoms, it has only finitely many elements. We study a generalisation of linear programming where constraints are expressed by an orbit-finite system of…
Many common methods for data analysis rely on linear algebra. We provide new results connecting data analysis error to numerical accuracy, which leads to the first meaningful stopping criterion for two way spectral partitioning. More…
We give a survey of work on the number of vertices of the convex hull of integer points defined by the system of linear inequalities. Also, we present our improvement of some of these.
We study graph parameters whose associated edge-connection matrices have exponentially bounded rank growth. Our main result is an explicit construction of a large class of graph parameters with this property that we call mixed partition…
Let $\mathcal A\subset\mathbb P^{k-1}$ be a rank $k$ arrangement of $n$ hyperplanes, with the property that any $k$ of the defining linear forms are linearly independent (i.e., $\mathcal A$ is called $k-$generic). We show that for any…
In this paper, we study the relations between the numerical structure of the optimal solutions of a convex programming problem defined on the edge set of a simple graph and the stability number (i.e. the maximum size of a subset of pairwise…
The cut polytope ${\rm CUT}(n)$ is the convex hull of the cut vectors in a complete graph with vertex set $\{1,\ldots,n\}$. It is well known in the area of combinatorial optimization and recently has also been studied in a direct relation…
For each integer $k \in [0,9]$, we count the number of plane cubic curves defined over a finite field $\mathbb{F}_q$ that do not share a common component and intersect in exactly $k\ \mathbb{F}_q$-rational points. We set this up as a…
Schemes defined by residual intersections have been extensively studied in the case when they are Cohen-Macaulay, but this is a very restrictive condition. In this paper we make the first study of a class of natural examples far from…
Given a factorable function f, we propose a procedure that constructs a concave underestimator of f that is tight at a given point. These underestimators can be used to generate intersection cuts. A peculiarity of these underestimators is…
Deciding the existence of an $l\times m\times n$ integer threeway table with given line-sums is NP-complete already for fixed $l=3$, but is in P with both $l,m$ fixed. Here we consider {\em huge} tables, where the variable dimension $n$ is…
A. Ya. Zaslavskii's results on the existence of a linear (affine) selection for a linear (affine) or superlinear (convex) map $\Phi : K \to 2^Y$ defined on a convex cone (convex set) $K$ having the interpolation property are extended. We…
Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…
Many classical objects on a surface S can be interpreted as cross-ratio functions on the circle at infinity of the universal covering. This includes closed curves considered up to homotopy, metrics of negative curvature considered up to…
We prove that, for the edge ideal of a cactus graph, the arithmetical rank is bounded above by the sum of the number of cycles and the maximum height of its associated primes. The bound is sharp, but in many cases it can be improved.…
Cutting plane methods are a fundamental approach for solving integer linear programs (ILPs). In each iteration of such methods, additional linear constraints (cuts) are introduced to the constraint set with the aim of excluding the previous…
Given two distinct reduced, irreducible curves of given degrees, contained in projective space but whose union is not contained in a hyperplane, what is the largest number of points of intersection they can have? When the projective space…
In this paper we give a description of separating or disjointness preserving linear bijections on spaces of vector-valued absolutely continuous functions defined on compact subsets of the real line. We obtain that they are continuous and…
We present a finitely convergent cutting-plane algorithm for solving a general mixed-integer convex program given an oracle for solving a general convex program. This method is extended to solve a family of two-stage mixed-integer convex…
We study the complexity of cutting planes and branching schemes from a theoretical point of view. We give some rigorous underpinnings to the empirically observed phenomenon that combining cutting planes and branching into a branch-and-cut…