Related papers: Transformations generating negative $\beta$-expans…
We extend the notion of matching for one-dimensional dynamical systems to random matching for random dynamical systems on an interval. We prove that for a large family of piecewise affine random systems of the interval the property of…
It is a survey on recent results in constructive sparse approximation. Three directions are discussed here: (1) Lebesgue-type inequalities for greedy algorithms with respect to a special class of dictionaries, (2) constructive sparse…
We define a new diffusive matrix model converging towards the $\beta$ -Dyson Brownian motion for all $\beta\in [0,2]$ that provides an explicit construction of $\beta$-ensembles of random matrices that is invariant under the…
We establish several new probabilistic, dynamical, dimensional and number theoretical phenomena connected with Ostrogradsky-Sierpi\'nski-Pierce expansion. First of all, we develop metric, ergodic and dimensional theories of the…
Consider $\beta > 1$ and $\lfloor \beta \rfloor$ its integer part. It is widely known that any real number $\alpha \in \Bigl[0, \frac{\lfloor \beta \rfloor}{\beta - 1}\Bigr]$ can be represented in base $\beta$ using a development in series…
For a real number $0<\lambda<2$, we introduce a transformation $T_\lambda$ naturally associated to expansion in $\lambda$-continued fraction, for which we also give a geometrical interpretation. The symbolic coding of the orbits of…
We consider base-$\beta$ expansions of Parry's type, where $a_0 \geq a_1 \geq 1$ are integers and $a_0<\beta <a_0+1$ is the positive solution to $\beta^2 = a_0\beta + a_1$ (the golden ratio corresponds to $a_0=a_1=1$). The map $x\mapsto…
The finiteness property is an important arithmetical property of beta-expansions. We exhibit classes of Pisot numbers $\beta$ having the negative finiteness property, that is the set of finite $(-\beta)$-expansions is equal to…
We propose a new method for generating realistic datasets with distribution shifts using any decoder-based generative model. Our approach systematically creates datasets with varying intensities of distribution shifts, facilitating a…
In this paper we continue the study of Lebesgue-type inequalities for greedy algorithms. We introduce the notion of strong partially greedy Markushevich bases and study the Lebesgue-type parameters associated with them. We prove that this…
This contribution is devoted to the study of positional numeration systems with negative base introduced by Ito and Sadahiro in 2009, called (-\beta)-expansions. We give an admissibility criterion for more general case of…
For $\beta > 1$, a sequence $(c_n)_{n \geq 1} \in \mathbb{Z}^{\mathbb{N}^+}$ with $0 \leq c_n < \beta$ is the \emph{beta expansion} of $x$ with respect to $\beta$ if $x = \sum_{n = 1}^\infty c_n\beta^{-n}$. Defining $d_\beta(x)$ to be the…
Let $\beta >1$ be a non-integer. We consider expansions of the form $\sum_{i=1}^{\infty} d_i \beta^{-i}$, where the digits $(d_i)_{i \geq 1}$ are generated by means of a Borel map $K_{\beta}$ defined on $\{0,1\}^{\N}\times [ 0, \lfloor…
The change-making problem consists of representing a certain amount of money with the least possible number of coins, from a given, pre-established set of denominations. The greedy algorithm works by choosing the coins of largest possible…
In the dynamic set cover problem, the input is a dynamic universe of elements and a fixed collection of sets. As elements are inserted or deleted, the goal is to efficiently maintain an approximate minimum set cover. While the past decade…
In this paper we give a detailed measure theoretical analysis of what we call sum-level sets for regular continued fraction expansions. The first main result is to settle a recent conjecture of Fiala and Kleban, which asserts that the…
One of the few accepted dynamical foundations of non-additive "non-extensive") statistical mechanics is that the choice of the appropriate entropy functional describing a system with many degrees of freedom should reflect the rate of growth…
Given a totally finite ordered alphabet $ A $, endowing the set of words over $ A $ with the alternating lexicographic order, we define a new class of Lyndon words. We study the fundamental properties of the associated symbolic dynamical…
This survey paper is aimed to describe a relatively new branch of symbolic dynamics which we call Arithmetic Dynamics. It deals with explicit arithmetic expansions of reals and vectors that have a "dynamical" sense. This means precisely…
In this paper, we study weights for the Thresholding Greedy Algorithm (TGA). While previous work focused on sequential weights $\varsigma = (s_n)_{n\in\mathbb{N}}$ on each positive integer, we study a more general weight $\omega =…