English
Related papers

Related papers: Toric Eigenvalue Methods for Solving Sparse Polyno…

200 papers

We compute the Cox ring of an embedded variety $X \subseteq Z$ within a Mori dream space, under the assumption that the pullback map induces an isomorphism at the level of divisor class groups. We show that the Cox ring of $X$ is the…

Algebraic Geometry · Mathematics 2026-05-22 Cristóbal Herrera , Antonio Laface , Luca Ugaglia

Renormalized homotopy continuation on toric varieties is introduced as a tool for solving sparse systems of polynomial equations, or sparse systems of exponential sums. The cost of continuation depends on a renormalized condition length,…

Numerical Analysis · Mathematics 2025-06-23 Gregorio Malajovich

A zero-dimensional polynomial ideal may have a lot of complex zeros. But sometimes, only some of them are needed. In this paper, for a zero-dimensional ideal $I$, we study its complex zeros that locate in another variety $\textbf{V}(J)$…

Symbolic Computation · Computer Science 2014-08-19 Ye Liang

To compute solutions of sparse polynomial systems efficiently we have to exploit the structure of their Newton polytopes. While the application of polyhedral methods naturally excludes solutions with zero components, an irreducible…

Symbolic Computation · Computer Science 2013-10-16 Danko Adrovic , Jan Verschelde

Given any polynomial system with fixed monomial term structure, we give explicit formulae for the generic number of roots with specified coordinate vanishing restrictions. For the case of affine space minus an arbitrary union of coordinate…

Algebraic Geometry · Mathematics 2016-09-06 J. Maurice Rojas

We introduce a ``geometric'' method to bound periods of automorphic forms. The key features of this method are the use of equidistribution results in place of mean value theorems, and the systematic use of mixing and the spectral gap.…

Number Theory · Mathematics 2007-05-23 Akshay Venkatesh

This work studies the problem of maximizing a higher degree real homogeneous multivariate polynomial over the unit sphere. This problem is equivalent to finding the leading eigenvalue of the associated symmetric tensor of higher order,…

Optimization and Control · Mathematics 2019-10-02 Yuning Yang , Guoyin Li

We study the local cohomology modules H^i_B(R) for a reduced monomial ideal B in a polynomial ring R=k[X_1,...,X_n]. We consider a grading on R which is coarser than the Z^n-grading such that each component of H^i_B(R) is finite dimensional…

Algebraic Geometry · Mathematics 2007-05-23 David Eisenbud , Mircea Mustata , Mike Stillman

A fast and weakly stable method for computing the zeros of a particular class of hypergeometric polynomials is presented. The studied hypergeometric polynomials satisfy a higher order differential equation and generalize Laguerre…

Numerical Analysis · Mathematics 2025-03-27 Nicola Mastronardi , Marc Van Barel , Raf Vandebril , Paul Van Dooren

We introduce a new method for sparse principal component analysis, based on the aggregation of eigenvector information from carefully-selected axis-aligned random projections of the sample covariance matrix. Unlike most alternative…

Methodology · Statistics 2019-05-07 Milana Gataric , Tengyao Wang , Richard J. Samworth

We study bihomogeneous systems defining, non-zero dimensional, biprojective varieties for which the projection onto the first group of variables results in a finite set of points. To compute (with) the 0-dimensional projection and the…

Commutative Algebra · Mathematics 2025-07-25 Matías Bender , Laurent Busé , Carles Checa , Elias Tsigaridas

To investigate solutions of (near-)optimal control problems, we extend and exploit a notion of homogeneity recently proposed in the literature for discrete-time systems. Assuming the plant dynamics is homogeneous, we first derive a scaling…

Optimization and Control · Mathematics 2021-09-24 Mathieu Granzotto , Romain Postoyan , Lucian Buşoniu , Dragan Nešić , Jamal Daafouz

In this paper, the concepts of Pareto $H$-eigenvalue and Pareto $Z$-eigenvalue are introduced for studying constrained minimization problem and the necessary and sufficient conditions of such eigenvalues are given. It is proved that a…

Optimization and Control · Mathematics 2022-02-09 Yisheng Song , Liqun Qi

Let $R=k[x,y,z]$ be a standard graded $3$-variable polynomial ring, where $k$ denotes any field. We study grade $3$ homogeneous ideals $I \subseteq R$ defining compressed rings with socle $k(-s)^{\ell} \oplus k(-2s+1)$, where $s \geq3$ and…

Commutative Algebra · Mathematics 2021-05-28 Keller VandeBogert

Let $X_{\Sigma}$ be a smooth complete toric variety defined by a fan $\Sigma$ and let $V=V(I)$ be a subscheme of $X_{\Sigma}$ defined by an ideal $I$ homogeneous with respect to the grading on the total coordinate ring of $X_{\Sigma}$. We…

Algebraic Geometry · Mathematics 2017-11-15 Martin Helmer

Given a symbolic power of a homogeneous ideal in a polynomial ring, we study the problem of determining which powers of the ideal contain it. For ideals defining 0-dimensional subschemes of projective space, as an immediate corollary of our…

Algebraic Geometry · Mathematics 2009-06-25 Cristiano Bocci , Brian Harbourne

Let $R=k[x,y,z]$ be a standard graded $3$-variable polynomial ring, where $k$ denotes any field. We study grade $3$ homogeneous ideals $I \subseteq R$ defining compressed rings with socle $k(-s) \oplus k(-2s+1)$, where $s \geq3$ is some…

Commutative Algebra · Mathematics 2020-02-21 Keller VandeBogert

Let $X$ be a complete simplicial toric variety over a finite field $\mathbb{F}_q$ with homogeneous coordinate ring $S=\mathbb{F}_q[x_1,\dots,x_r]$ and split torus $T_X\cong (\mathbb{F}^*_q)^n$. We prove that vanishing ideal of a subset $Y$…

Algebraic Geometry · Mathematics 2018-10-03 Mesut Şahin

The computation of the sparse principal component of a matrix is equivalent to the identification of its principal submatrix with the largest maximum eigenvalue. Finding this optimal submatrix is what renders the problem…

Information Theory · Computer Science 2013-12-23 Megasthenis Asteris , Dimitris S. Papailiopoulos , George N. Karystinos

We complete the complexity classification by degree of minimizing a polynomial over the integer points in a polyhedron in $\mathbb{R}^2$. Previous work shows that optimizing a quadratic polynomial over the integer points in a polyhedral…

Optimization and Control · Mathematics 2015-05-07 Alberto Del Pia , Robert Hildebrand , Robert Weismantel , Kevin Zemmer