Related papers: Transformations generating negative $\beta$-expans…
For random piecewise linear systems T of the interval that are expanding on average we construct explicitly the density functions of absolutely continuous T-invariant measures. In case the random system uses only expanding maps our…
We show that every intermediate $\beta$-transformation is topologically conjugate to a greedy $\beta$-transformation with a hole at zero, and provide a counterexample illustrating that the correspondence is not one-to-one. This…
We study the statistical properties of the generation of random graphs according the configuration model, where one assigns randomly degrees to nodes. This model is often used, e.g., for the scale-free degree distribution ~d^gamma. For the…
The concept of a uniform set is introduced for an ergodic, measure-preserving transformation on a non-atomic, infinite Lebesgue space. The uniform sets exist as much as they generate the underlying $\sigma$-algebra. This leads to the result…
We analyze a class of piecewise linear parabolic maps on the torus, namely those obtained by considering a linear map with double eigenvalue one and taking modulo one in each component. We show that within this two parameter family of maps,…
We utilize Gaussian measure preserving systems to prove the existence and genericity of Lebesgue measure preserving transformations $T:[0,1]\rightarrow [0,1]$ which exhibit both mixing and rigidity behavior along families of asymptotically…
From a dynamical viewpoint, basic phase transitions of statistical mechanics can be regarded as a breaking of ergodicity. While many random models exhibiting such transitions at the thermodynamics limit exist, finite-dimensional examples…
The goal of this paper is to study the performance of the Thresholding Greedy Algorithm (TGA) when we increase the size of greedy sums by a constant factor $\lambda\geqslant 1$. We introduce the so-called $\lambda$-almost greedy and…
In this paper, we define and study generalizations of expansiveness, namely n- expansiveness, $\aleph_0$-expansiveness, continuum-wise expansive and meagre expansiveness for non-autonomous discrete dynamical systems. We discuss various…
It is known that if a subset of $\mathbb{R}$ has positive Lebesgue measure, then it contains arbitrarily long finite arithmetic progressions. We prove that this result does not extend to infinite arithmetic progressions in the following…
Erd\H{o}s and Graham found it conceivable that the best $n$-term Egyptian underapproximation of almost every positive number for sufficiently large $n$ gets constructed in a greedy manner, i.e., from the best $(n-1)$-term Egyptian…
We demonstrate that the greedy algorithm for reduction of divisors on metric graphs need not terminate by modeling the Euclidean algorithm in this context. We observe that any infinite reduction has a well defined limit allowing us to treat…
It is well-known that when a positively expansive dynamical system is invertible then its underlying space is finite. C.Morales has introduced a decade ago a natural way to generalize positive expansiveness, by introducing other properties…
Discrete analogs of the Lebedev transforms with the product of the modified Bessel functions are introduced and investigated. Several expansions of suitable functions and sequences in terms of the series and integrals, involving the…
In the paper, we study behavior of discrete dynamical systems (automata) w.r.t. transitivity; that is, speaking loosely, we consider how diverse may be behavior of the system w.r.t. variety of word transformations performed by the system:…
Implicit generative models have the capability to learn arbitrary complex data distributions. On the downside, training requires telling apart real data from artificially-generated ones using adversarial discriminators, leading to unstable…
The evoluted set is the set of configurations reached from an initial set via a fixed flow for all times in a fixed interval. We find conditions on the initial set and on the flow ensuring that the evoluted set has negligible boundary (i.e.…
We present various estimates for the Lebesgue constants of the thresholding greedy algorithm, in the case of general bases in Banach spaces. We show the optimality of these estimates in some situations. Our results recover and slightly…
We extend the notion of rational ergodicity to $\beta$-rational ergodicity for $\beta > 1$. Given $\beta \in \mathbb R$ such that $\beta > 1$, we construct an uncountable family of rank-one infinite measure preserving transformations that…
Decision trees and decision rule systems play important roles as classifiers, knowledge representation tools, and algorithms. They are easily interpretable models for data analysis, making them widely used and studied in computer science.…