Related papers: Digraph Representations Of Rational Functions Over…
This paper is devoted to (discrete) $p$-adic dynamical systems, an important domain of algebraic and arithmetic dynamics. We consider the following open problem from theory of $p$-adic dynamical systems. Given continuous function $f:Z_p >…
A simple proof of the fact that each rank-one infinite measure preserving (i.m.p.) transformation is subsequence weakly rationally ergodic is found. Some classes of funny rank-one i.m.p. actions of Abelian groups are shown to be subsequence…
This document explores structural controllability of polynomial dynamical systems or polysystems. We extend Lin's concept of structural controllability for linear systems, offering hypergraph-theoretic methods to rapidly assess strong…
A set $R\subset \mathbb{N}$ is called rational if it is well-approximable by finite unions of arithmetic progressions. Examples of rational sets include many classical sets of number-theoretical origin such as the set of squarefree numbers,…
We consider a Random Graph Model on $\mathbb{Z}^{d}$ that incorporates the interplay between the statistics of the graph and the underlying space where the vertices are located. Based on a graphical construction of the model as the…
We define algebras of admissible functions associated to twisted Dirac structures, and we show that they are Poisson algebras. We study the standard cases associated to Dirac structures defined by graphs of non-degenerate 2-forms.
This paper presents a general and systematic discussion of various symbolic representations of iterated maps through subshifts. We give a unified model for all continuous maps on a metric space, by representing a map through a general…
We prove a new automorphy lifting theorem for l-adic representations where we impose a new condition at l, which we call `potential diagonalizability'. This result allows for `change of weight' and seems to be substantially more flexible…
We employ an extension of ergodic theory to the random setting to investigate the existence of random periodic solutions of random dynamical systems. Given that a random dynamical system has a dissipative structure, we proved that a random…
Let $G$ be a graph and $f: G\rightarrow G$ be a continuous map. We establish a structure theorem which describes the structures of the set $R(f)-\overline{P(f)}$, where $R(f)$ and $P(f)$ are the recurrent point set and the periodic point…
We prove that for any twist rigid compact $p$-adic analytic group $G$, its twist representation zeta function is a finite sum of terms $n_{i}^{-s}f_{i}(p^{-s})$, where $n_{i}$ are natural numbers and $f_{i}(t)\in\mathbb{Q}(t)$ are rational…
A pseudorandom point in an ergodic dynamical system over a computable metric space is a point which is computable but its dynamics has the same statistical behavior as a typical point of the system. It was proved in [Avigad et al. 2010,…
It is known that families of graphs with a semialgebraic edge relation of bounded complexity satisfy much stronger regularity properties than arbitrary graphs, and that they can be decomposed into very homogeneous semialgebraic pieces up to…
For meromorphic maps of complex manifolds, ergodic theory and pluripotential theory are closely related. In nice enough situations, dynamically defined Green's functions give rise to invariant currents which intersect to yield measures of…
Ergodic Optimization is the process of finding invariant probability measures that maximize the integral of a given function. It has been conjectured that "most" functions are optimized by measures supported on a periodic orbit, and it has…
Let $G$ be a split simply-connected group of type $D$ or $E$. The minimal automorphic representation $\Pi$ of $G(\mathbb A)$ admits a realization on a space of functions $\mathcal S(X(\mathbb A))$ for a variety $X$. In this paper we write…
We study the dynamic structures of the monomial $x^m$ over the ring of $p$-adic integers for every positive integer $m$ and for primes $p=2,3$ and $5$. The dynamic structures are described by investigating minimal decompositions which…
The graph reconstruction conjecture states that all graphs on at least three vertices are determined up to isomorphism by their deck. In this paper, a general framework for this problem is proposed to simply explain the reconstruction of…
We introduce the concepts of Baire Ergodicity and Ergodic Formalism, employing them to study topological and statistical attractors. Specifically, we establish the existence and finiteness of such attractors and provide applications for…
Many systems of interest in science and engineering are made up of interacting subsystems. These subsystems, in turn, could be made up of collections of smaller interacting subsystems and so on. In a series of papers David Spivak with…