Related papers: Non-Archimedean dynamics of the complex shift

We study the sweep complexity of DFA in one-way jumping mode answering several questions posed earlier. This measure is the number of times in the worst case that such machines have to return to the beginning of their input after having…

Motivated by the form of the noncommutative *-product in a system of open strings and Dp-branes with constant nonzero Neveu-Schwarz 2-form, we define a deformed multiplication operation on a quasitriangular Hopf algebra in terms of its…

Many complex systems satisfy a set of constraints on their degrees of freedom, and at the same time, they are able to work and adapt to different conditions. Here, we describe the emergence of this ability in a simplified model in which the…

In this paper, we explore the construction and dynamical properties of $\mathcal{S}$-limited shifts. An $S$-limited shift is a subshift defined on a finite alphabet $\mathcal{A} = \{1, \ldots,p\}$ by a set $\mathcal{S} = \{S_1, \ldots,…

We consider the computability and complexity of decision questions for Probabilistic Finite Automata (PFA) with sub-exponential ambiguity. We show that the emptiness problem for strict and non-strict cut-points of polynomially ambiguous…

A permutation \pi of an abelian group G is said to destroy arithmetic progressions (APs) if, whenever (a,b,c) is a non-trivial 3-term AP in G, that is c-b=b-a and a,b,c are not all equal, then (\pi(a),\pi(b),\pi(c)) is not an AP. In a paper…

In this paper we investigate the behavior of trajectories of one class of rational $p$-adic dynamical systems in complex $p$-adic field $\C_p$. We studied Siegel disks and attractors of such dynamical systems. We found the basin of the…

We consider infinite sequences of symbols, also known as streams, and the decidability question for equality of streams defined in a restricted format. This restricted format consists of prefixing a symbol at the head of a stream, of the…

In this paper, we investigate some ergodic properties of $Z^{2}$-actions $T_{p,n}$ generated by an additive cellular automata and shift acting on the space of all doubly -infinitive sequences taking values in $Z_{m}$.

We formulate general definitions of semi-classical gauge transformations for noncommutative gauge theories in general backgrounds of string theory, and give novel explicit constructions using techniques based on symplectic embeddings of…

We show that a dynamic gain-loss modulation in an optical structure can lead to a direction-dependent parity-time (PT) phase transition. The phase transition can be made thresholdless in the forward direction, and yet remains with a…

In this talk we go over several new developments regarding the techniques for a large class of non-hermitian matrix models with unitary randomness (complex random numbers). In particular, we discuss: (a) - A diagrammatic approach based on a…

Let K be a non-archimedean field, and let f in K(z) be a polynomial or rational function of degree at least 2. We present a necessary and sufficient condition, involving only the fixed points of f and their preimages, that determines…

In this paper we study ergodic $\mathbb{Z}^r$-actions and investigate expansion properties along cyclic subgroups. We show that under some spectral conditions there are always directions which expand significantly a given measurable set…

We describe the statistical properties of the dynamics of the quadratic polynomials P_a(z):=e^{2\pi a i} z+z^2 on the complex plane, with a of high return times. In particular, we show that these maps are uniquely ergodic on their measure…

We study the automorphism group of an infinite minimal shift $(X,\sigma)$ such that the complexity difference function, $p(n+1)-p(n)$, is bounded. We give some new bounds on $\mbox{Aut}(X,\sigma)/\langle \sigma \rangle$ and also study the…

We consider the asymmetric simple exclusion processes (ASEP) on a ring constrained to produce an atypically large flux, or an extreme activity. Using quantum free fermion techniques we find the time-dependent conditional transition…

We study the emptiness and $\lambda$-reachability problems for unary and binary Probabilistic Finite Automata (PFA) and characterise the complexity of these problems in terms of the degree of ambiguity of the automaton and the size of its…

We consider word automaticity for groups that are nilpotent of class $2$ and have exponent a prime $p$. We show that the infinitely generated free group in this variety is not word automatic. In contrast, the infinite extra-special…

We study a variant of the classical membership problem in automata theory, which consists of deciding whether a given input word is accepted by a given automaton. We do so under a different perspective, that is, we consider a dynamic…