English
Related papers

Related papers: Low-degree minimal generating sets of polynomial i…

200 papers

We prove that Chevalley groups over polynomial rings $\mathbb F_q[t]$ and over Laurent polynomial $\mathbb F_q[t,t^{-1}]$ rings, where $\mathbb F_q$ is a finite field, are boundedly elementarily generated. Using this we produce explicit…

Group Theory · Mathematics 2022-05-11 Boris Kunyavskii , Eugene Plotkin , Nikolai Vavilov

Let $X_{P}$ be the projective toric surface associated to a lattice polytope $P$. If the number of lattice points lying on the boundary of $P$ is at least $4$, it is known that $X_{P}$ is embeddable into a suitable projective space as zero…

Combinatorics · Mathematics 2017-07-11 Dimitrios I. Dais , Ioannis Markakis

The main goal of this paper is to size up the minimal graded free resolution of a homogeneous ideal in terms of its generating degrees. By and large, this is too ambitious an objective. As understood, sizing up means looking closely at the…

Commutative Algebra · Mathematics 2022-06-24 W. A. da Silva , S. H. Hassanzadeh , A. Simis

Several relations and bounds for the dimension of principal ideals in group algebras are determined by analyzing minimal polynomials of regular representations. These results are used in the two last sections. First, in the context of…

Information Theory · Computer Science 2020-07-24 Elias Javier Garcia Claro , Horacio Tapia Recillas

We consider the question "Is every nonzero generic degree a density-1-bounding generic degree?" By previous results \cite{I2} either resolution of this question would answer an open question concerning the structure of the generic degrees:…

Logic · Mathematics 2016-07-21 Peter Cholak , Gregory Igusa

We pursue various restricted variable generalizations of the Chevalley-Warning theorem for low degree polynomial systems over a finite field. Our first such result involves variables restricted to Cartesian products of the Vandermonde…

Number Theory · Mathematics 2022-01-28 Anurag Bishnoi , Pete L. Clark

For any real numbers $B \ge 1$ and $\delta \in (0, 1)$ and function $f: [0, B] \rightarrow \mathbb{R}$, let $d_{B; \delta} (f) \in \mathbb{Z}_{> 0}$ denote the minimum degree of a polynomial $p(x)$ satisfying $\sup_{x \in [0, B]} \big| p(x)…

Computational Complexity · Computer Science 2022-05-13 Amol Aggarwal , Josh Alman

Bounds on the minimum degree and on the number of vertices at- taining it have been much studied for finite edge-/vertex-minimally k- connected/k-edge-connected graphs. We give an overview of the results known for finite graphs, and show…

Combinatorics · Mathematics 2015-03-18 Maya Stein

The recently developed theory of extended generating functions of symplectic maps are combined with methods to prove invertibility via high-order Taylor model methods to obtain rigorous lower bounds for the domains of definition of…

Dynamical Systems · Mathematics 2025-04-29 B. Erdelyi , J. Hoefkens , M. Berz

Let $R^h$ denote the polynomial ring in variables $x_1,\,\ldots,\, x_h$ over a specified field $K$. We consider all of these rings simultaneously, and in each use lexicographic (lex) monomial order with $x_1 > \cdots > x_h$. Given a fixed…

Commutative Algebra · Mathematics 2020-03-03 Tigran Ananyan , Melvin Hochster

We prove that the cohomology ring of a finite-dimensional restricted Lie superalgebra over a field of characteristic $p > 2$ is a finitely-generated algebra. Our proof makes essential use of the explicit projective resolution of the trivial…

Representation Theory · Mathematics 2013-09-10 Christopher M. Drupieski

We extend the classical preferential attachment random graph model to random simplicial complexes. At each stage of the model, we choose one of the existing $k$-simplices with probability proportional to its $k$-degree. The chosen…

Probability · Mathematics 2024-10-24 Takashi Owada , Gennady Samorodnitsky

We consider the problem of bounding away from 0 the minimum value m taken by a polynomial P of Z[X_1,...,X_k] over the standard simplex, assuming that m>0. Recent algorithmic developments in real algebraic geometry enable us to obtain a…

Symbolic Computation · Computer Science 2009-02-20 Saugata Basu , Richard Leroy , Marie-Francoise Roy

We make explicit the exponential bound on the degrees of the polynomials appearing in the Effective Quillen-Suslin Theorem, and apply it jointly with the Hilbert-Burch Theorem to show that the syzygy module of a sequence of m polynomials in…

Commutative Algebra · Mathematics 2021-06-09 Teresa Cortadellas Benitez , Carlos D'Andrea , Eulalia Montoro

We show that there is a defining equation of degree at most $\mathsf{poly}(n)$ for the (Zariski closure of the) set of the non-rigid matrices: that is, we show that for every large enough field $\mathbb{F}$, there is a non-zero…

Computational Complexity · Computer Science 2020-11-06 Mrinal Kumar , Ben Lee Volk

Sequences of discrete random variables are studied whose probability generating functions are zero-free in a sector of the complex plane around the positive real axis. Sharp bounds on the cumulants of all orders are stated, leading to…

Probability · Mathematics 2023-12-04 Nils Heerten , Holger Sambale , Christoph Thäle

This note presents absolute bounds on the size of the coefficients of the characteristic and minimal polynomials depending on the size of the coefficients of the associated matrix. Moreover, we present algorithms to compute more precise…

Symbolic Computation · Computer Science 2011-11-10 Jean-Guillaume Dumas

We compute the minimal and the maximal bound on the number of generators of a minimal smooth monomial Togliatti system of forms of degree $d$ in $n+1$ variables, for any $d\ge 2$ and $n\geq 2$. We classify the Togliatti systems with number…

Algebraic Geometry · Mathematics 2016-01-27 Emilia Mezzetti , Rosa M. Miró-Roig

The notion of initial ideal for an ideal of a polynomial ring appears in the theory of Gr\"obner basis. Similarly to the initial ideals, we can define the initial algebra for a subalgebra of a polynomial ring, or more generally of a Laurent…

Commutative Algebra · Mathematics 2021-10-19 Shigeru Kuroda

Let $G$ be a finite almost simple group. It is well known that $G$ can be generated by 3 elements, and in previous work we showed that 6 generators suffice for all maximal subgroups of $G$. In this paper we consider subgroups at the next…

Group Theory · Mathematics 2016-11-21 Timothy C. Burness , Martin W. Liebeck , Aner Shalev