Related papers: Polynomial p-adic Low-Discrepancy Sequences

In their study of a binomial sum related to Wolstenholme's theorem, Chamberland and Dilcher prove that the corresponding sequence modulo primes $p$ satisfies congruences that are analogous to Lucas' theorem for the binomial coefficients…

For a polynomial $f(x)$ in $(\mathbb{Z}_p\cap \mathbb{Q})[x]$ of degree $d>2$ let $L(f \bmod p;T)$ be the $L$-function of the exponential sum of $f \bmod p$. Let $\mathrm{NP}(f \bmod p)$ denote the Newton polygon of $L(f \bmod p;T)$. Let…

Suppose that f has continuous derivatives thru order r+1 for x>0, and let P_{c} denote the Taylor polynomial to f of order r at x=c,c>0. In a previous paper of the author, it was shown that if r is an odd whole number and the (r+1)st…

This is a contribution to the classification problem for dp-minimal expansions of $(\mathbb{Z},+)$. Let $S$ be a dense cyclic group order on $(\mathbb{Z},+)$. We use results on "dense pairs" to construct uncountably many dp-minimal…

Let $p$ be a prime and let $g(p)$ be the least primitive root modulo $p$. We prove that for any $\epsilon>0$ and $p$ large enough the bound \begin{align} g(p)\ll p^{\frac{1}{4\sqrt{e}}+\epsilon} \nonumber \end{align} holds for most prime…

M. Levin defined a real number $x$ that satisfies that the sequence of the fractional parts of $(2^n x)_{n\geq 1}$ are such that the first $N$ terms have discrepancy $O((\log N)^2/ N)$, which is the smallest discrepancy known for this kind…

We investigate the $k$-error linear complexity of $p^2$-periodic binary sequences defined from the polynomial quotients (including the well-studied Fermat quotients), which is defined by $$ q_{p,w}(u)\equiv \frac{u^w-u^{wp}}{p} \bmod p ~…

Given a real polynomial $p$ with only real zeroes, we find upper and lower bounds for the number of non-real zeroes of the differential polynomial $$ F_{\varkappa}[p](z):= p(z)p''(z)-\varkappa[p'(z)]^2,$$ where $\varkappa$ is a real number.…

We first introduce a family of binary $pq^2$-periodic sequences based on the Euler quotients modulo $pq$, where $p$ and $q$ are two distinct odd primes and $p$ divides $q-1$. The minimal polynomials and linear complexities are determined…

In 1986 Lovasz, Spencer, and Vesztergombi proved a lower bound for the hereditary a discrepancy of a set system F in terms of determinants of square submatrices of the incidence matrix of F. As shown by an example of Hoffman, this bound can…

A classical observation of Deligne shows that, for any prime $p \geq 5$, the divisor polynomial of the Eisenstein series $E_{p-1}(z)$ mod $p$ is closely related to the supersingular polynomial at $p$, $$S_p(x) := \prod_{E/\bar{\mathbb{F}}_p…

We study the preorder $\le_p$ on the family of subsets of an algebraically closed field of characteristic $0$ defined by letting $A\le_pB $ if there exists a polynomial $P$ such that $A=P^{-1}(B)$.

Let $p$ be a prime, let $S$ be a non-empty subset of $\mathbb{F}_p$ and let $0<\epsilon\leq 1$. We show that there exists a constant $C=C(p, \epsilon)$ such that for every positive integer $k$, whenever $\phi_1, \dots, \phi_k:…

It has been conjectured by Sarkozy that with finitely many exceptions, the set of quadratic residues modulo a prime $p$ cannot be represented as a sumset $\{a+b\colon a\in A, b\in B\}$ with non-singleton sets $A,B\subset F_p$. The case…

Let E be a non-CM elliptic curve defined over Q. For each prime p of good reduction, E reduces to a curve E_p over the finite field F_p. For a given squarefree polynomial f(x,y), we examine the sequences f_p(E) := f(a_p(E), p), whose values…

Let $p$ be an odd prime. In the paper, by using the properties of Legendre polynomials we prove some congruences for $\sum_{k=0}^{\frac{p-1}2}\binom{2k}k^2m^{-k}\mod {p^2}$. In particular, we confirm several conjectures of Z.W. Sun. We also…

Let $(x_n)_{n\geq0}$ be a linear recurrence of order $k\geq2$ satisfying $$x_n=a_1x_{n-1}+a_2x_{n-2}+\dots+a_kx_{n-k}$$ for all integers $n\geq k$, where $a_1,\dots,a_k,x_0,\dots, x_{k-1}\in \mathbb{Z},$ with $a_k\neq0$. In [`The quotient…

Although squaring integers is deterministic, squares modulo a prime, $p$, appear to be random. First, because they are all generated by the multiplicative linear congruential equation, $x_{i+1} = g^2 x_i \mod p$, where $x_0 = 1$ and $g$ is…

We study the roots of a random polynomial over the field of p-adic numbers. For a random monic polynomial with coefficients in $\mathbb{Z}_p$, we obtain an asymptotic formula for the factorial moments of the number of roots of this…

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…