Related papers: The Ouroboros Goodstein Principle
A general class of non-Markov, supercritical Gaussian branching particle systems is introduced and its long-time asymptotics is studied. Both weak and strong laws of large numbers are developed with the limit object being characterized in…
We investigate fragments of generic absoluteness principles known as Maximality Principles. We determine the consistency strength of $\Sigma_n$-$\mathsf{MP}(\mathbb R)$ and $\Pi_n$-$\mathsf{MP}(\mathbb R)$, the boldface Maximality Principle…
We give lower bounds for the degree of multiplicative combinations of iterates of rational functions (with certain exceptions) over a general field, establishing the multiplicative independence of said iterates. This leads to a…
Given a sequence $\mathscr{A}=\{a_0<a_1<a_2\ldots\}\subseteq \mathbb{N}$, let $r_{\mathscr{A},h}(n)$ denote the number of ways $n$ can be written as the sum of $h$ elements of $\mathscr{A}$. Fixing $h\geq 2$, we show that if $f$ is a…
A recently proposed axiom system for Andr\'e's central translation structures is improved upon. First, one of its axioms turns out to be dependent (derivable from the other axioms). Without this axiom, the axiom system is indeed…
A well known result of Newman says that upto a limit, multiples of $3$ with even number of 1's in binary representation always exceed multiples of $3$ with odd number of 1's. The phenomenon of preponderance of even number of 1's is now…
It is widely claimed that the natural axiom systems$\unicode{x2013}$including the large cardinal axioms$\unicode{x2013}$form a well-ordered hierarchy. Yet, as is well-known, it is possible to exhibit non-linearity and ill-foundedness by…
M. E. Rudin proved under CH that for each P-point there exists another P-point strictly RK-greater (M. E. Rudin, Partial orders on the types of $\beta \mathbb{N}$ , Trans. Amer. Math. Soc., 155 (1971), 353-362). Assuming…
We defend a new theory of statistical evidence, which we call Robust Bayesianism (RB). We prove that, under widely accepted assumptions, RB entails the law of likelihood [Royall, 1997], the likelihood principle [Berger and Wolpert, 1988],…
Recently, Forr\'e (arXiv:2104.11547, 2021) introduced transitional conditional independence, a notion of conditional independence that provides a unified framework for both random and non-stochastic variables. The original paper establishes…
We consider ideals involving the maximal minors of a polynomial matrix. For example, those arising in the computation of the critical values of a polynomial restricted to a variety for polynomial optimisation. Gr\"obner bases are a…
In this paper we consider an alternative approach to "un-reduction". This is the process where one associates to a Lagrangian system on a manifold a dynamical system on a principal bundle over that manifold, in such a way that solutions…
Randomized algorithms and data structures are often analyzed under the assumption of access to a perfect source of randomness. The most fundamental metric used to measure how "random" a hash function or a random number generator is, is its…
The Majorization Principle is a fundamental statement governing the dynamics of information processing in optimal and efficient quantum algorithms. While quantum computation can be modeled to be reversible, due to the unitary evolution…
A well-ordering principle is a principle of the form: If $X$ is well-ordered then $F(X)$ is well-ordered, where $F$ is some natural operator transforming linear orders into linear orders. Many important subsystems of Second-order Arithmetic…
In this paper we give a conditional improvement to the Elekes-Szab\'{o} problem over the rationals, assuming the Uniformity Conjecture. Our main result states that for $F\in \mathbb{Q}[x,y,z]$ belonging to a particular family of…
This paper presents a conception for computing gr\"{o}bner basis. We convert some of gr\"{o}bner-computing algorithms, e.g., F5, extended F5 and GWV algorithms into a special type of algorithm. The new algorithm's finite termination problem…
Understanding the core content of quantum mechanics requires us to disentangle the hidden logical relationships between the postulates of this theory. Here we show that the mathematical structure of quantum measurements, the formula for…
For alternate Cantor real base numeration systems we generalize the result of Frougny and~Solomyak on~arithmetics on the set of numbers with finite expansion. We provide a class of alternate bases which satisfy the so-called finiteness…
We deal with the problem, initiated in [8], of finding randomized and quantum complexity of initial-value problems. We showed in [8] that a speed-up in both settings over the worst-case deterministic complexity is possible. In the present…