Related papers: Numeration systems as dynamical systems -- introdu…

We extend the notion of Herz-Schur multipliers to the setting of non-commutative dynamical systems: given a C*-algebra $A$, a locally compact group $G$, and an action $\alpha$ of $G$ on $A$, we define transformations on the (reduced)…

Symbolic Extension Entropy Theorem (SEET) describes the possibility of a lossless digitalization of a dynamical system by extending it to a subshift. It gives an estimate on the entropy of symbolic extensions (and the necessary number of…

We consider Gibbs distributions, which are families of probability distributions over a discrete space $\Omega$ with probability mass function of the form $\mu^\Omega_\beta(\omega) \propto e^{\beta H(\omega)}$ for $\beta$ in an interval…

For applications to cryptography, it is important to represent numbers with a small number of non-zero digits (Hamming weight) or with small absolute sum of digits. The problem of finding representations with minimal weight has been solved…

In the course of many mathematical developments involving 'number systems' like $\mathbb{N}, \mathbb{Z}, \mathbb{Q}, \mathbb{R}, \mathbb {C}$ etc., it sometimes becomes necessary to abstract away and study certain properties of the number…

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 propose new concept of energy reservoir and effectively conserved quantity, what enables us to treat dissipative systems along the lines of the framework of Geometric Numerical Integration. Using this opportunity, we try to confirm…

Mathematical descriptions of dynamical systems are deeply rooted in topological spaces defined by non-Euclidean geometry. This paper proposes leveraging structure-rich geometric spaces for machine learning to achieve structural…

If M is a monoid (e.g. the lattice Z^D), and G is a finite (nonabelian) group, then G^M is a compact group; a `multiplicative cellular automaton' (MCA) is a continuous transformation F:G^M-->G^M which commutes with all shift maps, and where…

In this paper, we consider two questions about topological entropy of dynamical systems. We propose to resolve these questions by the same approach of using \'etale analogs of topological and algebraic dynamical systems. The first question…

Random substitutions are a natural generalisation of their classical `deterministic' counterpart, whereby at every step of iterating the substitution, instead of replacing a letter with a predetermined word, every letter is independently…

Preconditioning is essential in iterative methods for solving linear systems. It is also the implicit objective in updating approximations of Jacobians in optimization methods, e.g.,in quasi-Newton methods. Motivated by the latter, we study…

Using a genealogically ordered infinite regular language, we know how to represent an interval of R. Numbers having an ultimately periodic representation play a special role in classical numeration systems. The aim of this paper is to…

Abstract numeration systems encode natural numbers using radix ordered words of an infinite regular language and linear recurrence sequences play a key role in their valuation. Sequence automata, which are deterministic finite automata with…

Let $\Theta$ be a finite alphabet. We consider a bundle of measure preserving transformations $(T_{\theta})_{\theta \in \Theta}$ acting on a probability space $(X,\mu)$, which are chosen randomly according to an ergodic stochastic process…

We study non-standard number systems with negative base $-\beta$. Instead of the Ito-Sadahiro definition, based on the transformation $T_{-\beta}$ of the interval $\big[-\frac{\beta}{\beta+1},\frac{1}{\beta+1}\big)$ into itself, we suggest…

This paper presents the concept of digit polynomials, which leads to a deterministic and unconditional integer factorization algorithm with the runtime complexity $\mathcal{O}(N^{1/4+\epsilon})$. Strassen's well known factoring approach is…

The subject of this paper is the evolution of the concept of information processing in regular structures based on multi-level processing in nested cellular automata. The essence of the proposed model is a discrete space-time containing…

The concept of random dynamical system is a comparatively recent development combining ideas and methods from the well developed areas of probability theory and dynamical systems. Due to our inaccurate knowledge of the particular physical…

We introduce a family of maps generating continued fractions where the digit $1$ in the numerator is replaced cyclically by some given non-negative integers $(N_1,\ldots,N_m)$. We prove the convergence of the given algorithm, and study the…