Related papers: Some New Applications of Toric Geometry

We present a Poisson formula for sparse resultants and a formula for the product of the roots of a family of Laurent polynomials, which are valid for arbitrary families of supports. To obtain these formulae, we show that the sparse…

This work introduces a unified approach to the reduction of Poisson manifolds using their description by graded symplectic manifolds. This yields a generalization of the classical Poisson reduction by distributions (Marsden-Ratiu…

We generalize Sylvester single sums to multisets (sets with repeated elements), and show that these sums compute subresultants of two univariate polyomials as a function of their roots independently of their multiplicity structure. This is…

Let $X$ be a projective variety with a torus action, which for simplicity we assume to have dimension 1. If $X$ is a smooth complex variety, then the geometric invariant theory quotient $X//G$ can be identifed with the symplectic reduction…

The purpose of this note is to give an exposition of some interesting combinatorics and convex geometry concepts that appear in algebraic geometry in relation to counting the number of solutions of a system of polynomial equations in…

In this article, we give a survey of Geometric Invariant Theory for Toric Varieties, and present an application to the Einstein-Weyl Geometry. We compute the image of the Minitwistor space of the Honda metrics as a categorical quotient…

In our recent work \cite{StojnicCSetam09,StojnicUpper10} we considered solving under-determined systems of linear equations with sparse solutions. In a large dimensional and statistical context we proved results related to performance of a…

We present the asymptotically fastest known algorithms for some basic problems on univariate polynomial matrices: rank, nullspace, determinant, generic inverse, reduced form. We show that they essentially can be reduced to two computer…

The generation of curves and surfaces from given data is a well-known problem in Computer-Aided Design that can be approached using subdivision schemes. They are powerful tools that allow obtaining new data from the initial one by means of…

We present a theory for Euclidean dimensionality reduction with subgaussian matrices which unifies several restricted isometry property and Johnson-Lindenstrauss type results obtained earlier for specific data sets. In particular, we…

Finding a common factor of two multivariate polynomials with approximate coefficients is a problem in symbolic-numeric computing. Taking a tropical view on this problem leads to efficient preprocessing techniques, applying polyhedral…

The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…

We consider constrained optimization problems defined in the tropical algebra setting on a linearly ordered, algebraically complete (radicable) idempotent semifield (a semiring with idempotent addition and invertible multiplication). The…

We construct polyhedral families of valuations on the branching algebra of a morphism of reductive groups. This establishes a connection between the combinatorial rules for studying a branching problem and the tropical geometry of the…

We obtain certain algebraic invariants relevant to study codes on subgroups of weighted projective tori inside an $n$-dimensional weighted projective space. As application, we compute all the main parameters of generalized toric codes on…

In this thesis, a new class of algorithms based on Sums of Squares Programming is developed. These allow to reduce a degree-$d$ homogeneous polynomial $T = \sum_{i = 1}^m \langle a_i, X \rangle^d $ to a quadratic form being close to a…

In this chapter, we identify fundamental geometric structures that underlie the problems of sampling, optimisation, inference and adaptive decision-making. Based on this identification, we derive algorithms that exploit these geometric…

Any integral convex polytope $P$ in $\mathbb{R}^N$ provides a $N$-dimensional toric variety $X_P$ and an ample divisor $D_P$ on this variety. This paper gives an explicit construction of the algebraic geometric error-correcting code on…

The present paper deals with the discrete inverse problem of reconstructing binary matrices from their row and column sums under additional constraints on the number and pattern of entries in specified minors. While the classical…

Polynomial reduction, designed first for hypergeometric terms, can be used to automatically prove and generate new hypergeometric identities from old ones. In this paper, we extend the reduction method to holonomic sequences. As…