Related papers: Partial elimination ideals and secant cones

Many combinatorial sequences (for example, the Catalan and Motzkin numbers) may be expressed as the constant term of $P(x)^k Q(x)$, for some Laurent polynomials $P(x)$ and $Q(x)$ in the variable $x$ with integer coefficients. Denoting such…

The pseudo-Frobenius numbers of a numerical semigroup $H$ are deeply connected to the structure of the defining ideal of its semigroup ring $k[H]$. In this paper, we resolve a certain conjecture related to this connection under the…

Let $K$ be a convex body in $\mathbb{R}^n$ (i.e., a compact convex set with nonempty interior). Given a point $p$ in the interior of $K$, a hyperplane $h$ passing through $p$ is called barycentric if $p$ is the barycenter of $K \cap h$. In…

Consider an independent site percolation model on $\Z^d$, with parameter $p \in (0,1)$, where all long range connections in the axes directions are allowed. In this work we show that given any parameter $p$, there exists and integer $K(p)$…

The paper is devoted to a study of the cone $\cop$ of copositive matrices. Based on the known from semi-infinite optimization concept of immobile indices, we define zero and minimal zero vectors of a subset of the cone $\cop$ and use them…

An $N$-dimensional parallelepiped will be called a bar if and only if there are no more than $k$ different numbers among the lengths of its sides (the definition of bar depends on $k$). We prove that a parallelepiped can be dissected into…

Given two arbitrary closed sets in Euclidean space, a simple transversality condition guarantees that the method of alternating projections converges locally, at linear rate, to a point in the intersection. Exact projection onto nonconvex…

We define a new class of pseudo effect algebras, called kite pseudo effect algebras, which is connected not necessarily with partially ordered groups, but rather with generalized pseudo effect algebras where the greatest element is not…

We study Poncelet's Theorem in finite projective coordinate planes over the field $GF(p)$ and concentrate on a particular pencil of conics. For pairs of such conics we investigate whether we can find polygons with $n$ sides, which are…

We prove that in any totally irrational cut-and-project setup with codimension (internal space dimension) one, it is possible to choose sections (windows) in non-trivial ways so that the resulting sets are bounded displacement to lattices.…

Closed formulae for all Gaussian or optimal, 1-parameter quadrature rules in a compact interval [a, b] with non uniform, asymmetric subintervals, arbitrary number of nodes per subinterval for the spline classes $S_{2N, 0}$ and $S_{2N+1,…

Criteria are given in terms of certain Hilbert coefficients for the fiber cone F(I) of an m-primary ideal I in a Cohen-Macaulay local ring (R,m) so that it is Cohen-Macaulay or has depth at least dim(R)-1. A version of Huneke's fundamental…

Let $H$ and $K$ be (finite or infinite dimensional) complex Hilbert spaces. A characterization of positive completely bounded normal linear maps from ${\mathcal B}(H)$ into ${\mathcal B}(K)$ is given, which particularly gives a…

By using a result from the numerical algebraic geometry package Bertini we show that (up to high numerical accuracy) a specific set of degree 6 and degree 9 polynomials cut out the secant variety $\sigma_{4}(\mathbb{P}^{2}\times \mathbb{P}…

Consider a homogeneous multifold convex conic system $$ Ax = 0, \; x\in K_1\times...\times K_r $$ and its alternative system $$ A\transp y \in K_1^*\times...\times K_r^*, $$ where $K_1,..., K_r$ are regular closed convex cones. We show that…

We over-approximate reachability sets in string rewriting by languages defined by admissible factors, called tiles. A sparse set of tiles contains only those that are reachable in derivations, and is constructed by completing an automaton.…

Clustering is one of the most fundamental tools in data science and machine learning, and k-means clustering is one of the most common such methods. There is a variety of approximate algorithms for the k-means problem, but computing the…

Semidefinite programming (SDP) is the task of optimizing a linear function over the common solution set of finitely many linear matrix inequalities (LMIs). For the running time of SDP solvers, the maximal matrix size of these LMIs is…

The intersection cut paradigm is a powerful framework that facilitates the generation of valid linear inequalities, or cutting planes, for a potentially complex set S. The key ingredients in this construction are a simplicial conic…

We study linear series on a general curve of genus $g$, whose images are exceptional with regard to their secant planes. Working in the framework of an extension of Brill-Noether theory to pairs of linear series, we prove that a general…