Related papers: Stable Polynomials over Finite Fields

Consider polynomial sequences that satisfy a first-order differential recurrence. We prove that if the recurrence is of a special form, then the Tur\'an expressions for the sequence are weakly Hurwitz stable (non-zero in the open right…

The goal of this paper is to prove that a random polynomial with i.i.d. random coefficients taking values uniformly in $\{1,\ldots, 210\}$ is irreducible with probability tending to $1$ as the degree tends to infinity. Moreover, we prove…

We formulate a stability conjecture for the coefficients of the colored Jones polynomial of a knot, colored by irreducible representations in a fixed ray of a simple Lie algebra, and verify it for all torus knots and all simple Lie algebras…

We extend and improve the existing characterization of the dynamics of general quadratic real polynomial maps with coefficients that depend on a single parameter $\lambda$, and generalize this characterization to cubic real polynomial maps,…

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…

We generalize the polynomial Szemer\'{e}di theorem to intersective polynomials over the ring of integers of an algebraic number field, by which we mean polynomials having a common root modulo every ideal. This leads to the existence of new…

We classify the stable formulas in the theory of Dense Linear Orders without endpoints, the stable formulas in the theory of Divisible Abelian Groups, and the stable formulas without parameters in the theory of Real Closed Fields. The third…

We present three proofs of an observation of Ahmadi on the number of irreducible polynomials over $\text{GF}(2)$ with certain traces and cotraces, the most interesting of which uses an explicit natural bijection. We also present two proofs…

Constructing $r$-th nonresidue over a finite field is a fundamental computational problem. A related problem is to construct an irreducible polynomial of degree $r^e$ (where $r$ is a prime) over a given finite field $\mathbb{F}_q$ of…

In this paper it is established that all two-dimensional polynomial automorphisms over a regular ring R are stably tame. In the case R is a Dedekind Q-algebra, some stronger results are obtained. A key element in the proof is a theorem…

In this paper, by using the theory of circulant matrices we study some matrices over finite fields which involve the quadratic character and trinomial coefficients.

Consider a quartic $q$-Weil polynomial $f$. Motivated by equidistribution considerations we define, for each prime $\ell$, a local factor which measures the relative frequency with which $f\bmod \ell$ occurs as the characteristic polynomial…

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…

Let $\FF$ be a finite field of characteristics different from two. We show that no bijective map transforms permanent into determinant when the cardinality of $\FF$ is sufficiently large. We also give an example of non-bijective map when…

We study the growth of polynomials on semialgebraic sets. For this purpose we associate a graded algebra to the set, and address all kinds of questions about finite generation. We show that for a certain class of sets, the algebra is…

Let $R(x)=g(x)/h(x)$ be a rational expression of degree three over the finite field $\mathbb{F}_q$. We count the irreducible polynomials in $\mathbb{F}_q[x]$, of a given degree, which have the form $h(x)^{\mathrm{deg}\, f}\cdot…

In this paper we present an iterative construction of irreducible polynomials over finite fields based upon repeated applications of transforms induced by endomorphisms of odd prime degree of ordinary elliptic curves.

We improve upon the upper bounds for the cardinality of the value set of a multivariable polynomial map over a finite field using the polytope of the polynomial. This generalizes earlier bounds only dependent on the degree of a polynomial.

The study of resonances (and well-posedness) for complex systems under time-periodic loading is of broad interest in application. The work of Galdi et al.~(2014) connects asymptotic stability of solutions to an unforced Cauchy problem to…

We develop a framework to give upper bounds on the "practical" computational complexity of stability problems for a wide range of nonlinear continuous and hybrid systems. To do so, we describe stability properties of dynamical systems using…