The polynomials of degree $\frac{p-1}{2}$ of range sum $p$ was determined in {\tt arXiv:2311.06136 [math.NT]} for large enough primes. We extend this result by reducing the lower bound for the primes to $23$ by introducing a new and elementary way of estimating sums of Legendre symbols.
In his paper, W. M. Schmidt obtained an exponential sum estimate for systems of polynomials not including linear polynomials, which was then used to apply the Hardy-Littlewood circle method. We prove an analogous estimate for systems including linear polynomials.
The aim of this paper is twofold. Firstly, we investigate a finite sum involving the generalized falling factorial polynomials, in some special cases of which we express it in terms of the degenerate Stirling numbers of the second kind, the degenerate Bernoulli polynomials and the degenerate Frobenius-Euler polynomials. Secondly, we consider the degenerate Eulerian polynomials and deduce the generating function and a recurrence relation for them.
We investigate the polynomials $\sum_{k=0}^{n-1} c_n(k)x^k$ and $\sum_{k=0}^{n-1} |c_n(k)| x^k$, where $c_n(k)$ denote the Ramanujan sums. We point out connections and analogies to the cyclotomic polynomials.
Let $n$ be an even positive integer with at most three distinct prime factors and let $\ze_n$ be a primitive $n$-th root of unity. In this study, we made an attempt to find the lowest-degree $0,1$-polynomial $f(x) \in \Q[x]$ having at least three terms such that $f(\ze_n)$ is a minimal vanishing sum of the $n$-th roots of unity.
In this paper we consider in detail the composition of an irreducible polynomial with X^2 and suggest a recurrent construction of irreducible polynomials of fixed degree over finite fields of odd characteristics. More precisely, given an irreducible polynomial of degree n and order 2^rt with t odd, the construction produces ord_t(2)/d irreducible polynomials of degree n and order t for a certain divisor d of n. The construction can be used, for example, to search irreducible polynomials with specific requirements on its coefficients.
In this paper, we give some new identities of symmetry for q-Bernoulli polynomials under the symmetric group of degree n arising from p-adic q-integrals on Zp.
We obtain a polynomial upper bound in the finite-field version of the multidimensional polynomial Szemerédi theorem for distinct-degree polynomials. That is, if $P_1, ..., P_t$ are nonconstant integer polynomials of distinct degrees and $v_1, ..., v_t$ are nonzero vectors in $\mathbb{F}_p^D$, we show that each subset of $\mathbb{F}_p^D$ lacking a nontrivial configuration of the form $$ x, x + v_1 P_1(y), ..., x + v_t P_t(y)$$ has at most $O(p^{D-c})$ elements. In doing so, we apply the notion of Gowers norms along a vector adapted from ergodic theory, which extends the classical concept of Gow…
We study sums of Dirichlet characters over polynomials in $\mathbb{F}_q[t]$ with a prescribed number of irreducible factors. Our main results are explicit formulae for these sums in terms of zeros of Dirichlet L-functions. We also exhibit new phenomena concerning Chebyshev-type biases of such sums when the number of irreducible factors is very large.
Recently, Kim-Kim Introduced some interesting identities of symmetry for q-Bernoulli polynomials under symmetry group of degree n. In this paper, we study the degenerate q-Euler polynomials and derive some identities of symmetry for these polynomials arising from the p-adic q-integral on Zp.
We introduce the inversion polynomial for Dedekind sums $f_b(x)=\sum x^{\operatorname{inv}(a,b)}$ to study the number of $s(a,b)$ which have the same value for given $b$. We prove several properties of this polynomial and present some conjectures. We also introduce connections between Kloosterman sums and the inversion polynomial evaluated at particular roots of unity. Finally, we improve on previously known bounds for the second highest value of the Dedekind sum and provide a conjecture for a possible generalization. Lastly, we include a new restriction on equal Dedekind sums based on the rec…
We show that the proportion of polynomials of degree $n$ over the finite field with $q$ elements, which have a divisor of every degree below $n$, is given by $c_q n^{-1} + O(n^{-2})$. More generally, we give an asymptotic formula for the proportion of polynomials, whose set of degrees of divisors has no gaps of size greater than $m$. To that end, we first derive an improved estimate for the proportion of polynomials of degree $n$, all of whose non-constant divisors have degree greater than $m$. In the limit as $q \to \infty$, these results coincide with corresponding estimates related to the c…
Let $f$ be a polynomial of degree $d>6$, with integer coefficients. Then the paucity of non-trivial positive integer solutions to the equation $f(a)+f(b)=f(c)+f(d)$ is established. The corresponding situation for equal sums of three like polynomials is also investigated.
Up to linear transformations, we give a classification of all permutation polynomials of degree $7$ over $\mathbb{F}_{q}$ for any odd prime power $q$, with the help of the SageMath software.
In this paper, we prove a generalization of the Schmidt's subspace theorem for polynomials of higher degree in subgeneral position with respect to a projective variety over a number field. Our result improves and generalizes the previous results on Schmidt's subspace theorem for the case of higher degree polynomials.
it is the purpose of this paper to construct a p-adic continuous function for an odd prime to contain a p-adic q-analogue of higher order Dedekind type sums related to q-Euler polynomials and numbers.
The polynomial Ramanujan sum was first introduced by Carlitz [7], and a generalized version by Cohen [10]. In this paper, we study the arithmetical and analytic properties of these sums, derive various fundamental identities, such as H older formula, reciprocity formula, orthogonality relation and Davenport{Hasse type formula. In particular, we show that the special Dirichlet series involving the polynomial Ramanujan sums are, indeed, the entire functions on the whole complex plane, we also give a square mean values estimation. The main results of this paper are new appearance to us, which ind…
We establish asymptotic upper bounds on the number of zeros modulo $p$ of certain polynomials with integer coefficients, with $p$ prime numbers arbitrarily large. The polynomials we consider have degree of size $p$ and are obtained by truncating certain power series with rational coefficients that satisfy simple differential equations.
We discuss several enumerative results for irreducible polynomials of a given degree and pairs of relatively prime polynomials of given degrees in several variables over finite fields. Two notions of degree, the {\em total degree} and the {\em vector degree}, are considered. We show that the number of irreducibles can be computed recursively by degree and that the number of relatively prime pairs can be expressed in terms of the number of irreducibles. We also obtain asymptotic formulas for the number of irreducibles and the number of relatively prime pairs. The asymptotic formulas for the num…
We investigate the permutation property of polynomials of the form $x^{r}(x^{s} -a)^{t}$, and give the expressions of their inverses. In particular, explicit expressions of inverses of permutation polynomials $x(x^3 -a)^2$ and $x(x^2 -a)^3$ on $\mathbb{F}_{7^n}$ are presented. Then, using some known results, we obtain the inverses of all permutation polynomials of degree $6, 7, 8$ over finite fields.
The polynomial Pell equation is \[P^2 - D Q^2 = 1\] where $D$ is a given integer polynomial and the solutions $P, Q$ must be integer polynomials. A classical paper of Nathanson \cite{Nat} solved it when $D(x) = x^2 + d$. We show that the Rédei polynomials can be used in a very simple and direct way for providing these solutions. Moreover, this approach allows to find all the integer polynomial solutions when $D(x) = f^2(x) + d$, for any $f \in \mathbb Z[X]$ and $d \in \mathbb Z$, generalizing the result of Nathanson. We are also able to find solutions of some generalized polynomial Pell equati…
We obtain explicit factorizations of reduced period polynomials of degree $2^m$, $m\ge 4$, for finite fields of characteristic $p\equiv 3$ or $5\pmod{8}$. This extends the results of G. Myerson, who considered the cases $m=1$ and $m=2$, and S. Gurak, who studied the case $m=3$.
Let n,k be the positive integers, and let S_{k}(n) be the sums of the k-th power of positive integers up to n. By means of that we consider the evaluation of the sum of more general series by Bernstein polynomials. Additionally we show the reality of our idea with some examples.
The sum formulas for multiple zeta(-star) values and symmetric multiple zeta(-star) values bear a striking resemblance. We explain the resemblance in a rather straightforward manner using an identity that involves the Schur multiple zeta values. We also obtain the sum formula for polynomial multiple zeta(-star) values in terms of generating functions, simultaneously generalizing the sum formulas for multiple zeta(-star) values and symmetric multiple zeta(-star) values.
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 called degenerate if it has two distinct roots whose quotient is a root of unity. In particular, our bounds imply that non-degenerate linear recurrence sequences can be generated randomly.
We introduce certain special polynomials in an arbitrary number of indeterminates over a finite field. These polynomials generalize the special polynomials associated to the Goss zeta function and Goss-Dirichlet $L$-functions over the ring of polynomials in one indeterminate over a finite field and also capture the special values at non-positive integers of $L$-series associated to Drinfeld modules over Tate algebras defined over the same ring. We compute the exact degree in $t_0$ of these special polynomials and show that this degree is an invariant for a natural action of Goss' group of digi…
In this paper, we focus on computing the higher slope Hasse polynomials of L-functions of certain exponential sums associated to the following family of Laurent polynomials $f(x_1,\ldots ,x_{n+1})=\sum_{i=1}^na_i x_{n+1}\left(x_i+\frac{1}{x_i}\right)+a_{n+1} x_{n+1}+\frac{1}{x_{n+1}}$, where $a_i \in \F^*_{q}$, $i=1,2, \ldots, n+1$. We find a simple formula for the Hasse polynomial of the slope one side and study the irreducibility of these Hasse polynomials. We will also provide a simple form of all the higher slope Hasse polynomials for $n=3$, answering an open question of Zhang and Feng.
We obtain new bounds of exponential sums modulo a prime $p$ with sparse polynomials $a_0x^{n_0} + \cdots + a_νx^{n_ν}$. The bounds depend on various greatest common divisors of exponents $n_0, \ldots, n_ν$ and their differences. In particular, two new bounds for binomials are obtained, improving previous results in broad ranges of parameters.
In \cite{D1}, Dickson listed all permutation polynomials up to degree 5 over an arbitrary finite field, and all permutation polynomials of degree 6 over finite fields of odd characteristic. The classification of degree 6 permutation polynomials over finite fields of characteristic 2 was left incomplete. In this paper we complete the classification of permutation polynomials of degree 6 over finite fields of characteristic 2. In addition, all permutation polynomials of degree 7 over finite fields of characteristic 2 are classified.
Generic Newton polygons for L-functions of exponential sums associated to Laurent polynomials in one variable are determined. The corresponding Hasse polynomials are also determined.
An algorithm for factoring polynomials over finite fields is given by Berlekamp in 1967. The main tool was the matrix Q corresponding to each polynomial. This paper studies the degrees of polynomials over binary field that associated with their corresponding matrices Q and irreducibility.
The $T$-adic exponential sum of a polynomial in one variable is studied. An explicit arithmetic polygon in terms of the highest two exponents of the polynomial is proved to be a lower bound of the Newton polygon of the $C$-function of the T-adic exponential sum. This bound gives lower bounds for the Newton polygon of the $L$-function of exponential sums of $p$-power order.
Let $f$ be an irreducible polynomial of prime degree $p\geq 5$ over $\QQ$, with precisely $k$ pairs of complex roots. Using a result of Jens Höchsmann (1999), we show that if $p\geq 4k+1$ then $\Gal(f/\QQ)$ is isomorphic to $A_{p}$ or $S_{p}$. This improves the algorithm for computing the Galois group of an irreducible polynomial of prime degree, introduced by A. Bialostocki and T.Shaska. If such a polynomial $f$ is solvable by radicals then its Galois group is a Frobenius group of degree p. Conversely, any Frobenius group of degree p and of even order, can be realized as the Galois group of a…
The twisted $T$-adic exponential sum associated to a polynomial in one variable is studied. An explicit arithmetic polygon in terms of the highest two exponents of the polynomial is proved to be a lower bound of the Newton polygon of the $C$-function of the twisted T-adic exponential sum. This bound gives lower bounds for the Newton polygon of the $L$-function of twisted $p$-power order exponential sums.
We obtain a new bound of certain double multiplicative character sums. We use this bound together with some other previously obtained results to obtain new algorithms for finding roots of polynomials modulo a prime $p$.
The twisted $T$-adic exponential sum associated to a polynomial in one variable is studied. An explicit arithmetic polygon is proved to be the generic Newton polygon of the twisted $C$-function of the T-adic exponential sum. It gives the generic Newton polygon of the twisted $L$-functions of $p^m$-power order exponential sums, for all $m$.
We improve upper bounds of F. R. K. Chung and of M. Lu, D. Wan, L.-P. Wang, X.-D. Zhang on the diameter of some Cayley graphs constructed from polynomials over finite fields.
The multi-variable Schmidt polynomials are defined by $$ S_n^{(r)}(x_0,\ldots,x_n):=\sum_{k=0}^n {n+k \choose 2k}^{r}{2k\choose k} x_k. $$ We prove that, for any positive integers $m$, $n$, $r$, and $\varepsilon=\pm 1$, all the coefficients in the polynomial $$ \sum_{k=0}^{n-1}\varepsilon^k(2k+1) S_k^{(r)}(x_0,\ldots,x_k)^m $$ are multiples of $n$. This generalizes a recent result of Pan on the divisibility of sums of Apéry polynomials.
We prove a number of conjectures due to Dinesh Thakur concerning sums of the form $\sum_P h(P)$ where the sum is over monic irreducible polynomials $P$ in $\mathbb{F}_q[T]$, the function $h$ is a rational function and the sum is considered in the $T^{-1}$-adic topology. As an example of our results, in $\mathbb{F}_2[T]$, the sum $\sum_P \tfrac{1}{P^k - 1}$ always converges to a rational function, and is $0$ for $k=1$.
We study canonical heights for plane polynomial mappings of small topological degree. In particular, we prove that for points of canonical height zero, the arithmetic degree is bounded by the topological degree and hence strictly smaller than the first dynamical degree. The proof uses the existence, proved by Favre and the first author, of certain compactifications of the plane adapted to the dynamics.
Let $q$ be an odd prime power and $D$ be the set of monic irreducible polynomials in $\mathbb F_q[x]$ which can be written as a composition of monic degree two polynomials. In this paper we prove that $D$ has a natural regular structure by showing that there exists a finite automaton having $D$ as accepted language. Our method is constructive.
For any positive integers $m$ and $α$, we prove that $$\sum_{k=0}^{n-1}ε^k(2k+1)A_k^{(α)}(x)^m\equiv0\pmod{n}, $$ where $ε\in\{1,-1\}$ and $$ A_n^{(α)}(x)=\sum_{k=0}^n\binom{n}{k}^α\binom{n+k}{k}^αx^k.$$
We provide an index bound for character sums of polynomials over finite fields. This improves the Weil bound for high degree polynomials with small indices, as well as polynomials with large indices that are generated by cyclotomic mappings of small indices. As an application, we also give some general bounds for numbers of solutions of some Artin-Schreier equations and mininum weights of some cyclic codes.
Good polynomials are the fundamental objects in the Tamo-Barg constructions of Locally Recoverable Codes (LRC). In this paper we classify all good polynomials up to degree $5$, providing explicit bounds on the maximal number $\ell$ of sets of size $r+1$ where a polynomial of degree $r+1$ is constant, up to $r=4$. This directly provides an explicit estimate (up to an error term of $O(\sqrt{q})$, with explict constant) for the maximal length and dimension of a Tamo-Barg LRC. Moreover, we explain how to construct good polynomials achieving these bounds. Finally, we provide computational examples …
