相关论文: A Congruence Property of Solvable Polynomials

We use the theory of resultants of polynomials to study the stability of an arbitrary polynomial over a finite field, that is, the property of having all its iterates irreducible. This result partially generalises the quadratic polynomial…

The paper studies constructions of irreducible polynomials over finite fields using polynomial composition method.

In this paper we introduce a version of irreducible Laguerre polynomials in two variables and prove for it a congruence property, which is similar to the one obtained by Carlitz for the classical Laguerre polynomials in one variable.

We give a criterion when a polynomial $x^n-g$ is irreducible over a pseudofinite field. As an application we give an explicit description of algebraic closure of some pseudofinite fields of zero characteristic.

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…

In this article, we give an account of some recent irreducibility testing criteria for polynomials having integer coefficients over the field of rational numbers.

Using Watson's terminating $_8\phi_7$ transformation formula, we prove a family of $q$-congruences modulo the square of a cyclotomic polynomial, which were originally conjectured by the author and Zudilin [J. Math. Anal. Appl. 475 (2019),…

Inspired by the recent work of El Bachraoui, we present some new $q$-supercongruences on triple and quadruple sums of basic hypergeometric series. In particular, we give a $q$-supercongruence modulo the fifth power of a cyclotomic…

With the help of El Bachraoui's lemma, the creative microscoping method, and a new form of the Chinese remainder theorem for coprime polynomials, we prove a $q$-supercongruence for double series and a $q$-supercongruence for triple series…

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…

The congruence subgroup property is established for the modular representations associated to any modular tensor category. This result is used to prove that the kernel of the representation of the modular group on the conformal blocks of…

H. Lenstra has pointed out that a cubic polynomial of the form (x-a)(x-b)(x-c) + r(x-d)(x-e), where {a,b,c,d,e} is some permutation of {0,1,2,3,4}, is irreducible modulo 5 because every possible linear factor divides one summand but not the…

In this paper we obtained the formula for the number of irreducible polynomials with degree $n$ over finite fields of characteristic two with given trace and subtrace. This formula is a generalization of the result of Cattell et al.(2003)…

We provide several new $q$-congruences for truncated basic hypergeometric series, mostly of arbitrary order. Our results include congruences modulo the square or the cube of a cyclotomic polynomial, and in some instances, parametric…

We investigate algebraic and arithmetic properties of a class of sequences of sparse polynomials that have binomial coefficients both as exponents and as coefficients. In addition to divisibility and irreducibility results we also consider…

We give a simple and a more explicit proof of a mod $4$ congruence for a series involving the little $q$-Jacobi polynomials which arose in a recent study of a certain restricted overpartition function.

A polynomial with rational coefficients is said to be pure with respect to a rational prime $p$ if its Newton polygon has one slope. In this article, we prove that the number of irreducible factors of the $n$-th iterate of a pure polynomial…

We obtain a small improvement of Gallagher's larger sieve and we extend it to higher dimensions. We also obtain two interesting upper bounds for the number of solutions to polynomial congruences.

In terms of the creative microscoping method recently introduced by Guo and Zudilin and the Chinese remainder theorem for coprime polynomials, we establish a $q$-supercongruence with two parameters modulo $[n]\Phi_n(q)^3$. Here…

We give a criterion for a quasi-ordinary polynomial to be irreducible. The criterion is based on the notion of approximate roots and that of generalized Newton polygons.