Related papers: Intersection Cuts with Infinite Split Rank

We prove that the number of real intersection points of a real line with a real plane curve defined by a polynomial with at most t monomials is either infinite or does not exceed 6t -7. This improves a result by M. Avendano. Furthermore, we…

We prove tight upper bounds for the number of vertices of a simple polygon that is the union or the intersection of two simple polygons with given numbers of convex and concave vertices. The similar question on graphs of the lower (or…

In a recent work of Duke, Imamo\={g}lu, and T\'{o}th, the linking number of certain links on the space $\text{SL}(2,\mathbb{Z})\backslash\text{SL}(2,\mathbb{R})$ is investigated. This linking number has an alternative interpretation as the…

Let $X$ be an absolutely irreducible hypersurface of degree $d$ in $\mathbb{A}^n$, defined over a finite field $\mathbb{F}_q$. The Lang-Weil bound gives an interval that contains $#X(\mathbb{F}_q)$. We exhibit explicit intervals, which do…

We answer a question due to A. Myasnikov by proving that all expected ranks occur as the ranks of intersections of finitely generated subgroups of free groups.

Let $I\subset \mathbb C[x,y,z]$ be an ideal of height 2 and minimally generated by three homogeneous polynomials of the same degree. If $I$ is a locally complete intersection we give a criterion for $\mathbb C[x,y,z]/I$ to be arithmetically…

The main outcomes of the paper are divided into two parts. First, we present a new dual for quadratic programs, in which, the dual variables are affine functions, and we prove strong duality. Since the new dual is intractable, we consider a…

We investigate the semigroup of integer points inside a convex cone. We extend classical results in integer linear programming to integer conic programming. We show that the semigroup associated with nonpolyhedral cones can sometimes have a…

The intersection cut framework was introduced by Balas in 1971 as a method for generating cutting planes in integer optimization. In this framework, one uses a full-dimensional convex $S$-free set, where $S$ is the feasible region of the…

In this paper we analyze a continuous version of the maximal covering location problem, in which the facilities are required to be interconnected by means of a graph structure in which two facilities are allowed to be linked if a given…

We show that the problem of counting perfect matchings remains #P-complete even if we restrict the input to very dense graphs, proving the conjecture in [5]. Here "dense graphs" refer to bipartite graphs of bipartite independence number…

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…

There are many physical processes that have inherent discontinuities in their mathematical formulations. This paper is motivated by the specific case of collisions between two rigid or deformable bodies and the intrinsic nature of that…

We prove here the following results: \begin{th} Let $E$ a rank 2 vector bundle over ${\bf P}_3$, if $C$ is a reduced irreducible curve of ${\bf P}_3^{\vee}$ such that $E_H$ is unstable for all $H\in C$ then $C$ is a line. \end{th} We define…

We study linear regressions in a context where the outcome of interest and some of the covariates are observed in two different datasets that cannot be matched. Traditional approaches obtain point identification by relying, often…

We show that the number of conjugacy classes of intersections $A\cap B^g$, for fixed finitely generated subgroups $A, B<F$ of a free group, is bounded above in terms of the ranks of $A$ and $B$; this confirms an intuition of Walter Neumann.…

An edge cut C of a graph G is tight if |C \M| = 1 for every perfect matching M of G. Barrier-cuts and 2-separation cuts, also referred to as ELP-cuts, are two important types of tight cuts in matching covered graphs. Edmonds, Lovasz and…

We study the arithmetical ranks and the cohomological dimensions of an infinite class of Cohen-Macaulay varieties of minimal degree. Among these we find, on the one hand, infinitely many set-theoretic complete intersections, on the other…

We prove that on a restricted contact type hypersurface the number of leaf-wise intersections is bounded from below by a certain cup-length.

We derive sharp upper and lower bounds on the number of intersection points and closed regions that can occur in sets of line segments with certain structure, in terms of the number of segments. We consider sets of segments whose underlying…