Related papers: G\'acs-Ku\v{c}era's Theorem Revisited by Levin
This note provides a simplified exposition of the proof of hierarchical Kraft lemma proven by Barmpalias and Lewis-Pye and its consequences for the oracle use in the Ku\v{c}era--G\'acs theorem (saying that every sequence is Turing reducible…
The Ku\v{c}era--G\'{a}cs theorem is a fundamental result in algorithmic randomness. It states that every infinite sequence $X$ is Turing reducible to a Martin-L\"of random $R$. This paper studies resource-bounded analogues of the…
There are three main thrusts to this article: a new proof of Levi's Enlargement Lemma for pseudoline arrangements in the real projective plane; a new characterization of pseudolinear drawings of the complete graph; and proofs that…
We give a short and self-contained proof of Levi's Extension Lemma for pseudoline arrangements.
Lov\'asz gave a short proof of Brooks' theorem by coloring greedily in a good order. We give a different short proof by reducing to the cubic case. Then we show how to extend the result to (online) list coloring via the Kernel Lemma.
The proofs of K. Oka's Coherence Theorems are based on Weierstrass' Preparation (division) Theorem. Here we formulate and prove a Weak Coherence Theorem without using Weierstrass' Preparation Theorem, but only with power series expansions:…
Standard proofs of Lusin's theorem, using simple functions, are sometimes quite elaborate. Here, we give a one-sentence proof of Lusin's theorem. We do not believe our approach, by way of inverse images, is new. However, this particular…
We give new necessary and sufficient conditions for higher order convex ordering. These results generalize the Levin-Ste\v{c}kin theorem (1960) on convex ordering. The obtained results can be useful in the study of the Hermite-Hadamard type…
In this paper we prove a Luk\'{a}cs type characterization theorem of the Wishart distribution on Euclidean simple Jordan algebras under weak regularity assumptions (e.g. measurability) on the densities.
We present a short proof of a celebrated result of G\'acs and K\"orner giving sufficient and necessary condition on the joint distribution of two discrete random variables $X$ and $Y$ for the case when their mutual information matches the…
The cut-elimination procedure for the provability logic is known to be problematic: a L\"ob-like rule keeps cut-formulae intact on reduction, even in the principal case, thereby complicating the proof of termination. In this paper, we…
The Johnson-Lindenstrauss lemma allows dimension reduction on real vectors with low distortion on their pairwise Euclidean distances. This result is often used in algorithms such as $k$-means or $k$ nearest neighbours since they only use…
The notion of a Galvin orientation of a line graph is introduced, generalizing the idea used by Galvin in his landmark proof of the list-edge-colouring conjecture for bipartite graphs. If L(G) has a proper Galvin orientation with respect to…
We survey the legacy of L.G. Kov\'acs in linear group theory, with a particular focus on classification questions.
The goal of this overview article is to give a tangible presentation of recent breakthrough works in discrepancy theory by M. B. Levin. These works provide proofs for the exact lower discrepancy bounds of Halton's sequence and a certain…
This paper introduces Least Volume (LV)--a simple yet effective regularization method inspired by geometric intuition--that reduces the number of latent dimensions required by an autoencoder without prior knowledge of the dataset's…
The first part of this paper introduces an analogue, for one-dimensional, singular, complete local rings, of Gersten's injectivity conjecture for discrete valuation rings. Our main theorem is the verification of this conjecture when the…
Cut-elimination theorems constitute one of the most important classes of theorems of proof theory. Since Gentzen's proof of the cut-elimination theorem for the system $\mathbf{LK}$, several other proofs have been proposed. Even though the…
We describe a construction by G\'abor Elek, associating C*-algebras with uniformly recurrent subgroups, in the language of groupoid C*-algebras. This allows us to simplify several proofs in the original paper and fully characterise their…
The algorithmic theory of randomness is well developed when the underlying space is the set of finite or infinite sequences and the underlying probability distribution is the uniform distribution or a computable distribution. These…