Related papers: The Attractor-Cycle Notation for Finite Transforma…
The subject of this paper is the cycle structure of the random permutation $\sigma$ of $[N]$, which is the product of $k$ independent random cycles of maximal length $N$. We use the character-based Fourier transform to study the number of…
An infinite permutation $\alpha$ is a linear ordering of $\mathbb N$. We study properties of infinite permutations analogous to those of infinite words, and show some resemblances and some differences between permutations and words. In this…
A finite spin system invariant under a symmetry group G is a very illustrative example of the finite group action on a set of mappings f:X->Y. In the case of spin systems X is a set of spin carriers and Y contains 2s+1 z-components -s<=m<=s…
We study infinite words fixed by a morphism and their derived words. A derived word is a coding of return words to a factor. We exhibit two examples of sets of morphisms which are closed under derivation --- any derived word with respect to…
Minimizing finite automata, proving trace equivalence of labelled transition systems or representing sofic subshifts involve very similar arguments, which suggests the possibility of a unified formalism. We propose finite states…
The aim of this paper is to find an upper bound for the box-counting dimension of uniform attractors for non-autonomous dynamical systems. Contrary to the results in literature, we do not ask the symbol space to have finite box-counting…
We show that attractors are semicontinuous for closed relations on compact Hausdorff spaces. Semicontinuity is what guarantees that small changes to a system do not result in massive growth of certain features, notably attractors. That is,…
We study the functorial and growth properties of closed orbits for maps. By viewing an arbitrary sequence as the orbit-counting function for a map, iterates and Cartesian products of maps define new transformations between integer…
In the scalar-tensor theory of gravitation it seems nontrivial to establish if solutions of the cosmological equations in the presence of a cosmological constant behave as attractors independently of the initial values. We develop a general…
The paper introduces a new 4d dynamical system leading to a typical 4d strange attractor. Its focal statement appears in its total disconnection from previous 3D nonlinear systems.
Transformers are arguably the main workhorse in recent Natural Language Processing research. By definition a Transformer is invariant with respect to reordering of the input. However, language is inherently sequential and word order is…
A class of modified Duffing oscillator differential equations, having nonlinear damping forces, are shown to have finite time dynamics, i.e., the solutions oscillate with only a finite number of cycles, and, thereafter, the motion is zero.…
A cyclic permutation $\pi:\{1, \dots, N\}\to \{1, \dots, N\}$ has a \emph{block structure} if there is a partition of $\{1, \dots, N\}$ into $k\notin\{1,N\}$ segments (\emph{blocks}) permuted by $\pi$; call $k$ the \emph{period} of this…
We identify the phase of a cycle as a new critical factor for tipping points (critical transitions) in cyclic systems subject to time-varying external conditions. As an example, we consider how contemporary climate variability induces…
We give new call-by-value calculi of control operators that are complete for the continuation-passing style semantics. Various anticipated computational properties are induced from the completeness. In the first part of a series of papers,…
We introduce a new combinatorial object called tower diagrams and prove fundamental properties of these objects. We also introduce an algorithm that allows us to slide words to tower diagrams. We show that the algorithm is well-defined only…
In this paper, we enumerate the pairs of permutations that are long cycles and whose product has a given cycle-type. Our main result is a simple relation concerning the desired numbers for a few related cycle-types. The relation refines a…
This dissertation presents a multifaceted look into the structural decomposition of permutation classes. The theory of permutation patterns is a rich and varied field, and is a prime example of how an accessible and intuitive definition…
The review presents a parameter switching algorithm and his applications which allows numerical approximation of any attractor of a class of continuous-time dynamical systems depending linearly on a real parameter. The considered classes of…
We \emph{propose} a new \emph{invariant} for a \emph{cycle} of an \emph{interval map} $f:[0,1] \to [0,1]$, called its \emph{unfolding number}.