Related papers: The Golden Sieve
It is a classic result of Selberg in the 1950's that $\theta_2 = 2/3$, where $\theta_2$ is the level of distribution of the divisor function in arithmetic progressions (defined more precisely below). Selberg applies this estimate, together…
In this article, we will use elementary number theory techniques to investigate a sequence of integers defined by a sifting process called the lucky numbers. Ulam introduced lucky numbers as a sieve-based analogue of prime numbers. We…
Systems of Prony type appear in various signal reconstruction problems such as finite rate of innovation, superresolution and Fourier inversion of piecewise smooth functions. We propose a novel approach for solving Prony-type systems, which…
The quantitative distribution of twin primes remains a central open problem in number theory. This paper develops a heuristic model grounded in the principles of sieve theory, with the goal of constructing an analytical approximation for…
We have provided a pure model-theoretic proof for the decidability of the additive structure of the integers together with the function {f} sending {x} to {[\phi x]} where {\phi} is the golden ratio.
H.Furstenberg and E.Glasner proved that for an arbitrary $k\in\mathbb{N}$, any piecewise syndetic set of integers contains a $k$-term arithmetic progression and the collection of such progressions is itself piecewise syndetic in…
Bertrand's Postulate ensures existence of prime $p$ between $n$ and $2n$, $n$ an integer $\geq 2$ and the sieve of Eratosthenes, a very simple ancient algorithm, generates all prime numbers up to any given limit. Combining the above two, in…
We show that the additive-slow-Farey version of the traditional continued fractions algorithm has a natural interpretation as a method for producing integer partitions of a positive number $n$ into two smaller numbers, with multiplicity. We…
In this article we present method of solving some additive problems with primes. The method may be employed to the Goldbach-Euler conjecture and the twin primes conjecture. The presented method also makes it possible to obtain some…
Most prime gaps results have been proven using tools from analytic or algebraic number theory in the last few centuries. In this paper, we would like to present some probabilistic way of proving many essential results. A major component of…
We study those automatic sequences which are produced by an automaton whose underlying graph is the Cayley graph of a finite group. For $2$-automatic sequences, we find a characterization in terms of what we call homogeneity, and among…
In order to investigate multiplicative structures in additively large sets, Beiglb\"{o}ck et al. raised a significant open question as to whether or not every subset of the natural numbers with bounded gaps (syndetic set) contains…
In this paper, we introduce two golden ratio algorithms with new stepsize rules for solving pseudomonotone and Lipschitz variational inequalities in finite dimensional Hilbert spaces. The presented stepsize rules allow the resulting…
The set B_{p,r}^q:=\{\floor{nq/p+r} \colon n\in Z \} with integers p, q, r) is a Beatty set with density p/q. We derive a formula for the Fourier transform \hat{B_{p,r}^q}(j):=\sum_{n=1}^p e^{-2 \pi i j \floor{nq/p+r} / q}. A. S. Fraenkel…
Let $\bm{i}=1+q+...+q^{i-1}$. For certain sequences $(r_1,...,r_l)$ of positive integers, we show that in the Hecke algebra $\mathscr{H}_n(q)$ of the symmetric group $\mathfrak{S}_n$, the product $(1+\bm{r_1}T_{r_1})... (1+\bm{r_l}T_{r_l})$…
The nested distance builds on the Wasserstein distance to quantify the difference of stochastic processes, including also the information modelled by filtrations. The Sinkhorn divergence is a relaxation of the Wasserstein distance, which…
In \cite{O2015}, T. Oikhberg introduced and studied variants of the greedy and weak greedy algorithms for sequences with gaps. In this paper, we extend some of the notions that appear naturally in connection with these algorithms to the…
The famous Goldbach conjecture states that any even natural number $N$ greater than $2$ can be written as the sum of two prime numbers $p^{\text{(I)}}$ and $p^{\text{(II)}}$. In this article we propose a quantum analogue device that solves…
In this paper we classify the Zeckendorf expansions according to their digit blocks. It turns out that if we consider these digit blocks as labels on the Fibonacci tree, then the numbers ending with a given digit block in their Zeckendorf…
We consider the sum of digits functions for both base phi, and for the Zeckendorf expansion of the natural numbers. For both sum of digits functions we present morphisms on infinite alphabets such that these functions viewed as infinite…