Related papers: The generalized strong recurrence for non-zero rat…
This work presents a formalization of analogy on numbers that relies on generalized means. It is motivated by recent advances in artificial intelligence and applications of machine learning, where the notion of analogy is used to infer…
The law of large numbers is one of the fundamental properties which algorithmically random infinite sequences ought to satisfy. In this paper, we show that the law of large numbers can be effectivized for an arbitrary Schnorr random…
We establish new sufficient conditions for the applicability of the strong law of large numbers (SLLN) for sequences of pairwise independent non-identically distributed random variables. These results generalize Etemadi's extension of…
For a positive integer $n$, the set of all integers greater than or equal to $n$ is denoted by $\mathcal T(n)$. A sum of generalized $m$-gonal numbers $g$ is called tight $\mathcal T(n)$-universal if the set of all nonzero integers…
If $G$ is an abelian group, we say $S\subset G$ is a set of recurrence if for every probability measure preserving $G$-system $(X,\mu,T)$ and every $D\subset X$ having $\mu(D)>0$, there is a $g\in S$ such that $\mu(D\cap T^{g}D)>0$. We say…
We provide an historical account of equivalent conditions for the Riemann Hypothesis arising from the work of Ramanujan and, later, Guy Robin on generalized highly composite numbers. The first part of the paper is on the mathematical…
The issue addressed in this paper is that of testing for common breaks across or within equations of a multivariate system. Our framework is very general and allows integrated regressors and trends as well as stationary regressors. The null…
We prove recursive formulas for sums of squares and sums of triangular numbers in terms of sums of divisors functions and we give a variety of consequences of these formulas. Intermediate applications include statements about positivity of…
We consider the decidability and complexity of the Ultimate Positivity Problem, which asks whether all but finitely many terms of a given rational linear recurrence sequence (LRS) are positive. Using lower bounds in Diophantine…
A real number is called simply normal to base $b$ if every digit $0,1,\ldots ,b-1$ should appear in its $b$-adic expansion with the same frequency $1/b$. A real number is called normal to base $b$ if it is simply normal to every base $b,…
For each $f:[0,\infty)\to\Com$ formally consider its co-Poisson or M\"{u}ntz transform $g(x)=\sum_{n\geq 1}f(nx)-\frac{1}{x}\int_0^\infty f(t)dt$. For certain $f$'s with both $f, g \in L_2(0,\infty)$ it is true that the Riemann hypothesis…
Zeckendorf's theorem states that every positive integer can be written uniquely as the sum of non-consecutive shifted Fibonacci numbers $\{F_n\}$, where we take $F_1=1$ and $F_2=2$. This has been generalized for any Positive Linear…
Riemann conjectured that all the zeros of the Riemann $\Xi$-function are real, which is now known as the Riemann Hypothesis (RH). In this article we introduce the study of the zeros of the truncated sums $\Xi_N(z)$ in Riemann's uniformly…
In this paper, a simple explanation for the Goldbach Conjecture is given. We have shown that the probability of violating the conjecture not only for the prime numbers, but also for any subset of natural numbers whose distribution is…
Nourdin et al. [9] established the following universality result: if a sequence of off-diagonal homogeneous polynomial forms in i.i.d. standard normal random variables converges in distribution to a normal, then the convergence also holds…
Effective versions of strong measure zero sets are developed for various levels of complexity and computability. It is shown that the sets can be equivalently defined using a generalization of supermartingales called odds supermartingales,…
After surveying classical results, we introduce a generalized notion of inference system to support structural recursion on non-well-founded data types. Besides axioms and inference rules with the usual meaning, a generalized inference…
We will show that the sequence appearing in the double recurrence theorem is a good universal weight for the Furstenberg averages. That is, given a system $(X, \mathcal{F}, \mu, T)$ and bounded functions $f_1, f_2 \in L^\infty(\mu)$, there…
This article describes a sequence of rational functions which converges locally uniformly to the zeta function. The numerators (and denominators) of these rational functions can be expressed as characteristic polynomials of matrices that…
Effectively inseparable pairs and their properties play an important role in the meta-mathematics of arithmetic and incompleteness. Different notions are introduced and shown in the literature to be equivalent to effective inseparability.…