English
Related papers

Related papers: On Arithmetic Progressions of Powers in Cyclotomic…

200 papers

Loeb showed that a natural extension of the usual binomial coefficient to negative (integer) entries continues to satisfy many of the fundamental properties. In particular, he gave a uniform binomial theorem as well as a combinatorial…

Combinatorics · Mathematics 2018-02-09 Sam Formichella , Armin Straub

In this article, we prove some factorization results for several classes of polynomials having integer coefficients, which in particular yield several classes of irreducible polynomials. Such classes of polynomials are devised by imposing…

Number Theory · Mathematics 2024-01-17 Jitender Singh , Rishu Garg

For positive integers $n>k$, let $P_{n,k}(x)=\displaystyle\sum_{j=0}^k \binom{n}{j}x^j $ be the polynomial obtained by truncating the binomial expansion of $(1+x)^n$ at the $k^{th}$ stage. These polynomials arose in the investigation of…

Number Theory · Mathematics 2013-06-05 Sudesh K. Khanduja , Ramneek Khassa , Shanta Laishram

Let $P_1, \ldots, P_m \in K[y]$ be polynomials with distinct degrees, no constant terms and coefficients in a general locally compact topological field $K$. We give a quantitative count of the number of polynomial progressions $x, x+P_1(y),…

Number Theory · Mathematics 2024-11-27 Ben Krause , Mariusz Mirek , Sarah Peluse , James Wright

A ternary inclusion-exclusion polynomial is a polynomial of the form \[ Q_{{p,q,r}}=\frac{(z^{pqr}-1)(z^p-1)(z^q-1)(z^r-1)} {(z^{pq}-1)(z^{qr}-1)(z^{rp}-1)(z-1)}, \] where $p$, $q$, and $r$ are integers $\ge3$ and relatively prime in pairs.…

Number Theory · Mathematics 2010-06-04 Gennady Bachman , Pieter Moree

We study Schur Q-polynomials evaluated on a geometric progression, or equivalently q-enumeration of marked shifted tableaux, seeking explicit formulas that remain regular at q=1. We obtain several such expressions as multiple basic…

Combinatorics · Mathematics 2008-04-08 Hjalmar Rosengren

We show that explicit forms for certain polynomials~$\psi^{(a)}_m(n)$ with the property \[ \psi^{(a+1)}_m(n) = \sum_{\nu=1}^n \psi_m^{(a)}(\nu) \] can be found (here, $a,m,n\in\mathbb{N}_0$). We use these polynomials as a basis to express…

Combinatorics · Mathematics 2022-07-06 Christoph Muschielok

We demonstrate, using character sum arguments, the existence of primitive polynomials of degree n over a finite field GF(q) with the coefficients for x^(n-1), x^(n-2), and x^(n-3) prescribed, so long as char(GF(q)) is at least 5 and n is at…

Number Theory · Mathematics 2007-05-23 Donald Mills

We use a variety of computational tools to obtain a degree-$\binom{m + n - 2}{m - 1}$ polynomial equation conjecturally satisfied by the top-left entry of the Sinkhorn limit of a positive $m \times n$ matrix. The degree of this equation has…

Number Theory · Mathematics 2025-05-27 Eric Rowland , Jason Wu

Let K be a non-archimedean field, and let f in K(z) be a polynomial or rational function of degree at least 2. We present a necessary and sufficient condition, involving only the fixed points of f and their preimages, that determines…

Number Theory · Mathematics 2013-12-03 Robert L. Benedetto

Let $q$ be a power of a prime $p$, let $k$ be a nontrivial divisor of $q-1$ and write $e=(q-1)/k$. We study upper bounds for cyclotomic numbers $(a,b)$ of order $e$ over the finite field $\mathbb{F}_q$. A general result of our study is that…

Number Theory · Mathematics 2019-03-19 Tai Do Duc , Ka Hin Leung , Bernhard Schmidt

The purpose of this note is to characterize those orthogonal polynomials sequences $(P_n)_{n\geq0}$ for which $$ \pi(x)\mathcal{D}_q P_n(x)=(a_n x+b_n)P_n(x)+c_n P_{n-1}(x),\quad n=0,1,2,\dots, $$ where $\mathcal{D}_q$ is the Askey-Wilson…

Classical Analysis and ODEs · Mathematics 2021-10-08 K. Castillo , D. Mbouna , J. Petronilho

Classes of polynomial differential equations of degree n are considered. An explicit upper bound on the size of the coefficients are given which implies that each equation in the class has exactly n complex periodic solutions. In most of…

Classical Analysis and ODEs · Mathematics 2009-04-20 M. A. M. Alwash

Departing from a class of infinite series with central binomial coefficients in the numerator and depending on a positive integer parameter, we first extend known identities to all complex parameters. Then we use various methods, including…

Number Theory · Mathematics 2025-11-04 Karl Dilcher , Christophe Vignat

Some families of linear permutation polynomials of $\mathbb{F}_{q^{ms}}$ with coefficients in $\mathbb{F}_{q^{m}}$ are explicitly described (via conditions on their coefficients) as isomorphic images of classical subgroups of the general…

Representation Theory · Mathematics 2023-06-07 Elías Javier García Claro , Gustavo Terra Bastos

The following theorem is proved. {\bf Theorem.} {\it Let $P(x) = \sum_{k=0}^{2n} a_k x^k$ be a polynomial with positive coefficients. If the inequalities $\frac{a_{2k+1}^2}{a_{2k}a_{2k+ 2}} < \frac{1}{cos^2(\frac{\pi}{n+2})} $ hold for all…

Classical Analysis and ODEs · Mathematics 2009-10-27 Olga M. Katkova , Anna M. Vishnyakova

We consider the problem of evaluating certain exponential sums. These sums take the form $\sum_{x_1,...,x_n \in Z_N} e^{f(x_1,...,x_n) {2 \pi i / N}} $, where each x_i is summed over a ring Z_N, and f(x_1,...,x_n) is a multivariate…

Computational Complexity · Computer Science 2015-05-19 Jin-Yi Cai , Xi Chen , Richard Lipton , Pinyan Lu

We unify in a large class of additive functions the results obtained in the first part of this work. The proof rests on series involving the Riemann zeta function and certain sums of primes which may have their own interest.

Number Theory · Mathematics 2021-12-28 Olivier Bordellès , László Tóth

It is conjectured that all separable polynomials with integers coefficients, satisfying some local conditions, take infinitely many square free values on integer arguments. But not a single polynomial of degree greater than $3$ is proven to…

Number Theory · Mathematics 2023-03-14 Prem Prakash Pandey

In this paper we consider polynomial representability of functions defined over $Z_{p^n}$, where $p$ is a prime and $n$ is a positive integer. Our aim is to provide an algorithmic characterization that (i) answers the decision problem: to…

Symbolic Computation · Computer Science 2015-02-16 Ashwin Guha , Ambedkar Dukkipati