Related papers: The Ouroboros Goodstein Principle
We provide a writeup of a resolution of Erd\H{o}s Problem #728; this is the first Erd\H{o}s problem (a problem proposed by Paul Erd\H{o}s which has been collected in the Erd\H{o}s Problems website) regarded as fully resolved autonomously by…
In this paper we present a new efficient variant to compute strong Gr\"obner basis over quotients of principal ideal domains. We show an easy lifting process which allows us to reduce one computation over the quotient $R/nR$ to two…
A joint limit theorem for the point process of the off-diagonal entries of a sample covariance matrix $\mathbf{S}$, constructed from $n$ observations of a $p$-dimensional random vector with iid components, and the Frobenius norm of…
Order effects occur when judgments about a hypothesis's probability given a sequence of information do not equal the probability of the same hypothesis when the information is reversed. Different experiments have been performed in the…
We investigate an extension of nominal many-sorted signatures in which abstraction has a form of instantiation, called generalised concretion, as elimination operator (similarly to lambda-calculi). Expressions are then classified using a…
Inspired by the recent proposal by Feldman and Cousins of a ``unified approach to the classical statistical analysis of small signals'' based on a choice of ordering in Neyman's construction of classical confidence intervals, I propose a…
Discretization of Navier-Stokes' equations using pressure-robust finite element methods is considered for the high Reynolds number regime. To counter oscillations due to dominating convection we add a stabilization based on a bulk term in…
The C_\ell-free process starts with the empty graph on n vertices and adds edges chosen uniformly at random, one at a time, subject to the condition that no copy of C_\ell is created. For every $\ell \geq 4$ we show that, with high…
We suggest a new approach to hypothesis testing for ergodic and stationary processes. In contrast to standard methods, the suggested approach gives a possibility to make tests, based on any lossless data compression method even if the…
We give metric theorems for the property of Borel normality for real numbers under the assumption of digit dependencies in their expansion in a given integer base. We quantify precisely how much digit dependence can be allowed such that,…
Let $a_n$ be the random increasing sequence of natural numbers which takes each value independently with decreasing probability of order $n^{-\alpha}$, $0 < \alpha < 1/2$. We prove that, almost surely, for every measure-preserving system…
The (weak) Nullstellensatz over finite fields says that if $P_1,\ldots,P_m$ are $n$-variate degree-$d$ polynomials with no common zero over a finite field $\mathbb{F}$ then there are polynomials $R_1,\ldots,R_m$ such that…
We utilize quantum superposition principle to establish the improvable upper and lower bounds on the stronger uncertainty relation, i.e., the "weighted-like" sum of the variances of observables. Our bounds include some free parameters which…
We apply the methods of modern analytic bootstrap to the critical $O(N)$ model in a $1/N$ expansion. At infinite $N$ the model possesses higher spin symmetry which is weakly broken as we turn on $1/N$. By studying consistency conditions for…
We introduce a self-reinforced point processes on the unit interval that appears to exhibit self-organized criticality, somewhat reminiscent of the well-known Bak-Sneppen model. The process takes values in the finite subsets of the unit…
Termination is a major question in both logic and computer science. In logic, termination is at the heart of proof theory where it is usually called strong normalization (of cut elimination). In computer science, termination has always been…
This paper discusses the method of formative rules for first-order term rewriting, which was previously defined for a higher-order setting. Dual to the well-known usable rules, formative rules allow dropping some of the term constraints…
We bring forward a logical system of transition algebras that enhances many-sorted first-order logic using features from dynamic logics. The sentences we consider include compositions, unions, and transitive closures of transition…
An $(n,r,s)$-system is an $r$-uniform hypergraph on $n$ vertices such that every pair of edges has an intersection of size less than $s$. Using probabilistic arguments, R\"{o}dl and \v{S}i\v{n}ajov\'{a} showed that for all fixed integers…
Operations performing on quantum batteries are extended to scenarios where we no longer force the existence of definite causal order of occurrence between distinct processes. In contrast to standard theories, the so called indefinite causal…