Related papers: Sharkovsky's Ordering in the Mandelbrot Set
The Decoration Conjecture describes the structure of the set of braid types of Smale's horseshoe map ordered by forcing, providing information about the order in which periodic orbits can appear when a horseshoe is created. A proof of this…
A follow-up to my previous tutorial on metric indexing, this paper walks through the classic structures, placing them all in the context of the recently proposed "sprawl of ambits" framework. The indexes are presented as configurations of a…
The class of closed graphs by a linear ordering on their sets of vertices is investigated. A recent characterization of such a class of graphs is analyzed by using tools from the proper interval graph theory.
Given a Bratteli diagram B, we study the set O(B) of all possible orderings w on a Bratteli diagram B and its subset P(B) consisting of `perfect' orderings that produce Bratteli-Vershik dynamical systems (Vershik maps). We give necessary…
The Fisher-Shannon complexity plane is a powerful tool that represents complex dynamics in a two-dimensional plane. It locates a dynamical system based upon its entropy and its Fisher Information Measure (FIM). It has been recently shown…
We show the nonequivalence of combinations of several natural geometric restrictions on trapezoid representations of trapezoid orders. Each of the properties unit parallelogram, unit trapezoid and proper parallelogram, unit trapezoid and…
For every flat surface, almost every flat surface in its $\mathsf{SL}(2,\mathbb{R})$ orbit has the following property: the sequence of its saddle connection lengths in non-decreasing order is uniformly distributed in the unit interval.
In this paper, we consider the dynamics of a skew-product map defined on the Cartesian product of the symbolic one-sided shift space on $N$ symbols and the complex sphere where we allow $N$ rational maps, $R_{1}, R_{2}, \cdots, R_{N}$, each…
The rotor walk is a derandomized version of the random walk on a graph. On successive visits to any given vertex, the walker is routed to each of the neighboring vertices in some fixed cyclic order, rather than to a random sequence of…
We identify a new and important global (or non-binary) constraint. This constraint ensures that the values taken by two vectors of variables, when viewed as multisets, are ordered. This constraint is useful for a number of different…
Motivated by recent experimental progress in transition metal oxides with the K$_2$NiF$_4$ structure, we investigate the magnetic and orbital ordering in $\alpha$-Sr$_2$CrO$_4$. Using first principles calculations, first we derive a…
This paper contains the details and complete proofs of our earlier announcement in math.AG/9907004 . We construct a general semiregularity map for algebraic cycles as asked for by S. Bloch in 1972. The existence of such a semiregularity map…
We provide an expository account of some of the Hopf algebras that can be defined using trees, labeled trees, ordered trees and heap ordered trees. We also describe some actions of these Hopf algebras on algebra of functions.
A new tree model is introduced based on ordered trees, by distinguishing exactly one child of each node that \emph{has} children. The basic enumeration leads to a cubic equation of the generating function. The extraction of its coefficients…
We count invertible Schr\"odinger operators (perturbations by diagonal matrices of the adjacency matrix) over finite fieldsfor trees, cycles and complete graphs.This is achieved for trees through the definition and use of local invariants…
In this paper we investigate a quantity called conditional entropy of ordinal patterns, akin to the permutation entropy. The conditional entropy of ordinal patterns describes the average diversity of the ordinal patterns succeeding a given…
We introduce a sequent calculus with a simple restriction of Lambek's product rules that precisely captures the classical Tamari order, i.e., the partial order on fully-bracketed words (equivalently, binary trees) induced by a…
We consider perturbations of interval maps with indifferent fixed points, which we refer to as wobbly interval intermittent maps, for which stable laws for general H\"older observables fail. We obtain limit laws for such maps and H\"older…
We have recently presented strong evidence that chaotic orbits that obey one isolating integral besides energy exist in a toy Hamiltonian model with three degrees of freedom and are bounded by regular orbits that isolate them from the…
Forbidden ordinal patterns are ordinal patterns (or `rank blocks') that cannot appear in the orbits generated by a map taking values on a linearly ordered space, in which case we say that the map has forbidden patterns. Once a map has a…