Related papers: Dynamical properties of some adic systems with arb…
The cycles of a graph give a natural cyclic ordering to their edge-sets, and these orderings are consistent in that two edges are adjacent in one cycle if and only if they are adjacent in every cycle in which they appear together. An…
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…
This study analyzes the Collatz map through nonlinear dynamics. By embedding integers in Sharkovsky's ordering, we show that odd initial values suffice for full dynamical characterization. We introduce ``direction phases'' to partition…
The paper is devoted to the study of topologies on the group Aut(X,B) of all Borel automorphisms of a standard Borel space $(X, B)$. Several topologies are introduced and all possible relations between them are found. One of these…
A successive vertex ordering of a graph is a linear ordering of its vertices in which every vertex except the first has at least one neighbour appearing earlier. Such orderings arise naturally in incremental growth and…
Generalized Bratteli diagrams with a countable set of vertices in every level are models for aperiodic Borel automorphisms. This paper is devoted to the description of all ergodic probability tail invariant measures on the path spaces of…
Given a finite set T of maps on a finite ring R, we look at the finite simple graph G=(V,E) with vertex set V=R and edge set E={(a,b) | exists t in T, b=t(a), b not equal to a}. An example is when R=Z_n and T consists of a finite set of…
We prove that every 2k-edge-connected graph with countably many edge-ends admits a k-arc-connected orientation, extending the previous result by Assem, Koloschin and Pitz that also assumed the hypothesis of the graph being locally finite.…
In 2010, Bezuglyi, Kwiatkowski, Medynets and Solomyak [Ergodic Theory Dynam. Systems 30 (2010), no.4, 973-1007] found a complete description of the set of probability ergodic tail invariant measures on the path space of a standard…
Algorithmic decidability is established for two order-theoretic properties of downward closed subsets defined by finitely many obstructions in two infinite posets. The properties under consideration are: (a) being atomic, i.e. not being…
We propose a unifying setting for dealing with monodromically atypical intersections that goes beyond the usual Zilber-Pink conjecture. In particular we obtain a new proof of finiteness of the maximal atypical orbit closures in each stratum…
Structurally stable (rough) flows on surfaces have only finitely many singularities and finitely many closed orbits, all of which are hyperbolic, and they have no trajectories joining saddle points. The violation of the last property leads…
For a class of Fibonacci-like unimodal maps, the restriction to the $\omega$-limit set of the unique turning point defines a minimal Cantor system. We construct these Cantor sets geometrically using a nested sequence of finite covers with a…
An Alexandroff space is a topological space in which every intersection of open sets is open. There is one to one correspondence between Alexandroff $T_0$-spaces and partially ordered sets (posets). We investigate Alexandroff…
We give the detale description from various points of view of Pascal automorphism,--- a natural transformation of the space of paths in the Pascal graph (= infinite Pascal triangle), and describetha plan of the proof of continuiuty of its…
We introduce a family of adic transformations on diagrams that are nonstationary and nonsimple. This family includes some previously studied adic transformations. We relate the dimension group of each these diagrams to the dynamical system…
Chaotic dynamics in systems ranging from low-dimensional nonlinear differential equations to high-dimensional spatio-temporal systems including fluid turbulence is supported by non-chaotic, exactly recurring time-periodic solutions of the…
Recall that an excedance of a permutation $\pi$ is any position $i$ such that $\pi_i > i$. Inspired by the work of Hopkins, McConville and Propp (Elec. J. Comb., 2017) on sorting using toppling, we say that a permutation is toppleable if it…
In this paper we present a computer-assisted procedure for proving the existence of transverse heteroclinic orbits connecting hyperbolic equilibria of polynomial vector fields. The idea is to compute high-order Taylor approximations of…
Anyon models can be symmetric under some permutations of their topological charges. One can then conceive topological defects that, under monodromy, transform anyons according to a symmetry. We study the realization of such defects in the…