English
Related papers

Related papers: Parametric standard basis, degree bound and local …

200 papers

We study the complexity of solving the \emph{generalized MinRank problem}, i.e. computing the set of points where the evaluation of a polynomial matrix has rank at most $r$. A natural algebraic representation of this problem gives rise to a…

Symbolic Computation · Computer Science 2015-03-19 Jean-Charles Faugère , Mohab Safey El Din , Pierre-Jean Spaenlehauer

We use function field analytic number theory to establish the irreducibility and dimension of the moduli space that parameterises morphisms of fixed degree from $\mathbb{P}^2$ to an arbitrary smooth hypersurface of sufficiently small…

Algebraic Geometry · Mathematics 2025-08-27 Tim Browning , Shuntaro Yamagishi

In this article we study the tropicalization of the Hilbert scheme and its suitability as a parameter space for tropical varieties. We prove that the points of the tropicalization of the Hilbert scheme have a tropical variety naturally…

Algebraic Geometry · Mathematics 2018-09-25 Daniele Alessandrini , Michele Nesci

The number of linear independent algebraic relations among elementary symmetric polynomial functions over finite fields is computed. An algorithm able to find all such relations is described. It is proved that the basis of the ideal of…

Symbolic Computation · Computer Science 2023-09-26 Mihai Prunescu

Let $S$ be a polynomial ring in $n$ variables over a field. Let $I$ be a homogeneous ideal in $S$ generated by forms of degree at most $d$ with $\text{dim}(S/I)=r$. In the first part of this paper, we show how to derive from a result of Hoa…

Commutative Algebra · Mathematics 2022-04-20 Yihui Liang

Castelnuovo-Mumford regularity is a measure of algebraic complexity of an ideal. Regularity of monomial ideals can be investigated combinatorially. We use a simple graph decomposition and results from structural graph theory to prove,…

Commutative Algebra · Mathematics 2020-07-07 Grigoriy Blekherman , Jaewoo Jung

Let $\{f_i:\mathbb{F}_p^i \to \{0,1\}\}$ be a sequence of functions, where $p$ is a fixed prime and $\mathbb{F}_p$ is the finite field of order $p$. The limit of the sequence can be syntactically defined using the notion of ultralimit.…

Computational Complexity · Computer Science 2015-03-27 Yuichi Yoshida

Motivated by polynomial approximations of differential forms, we study analytical and numerical properties of a polynomial interpolation problem that relies on function averages over interval segments. The usage of segment data gives rise…

Numerical Analysis · Mathematics 2023-09-04 Ludovico Bruni Bruno , Wolfgang Erb

We consider log-supermodular models on binary variables, which are probabilistic models with negative log-densities which are submodular. These models provide probabilistic interpretations of common combinatorial optimization tasks such as…

Machine Learning · Statistics 2016-08-19 Tatiana Shpakova , Francis Bach

Let $A$ be a Dedekind domain of characteristic zero such that its localization at every maximal ideal has mixed characteristic with finite residue field. Let $R=A[X_1,\ldots, X_n]$ be a polynomial ring and $I=(a_1U_1, \ldots, a_c…

Commutative Algebra · Mathematics 2022-08-02 Tony J. Puthenpurakal , Sudeshna Roy

The paper deals with different properties of polynomials in random elements: bounds for characteristics functionals of polynomials, stochastic generalization of the Vinogradov mean value theorem, characterization problem, bounds for…

Probability · Mathematics 2016-08-05 Vladimir V. Ulyanov

In this paper, we recover the characteristic polynomial of an arrangement of hyperplanes by computing the rational equivalence class of the variety defined by the logarithmic ideal of the arrangement. The logarithmic ideal was introduced in…

Algebraic Geometry · Mathematics 2014-09-22 Graham Denham , Mehdi Garrousian , Mathias Schulze

Let $A/K$ be an absolutely simple abelian surface defined over a number field $K$. We give unconditional upper bounds for the number of prime ideals $\mathfrak{p}$ of $K$ with norm up to $x$ such that $A$ has supersingular reduction at…

Number Theory · Mathematics 2025-07-10 Tian Wang

We give a conditional proof of the Uniform Boundedness Conjecture of Morton and Silverman in the case of polynomials over number fields, assuming a standard conjecture in arithmetic geometry. Our technique simultaneously yields a dynamical…

Number Theory · Mathematics 2025-12-23 Nicole R. Looper

For univariate polynomials over arbitrary field the degree gives an upper bound on the number of roots (factor theorem) and as a related result for any finite point-set one can construct a polynomial of degree equal to the cardinality…

Commutative Algebra · Mathematics 2026-05-19 Olav Geil

An algorithm to generate a minimal comprehensive Gr\"obner\, basis of a parametric polynomial system from an arbitrary faithful comprehensive Gr\"obner\, system is presented. A basis of a parametric polynomial ideal is a comprehensive…

Symbolic Computation · Computer Science 2020-03-19 Deepak Kapur , Yiming Yang

Using results obtained from the study of homogeneous ideals sharing the same initial ideal with respect to some term order, we prove the singularity of the point corresponding to a segment ideal with respect to the revlex term order in the…

Commutative Algebra · Mathematics 2010-03-16 Francesca Cioffi , Paolo Lella , Maria Grazia Marinari , Margherita Roggero

We study solutions of uniformly elliptic PDE with Lipschitz leading coefficients and bounded lower order coefficients. We extend previous results of A. Logunov concerning nodal sets of harmonic functions and, in particular, prove polynomial…

Spectral Theory · Mathematics 2017-04-17 Bogdan Georgiev , Guillaume Roy-Fortin

Let $(A,\mathfrak{m})$ be a regular local ring of dimension $d \geq 1$, $I$ an $\mathfrak{m}$-primary ideal. Let $N$ be a non-zero finitely generated $A$-module. Consider the functions \[ t^I(N, n) = \sum_{i = 0}^{ d}\ell(\text{Tor}^A_i(N,…

Commutative Algebra · Mathematics 2024-12-04 Tony J. Puthenpurakal

This paper describes and analyzes a method for computing border bases of a zero-dimensional ideal $I$. The criterion used in the computation involves specific commutation polynomials and leads to an algorithm and an implementation extending…

Symbolic Computation · Computer Science 2008-12-02 Bernard Mourrain , Philippe Trébuchet