English
Related papers

Related papers: Non-Archimedean dynamics of the complex shift

200 papers

For each prime number $p$, the dynamical behavior of the square mapping on the ring $\mathbb{Z}_p$ of $p$-adic integers is studied. For $p=2$, there are only attracting fixed points with their attracting basins. For $p\geq 3$, there are a…

Dynamical Systems · Mathematics 2014-08-21 Shilei Fan , Lingmin Liao

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…

Mathematical Physics · Physics 2019-09-25 Bastien Fernandez

An exact, one-to-one transform is presented that not only allows digital circular convolutions, but is free from multiplications and quantisation errors for transform lengths of arbitrary powers of two. The transform is analogous to the…

Numerical Analysis · Computer Science 2010-05-11 Shekhar S. Chandra

Shifted combinatorial optimization is a new nonlinear optimization framework which is a broad extension of standard combinatorial optimization, involving the choice of several feasible solutions at a time. This framework captures well…

Computational Complexity · Computer Science 2021-02-25 Jakub Gajarský , Petr Hliněný , Martin Koutecký , Shmuel Onn

In this paper we calculate the metric and folding entropies for a family of non-invertible symbolic dynamical systems $(\Sigma_{m_-,m_+}, \sigma_\phi)$ which generalizes the standard bilateral Bernoulli shifts. The space $\Sigma_{m_-,m_+}$…

Dynamical Systems · Mathematics 2026-01-30 Neemias Martins , Pedro G. Mattos , Régis Varão

In this summary of my talk at Strings 2016, I explain how classical dynamics on an infinite tree graph can be dual to a conformal field theory defined over the $p$-adic numbers. An informal introduction to $p$-adic numbers is followed by a…

High Energy Physics - Theory · Physics 2017-05-02 Steven S. Gubser

We obtained the exact solution of a probabilistic cellular automaton related to the diagonal-to-diagonal transfer matrix of the six-vertex model on a square lattice. The model describes the flow of ants (or particles), traveling on a…

Statistical Mechanics · Physics 2015-07-14 M. J. Lazo , A. A. Ferreira , F. C. Alcaraz

We show how geometric methods from the general theory of fractal dimensions and iterated function systems can be deployed to study symbolic dynamics in the zero entropy regime. More precisely, we establish a dimensional characterization of…

Dynamical Systems · Mathematics 2018-12-31 Gabriel Fuhrmann , Maik Gröger

A nonhomogeneous system of linear recurrence equations can be recognized by an automaton $\mathcal{A}$ over a one-letter alphabet $A = \{z\}$. Conversely, the automaton $\mathcal{A}$ generates precisely this nonhomogeneous system of linear…

Symbolic Computation · Computer Science 2010-11-09 Edoardo Carta-Gerardino

This work is a study of $p$-adic multiple zeta values at roots of unity ($p$MZV$\mu_{N}$'s), the $p$-adic periods of the crystalline pro-unipotent fundamental groupoid of $(\mathbb{P}^{1} - \{0,\mu_{N},\infty\})/ \mathbb{F}_{q}$. The main…

Number Theory · Mathematics 2017-12-29 David Jarossay

We study the dynamics of compositions of a sequence of holomorphic mappings in projective space. We define ergodicity and mixing for non-autonomous dynamical systems, and we construct totally invariant measures for which our sequence…

Complex Variables · Mathematics 2007-05-23 Han Peters

Let f be a rational mapping of a space X . The complexity of (f,X) as a dynamical system is measured by the dynamical degrees $\delta_p(f)$, $1\le p\le {\rm dim}(X)$. We give the definition of the dynamical degrees show how they are…

Dynamical Systems · Mathematics 2011-10-11 Eric Bedford

This paper continues the author's previous studies on continued fractions and Heron's algorithm, as from his former JMM2017 presentation (see \cite{CF.HA}).\par\medskip Extending the notion of continued fraction to the $p$-adic fields, one…

Number Theory · Mathematics 2019-03-11 Antonino Leonardis

A new incremental algorithm for data compression is presented. For a sequence of input symbols algorithm incrementally constructs a p-adic integer number as an output. Decoding process starts with less significant part of a p-adic integer…

Data Structures and Algorithms · Computer Science 2007-05-23 Anatoly Rodionov , Sergey Volkov

Probabilistic approaches for handling count-valued time sequences have attracted amounts of research attentions because their ability to infer explainable latent structures and to estimate uncertainties, and thus are especially suitable for…

Machine Learning · Computer Science 2024-05-24 Jiahao Wang , Sikun Yang , Heinz Koeppl , Xiuzhen Cheng , Pengfei Hu , Guoming Zhang

We show that spacetime diagrams of linear cellular automata $\Phi : {\mathbb F}_p^{\mathbb Z} \to {\mathbb F}_p^{\mathbb Z}$ with $(-p)$-automatic initial conditions are automatic. This extends existing results on initial conditions which…

Formal Languages and Automata Theory · Computer Science 2023-09-06 Eric Rowland , Reem Yassawi

We give a construction of a new $p$-adic Maass-Shimura operator defined on an affinoid subdomain of the preperfectoid $p$-adic universal cover $\mathcal{Y}$ of a modular curve $Y$. We define a new notion of $p$-adic modular forms as…

Number Theory · Mathematics 2018-05-10 Daniel Kriz

In this article, we define amorphic complexity for actions of locally compact $\sigma$-compact amenable groups on compact metric spaces. Amorphic complexity, originally introduced for $\mathbb Z$-actions, is a topological invariant which…

Dynamical Systems · Mathematics 2023-03-15 Gabriel Fuhrmann , Maik Gröger , Tobias Jäger , Dominik Kwietniak

A \emph{data automaton} is a finite automaton equipped with variables (counters or registers) ranging over infinite data domains. A trace of a data automaton is an alternating sequence of alphabet symbols and values taken by the counters…

Logic in Computer Science · Computer Science 2015-10-22 Radu Iosif , Adam Rogalewicz , Tomas Vojnar

Motivated by applications in the theory of numeration systems and recognizable sets of integers, this paper deals with morphic words when erasing morphisms are taken into account. Cobham showed that if an infinite word $w =g(f^\omega(a))$…

Combinatorics · Mathematics 2016-04-18 Emilie Charlier , Julien Leroy , Michel Rigo