Related papers: Transformations generating negative $\beta$-expans…
A `symbolic dynamical system' is a continuous transformation F:X-->X of a closed perfect subset X of A^V, where A is a finite set and V is countable. (Examples include subshifts, odometers, cellular automata, and automaton networks.) The…
We consider the random $\beta$-transformation $K_{\beta}$, defined on $\{0,1\}^{\mathbb N}\times[0, \frac{\lfloor\beta\rfloor}{\beta-1}]$, that generates all possible expansions of the form $x=\sum_{i=0}^{\infty}\frac{a_i}{\beta^i}$, where…
For Schauder bases, Dilworth et al. introduced and characterized the partially greedy property, which is strictly weaker than the (almost) greedy property. Later, Berasategui et al. defined and studied the strong partially greedy property…
We prove limit theorems of an entirely new type for certain long memory regularly varying stationary infinitely divisible random processes. These theorems involve multiple phase transitions governed by how long the memory is. Apart from one…
A lot of recent activity in the theory of cluster algebras has been directed towards various constructions of "natural" bases in them. One of the approaches to this problem was developed several years ago by P.Sherman - A.Zelevinsky who…
Let $\beta>1$. For $x \in [0,\infty)$, we have so-called the $\beta$-expansion of $x$ in base $\beta$ as follows: $$x= \sum_{j \leq k} x_{j}\beta^{j} = x_{k}\beta^{k}+ \cdots + x_{1}\beta+x_{0}+x_{-1}\beta^{-1} + x_{-2}\beta^{-2} + \cdots$$…
The purpose of this paper is to quantify the size of the Lebesgue constants $(L_m)_{m=1}^{\infty}$ associated with the thresholding greedy algorithm in terms of a new generation of parameters that modulate accurately some features of a…
We study expansive measures for continuous flows without fixed points on compact metric spaces. We provide a new characterization of expansive measures through dynamical balls that, in contrast to the dynamical balls considered in [\emph{J.…
Expansion of real numbers is a basic research topic in number theory. Usually we expand real numbers in one given base. In this paper, we begin to systematically study expansions in multiple given bases in a reasonable way, which is a…
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…
It was previously known that the almost greedy (AG) property essentially remains the same when we enlarge greedy sums in the classical definition by a factor $\lambda \geqslant 1$. The present paper shows that if instead, we enlarge greedy…
We propose a new method for obtaining complete asymptotic expansions in a systematic manner, which is suitable for counting sequences of various graph families in dense regime. The core idea is to encode the two-dimensional array of…
This note examines the infinite divisibility of density-based transformations of normal random variables. We characterize a class of density-based transformations of normal variables which produces non-infinitely divisible distributions. We…
We obtain Lebesgue-type inequalities for the greedy algorithm for arbitrary complete seminormalized biorthogonal systems in Banach spaces. The bounds are given only in terms of the upper democracy functions of the basis and its dual. We…
For two countable ordinals $\alpha$ and $\beta$, a basis of a Banach space $X$ is said to be $(\alpha, \beta)$-quasi-greedy if it is 1) quasi-greedy, 2) $\mathcal{S}_\alpha$-unconditional but not $\mathcal{S}_{\alpha+1}$-unconditional, and…
We introduce a parametrised family of maps $\{S_{\eta}\}_{\eta \in [1,2]}$, called symmetric doubling maps, defined on $[-1,1]$ by $S_\eta (x)=2x-d\eta$, where $d\in \{-1,0,1 \}$. Each map $S_\eta$ generates binary expansions with digits…
We consider a one dimensional affine switched system obtained from a formal limit of a two dimensional linear system. We show this is equivalent to minimising the average digit in beta representations with unrestricted digits. We give a…
The notion of $\Delta$-weakly mixing set is introduced, which shares similar properties of weakly mixing sets. It is shown that if a dynamical system has positive topological entropy, then the collection of $\Delta$-weakly mixing sets is…
Greedy algorithms are a fundamental category of algorithms in mathematics and computer science, characterized by their iterative, locally optimal decision-making approach, which aims to find global optima. In this review, we will discuss…
Piecewise Translations is a class of dynamical systems which arises from some applications in computer science, machine learning, and electrical engineering. In dimension 1 it can also be viewed as a non-invertible generalization of…