Related papers: lim+, delta+, and Non-Permutability of beta-Steps
Selman's Theorem in classical Computability Theory gives a characterization of the enumeration reducibility for arbitrary sets in terms of the enumeration reducibility on the total sets: $A \le_e B \iff \forall X [X \equiv_{e} X \oplus…
A univariate clustering criterion for stationary processes satisfying a $\beta$-mixing condition is proposed extending the work of \cite{KB2} to the dependent setup. The approach is characterized by an alternative sample criterion function…
We describe how certain properties of the extrema of the digits of Luroth expansions lead to a probabilistic proof of a limiting relation involving the Riemann zeta function and the Bernoulli triangles. We also discuss trimmed sums of…
The lambda-Pi-calculus Modulo is a variant of the lambda-calculus with dependent types where beta-conversion is extended with user-defined rewrite rules. It is an expressive logical framework and has been used to encode logics and type…
Let $\|\cdot\|$ denote the minimum distance to an integer. For $0<\gamma< 1$, $\theta>0$ and $(\alpha, \beta) \in \mathbb{R} \setminus \{0\} \times \mathbb{R}$ we study when \begin{equation*} \|\alpha p^{\gamma}+\beta \|<p^{-\theta},…
Random walks of n steps taken into independent uniformly random directions in a d-dimensional Euclidean space (d larger than 1), are named Dirichlet when their step lengths are distributed according to a Dirichlet law. The latter continuous…
We consider the arithmetic complexity of index sets of uniformly computably enumerable families learnable under different learning criteria. We determine the exact complexity of these sets for the standard notions of finite learning,…
Consider a random walk $S_n=\sum_{i=1}^n X_i$ with independent and identically distributed real-valued increments $X_i$ of zero mean and finite variance. Assume that $X_i$ is non-lattice and has a moment of order $2+\delta$. For any $x\geq…
We introduce a framework to study the random entire function $\zeta_\beta$ whose zeros are given by the Sine$_\beta$ process, the bulk limit of beta ensembles. We present several equivalent characterizations, including an explicit power…
Safety is a syntactic condition of higher-order grammars that constrains occurrences of variables in the production rules according to their type-theoretic order. In this paper, we introduce the safe lambda calculus, which is obtained by…
We provide a simple reformulation of the $\epsilon$-$\delta$ limit definition introduced in undergraduate calculus courses that enhances its pedagogical value for conceptual understanding and computational skill.
Let L be a positive line bundle over a projective complex manifold X. Consider the space of holomorphic sections of the tensor power of order p of L. The determinant of a basis of this space, together with some given probability measure on…
The classical beta function B(x; y) is one of the most fundamental special functions, due to its important role in various fields in the mathematical, physical, engineering and statistical sciences. Useful extensions of the classical Beta…
Slot and van Emde Boas' weak invariance thesis states that reasonable machines can simulate each other within a polynomially overhead in time. Is $\lambda$-calculus a reasonable machine? Is there a way to measure the computational…
This paper studies tilings related to the beta-transformation when beta is a Pisot number (that is not supposed to be a unit). Then it applies the obtained results to study the set of rational numbers having a purely periodic…
We give a simple proof of a central limit theorem for linear statistics of the Circular beta-ensembles which is valid at almost arbitrary mesoscopic scale and for functions of class C^3. As a consequence, using a coupling introduced by…
We present a new lambda-calculus with explicit substitutions and named variables. Renaming of bound variables in this calculus is explicit (there is a special rewrite rule) and can be delayed. Contexts (environments) are not sets or lists…
In this paper, we give corrected and improved definitions of the sets $S$ and $\Delta$ compared to [1]. By using these new definitions, we go throughout the proof of the main result in [1], and we correct it.
We survey arithmetic and asymptotic properties of the alternating sum-of-divisors function $\beta$ defined by $\beta(p^a)=p^a-p^{a-1}+p^{a-2}-...+(-1)^a$ for every prime power $p^a$ ($a\ge 1$), and extended by multiplicativity. Certain open…
We study sufficient conditions for the belonging of random process to certain Besov space and for the Central Limit Theorem (CLT) in these spaces. We investigate also the non-asymptotic tail behavior of normed sums of centered random…