Related papers: Cotlar's ergodic theorem along the prime numbers
In this short note, we give two proofs of the infinitude of primes via valuation theory and give a new proof of the divergence of the sum of prime reciprocals by Roth's theorem and Euler-Legendre's theorem for arithmetic progressions.
The goal of the present paper is to present a method of proving of Diophantine inequalities with primes through the use of auxiliary inequalities and available evaluations of the difference between consecutive primes. We study the Legendre…
The purpose of this note is to rephrase Speyer's elegant topological proof for Kasteleyn's Theorem in a simple graph theoretical manner.
We show that Isserlis' theorem follows as a corollary to the invariant tensor theorem for isotropic tensors.
We prove the analog of Cram\'er's short intervals theorem for primes in arithmetic progressions and prime ideals, under the relevant Riemann Hypothesis. Both results are uniform in the data of the underlying structure. Our approach is based…
We show that a certain tiling property (which directly implies the pointwise ergodic theorem) holds for pmp actions of amenable groups along increasing Tempelman F{\o}lner sequences, thus providing a short and combinatorial proof of the…
We use ergodic theory to prove a quantitative version of a theorem of M. A. Berger and Y. Wang, which relates the joint spectral radius of a set of matrices to the spectral radii of finite products of those matrices. The proof rests on a…
In this paper, we will give some estimation for the average error of the prime number theorem.
We survey some of the ideas behind the recent developments in additive number theory, combinatorics and ergodic theory leading to the proof of Hardy- Littlewood type estimates for the number of prime solutions to systems of linear equations…
In this paper we generalize Kingman's sub-additive ergodic theorem to a large class of infinite countable discrete amenable group actions.
We prove the theorems which are equivalent to the Roland's results such that a new form of them allows to consider some generalizations. In particular, we give generators of primes more than a fixed prime.
A very short and direct proof along the lines of the Kamae-Katznelson-Weiss approach.
The aim of this paper is to establish some metrical coincidence and common fixed point theorems with an arbitrary relation under an implicit contractive condition which is general enough to cover a multitude of well known contraction…
This work proposes a proof of the simplest cubic primes counting problem. It shows that the subset of primes {p = n^3 + 2 is prime : n => 1} is an infinite subset of primes. Further, the expected order of magnitude of the cubic primes…
This document presents an alternative proof of Sylvester's theorem stating that "the product of $n$ consecutive numbers strictly greater than $n$ is divisible by a prime strictly greater than $n$". In addition, the paper proposes stronger…
A linear combination $aT_r(m)+bT_s(n)$ of an \mbox{$r$-gonal} number $T_r(m)$ and an $s$-gonal number $T_s(n)$ with mutually coprime positive integer coefficients $a$ and $b$ produces infinitely many primes as $m$ and~$n$ varies over the…
We examine the convergence of ergodic averages along polynomials in Toeplitz systems and prove that it is possible for averages along one polynomial to converge, and along another to diverge. We also study density of the polynomial orbits…
{\bf In the fourth extended version of this article, we provide a comprehensive historical survey of 200 different proofs of famous Euclid's theorem on the infinitude of prime numbers (300 {\small B.C.}--2022)}. The author is trying to…
We show any subset $A\subset\mathbb{N}$ with positive upper Banach density contains the pattern $\{m,m+[n\alpha],\dots,m+k[n\alpha]\}$, for some $m\in\mathbb{N}$ and $n=p-1$ for some prime $p$, where…
We present a characterization of sets for which Cartwright's theorem holds true. The connection is discussed between these sets and sampling sets for entire functions of exponential type.