Related papers: Sieving and the Erd{\H o}s-Kac theorem
We give a generalization of the ergodic theorem for semi-Markov linear-type processes. This generalization is proved for the case when a common support of distributions defining this process is not arithmetic. Also we give an uniform…
A general proof of the optical theorem (also known as the optical cross-section theorem) is presented that reveals the intimate connection between the forward scattering amplitude and the absorption-plus-scattering of the incident wave…
Inspired by the quantitative $K$-theory, in this paper, we introduce the coarse Baum-Connes conjecture with filtered coefficients which generalizes the original conjecture. There are two advantages for the conjecture with filtered…
We give a large sieve type inequality for functions supported on primes. As application we prove a conjecture by Elliott, and give bounds for short character sums over primes. The proves uses a combination of the large sieve and the Selberg…
A very simple but useful almost sure convergence theorem of probability is given.
Many versions of the Stokes theorem are known. More advanced of them require complicated mathematical machinery to be formulated which discourages the users. Our theorem is sufficiently simple to suit the handbooks and yet it is pretty…
Noether's theorem is widely regarded as one of the most elegant results in theoretical physics. The article presents two simple examples that can be used to demonstrate the basic idea behind Noether's theorem, by deriving a relation between…
In the words of the esteemed mathematician Paul Erd\"os, the mathematician's task is to \emph{prove and conjecture}. These two processes form the bedrock of all mathematical endeavours, and in the recent years, the mathematical community…
The Egoroff theorem for measurable $\bold X$-valued functions and operator-valued measures $\bold m: \Sigma \to L(\bold X, \bold Y)$, where $\Sigma$ is a $\sigma$-algebra of subsets of $T \neq \emptyset$ and $\bold X$, $\bold Y$ are both…
The CAP theorem is routinely treated as a systems law: under network partition, a replicated service must sacrifice either consistency or availability. The theorem is correct within its standard asynchronous network model, but operational…
Quantum theory reflects within itself a separation of evidence from explanations. This separation leads to a known proof that: (1) no wave function can be determined uniquely by evidence, and (2) any chosen wave function requires a guess…
We prove the constructive version of Birkhoff's ergodic theorem following Vyugin but trying to separate and state explicitly the combinatorial statement on which this proof is based. We pose some questions related to this statement (and the…
We present a formal proof in Lean of probably approximately correct (PAC) learnability of the concept class of decision stumps. This classic result in machine learning theory derives a bound on error probabilities for a simple type of…
We prove the Extended Church-Turing Thesis: Every effective algorithm can be efficiently simulated by a Turing machine. This is accomplished by emulating an effective algorithm via an abstract state machine, and simulating such an abstract…
The aim of this paper is to provide a self-contained proof of a general case of the coarea inequality, also known as the Eilenberg inequality. The result is known, but we are not aware of any place that a proof would be written with all…
The cyclic sieving phenomenon is a well-studied occurrence in combinatorics appearing when a cyclic group acts on a finite set. In this paper, we demonstrate a natural extension of this theory to finite abelian groups. We also present a…
Recent work by Shehper et al. (2024) demonstrated that the well-known Akbulut-Kirby AK(3) balanced presentation of the trivial group is stably AC-equivalent to the trivial presentation. This result eliminates AK(3) as a potential…
In this paper we introduce the notion of $e$-computability as a method of finding the Waring rank of forms. We use this notion to find infinitely many new examples which satisfy Strassen's Conjecture.
Normally hyperbolic invariant manifolds theory provides an efficient tool for proving diffusion in dynamical systems. In this paper we develop a methodology for computer assisted proofs of diffusion in a-priori chaotic systems based on this…
The Kirkwood-Dirac (KD) distribution has recently emerged as a powerful quasiprobability framework with wide-ranging applications in quantum information processing tasks. In this work, we introduce an experimentally motivated criterion for…