Related papers: Attractors of Parikh mapping iterations
We construct a family of birational maps acting on two dimensional projective varieties, for which the growth of the degrees of the iterates is cubic. It is known that this growth can be bounded, linear, quadratic or exponential for such…
We examine a family of 3-point mappings that include mappings solvable through linearization. The different origins of mappings of this type are examined: projective equations and Gambier systems. The integrable cases are obtained through…
The Mapper produces a compact summary of high dimensional data as a simplicial complex. We study the problem of quantifying the interestingness of subpopulations in a Mapper, which appear as long paths, flares, or loops. First, we create a…
For a two parameter family of two-dimensional piecewise linear maps and for every natural number $ n $ we prove not only the existence of intervals of parameters for which the respective maps are $ n $ times renormalizable but also we show…
We consider the existence of robust strange nonchaotic attractors (SNA's) in a simple class of quasiperiodically forced systems. Rigorous results are presented demonstrating that the resulting attractors are strange in the sense that their…
Graphs are extremely versatile and ubiquitous mathematical structures with potential to model a wide range of domains. For this reason, graph problems have been of interest since the early days of computer science. Some of these problems…
We introduce a one-parameter family of polymatrix replicators defined in a three-dimensional cube and study its bifurcations. For a given interval of parameters, this family exhibits suspended horseshoes and persistent strange attractors.…
Guided by classical concepts, we define the notion of \emph{ends} of an iterated function system and prove that the number of ends is an upper bound for the number of nondegenerate components of its attractor. The remaining isolated points…
Planes are familiar mathematical objects which lie at the subtle boundary between continuous geometry and discrete combinatorics. A plane is geometrical, certainly, but the ways that two planes can interact break cleanly into discrete sets:…
We construct 9-parameter and 13-parameter dynamical systems of the plane which map bi-quadratic curves to other bi-quadratic curves and return to the original curve after two iterations. These generalize the QRT maps which map each such…
Mixture models on order relations play a central role in recent investigations of transitivity in binary choice data. In such a model, the vectors of choice probabilities are the convex combinations of the characteristic vectors of all…
We study some topological properties of attractors.
Any associative bilinear multiplication on the set of n-by-n matrices over some field of characteristic not two, that makes the same vectors orthogonal and has the same trace as ordinary matrix multiplication, must be ordinary matrix…
We compute the algebraic $K$-theory of some classes of surfaces defined over finite fields. We achieve this by first calculating the motivic cohomology groups and then studying the motivic Atiyah-Hirzebruch spectral sequence. In an…
We introduce a new class of filtrations indexed by attracting levels in dynamical systems, providing novel inputs for persistent homology and related methods in topological data analysis. These filtrations quantify, in a forward direction,…
Formulas are developed for the eight basis matrices {T^+,T^-,T^3,V^+,V^-,U^+,U^-,U^3} of the finite dimensional (p,q)-irreducible representation of SU(3). Two computer programs, one in an interpretive language and one in a compiled…
We introduce the notion of pattern in the context of lattice paths, and investigate it in the specific case of Dyck paths. Similarly to the case of permutations, the pattern-containment relation defines a poset structure on the set of all…
The Kaprekar transformation is uniquely determined by parameters based on differences between symmetric values in the ordered numeric sequence. The parametric analysis of the iteration of the process requires developing Ki functions that…
In some preference aggregation scenarios, voters' preferences are highly structured: e.g., the set of candidates may have one-dimensional structure (so that voters' preferences are single-peaked) or be described by a binary decision tree…
We provide generating functions for the popularity and the distribution of patterns of length at most three over the set of Dyck paths having a first return decomposition constrained by height.