English
Related papers

Related papers: Stability of binomials over finite fields

200 papers

Let $p$ be a prime and $b(x)$ be an irreducible polynomial of degree $k$ over $\mathbb{F}_p$. Let $d\geq 1$ be an integer. Consider the following question: Is $b(x^d)$ irreducible? We derive necessary conditions for $b(x^d)$ to be…

Number Theory · Mathematics 2016-04-29 Palash Sarkar , Shashank Singh

We study a random polynomial of degree $n$ over the finite field $\mathbb{F}_q$, where the coefficients are independent and identically distributed and uniformly chosen from the squares in $\mathbb{F}_q$. Our main result demonstrates that…

Number Theory · Mathematics 2024-10-23 Lior Bary-Soroker , Roy Shmueli

We study the number of irreducible factors (over $\mathbb{Q}$) of the $n$th iterate of a polynomial of the form $f_r(x) = x^2 + r$ for rational $r$. When the number of such factors is bounded independent of $n$, we call $f_r(x)$…

Number Theory · Mathematics 2021-11-24 David DeMark , Wade Hindes , Rafe Jones , Moses Misplon , Michael Stoll , Michael Stoneman

Let $f=ax+x^{r(q-1)+1}\in \mathbb{F}_{q^2}^*[x], r\in \{5,7\}.$ We give explicit conditions on the values $(q,a)$ for which $f$ is a permutation polynomials of $\mathbb{F}_{q^2}.$

Number Theory · Mathematics 2014-06-19 Stephen Lappano

A finitely generated quadratic module or preordering in the real polynomial ring is called stable, if it admits a certain degree bound on the sums of squares in the representation of polynomials. Stability, first defined explicitly by…

Algebraic Geometry · Mathematics 2008-07-29 Tim Netzer

If $V$ is an irreducible algebraic variety over a number field $K$, and $L$ is a field containing $K$, we say that $V$ is diophantine-stable for $L/K$ if $V(L) = V(K)$. We prove that if $V$ is either a simple abelian variety, or a curve of…

Number Theory · Mathematics 2017-07-04 Barry Mazur , Karl Rubin , Michael Larsen

We give a strongly polynomial time algorithm which determines whether or not a bivariate polynomial is real stable. As a corollary, this implies an algorithm for testing whether a given linear transformation on univariate polynomials…

Data Structures and Algorithms · Computer Science 2016-10-04 Prasad Raghavendra , Nick Ryder , Nikhil Srivastava

Given two polynomials $P(\underline x)$, $Q(\underline x)$ in one or more variables and with integer coefficients, how does the property that they are coprime relate to their values $P(\underline n), Q(\underline n)$ at integer points…

Number Theory · Mathematics 2022-09-30 Arnaud Bodin , Pierre Dèbes

We consider homogeneous multiaffine polynomials whose coefficients are the Pl\"ucker coordinates of a point $V$ of the Grassmannian. We show that such a polynomial is stable (with respect to the upper half plane) if and only if $V$ is in…

Complex Variables · Mathematics 2019-08-15 Kevin Purbhoo

Let R be an affine algebra of dimension n \geq 3 over an algebraically closed field k. Suppose char k =0 or char k =p \geq n. Let g,f_1,...,f_r be a R-regular sequence and A=R[f_1/g,...,f_r/g]. Let P be a projective A-module of rank n-1…

Commutative Algebra · Mathematics 2007-05-23 Manoj Kumar Keshari

A monomial self-map $f$ on a complex toric variety is said to be $k$-stable if the action induced on the $2k$-cohomology is compatible with iteration. We show that under suitable conditions on the eigenvalues of the matrix of exponents of…

Dynamical Systems · Mathematics 2013-04-05 Jan-Li Lin , Elizabeth Wulcan

For a class of polynomials $f \in \mathbb{Z}[X]$, which in particular includes all quadratic polynomials, and also trinomials of some special form, we show that, under some natural conditions (necessary for quadratic polynomials), the set…

Number Theory · Mathematics 2020-09-25 László Mérai , Alina Ostafe , Igor E. Shparlinski

We prove a function field analogue of Maynard's result about primes with restricted digits. That is, for certain ranges of parameters n and q, we prove an asymptotic formula for the number of irreducible polynomials of degree n over a…

Number Theory · Mathematics 2019-08-15 Sam Porritt

We consider the set of monic irreducible polynomials $P$ over a finite field $\mathbb{F}_q$ such that the multiplicative order modulo $P$ of some a in $\mathbb{F}_q(T)$ is divisible by a fixed positive integer $d$. Call $R_q(a,d)$ this set.…

Number Theory · Mathematics 2025-10-21 Joaquim Cera Da Conceição

We study degree preserving maps over the set of irreducible polynomials over a finite field. In particular, we show that every permutation of the set of irreducible polynomials of degree $k$ over $\mathbb{F}_q$ is induced by an action from…

Number Theory · Mathematics 2018-09-21 Lucas Reis , Qiang Wang

In this short note we prove that a definable set $X$ over $\mathbb F_n$ is superstable only if $X(\mathbb F_n)=X(\mathbb F_{\omega})$.

Logic · Mathematics 2014-11-25 Chloé Perin , Rizos Sklinos

The following result, a consequence of Dumas criterion for irreducibility of polynomials over integers, is generally proved using the notion of Newton diagram: Let $f(x)$ be a polynomial with integer coefficients and $k$ be a positive…

History and Overview · Mathematics 2016-12-21 Akash Jena , Binod Kumar Sahoo

Let $D$ be an integrally closed domain with quotient field $K$ and $n$ a positive integer. We give a characterization of the polynomials in $K[X]$ which are integer-valued over the set of matrices $M_n(D)$ in terms of their divided…

Rings and Algebras · Mathematics 2018-10-03 Giulio Peruginelli

In this article, we consider the polynomials of the form $f(x)=a_0+a_1x+a_2x^2+\cdots+a_nx^n\in \mathbb{Z}[x],$ where $|a_0|=|a_1|+\dots+|a_n|$ and $|a_0|$ is a prime. We show that these polynomials have a cyclotomic factor whenever…

Number Theory · Mathematics 2020-06-09 Biswajit Koley , A. Satyanarayana Reddy

A monoid $M$ is said to be surjunctive if every injective cellular automaton with finite alphabet over $M$ is surjective. We show that monoid algebras of surjunctive monoids are stably finite. In other words, given any field $K$ and any…

Rings and Algebras · Mathematics 2024-05-29 Tullio Ceccherini-Silberstein , Michel Coornaert , Xuan Kien Phung