Related papers: Cycles in Repeated Exponentiation Modulo $p^n$

In dynamical systems limit cycles arise as a result of a Hopf bifurcation, after a control parameter has crossed its critical value. In this study we present a constructive method to produce dissipative dynamics which lead to stable…

For the ring R of integers of a ramified extension of the field of p-adic numbers and a cyclic group G of prime order p we study the extensions of the additive groups of R-representations modules of G by the group G.

A universal cycle (u-cycle) for permutations of length $n$ is a cyclic word, any size $n$ window of which is order-isomorphic to exactly one permutation of length $n$, and all permutations of length $n$ are covered. It is known that…

In this paper, we study rotation numbers of random dynamical systems on the circle. We prove the existence of rotation numbers and the continuous dependence of rotation numbers on the systems. As an application, we prove a theorem on…

Let $f$ be a permutation from $\mathbb{N}_0$ onto $\mathbb{N}_0$. Let $x\in\mathbb{N}_0$ and consider a (finite or infinite) sequence $s= (x,f(x),f^2(x),\cdots)$. We call $s$ a permutation sequence. Let $D$ be the set of elements of $s$. If…

A meander system is a union of two arc systems that represent non-crossing pairings of the set $[2n] = \{1, \ldots, 2n\}$ in the upper and lower half-plane. In this paper, we consider random meander systems. We show that for a class of…

We enumerate permutations in the two permutation classes $\text{Av}_n(312, 4321)$ and $\text{Av}_n(321, 4123)$ by the number of cycles each permutation admits. We also refine this enumeration with respect to several statistics.

A system of commutative complex numbers in 5 dimensions of the form u=x_0+h_1x_1+h_2x_2+h_3x_3+h_4x_4 is described in this paper, the variables x_0, x_1, x_2, x_3, x_4 being real numbers. The operations of addition and multiplication of the…

Classes of polynomial differential equations of degree n are considered. An explicit upper bound on the size of the coefficients are given which implies that each equation in the class has exactly n complex periodic solutions. In most of…

This paper studies the largest cycles consisted by the quadratic residues modulo prime numbers. We give some formulae about the maximum length of the cycles. Especially, the formula for modulo Fermat primes is given.

The periodic (ordinal) patterns of a map are the permutations realized by the relative order of the points in its periodic orbits. We give a combinatorial characterization of the periodic patterns of an arbitrary signed shift, in terms of…

Let $K$ be a global function field of characteristic $p$ and degree $D$ over $\mathbb F_{p}(t)$. We consider dynamical systems over the projective line $\mathbb P^1(K)$ defined by rational maps with at most one prime of bad reduction. The…

An existing dialogue between number theory and dynamical systems is advanced. A combinatorial device gives necessary and sufficient conditions for a sequence of non-negative integers to count the periodic points in a dynamical system. This…

We study the rational dynamics of the map $\mathcal{T}(x)=\lfloor x\rfloor(1+\{x\})$, which appears in the recursive construction of the prime-representing constant of Fridman, Garbulsky, Glecer, Grime and Florentin. For a rational number…

Cycle integrals of modular functions are expected to play a role in real quadratic analogue of singular moduli. In this paper, we extend the definition of cycle integrals of modular functions from real quadratic numbers to badly…

We present a deterministic algorithm that given any directed graph on n vertices computes the parity of its number of Hamiltonian cycles in O(1.619^n) time and polynomial space. For bipartite graphs, we give a 1.5^n poly(n) expected time…

We study unitary representations associated to cocycles of measurable dynamical systems. Our main result establishes conditions on a cocycle, ensuring that ergodicity of the dynamical system under consideration is equivalent to…

Evolutionary dynamics provides an iconic relationship --- the periodic frequency of a game is determined by the payoff matrix of the game. This paper reports the first experimental evidence to demonstrate this relationship. Evidence comes…

We compute the number of equivalence classes of nonperiodic covering cycles of given length in a non oriented connected graph. A covering cycle is a closed path that traverses each edge of the graph at least once. A special case is the…

Given a constant $\alpha>0$, an $n$-vertex graph is called an $\alpha$-expander if every set $X$ of at most $n/2$ vertices in $G$ has an external neighborhood of size at least $\alpha|X|$. Addressing a question posed by Friedman and…