Related papers: Polyhedral Methods for Space Curves Exploiting Sym…
By viewing the regular $N$-gon as the set of $N$th roots of unity in the complex plane we transform several questions regarding polygon diagonals into when a polynomial vanishes when evaluated at roots of unity. To study these solutions we…
This paper deals with the use of numerical methods based on random root sampling techniques to solve some theoretical problems arising in the analysis of polynomials. These methods are proved to be practical and give solutions where…
The Fr\'{e}chet mean is a fundamental notion of central tendency defined as a minimizer of a sum of squared distances in a general metric space. In this paper, we study Fr\'{e}chet means in tropical geometry -- a piecewise linear,…
The requirement for solving a polynomial is a means of breaking its symmetry, which in the case of the quintic, is that of the symmetric group S_5. Induced by its five-dimensional linear permutation representation is a three-dimensional…
The dynamics of many systems from physics, economics, chemistry, and biology can be modelled through polynomial functions. In this paper, we provide a computational means to find positively invariant sets of polynomial dynamical systems by…
Geometric involutive bases for polynomial systems of equations have their origin in the prolongation and projection methods of the geometers Cartan and Kuranishi for systems of PDE. They are useful for numerical ideal membership testing and…
We show the existence of some infinite families of periodic solutions of the planar Newtonian n-body problem --with positive masses-- which are symmetric with respect to suitable actions of finite groups (under a strong--force assumption,…
Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…
We study first-order methods with preconditioning for solving structured nonlinear convex optimization problems. We propose a new family of preconditioners generated by symmetric polynomials. They provide first-order optimization methods…
Circuits play a fundamental role in polyhedral theory and linear programming. For instance, circuits are used as step directions in various augmentation schemes for solving linear programs or to leave degenerate vertices while running the…
The linear orbit of a degree d hypersurface in $\mathbb{P}^n$ is its orbit under the natural action of PGL(n+1), in the projective space of dimension $N =\binom{n+d}{d} - 1$ parameterizing such hypersurfaces. This action restricted to a…
We illustrate an efficient new method for handling polynomial systems with degenerate solution sets. In particular, a corollary of our techniques is a new algorithm to find an isolated point in every excess component of the zero set (over…
The study of the combinatorial diameter of a polyhedron is a classical topic in linear-programming theory due to its close connection with the possibility of a polynomial simplex-method pivot rule. The 2-sum operation is a classical…
Polyhedral Lyapunov functions can approximate any norm arbitrarily well. Because of this, they are used to study the stability of linear time varying and linear parameter varying systems without being conservative. However, the…
Using the Newton polytope and polyhedron, we study analytic spread and ideal reductions of monomial ideals. We determine a bound for analytic spread based on halfspaces and hyperplanes of the Newton polytope, and we classify basic monomial…
We develop a computational framework that leverages the features of sophisticated software tools and numerics to tackle some of the pressing issues in the realm of earth sciences. The algorithms to handle the physics of multiphase flow,…
In this paper we provide, first, a general symbolic algorithm for computing the symmetries of a given rational surface, based on the classical differential invariants of surfaces, i.e. Gauss curvature and mean curvature. In practice, the…
We present a comprehensive analysis of an algorithm for evaluating high-dimensional polynomials that are invariant under permutations and rotations. The key bottleneck is the contraction of a high-dimensional symmetric and sparse tensor…
A product of cochains in a polyhedral complex is constructed. The multiplication algorithm depends on the choice of a parameter. The parameter is a linear functional on the ambient space. Cocycles form a subring of the ring of cochains,…
We describe a provably complete algorithm for the generation of a tight, possibly exact superset of all combinatorially distinct simple n-facet polytopes in R^d, along with their graphs, f-vectors, and face lattices. The technique applies…