Related papers: The height of the mixed sparse resultant

This paper gives the recursion formula for mixed multiplicities of maximal degrees with respect to joint reductions of ideals, which is one of important results in the mixed multiplicity theory. Using this result, we give consequences on…

This paper proposes tight semidefinite relaxations for polynomial optimization. The optimality conditions are investigated. We show that generally Lagrange multipliers can be expressed as polynomial functions in decision variables over the…

A robust and sparse estimator for multinomial regression is proposed for high dimensional data. Robustness of the estimator is achieved by trimming the observations, and sparsity of the estimator is obtained by the elastic net penalty,…

We demonstrate the possibility of achieving the maximum possible singlet fraction using a entangled mixed two-qubit state as a resource. For this, we establish a tight upper bound on singlet fraction and show that the maximal singlet…

The mixed discriminant of n Laurent polynomials in n variables is the irreducible polynomial in the coefficients which vanishes whenever two of the roots coincide. The Cayley trick expresses the mixed discriminant as an A-discriminant. We…

In this paper, we recast a special case of Mahler'c conjecture by the maximum value of box splines. This is the case of polytopes with at most $2n+2$ facets. An asymptotic formula for univariate box splines is given. Based on the formula,…

We obtain a series of lower bounds for the product set of combinatorial cubes, as well as some non--trivial upper estimates for the multiplicative energy of such sets.

A planar point set is in convex position precisely when it has a convex polygonization, that is, a polygonization with maximum interior angle measure at most \pi. We can thus talk about the convexity of a set of points in terms of the…

In this note we give exact formulas (and asymptotics) for the number of rational points of bounded height on weighted projective stacks over global function fields.

We present randomized algorithms to compute the sumset (Minkowski sum) of two integer sets, and to multiply two univariate integer polynomials given by sparse representations. Our algorithm for sumset has cost softly linear in the combined…

We obtain an upper bound for the multiplicative energy of the spectrum of an arbitrary set from $\mathbb{F}_p$, which is the best possible up to the results on exponential sums over subgroups.

We obtain effective bounds on the heights of algebraic integers whose orbits contain multiplicatively dependent values modulo S-integers. Our method is based on a new upper bound on the so-called S-height of polynomial values over the ring…

We present a new algorithm for computing the volume of an arbitrary matroid base polytope. We provide two applications of this approach: a relation between the volume of the base polytope of a matroid $\M$ and its relaxation $\M'$, and a…

We generalize an inequality for mixed Monge-Amp\`ere measures. We also give an example that shows that our assumptions are sharp. The corresponding result in the setting of compact K\"ahler manifold is also discussed.

The entanglement of superpositions [Phys. Rev. Lett. 97, 100502 (2006)] is generalized to the multipartite scenario: an upper bound to the multipartite entanglement of a superposition is given in terms of the entanglement of the superposed…

We study probability density functions that are log-concave. Despite the space of all such densities being infinite-dimensional, the maximum likelihood estimate is the exponential of a piecewise linear function determined by finitely many…

Sparse (or toric) elimination exploits the structure of polynomials by measuring their complexity in terms of Newton polytopes instead of total degree. The sparse, or Newton, resultant generalizes the classical homogeneous resultant and its…

We prove an O(log n) bound for the expected value of the logarithm of the componentwise (and, a fortiori, the mixed) condition number of a random sparse n x n matrix. As a consequence, small bounds on the average loss of accuracy for…

We study the Manhattan and Lorentz Mirror models on an infinite cylinder of finite even width $n$, with the mirror probability $p$ satisfying $p<Cn^{-1}$, $C$ a constant. We use the Brauer and Walled Brauer algebras to show that the maximum…

Let $X$ be a quasi-projective variety over a number field, admitting (after passage to $\mathbb{C}$) a geometric variation of Hodge structure whose period mapping has zero-dimensional fibers. Then the integral points of $X$ are sparse: the…