Related papers: Some Questions of Uniformity in Algorithmic Random…
In this work limit probabilities of first-order properties of the random $s$-uniform hypergraph in the binomial model $G^{s}(n,p)$ are studied. We give a complete discription of all positive $\alpha$ such that $G^{s}(n,n^{-\alpha})$ obeys…
In this paper, we study the power and limitations of computing effectively generic sequences using effectively random oracles. Previously, it was known that every 2-random sequence computes a 1-generic sequence (as shown by Kautz) and every…
We present three simple algorithms to uniformly generate `Fibonacci words' (i.e., some words that are enumerated by Fibonacci numbers), Schr{\"o}der trees of size $n$ and Motzkin left factors of size $n$ and final height $h$. These…
Boundedness properties of operators associated with non-degenerate symmetric $\alpha$-stable, $\alpha \in (1,2)$, probability measures on $\mathbb{R}^d$ are investigated on appropriate, Euclidean or otherwise, $L^p$-spaces, $p \in…
We investigate the orbits of automaton semigroups and groups to obtain algorithmic and structural results, both for general automata but also for some special subclasses. First, we show that a more general version of the finiteness problem…
We introduce here a new universality conjecture for levels of random Hamiltonians, in the same spirit as the local REM conjecture made by S. Mertens and H. Bauke. We establish our conjecture for a wide class of Gaussian and non-Gaussian…
We develop a theory of universal central extensions of Hom-Lie algebras. Classical results of universal central extensions of Lie algebras cannot be completely extended to Hom-Lie algebras setting, because of the composition of two central…
It is known that the M\"obius function in number theory is higher order oscillating. In this paper we show that there is another kind of higher order oscillating sequences in the form $(e^{2\pi i \alpha \beta^{n}g(\beta)})_{n\in \N}$, for a…
Joseph Miller [16] and independently Andre Nies, Frank Stephan and Sebastiaan Terwijn [18] gave a complexity characterization of 2-random sequences in terms of plain Kolmogorov complexity C: they are sequences that have infinitely many…
We study uniform stability of discrete groups, Lie groups and Lie algebras in the rank metric, and the connections between uniform stability of these objects. We prove that semisimple Lie algebras are far from being flexibly…
In this paper ideas of different types of convergence of a sequence of random variables in probability, namely, statistical convergence of order $\alpha$ in probability, strong $p$-Ces$\grave{\mbox{a}}$ro summability of order $\alpha$ in…
Automatic structures are first-order structures whose universe and relations can be represented as regular languages. It follows from the standard closure properties of regular languages that the first-order theory of an automatic structure…
A study of certain Hamiltonian systems has lead Y. Long to conjecture the existence of infinitely many primes of the form $p=2[\alpha n]+1$, where $1<\alpha<2$ is a fixed irrational number. An argument of P. Ribenboim coupled with classical…
We show that many classical decision problems about 1-counter omega-languages, context free omega-languages, or infinitary rational relations, are $\Pi_2^1$-complete, hence located at the second level of the analytical hierarchy, and…
We introduce layered automata, a subclass of alternating parity automata that generalises deterministic automata. Assuming a consistency property, these automata are history deterministic and 0-1 probabilistic. We show that every…
Let $\Omega \subset \mathbb{C}^n$ be a bounded domain and let $\mathcal{A} \subset \mathcal{C}(\bar{\Omega})$ be a uniform algebra generated by a set $F$ of holomorphic and pluriharmonic functions. Under natural assumptions on $\Omega$ and…
The main goal of this article is to put some known results in a common perspective and to simplify their proofs. We start with a simple proof of a result of Vereshchagin saying that $\limsup_n C(x|n)$ equals $C^{0'}(x)$. Then we use the…
This paper is devoted to uniform versions of the Hanson-Wright inequality for a random vector with independent centered $\alpha$-subexponential entries, $0<\alpha\le 1$. Our method relies upon a novel decoupling inequality and a comparison…
A regular language $L$ is said to be prime, if it is not the product of two non-trivial languages. Martens et al. settled the exact complexity of deciding primality for deterministic finite automata in 2010. For finite languages, Mateescu…
We develop a statistical mechanics framework for prefix coding based on variational principles, renormalization, and quantization. A Lagrangian formulation of entropy-optimal encoding under the Kraft-McMillan constraint yields a Gibbs-type…