Related papers: Forcing Minimal Interval Patterns as Interval Exch…
We employ techniques from optimal transport in order to prove decay of transfer operators associated to iterated functions systems and expanding maps, giving rise to a new proof without requiring a Doeblin-Fortet (or Lasota-Yorke)…
A number of mechanisms that lead to the confinement of patterns to a small part of a translationally symmetric pattern-forming system are reviewed: nonadiabatic locking of fronts, global coupling and conservation laws, dispersion, and…
Juggling patterns can be mathematically modeled as closed walks within directed state graphs. In this paper, we present a unified framework of unbounded juggling patterns and its variations (including multiplex, colored, and passing)…
We study the asymptotical behaviour of iterates of piecewise contractive maps of the interval. It is known that Poincar\'e first return maps induced by some Cherry flows on transverse intervals are, up to topological conjugacy, piecewise…
We study multidimensional minimal and quasiperiodic shifts of finite type. We prove for these classes several results that were previously known for the shifts of finite type in general, without restriction. We show that some quasiperiodic…
The thermal ratchets model toggles a spatially periodic asymmetric potential to rectify random walks and achieve transport of diffusing particles. We numerically solve the governing equation for the full dynamics of an infinite 1D ratchet…
A rotated odometer is an infinite interval exchange transformation (IET) obtained as a composition of the von Neumann-Kakutani map and a finite IET of intervals of equal length. In this paper, we consider rotated odometers for which the…
For almost all interval exchange maps T_0, with combinatorics of genus g>=2, we construct affine interval exchange maps T which are semi-conjugate to T_0 and have a wandering interval.
We characterize the minimum-length sequences of independent lazy simple transpositions whose composition is a uniformly random permutation. For every reduced word of the reverse permutation there is exactly one valid way to assign…
A natural generalization of interval exchange maps are linear involutions, first introduced by Danthony and Nogueira. Recurrent train tracks with a single switch which we call non-classical interval exchanges, form a subclass of linear…
There have been two separate lines of work on estimating Ising models: (1) estimating them from multiple independent samples under minimal assumptions about the model's interaction matrix; and (2) estimating them from one sample in…
This paper presents a non-minimal order dynamics model for many analysis, simulation, and control problems of constrained mechanical systems with switching topology by making use of linear projection operator. The distinct features of this…
We study discrete time linear constrained switching systems with additive disturbances, in which the switching may be on the system matrices, the disturbance sets, the state constraint sets or a combination of the above. In our general…
We show that every transformation is disjoint from almost every interval exchange transformation (IET), answering a question of Bufetov. In particular, we prove that almost every pair of IETs is disjoint. It follows that the product of…
An extension of the Kinetic Ising model with nonuniform coupling constants on a one-dimensional lattice with boundaries is investigated, and the relaxation of such a system towards its equilibrium is studied. Using a transfer matrix method,…
Twist operators implement symmetries in bounder regions of the space. Standard twists are a special class of twists constructed using modular tools. The twists corresponding to translations have interesting special properties. They can move…
We show that an atomic system in a periodically modulated optical trap displays an ideal mean-field symmetry-breaking transition. The symmetry is broken with respect to time translation by the modulation period. The transition is due to the…
Strong stability, defined by bounds that decay not only over time but also with the number of impulses, has been established as a requirement to ensure robustness properties for impulsive systems with respect to inputs or disturbances. Most…
We address the stability problem for linear switching systems with mode-dependent restrictions on the switching intervals. Their lengths can be bounded as from below (the guaranteed dwell-time) as from above. The upper bounds make this…
The scope of this paper is two-fold. First, to present to the researchers in combinatorics an interesting implementation of permutations avoiding generalized patterns in the framework of discrete-time dynamical systems. Indeed, the orbits…