English
Related papers

Related papers: On the bit-size of non-radical triangular sets

200 papers

Experiences with the implementation of strong Gr\"obner bases respectively standard bases for polynomial rings over principal ideal rings are explained: different strategies for creating the pair set, methods to avoid coefficient growth and…

Commutative Algebra · Mathematics 2016-09-15 Christian Eder , Gerhard Pfister , Adrian Popescu

The security of multivariate cryptosystems and digital signature schemes relies on the hardness of solving a system of polynomial equations over a finite field. Polynomial system solving is also currently a bottleneck of index-calculus…

Cryptography and Security · Computer Science 2020-11-03 M. Bigdeli , E. De Negri , M. M. Dizdarevic , E. Gorla , R. Minko , S. Tsakou

We discuss algorithmic approach to growth of the codimension sequences of varieties of multilinear algebras, or, equivalently, the sequences of the component dimensions of algebraic operads. The (exponentional) generating functions of such…

Rings and Algebras · Mathematics 2017-12-19 Dmitri Piontkovski

In previous work, the authors established various bounds for the dimensions of degree $n$ cohomology and $\Ext$-groups, for irreducible modules of semisimple algebraic groups $G$ (in positive characteristic $p$) and (Lusztig) quantum groups…

Representation Theory · Mathematics 2010-08-16 Brian Parshall , Leonard Scott

A characteristic pair is a pair (G,C) of polynomial sets in which G is a reduced lexicographic Groebner basis, C is the minimal triangular set contained in G, and C is normal. In this paper, we show that any finite polynomial set P can be…

Symbolic Computation · Computer Science 2017-03-01 Dongming Wang , Rina Dong , Chenqi Mou

In this paper we study the structure of polynomials of degree three and four that have high bias or high Gowers norm, over arbitrary prime fields. In particular we obtain the following results. 1. We give a canonical representation for…

Combinatorics · Mathematics 2010-01-01 Elad Haramaty , Amir Shpilka

We consider the Graver basis, the universal Groebner basis, a Markov basis and the set of the circuits of a toric ideal. Let $A, B$ be any two of these bases such that $A\not \subset B$, we prove that there is no polynomial on the size or…

Combinatorics · Mathematics 2021-01-26 Christos Tatakis , Apostolos Thoma

We establish asymptotic upper bounds on the number of zeros modulo $p$ of certain polynomials with integer coefficients, with $p$ prime numbers arbitrarily large. The polynomials we consider have degree of size $p$ and are obtained by…

Number Theory · Mathematics 2022-01-19 Amit Ghosh , Kenneth Ward

In this paper the description of solvable Lie algebras with triangular nilradicals is extended to Leibniz algebras. It is proven that the matrices of the left and right operators on elements of Leibniz algebra have upper triangular forms.…

Rings and Algebras · Mathematics 2014-07-31 I. A. Karimjanov , A. Kh. Khudoyberdiyev , B. A. Omirov

Let $F$ be a non-negatively graded free module over a polynomial ring $\mathbb{K}[x_1,\dots,x_n]$ generated by $m$ basis elements. Let $M$ be a submodule of $F$ generated by elements in $F$ with degrees bounded by $D$ and dim $F/M$=$r$. We…

Commutative Algebra · Mathematics 2022-04-22 Yihui Liang

Assuming the Generalised Riemann Hypothesis (GRH), we show that for all k, there exist polynomials with coefficients in $\MA$ having no arithmetic circuits of size O(n^k) over the complex field (allowing any complex constant). We also build…

Computational Complexity · Computer Science 2013-04-23 Hervé Fournier , Sylvain Perifel , Rémi de Verclos

We develop the theory of Gr\"obner bases for ideals in a polynomial ring with countably infinite variables over a field. As an application we reconstruct some of the one-one correspondences among various sets of partitions by using division…

Commutative Algebra · Mathematics 2008-06-04 Kei-ichiro Iima , Yuji Yoshino

The present note is devoted to an amendment to a recent paper of Ellenberg, Lawrence and Venkatesh. Roughly speaking, the main result here states the subpolynomial growth of the number of integral points with bounded height of a variety…

Number Theory · Mathematics 2022-05-31 Yohan Brunebarbe , Marco Maculan

The computation of Gr\"obner bases is an established hard problem. By contrast with many other problems, however, there has been little investigation of whether this hardness is robust. In this paper, we frame and present results on the…

Symbolic Computation · Computer Science 2018-07-18 Gwen Spencer , David Rolnick

It is proved that for any finite dimensional representation of a prime order group over the field of rational numbers, polynomial invariants of degree at most $3$ separate the orbits. A result providing an upper degree bound for separating…

Commutative Algebra · Mathematics 2025-07-01 Mátyás Domokos

Let $F$ be a univariate polynomial or rational fraction of degree $d$ defined over a number field. We give bounds from above on the absolute logarithmic Weil height of $F$ in terms of the heights of its values at small integers: we review…

Number Theory · Mathematics 2022-10-11 Jean Kieffer

Separation bounds are a fundamental measure of the complexity of solving a zero-dimensional system as it measures how difficult it is to separate its zeroes. In the positive dimensional case, the notion of reach takes its place. In this…

Algebraic Geometry · Mathematics 2024-05-31 Chris La Valle , Josué Tonelli-Cueto

We provide necessary and sufficient conditions for simplicial complexes whose determinantal facet ideals admit reduced Grobner bases under diagonal term orders. Building on and extending foundational results for binomial edge ideals and…

Commutative Algebra · Mathematics 2026-01-27 Fahimeh Khosh-Ahang Ghasr

In this work we develop the theory of Gr\"obner bases for modules over the ring of univariate linearized polynomials with coefficients from a finite field.

Symbolic Computation · Computer Science 2014-06-19 Margreta Kuijper , Anna-Lena Trautmann

Given an odd integer polynomial f(x) of a degree k >=3, we construct a non-negative valued, normed trigonometric polynomial with the spectrum in the set of integer values of f(x) not greater than n, and a small free coefficient…

Number Theory · Mathematics 2013-01-17 Marina Nincevic , Sinisa Slijepcevic