Related papers: On $k$-error linear complexity of pseudorandom bin…

We consider the classical $k$-Center problem in undirected graphs. The problem is known to have a polynomial-time 2-approximation. There are even $(2+\varepsilon)$-approximations running in near-linear time. The conventional wisdom is that…

For a prime $p$ and an integer $u$ with $\gcd(u,p)=1$, we define Fermat quotients by the conditions $$ q_p(u) \equiv \frac{u^{p-1} -1}{p} \pmod p, \qquad 0 \le q_p(u) \le p-1. $$ D. R. Heath-Brown has given a bound of exponential sums with…

This paper is a study of power series, where the coefficients are binomial expressions (iterated finite differences). Our results can be used for series summation, for series transformation, or for asymptotic expansions involving Stirling…

For a given prime $p$, a new construction of families of the complex valued sequences of period $p$ with efficient implementation is given by applying both multiplicative characters and additive characters of finite field $\mathbb{F}_p$.…

Recently, Masjed-Jamei-Beyki-Koepf studied the so called new type Euler polynomials without making use of Euler polynomials of complex variable. Here we study degenerate and type 2 versions of these new type Euler polynomials, namely the…

In this paper modified variants of the sparse Fourier transform algorithms from [14] are presented which improve on the approximation error bounds of the original algorithms. In addition, simple methods for extending the improved sparse…

The $2$-adic complexity has been well-analyzed in the periodic case. However, we are not aware of any theoretical results on the $N$th $2$-adic complexity of any promising candidate for a pseudorandom sequence of finite length $N$ or…

A detailed study of complex-space singularities of the two-dimensional incompressible Euler equation is performed in the short-time asymptotic r\'egime when such singularities are very far from the real domain; this allows an exact…

We study multiplicative dependence between terms of the $k$-generalized Pell sequence $(P_n^{(k)})_{n\ge 2-k}$, defined by the linear recurrence \[ P_n^{(k)} = 2P_{n-1}^{(k)} + P_{n-2}^{(k)} + \dots + P_{n-k}^{(k)}, \] with initial…

In this paper, we study the degenerate version of the new type Euler polynomials, namely degenerate cosine-Euler polynomials and sime-Euler polynomials and also corresponding ones for Bernoulli polynomials, namely degenerate cosine…

In this paper, we show that the difference between the number of parts in the odd partitions of $n$ and the number of parts in the distinct partitions of $n$ satisfies Euler's recurrence relation for the partition function $p(n)$ when $n$…

Multidimensional continued fractions generalize classical continued fractions with the aim of providing periodic representations of algebraic irrationalities by means of integer sequences. However, there does not exist any algorithm that…

We consider a complex of tori of length 2 defined over a number field k. We establish here some local and global duality theorems for the (\'etale or Galois) hypercohomology of such a complex. We prove the existence of a Poitou-Tate exact…

About thirty years ago we looked for "minimal assumptions" on the data which guarantee that solutions to the $\,2-D\,$ evolution Euler equations in a bounded domain are classical. Classical means here that all the derivatives appearing in…

We prove some polynomial identities from which we deduce congruences modulo $p^2$ for the Fermat quotient $\frac{2^p-2}{p}$ for any odd prime $p$ (Proposition 1 and Theorem 1). These congruences are simpler than the one obtained by…

Via interleaving Ding-Helleseth-Lam sequences, a class of binary sequences of period $4p$ with optimal autocorrelation magnitude was constructed in \cite{W. Su}. Later, Fan showed that the linear complexity of this class of sequences is…

Fix m >= 1 and let E be an elliptic curve over Q with complex multiplication. We formulate conjectures on the density of primes p (congruent to one modulo m) for which the pth Fourier coefficient of E is an mth power modulo p; often these…

Let $p>3$ be a prime, and let $m$ be an integer with $p\nmid m$. In the paper we prove some supercongruences concerning $$\align &\sum_{k=0}^{p-1}\frac{\binom{2k}k\binom{3k}k}{54^k},\…

Given a matrix $A\in \mathrm{GL}_d(\mathbb{Z})$. We study the pseudorandomness of vectors $\mathbf{u}_n$ generated by a linear recurrent relation of the form $$ \mathbf{u}_{n+1} \equiv A \mathbf{u}_n \pmod {p^t}, \qquad n = 0, 1, \ldots, $$…

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…