Related papers: Non-Archimedean dynamics of the complex shift
The asymptotic results for Berezin-Toeplitz operators yield a strict quantization for the algebra of smooth functions on a given Hodge manifold. It seems natural to generalize this picture for quantizable pseudo-K\"ahler manifolds in…
The automated synthesis of control policies for stochastic dynamical systems presents significant challenges. A standard approach is to construct a finite-state abstraction of the continuous system, typically represented as a Markov…
We exhibit a Probabilistic Cellular Automaton (PCA) on the integers with an alphabet and a neighborhood of size 2 which is non-ergodic although it has a unique invariant measure. This answers by the negative an old open question on whether…
A word in a free group is called ``potentially positive'' if it is automorphic to an element which is written with only positive exponents. We will develop automata to analyze properties of potentially positive words. We will use these to…
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…
We investigate numerically and analytically the effects of hydrodynamics on the dynamics of topological defects in $p-$atic liquid crystals, i.e. two-dimensional liquid crystals with $p-$fold rotational symmetry. Importantly, we find that…
In this paper we further develop the theory of one sided shift spaces over infinite alphabets, characterizing one-step shifts as edge shifts of ultragraphs and partially answering a conjecture regarding shifts of finite type (we show that…
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…
In [6], a constraint on invariant measures of bi-permutative cellular automata has been observed: fixed values at the positive indices determine almost-surely a uniform conditional probability on the subset of values of positive conditional…
We develop a systematic approach to continuous substitutions on compact Hausdorff alphabets. Focussing on implications of irreducibility and primitivity, we highlight important features of the topological dynamics of their (generalised)…
We study how much injective morphisms can increase the repetitiveness of a given word. This question has a few possible variations depending on the meaning of ``repetitiveness''. We concentrate on fractional exponents of finite words and…
An infinite word is S-automatic if, for all n>=0, its (n + 1)st letter is the output of a deterministic automaton fed with the representation of n in the considered numeration system S. In this extended abstract, we consider an analogous…
p-Adic and noncommutative analysis are applied to describe phase transitions in disordered systems. In the noncommutative replica approach we replicate the disorder instead of the system degrees of freedom. The noncommutatibe replica…
Wavelet analysis has been extended to the $p$-adic line $\mathbb{Q}_p$. The $p$-adic wavelets are complex valued functions with compact support. As in the case of real wavelets, the construction of the basis functions is recursive,…
We study the relation between the palindromic and factor complexity of infinite words. We show that for uniformly recurrent words one has P(n)+P(n+1) \leq \Delta C(n) + 2, for all n \in N. For a large class of words it is a better estimate…
An action for a prospect of a $p$-adic open superstring on a target Minkowski space is proposed. The action is constructed for `worldsheet' fields taking values in the $p$-adic field $\mathbb{Q}_p$, but it is assumed to be obtained from a…
In this paper, we introduce a new type of matter that has origin in $p$-adic strings, i.e., strings with a $p$-adic worldsheet. We investigate some properties of this $p$-adic matter, in particular its cosmological aspects. We start with…
The goal of this paper is to give a numerical criterion for an open question in $p$-adic Fourier theory. Let $F$ be a finite extension of $\mathbf{Q}_p$. Schneider and Teitelbaum defined and studied the character variety $\mathfrak{X}$,…
In this paper, a compressed membership problem for finite automata, both deterministic and non-deterministic, with compressed transition labels is studied. The compression is represented by straight-line programs (SLPs), i.e. context-free…
The fully dynamic transitive closure problem asks to maintain reachability information in a directed graph between arbitrary pairs of vertices, while the graph undergoes a sequence of edge insertions and deletions. The problem has been…