Related papers: Rotational Interval Exchange Transformations
Lorentz transformation equations provide us a set of relations between the spacetime coordinates as observed from two different inertial frames. In case, one of the frames is moving with a uniform rectilinear acceleration we have Rindler's…
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…
We propose an integral transform, called metamorphism, which allow us to reduce the order of a differential equation. For example, the second order Helmholtz equation is transformed into a first order equation, which can be solved by the…
We prove the existence of recurrent initial configurations for the rotor walk on many graphs, including Z^d, and planar graphs with locally finite embeddings. We also prove that recurrence and transience of rotor walks are invariant under…
In this note we give a re-interpretation of the algebraic fundamental group for proper schemes that is rather close to the original definition of the fundamental group for topological spaces. The idea is to replace the standard interval…
A flow view is the graph of a measurable conjugacy $\Phi$ between a substitution or S-adic subshift $(\Sigma,\sigma, \mu)$ and an exchange of infinitely many intervals in $([0,1], F, m)$, where $m$ is Lebesgue measure. A natural refining…
We give a formula on the rotation number of a sequence of primitive vectors, which is a generalization of the formula on the rotation number of a unimodular sequence in \cite{Higashitani and Masuda}.
We try to define the more general form of iterative processes in which the Pomeau-Manneville and the Feigenbaum scenario may occur along with their specific scaling properties. Doing this we need to generalize other basic concepts. Thus,…
Signed shifts are generalizations of the shift map in which, interpreted as a map from the unit interval to itself sending x to the fractional part of Nx, some slopes are allowed to be negative. Permutations realized by the relative order…
The purpose of this paper is to survey the structure of closed and transitive transformation groups acting on a closed surface. In particular, we prove a number of relations between groups acting on the sphere that contain the rotation…
We examine the number of cycles of length k in a permutation, as a function on the symmetric group. We write it explicitly as a combination of characters of irreducible representations. This allows to study formation of long cycles in the…
It is a well-known fact that an exchangeable sequence has empirical distributions that form a reverse-martingale. This paper is devoted to proof of the converse statement. As a byproduct of the proof for the binary case, we introduce and…
Given a typical interval exchange transformation, we may naturally associate to it an infinite sequence of matrices through Rauzy induction. These matrices encode visitations of the induced interval exchange transformations within the…
A domain exchange map (DEM) is a dynamical system defined on a smooth Jordan domain which is a piecewise translation. We explain how to use cut-and-project sets to construct minimal DEMs. Specializing to the case in which the domain is a…
The interval poset of a permutation catalogues the intervals that appear in its one-line notation, according to set inclusion. We study this poset, describing its structural, characterizing, and enumerative properties.
Starting from any pseudo-Anosov map $\varphi$ on a surface of genus $g \geqslant 2$, we construct explicitly a family of Derived from pseudo-Anosov maps $f$ by adapting the construction of Smale's Derived from Anosov maps on the two-torus.…
The transformation of the partial fractional derivatives under spatial rotation in $R^2$ are derived for the Riemann-Liouville and Caputo definitions. These transformation properties link the observation of physical quantities, expressed…
This paper presents the first transformation that introduces both lock-freedom and recoverability. Our transformation starts with a lock-based implementation, and provides a recoverable, lock-free substitution to lock acquire and lock…
We consider partial matchings, which are finite graphs consisting of edges and vertices of degree zero or one. We consider transformations between two states of partial matchings. We introduce a method of presenting a transformation between…
We study the group of interval exchange transformations. Let $T$ be an $m$-interval exchange transformation. By the rank of $T$ we mean the dimension of the $\mathbb{Q}$-vector space spanned by the lengths of the exchanged subintervals. We…