Related papers: The Attractor-Cycle Notation for Finite Transforma…
The beta transformation is the iterated map $\beta x\,\mod1$; it generates the base-$\beta$ expansion of a real number x. Every iterated piece-wise monotonic map is topologically conjugate to the beta transformation. For all but a countable…
This is my dissertation. Its research object is a symmetric group of permutations acting on a finite set. The density of permutations with a given cycle structure pattern is explored when the group order tends to infinity. New and sharper…
In this paper we study the fractal dimension of global attractors for a class of wave equations with (single-point) degenerate nonlocal damping. Both the equation and its linearization degenerate into linear wave equations at the degenerate…
A new mathematical notation is proposed for the iteration of functions. It facilitates the application of the iteration of functions in mathematical and logical expressions, definitions of sets, and formulations of algorithms. Illustrations…
In this paper we give explicit characterizations, based on the cutting and spacer parameters, of (a) which rank-one transformations factor onto a given finite cyclic permutation, (b) which rank-one transformations factor onto a given…
In this paper we show an alternative way of defining Fourier Series and Transform by using the concept of convolution with exponential signals. This approach has the advantage of simplifying proofs of transforms properties and, in our view,…
We investigate the combinatorics and geometry of permutation polytopes associated to cyclic permutation groups, i.e., the convex hulls of cyclic groups of permutation matrices. We give formulas for their dimension and vertex degree. In the…
An infinite permutation is a linear ordering of the set of non-negative integers. Generally, the properties of infinite permutations analogous to those of infinite words show some resemblances and some differences between permutations and…
We show the equivalence of two possible definitions of a rotational interval exchange transformation: by the first one, it is a first return map for a circle rotation onto a union of finite number of circle arcs, and by the second one, it…
We give a new expression for the number of factorizations of a full cycle into an ordered product of permutations of specified cycle types. This is done through purely algebraic means, extending work of Biane. We deduce from our result a…
We develop categorical foundations of discrete dynamical systems, aimed at understanding how the structure of the system affects its dynamics. The key technical innovation is the notion of a cycle set, which provides a formal language in…
A family of periodic perturbations of an attracting robust heteroclinic cycle defined on the two-sphere is studied by reducing the analysis to that of a one-parameter family of maps on a circle. The set of zeros of the family forms a…
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…
We consider the structure of roller coaster permutations as introduced by Ahmed & Snevily[1]. A roller coaster permutation is described as a permuta- tion that maximizes the total switches from ascending to descending or visa versa for the…
For evolution of flat universe, we classify late time and future attractors with scaling behavior of scalar field quintessence in the case of potential, which, at definite values of its parameters and initial data, corresponds to exact…
We consider a class of differential equations, $\ddot x + \gamma \dot x + g(x) = f(\omega t)$, with $\omega \in {\bf R}^{d}$, describing one-dimensional dissipative systems subject to a periodic or quasi-periodic (Diophantine) forcing. We…
An infinite permutation is a linear order on the set N. We study the properties of infinite permutations generated by fixed points of some uniform binary morphisms, and find the formula for their complexity.
We consider continuous, translation-commuting transformations of compact, translation-invariant families of mappingsfrom finitely generated groups into finite alphabets. It is well-known that such transformations and spaces can be described…
This paper introduces the notion of referring forms as a new metric for analyzing sequential circuits from a functional perspective. Sequential circuits are modeled as causal stream functions, the outputs of which depend solely on the past…
The dynamics of a linear dynamical system over a finite field can be described by using the elementary divisors of the corresponding matrix. It is natural to extend the investigation to a general finite commutative ring. In a previous…