Related papers: Partial elimination ideals and secant cones
We solve the truncated K-moment problem when $K\subseteq R^n$ is the closure of a, not necessarily bounded, open set (which includes the important cases $K=R^n$ and $K=R^n_+$). That is, we completely characterize the interior of the convex…
In this paper, we study how simple linear projections of some projective varieties behave when the projection center runs through the ambient space. More precisely, let $X \subset \P^r$ be a projective variety satisfying Green-Lazarsfeld's…
This paper shows that Gr\"obner walks aiming for the elimination of variables from a polynomial ideal can be terminated much earlier than previously known. To this end we provide an improved stopping criterion for a known Gr\"obner walk…
For a nonempty polyhedral set $P\subset \mathbb R^d$, let $\mathcal F(P)$ denote the set of faces of $P$, and let $N(P,F)$ be the normal cone of $P$ at the nonempty face $F\in\mathcal F(P)$. We prove that the function $\sum_{F\in\mathcal…
Let $C$ be a proper convex cone generated by a compact set which supports a measure $\mu$. A construction due to A.Barvinok, E.Veomett and J.B. Lasserre produces, using $\mu$, a sequence $(P_k)_{k\in \mathbb{N}}$ of nested spectrahedral…
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…
The class of problems complete for NP via first-order reductions is known to be characterized by existential second-order sentences of a fixed form. All such sentences are built around the so-called generalized IS-form of the sentence that…
We study the following separation problem: Given a collection of colored objects in the plane, compute a shortest "fence" $F$, i.e., a union of curves of minimum total length, that separates every two objects of different colors. Two…
Linear recurrent sequences are those whose elements are defined as linear combinations of preceding elements, and finding recurrence relations is a fundamental problem in computer algebra. In this paper, we focus on sequences whose elements…
We introduce a novel method for clustering using a semidefinite programming (SDP) relaxation of the Max k-Cut problem. The approach is based on a new methodology for rounding the solution of an SDP relaxation using iterated linear…
We derive a closed-form expression for the projection onto a capped rotated second-order cone -- a convex set that arises in perspective relaxations of nonlinear programs with binary indicator variables. The closed-form solution involves…
Quantum states that remain separable (i.e., not entangled) under any global unitary transformation are known as absolutely separable and form a convex set. Despite extensive efforts, the complete characterization of this set remains largely…
Given an arithmetic surface and a positive hermitian line bundle over it, we bound the successive minima of the lattice of global sections of this line bundle. Our method combines a result of C.Voisin on secant varieties of projective…
We consider an extension of the modal logic of transitive closure K+ with some inifinitary derivations and present a sequent calculus for this extension, which allows non-well-founded proofs. For the given calculus, we obtain the…
This article investigates the splitting problem for finitely generated projective modules $P$ over affine algebras over algebraically closed fields and their polynomial extensions. We then address an open question due to M. Roitman on monic…
The effect of a moving defect particle for the one-dimensional partially asymmetric simple exclusion process on a ring is considered. The current of the ordinary particles, the speed of the defect particle and the density profile of the…
We present effective procedures to calculate regular normal cones and other related objects using quantifier elimination. This method of normal cone calculations is complementary to computing Lagrangians and it works best at points where…
A (multi)set of segments in the plane may form a TSP tour, a matching, a tree, or any multigraph. If two segments cross, then we can reduce the total length with the following flip operation. We remove a pair of crossing segments, and…
We use floor decompositions of tropical curves to prove that any enumerative problem concerning conics passing through projective-linear subspaces in $\RP^n$ is maximal. That is, there exist generic configurations of real linear spaces such…
I shall describe a general model-theoretic task to construct expansions of pseudofinite structures and discuss several examples of particular relevance to computational complexity. Then I will present one specific situation where finding a…