English
Related papers

Related papers: Represent MOD function by low degree polynomial wi…

200 papers

Let I denote an R_+ -primary homogeneous ideal in a normal standard-graded Cohen-Macaulay domain over a field of positive characteristic p. We give a linear degree bound for the Frobenius powers I^[q] of I, q=p^e, in terms of the minimal…

Commutative Algebra · Mathematics 2007-05-23 Holger Brenner

We determine a sharp lower bound for the Hilbert function in degree $d$ of a monomial algebra failing the weak Lefschetz property over a polynomial ring with $n$ variables and generated in degree $d$, for any $d\geq 2$ and $n\geq 3$. We…

Commutative Algebra · Mathematics 2021-07-02 Nasrin Altafi , Mats Boij

In this article we prove that a class of Goppa codes whose Goppa polynomial is of the form $g(x) = x + x^q + \cdots + x^{q^{m-1}}$ where $m \geq 3$ (i.e. $g(x)$ is a trace polynomial from a field extension of degree $m \geq 3$) has a better…

Information Theory · Computer Science 2022-01-19 Isabel Byrne , Natalie Dodson , Ryan Lynch , Eric Pabón , Fernando Piñero

Let $f_1,\...,f_r$ be polynomials in $n$ variables over a finite field $F$ of cardinality $q$ and characteristic $p$. Let $f_i$ have total degree $d_i$ and define $d=d_1+\...+d_r$. Write $Z$ for the set of common zeros of the $f_i$, over…

Number Theory · Mathematics 2016-09-26 D. R. Heath-Brown

We shall give an explicit upper bound for the smallest prime factor of multiperfect numbers of the form $N=p_1^{\alpha_1}\cdots p_s^{\alpha_s} q_1^{\beta_1}\cdots q_t^{\beta_t}$ with $\beta_1, \ldots, \beta_t$ bounded by a given constant.…

Number Theory · Mathematics 2021-09-08 Tomohiro Yamada

An irreducible polynomial over $\Bbb F_q$ is said to be normal over $\Bbb F_q$ if its roots are linearly independent over $\Bbb F_q$. We show that there is a polynomial $h_n(X_1,\dots,X_n)\in\Bbb Z[X_1,\dots,X_n]$, independent of $q$, such…

Number Theory · Mathematics 2023-08-03 Xiang-dong Hou

Given a separable nonconstant polynomial $f(x)$ with integer coefficients, we consider the set $S$ consisting of the squarefree parts of all the rational values of $f(x)$, and study its behavior modulo primes. Fixing a prime $p$, we…

Number Theory · Mathematics 2014-07-21 David Krumm

Let $q$ be a prime power. We construct stable polynomials of the form $b^{m-1}(x+a)^m+c(x+a)+d$ over a finite field $\mathbb{F}_{q}$ for $m=2,3,4$ by Capelli's lemma. When $m=3$ and $q$ is even, we confirm the conjecture of Ahmadi and…

Number Theory · Mathematics 2023-10-05 Tong Lin , Qiang Wang

We introduce two kinds of gauge invariants for any finite-dimensional Hopf algebra H. When H is semisimple over C, these invariants are respectively, the trace of the map induced by the antipode on the endomorphism ring of a self-dual…

Quantum Algebra · Mathematics 2015-11-13 Yevgenia Kashina , Susan Montgomery , Siu-Hung Ng

We prove super-polynomial lower bounds on the size of propositional proof systems operating with constant-depth algebraic circuits over fields of zero characteristic. Specifically, we show that the subset-sum variant…

Computational Complexity · Computer Science 2022-05-17 Nashlen Govindasamy , Tuomas Hakoniemi , Iddo Tzameret

The nilpotence order of the mod 2 Hecke operators. Let $\Delta=\sum_{m=0}^\infty q^{(2m+1)^2} \in F_2[[q]]$ be the reduction mod 2 of the $\Delta$ series. A modular form f modulo 2 of level 1 is a polynomial in $\Delta$. If p is an odd…

Number Theory · Mathematics 2012-10-16 Jean-Louis Nicolas , Jean-Pierre Serre

We study limitations of polynomials computed by depth two circuits built over read-once polynomials (ROPs) and depth three syntactically multi-linear formulas. We prove an exponential lower bound for the size of the $\Sigma\Pi^{[N^{1/30}]}$…

Computational Complexity · Computer Science 2015-12-14 C. Ramya , B. V. Raghavendra Rao

The ring of polynomial over a finite field $F_q[x]$ has received much attention, both from a combinatorial viewpoint as in regards to its action on measurable dynamical systems. In the case of $(\mathbb{Z},+)$ we know that the ideal…

Dynamical Systems · Mathematics 2017-07-03 Dibyendu De , Pintu Debnath

An efficient randomized polynomial identity test for noncommutative polynomials given by noncommutative arithmetic circuits remains an open problem. The main bottleneck to applying known techniques is that a noncommutative circuit of size…

Computational Complexity · Computer Science 2016-11-23 Vikraman Arvind , Pushkar Joglekar , Partha Mukhopadhyay , S Raja

Let $M_{d,n}(q)$ denote the number of monic irreducible polynomials in $\mathbb{F}_q[x_1, x_2, \ldots , x_n]$ of degree $d$. We show that for a fixed degree $d$, the sequence $M_{d,n}(q)$ converges $q$-adically to an explicitly determined…

Number Theory · Mathematics 2018-09-10 Trevor Hyde

We classify the simple restricted modules for the minimal $p$-envelope of the non-graded, non-restricted Hamiltonian Lie algebra $H(2; (1,1); \Phi(1))$ over an algebraically closed field $k$ of characteristic $p \geq 5$. We also give the…

Representation Theory · Mathematics 2020-07-09 Horacio Guerra

The aim of this paper is to obtain a uniform bound for a certain class of submodules from the following theorem: Let $(R,\frak m)$ be a local ring, let $M$ be a finite $R$--module of dimension $d\ge 1$ and let $\frak q$ be an ideal of $R$…

Commutative Algebra · Mathematics 2007-05-23 Tirdad Sharif , Siamak Yassemi

We focus on Gr\"obner bases for modules of univariate polynomial vectors over a ring. We identify a useful property, the "predictable leading monomial (PLM) property" that is shared by minimal Gr\"{o}bner bases of modules in F[x]^q, no…

Information Theory · Computer Science 2010-12-24 M. Kuijper , K. Schindelar

We find a formula for the number of permutation polynomials of degree q-2 over a finite field Fq, which has q elements, in terms of the permanent of a matrix. We write down an expression for the number of permutation polynomials of degree…

Rings and Algebras · Mathematics 2013-12-18 Kwang-Yon Kim , Ryul Kim

Given a prime $p\ge5$ and an integer $s\ge1$, we show that there exists an integer $M$ such that for any quadratic polynomial $f$ with coefficients in the ring of integers modulo $p^s$, such that $f$ is not a square, if a sequence…

Number Theory · Mathematics 2019-05-07 Pablo Sáez , Xavier Vidaux , Maxim Vsemirnov