Related papers: Forcing Minimal Interval Patterns as Interval Exch…
We prove that for continuous maps on the interval, the existence of an n-cycle, implies the existence of n-1 points which interwind the original ones and are permuted by the map. We then use this combinatorial result to show that piecewise…
Continuous interpolates are described for classical dynamical systems defined by discrete time-steps. Functional conjugation methods play a central role in obtaining the interpolations. The interpolates correspond to particle motion in an…
We develop an Over Barrier Model for computing charge exchange between ions and one-active-electron atoms at low impact energies. The main feature of the model is the treatment of the barrier crossing process by the electron within a…
An interval translation map (ITM) is a piece-wise translation $T \colon I \to I$ defined on a finite partition $I_1, \ldots, I_r$ of an interval $I$ into $r \ge 2$ subintervals. In contrast to classical interval exchange transformations…
The electron transmission $T$ is evaluated through waveguides, in which the strength of the spin-orbit interaction(SOI) $\alpha$ is varied periodically, using the transfer-matrix technique. It is shown that $T$ exhibits a {\it…
In this contribution, the transitivity property of commutative first-order linear time-varying systems is investigated with and without initial conditions. It is proven that transitivity property of first-order systems holds with and…
Given any two forests with the same degree sequence, we show in an algorithmic way that one can be transformed into the other by a sequence of 2-switches in such a way that all the intermediate graphs of the transformation are forests. We…
In order to investigate the role of the weight in weighted networks, the collective behavior of the Ising system on weighted regular networks is studied by numerical simulation. In our model, the coupling strength between spins is inversely…
We describe the infinite interval exchange transformations, called the rotated odometers, that are obtained as compositions of finite interval exchange transformations and the von Neumann-Kakutani map. We show that with respect to Lebesgue…
We consider an extension of the interchange process on the complete graph, in which a fraction of the transpositions are replaced by `reversals'. The model is motivated by statistical physics, where it plays a role in stochastic…
This paper studies permutation tests for regression parameters in a time series setting, where the time series is assumed stationary but may exhibit an arbitrary (but weak) dependence structure. In such a setting, it is perhaps surprising…
We study an interval exchange transformation of [0,1] formed by cutting the interval at the points 1/n and reversing the order of the intervals. We find that the transformation is periodic away from a Cantor set of Hausdorff dimension zero.…
An adjacent $q$-cycle is a natural generalization of an adjacent transposition. We show that the number of adjacent $q$-cycles in a permutation maps to the sum of occurrences of two mesh patterns under Foata's fundamental transformation. As…
Recently it has been shown, in several settings, how to carry out adaptive control for an LTI plant so that a convolution bound holds on the closed-loop behavior; this, in turn, has been leveraged to prove robustness of the closed-loop…
Consider a finite sequence of permutations of the elements 1,...,n, with the property that each element changes its position by at most 1 from any permutation to the next. We call such a sequence a tangle, and we define a move of element i…
We present a new, high-level approach for the specification of model-to-model transformations based on declarative patterns. These are (atomic or composite) constraints on triple graphs declaring the allowed or forbidden relationships…
In this paper we study the non-injectivity arising in infinite interval exchange transformations. In particular, we build and analyze an infinite family of infinite interval exchanges semi-conjugated to generalized Thue-Morse subshifts,…
Generalized interval exchange transformations (GIETs) are semi-conjugate to interval exchange transformations (IETs) when the Rauzy-Veech combinatorics is $\infty$-complete. When this semi-conjugacy is a homeomorphism, a fundamental problem…
A natural generalization of interval exchange maps are linear involutions, first introduced by Danthony and Nogueira. Recurrent train tracks with a single switch provide a subclass of linear involutions. We call such linear involutions…
We study the phenomenon of composite operator renormalization and mixing in systems where time-translational invariance is broken and the evolution is out-of-equilibrium. We show that composite operators mix also through non-local memory…