English
Related papers

Related papers: A note on polynomial sequences modulo integers

200 papers

This paper provides some statistics for the coefficients of Russell- Type modular equations for the modular function, {\lambda}({\tau}). The results hold uniformly for all odd primes. They do not rely on any numerical evaluations of…

Number Theory · Mathematics 2016-08-08 Timothy Redmond , Charles Ryavec

Scattered polynomials over finite fields attracted an increasing attention in the last years. One of the reasons is their deep connection with Maximum Rank Distance (MRD) codes. Known classification results for exceptional scattered…

Number Theory · Mathematics 2022-06-29 Daniele Bartoli , Massimo Giulietti , Giovanni Zini

We fully classify completely multiplicative sequences which are given by generalised polynomial formulae, and obtain a similar result for (not necessarily completely) multiplicative sequences under the additional restriction that the…

Number Theory · Mathematics 2024-03-27 Jakub Konieczny

We prove new cases of reasonable bounds for the polynomial Szemer\'{e}di theorem both over $\mathbb{Z}/N\mathbb{Z}$ with $N$ prime and over the integers. In particular, we prove reasonable bounds for Szemer\'edi's theorem in the integers…

Number Theory · Mathematics 2025-06-17 Daniel Altman , Mehtaab Sawhney

H. Weyl proved in \cite{Weyl} that integer evaluations of polynomials are equidistributed mod 1 whenever at least one of the non-free coefficients is irrational. We use Weyl's result to prove a higher dimensional analogue of this fact.…

Number Theory · Mathematics 2023-07-07 Yuval Yifrach

We introduce an elementary argument to the theory of distribution of sequences modulo one.

Number Theory · Mathematics 2007-05-23 M. Z. Garaev

In this paper, we concentrate on counting and testing dominant polynomials with integer coefficients. A polynomial is called dominant if it has a simple root whose modulus is strictly greater than the moduli of its remaining roots. In…

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

The behaviour of Hecke polynomials modulo p has been the subject of some study. In this note we show that, if p is a prime, the set of integers N such that the Hecke polynomials T^{N,\chi}_{l,k} for all primes l, all weights k>1 and all…

Number Theory · Mathematics 2009-05-28 L. J. P. Kilford , Gabor Wiese

Let $pod_{\ell}(n)$ be the number of $\ell$-regular partitions of $n$ with distinct odd parts. In this article, prove that for any positive integer $k$, the set of non-negative integers $n$ for which $pod_{\ell}(n)\equiv 0 \pmod{p^{k}}$ has…

Number Theory · Mathematics 2021-09-22 Chiranjit Ray

In 1969, Delange has proved a general criterion for uniform distribution of additive functions. In this paper, we study the uniform distribution of a special class of polynomially-defined additive functions where the moduli is allowed to…

Number Theory · Mathematics 2024-01-10 Agbolade Patrick Akande

We consider integer sequences that satisfy a recursion of the form $x_{n+1} = P(x_n)$ for some polynomial $P$ of degree $d > 1$. If such a sequence tends to infinity, then it satisfies an asymptotic formula of the form $x_n \sim A…

Number Theory · Mathematics 2020-08-07 Stephan Wagner , Volker Ziegler

Let f(x) be a primitive irreducible polynomial with integer coefficients of degree greater than one. In 1964, Hooley showed that the sequence of normalized roots u/n, where f(u) = 0(n), ordered in the obvious way, is uniformly distributed…

Number Theory · Mathematics 2020-03-31 Sa'ar Zehavi

A bracket polynomial on the integers is a function formed using the operations of addition, multiplication and taking fractional parts. For a fairly large class of bracket polynomials we show that if p is a bracket polynomial of degree k-1…

Number Theory · Mathematics 2014-09-29 Matthew Tointon

Let $\{\cdot\}$ denote the fractional part and $n \geq 1$ be a fixed integer. In this short note, we show for any prime $p$ the one-to-one correspondence $$\sum_{\nu \geq 1} \left\{\frac{n}{p^\nu}\right\} > 1 \quad \iff \quad p \mid…

Number Theory · Mathematics 2017-08-24 Bernd C. Kellner

The injective polynomial modules for a general linear group $G$ of degree $n$ are labelled by the partitions with at most $n$ parts. Working over an algebraically closed field of characteristic $p$, we consider the question of which…

Representation Theory · Mathematics 2017-04-11 Stephen Donkin , Haralampos Geranios

A set ${\cal A} \subseteq \Set{1,...,N}$ is of type $B_2$ if all sums $a+b$, with $a\ge b$, $a,b\in {\cal A}$, are distinct. It is well known that the largest such set is of size asymptotic to $N^{1/2}$. For a $B_2$ set ${\cal A}$ of this…

Number Theory · Mathematics 2007-05-23 Mihail N. Kolountzakis

In this paper we study the asymptotic behavior of the maximum magnitude of a complex random polynomial with i.i.d. uniformly distributed random roots on the unit circle. More specifically, let $\{n_k\}_{k=1}^{\infty}$ be an infinite…

Probability · Mathematics 2012-11-19 Gabriel H. Tucci , Philip A. Whiting

We show that a discrete sequence $\Lambda$ of the complex plane is the union of $n$ interpolating sequences for the H\"ormander algebras $A_p$ if and only if the trace of $A_p$ on $\Lambda$ coincides with the space of functions on $\Lambda$…

Complex Variables · Mathematics 2010-04-16 Xavier Massaneda , Joaquim Ortega-Cerdà , Myriam Ounaïes

We primarily investigate congruences modulo $p$ for finite sums of the form $\sum_k\binom{rk}{k}x^k/k$ over the ranges $0<k<p$ and $0<k<p/r$, where $p$ is a prime larger than the positive integer $r$. Here $x$ is an indeterminate, thus…

Number Theory · Mathematics 2026-03-18 Sandro Mattarei , Roberto Tauraso

Given a prime $p\ge5$ and an integer $s\ge1$, we show that there exists an integer $M$ such that for any quadratic polynomial $f$ with coefficients in the ring of integers modulo $p^s$, such that $f$ is not a square, if a sequence…

Number Theory · Mathematics 2019-05-07 Pablo Sáez , Xavier Vidaux , Maxim Vsemirnov