English
Related papers

Related papers: The Arithmetic of Consecutive Polynomial Sequences…

200 papers

We address some questions concerning indecomposable polynomials and their spectrum. How does the spectrum behave via reduction or specialization, or via a more general ring morphism? Are the indecomposability properties equivalent over a…

Algebraic Geometry · Mathematics 2015-05-13 Arnaud Bodin , Pierre Dèbes , Salah Najib

We tabulate polynomials in Z[t] with a given factorization partition, bad reduction entirely within a given set of primes, and satisfying auxiliary conditions associated to 0, 1, and infinity. We explain how these sets of polynomials are of…

Number Theory · Mathematics 2014-01-31 David P. Roberts

Answering a question of Frank Calegari, we extend some of our earlier results on dimension of fixed point spaces of elements in irreducible linear groups. We consider characteristic polynomials rather than just fixed spaces.

Group Theory · Mathematics 2011-12-21 Robert Guralnick , Gunter Malle

We evaluate the number of monic polynomials (of arbitrary degree $N$) the zeros of which equal their coefficients when these are allowed to take arbitrary complex values. In the following, we call polynomials with this property {\em…

Mathematical Physics · Physics 2017-06-13 Francesco Calogero , Francois Leyvraz

Let $\mathbb{F}_q$ be the finite field with $q$ elements, where $q$ is a prime power and $n$ be a positive integer. In this paper, we explore the factorization of $f(x^{n})$ over $\mathbb{F}_q$, where $f(x)$ is an irreducible polynomial…

Number Theory · Mathematics 2019-01-11 F. E. Brochero Martínez , Lucas Reis , Lays Silva

In this work we relate the deterministic complexity of factoring polynomials (over finite fields) to certain combinatorial objects we call m-schemes. We extend the known conditional deterministic subexponential time polynomial factoring…

Computational Complexity · Computer Science 2008-04-15 Gábor Ivanyos , Marek Karpinski , Nitin Saxena

We show that for any polynomial $f$ from the integers to the integers, with positive leading coefficient and irreducible over the rationals, if $x$ is large enough then there is a string of $(\log x)(\log\log x)^{1/835}$ consecutive…

Number Theory · Mathematics 2023-11-01 Kevin Ford , Mikhail R. Gabdullin

We present new classes of permutation polynomials over finite fields.

Number Theory · Mathematics 2010-06-10 Jose E. Marcos

In this note we consider roots of multivariate polynomials over a finite grid. When given information on the leading monomial with respect to a fixed monomial ordering, the footprint bound [8, 5] provides us with an upper bound on the…

Commutative Algebra · Mathematics 2019-09-17 Olav Geil

Permutation rational functions over finite fields have attracted high interest in recent years. However, only a few of them have been exhibited. This article studies a class of permutation rational functions constructed using trace maps on…

Number Theory · Mathematics 2024-01-01 Ruikai Chen , Sihem Mesnager

We give, in this paper, all bi-unitary perfect polynomials over the prime field $\mathbb{F}_2$, with at most four irreducible factors.

Number Theory · Mathematics 2022-05-24 Olivier Rahavandrainy

We show that the difference between consecutive terms in sequences of integers whose greatest prime factor grows slowly tends to infinity.

Number Theory · Mathematics 2023-08-07 C. L. Stewart

This paper deals with properties of the algebraic variety defined as the set of zeros of a "deficient" sequence of multivariate polynomials. We consider two types of varieties: ideal-theoretic complete intersections and absolutely…

Algebraic Geometry · Mathematics 2022-08-19 Nardo Giménez , Guillermo Matera , Mariana Pérez , Melina Privitelli

In this paper, we give sharp upper and lower bounds for the number of degenerate monic (and arbitrary, not necessarily monic) polynomials with integer coefficients of fixed degree $n \ge 2$ and height bounded by $H \ge 2$. The polynomial is…

Number Theory · Mathematics 2015-01-14 Artūras Dubickas , Min Sha

Regarding non-unique factorization of integer-valued polynomials over a discrete valuation domain $(R,M)$ with finite residue field, it is known that there exist absolutely irreducible elements, that is, irreducible elements all of whose…

Commutative Algebra · Mathematics 2022-03-16 Sophie Frisch , Sarah Nakato , Roswitha Rissner

We consider expansions of Presburger arithmetic with families of monadic polynomial predicates. (Examples of such predicates are the set of perfect squares, or the set of integers of the form $2n^3-5n+3$, etc.) Although the full attendant…

Logic in Computer Science · Computer Science 2026-05-19 Piotr Bacik , Joris Nieuwveld , Joël Ouaknine , Mihir Vahanwala , Madhavan Venkatesh , Emil Rugaard Wieser

Permutation polynomials have been a subject of study for a long time and have applications in many areas of science and engineering. However, only a small number of specific classes of permutation polynomials are described in the literature…

Information Theory · Computer Science 2014-02-25 Cunsheng Ding , Longjiang Qu , Qiang Wang , Jin Yuan , Pingzhi Yuan

Let $f(T)$ be a monic polynomial of degree $d$ with coefficients in a finite field $\mathbb{F}_q$. Extending earlier results in the literature, but now allowing $(q,2d)>1$, we give a criterion for $f$ to satisfy the following property: for…

Algebraic Geometry · Mathematics 2024-06-04 Kaloyan Slavov

The study of many problems in additive combinatorics, such as Szemer\'edi's theorem on arithmetic progressions, is made easier by first studying models for the problem in F_p^n for some fixed small prime p. We give a number of examples of…

Number Theory · Mathematics 2007-05-23 Ben Green

In this paper, with the help of trinomial coefficients we study some arithmetic properties of certain determiants involving reciprocals of binary quadratic forms over finite fields.

Number Theory · Mathematics 2024-07-25 Yue-Feng She , Hai-Liang Wu