English
Related papers

Related papers: Extremal Real Algebraic Geometry and A-Discriminan…

200 papers

We construct algebraic surfaces with a large number of type A singularities. Bivariate polynomials presented in previous works for the construction of nodal surfaces and certain families of Belyi polynomials are used. In some cases explicit…

Algebraic Geometry · Mathematics 2025-10-17 Juan García Escudero

We obtain new bounds of exponential sums modulo a prime $p$ with sparse polynomials $a_0x^{n_0} + \cdots + a_{\nu}x^{n_\nu}$. The bounds depend on various greatest common divisors of exponents $n_0, \ldots, n_\nu$ and their differences. In…

Number Theory · Mathematics 2020-07-30 Igor E. Shparlinski , Qiang Wang

This paper deals with properties of the algebraic variety defined as the set of zeros of a "typical" sequence of polynomials. We consider various types of "nice" varieties: set-theoretic and ideal-theoretic complete intersections,…

Number Theory · Mathematics 2015-12-18 Joachim von zur Gathen , Guillermo Matera

The interaction of a Lie algebra $\LL,$ having a weight space decomposition with respect to a nonzero toral subalgebra, with its corresponding root system forms a powerful tool in the study of the structure of $\LL.$ This, in particular,…

Quantum Algebra · Mathematics 2018-07-13 Malihe Yousofzadeh

This paper reexamines univariate reduction from a toric geometric point of view. We begin by constructing a binomial variant of the $u$-resultant and then retailor the generalized characteristic polynomial to fully exploit sparsity in the…

Algebraic Geometry · Mathematics 2009-09-25 J. Maurice Rojas

In this paper we derive aggregate separation bounds, named after Davenport-Mahler-Mignotte (\dmm), on the isolated roots of polynomial systems, specifically on the minimum distance between any two such roots. The bounds exploit the…

Symbolic Computation · Computer Science 2010-07-26 Ioannis Z. Emiris , Bernard Mourrain , Elias Tsigaridas

Let $R$ be a real closed field. We consider basic semi-algebraic sets defined by $n$-variate equations/inequalities of $s$ symmetric polynomials and an equivariant family of polynomials, all of them of degree bounded by $2d < n$. Such a…

Symbolic Computation · Computer Science 2018-06-22 Cordian Riener , Mohab Safey El Din

Given an ideal of forms in an algebra (polynomial ring, tensor algebra, exterior algebra, Lie algebra, bigraded polynomial ring), we consider the Hilbert series of the factor ring. We concentrate on the minimal Hilbert series, which is…

Commutative Algebra · Mathematics 2018-11-19 Ralf Fröberg , Samuel Lundqvist

We state a kind of Euclidian division theorem: given a polynomial P(x) and a divisor d of the degree of P, there exist polynomials h(x),Q(x),R(x) such that P(x) = h(Q(x)) +R(x), with deg h=d. Under some conditions h,Q,R are unique, and Q is…

Algebraic Geometry · Mathematics 2009-10-12 Arnaud Bodin

In many high-dimensional problems,polynomial-time algorithms fall short of achieving the statistical limits attainable without computational constraints. A powerful approach to probe the limits of polynomial-time algorithms is to study the…

Statistics Theory · Mathematics 2025-07-11 Bertrand Even , Christophe Giraud , Nicolas Verzelen

Let A be a polynomial algebra with complex coefficients. Let B be a finite extension ring of A which is also a polynomial algebra. We describe the factorisation of the Jacobian J of the extension into irreducibles. We also introduce the…

Group Theory · Mathematics 2010-12-24 Vivien Ripoll

We present a new probabilistic algorithm that characterizes the equidimensional components of the affine algebraic variety defined by an arbitrary sparse polynomial system with prescribed supports. For each equidimensional component, the…

Algebraic Geometry · Mathematics 2026-01-19 Maria Isabel Herrero , Gabriela Jeronimo , Juan Sabia

To directed graphs with unique sink and source we associate a noncommutative associative alsgebra and a polynomial over this algebra. Edges of the graph correspond to pseudo-roots of the polynomial. We give a sufficient condition when…

Quantum Algebra · Mathematics 2009-11-11 Israel Gelfand , Sergei Gelfand , Vladimir Retakh , Robert Lee Wilson

To every Gorenstein algebra $A$ of finite vector space dimension greater than 1 over a field $\FF$ of characteristic zero, and a linear projection $\pi$ on its maximal ideal ${\mathfrak m}$ with range equal to the annihilator…

Commutative Algebra · Mathematics 2012-12-07 A. V. Isaev

We present a framework to define a large class of neural networks for which, by construction, training by gradient flow provably reaches arbitrarily low loss when the number of parameters grows. Distinct from the fixed-space global…

Optimization and Control · Mathematics 2025-01-13 David A. R. Robin , Kevin Scaman , Marc Lelarge

The real type of a finite family of univariate polynomials characterizes the combined sign behavior of the polynomials over the real line. We derive an explicit formula for the number of real types subject to given degree bounds. For the…

Symbolic Computation · Computer Science 2025-02-10 Nicolas Faroß , Thomas Sturm

While every matrix admits a singular value decomposition, in which the terms are pairwise orthogonal in a strong sense, higher-order tensors typically do not admit such an orthogonal decomposition. Those that do have attracted attention…

Algebraic Geometry · Mathematics 2015-12-29 Ada Boralevi , Jan Draisma , Emil Horobet , Elina Robeva

Let $X$ be a smooth irreducible quasi-projective algebraic variety over a number field $K$. Suppose $X$ is equipped with a $p$-adic \'{e}tale local system compatible with an admissible graded-polarized variation of mixed Hodge structures on…

Number Theory · Mathematics 2025-08-15 Kenneth Chung Tak Chiu

We present a new probabilistic algorithm to find a finite set of points intersecting the closure of each connected component of the realization of every sign condition over a family of real polynomials defining regular hypersurfaces that…

Algebraic Geometry · Mathematics 2008-12-18 Gabriela Jeronimo , Daniel Perrucci , Juan Sabia

We give polynomial-time algorithms for the exact computation of lowest-energy (ground) states, worst margin violators, log partition functions, and marginal edge probabilities in certain binary undirected graphical models. Our approach…

Machine Learning · Computer Science 2009-09-29 Nicol N. Schraudolph , Dmitry Kamenetsky