Related papers: Complexity of Nilsystems and systems lacking nilfa…
We show a continuity result for the Weyl pseudometric on subshifts which are generated by model sets. This fact is then used for multiple constructions of subshifts that exhibit different behavior regarding entropy, amorphic complexity and…
We explore the relation between the topological relevance of a node in a complex network and the individual dynamics it exhibits. When the system is weakly coupled, the effect of the coupling strength against the dynamical complexity of the…
In the framework of certain general probability theories of single systems, we identify various nonclassical features such as incompatibility, multiple pure-state decomposability, measurement disturbance, no-cloning and the impossibility of…
In topological dynamics, tame and null systems arise naturally in the study of low-complexity aperiodic behaviour, yet providing concrete and easily testable conditions to establish their existence in a canonical class of systems is often…
We consider the population dynamics of a set of species whose network of catalytic interactions is described by a directed graph. The relationship between the attractors of this dynamics and the underlying graph theoretic structures like…
The true complexity of a polynomial progression in finite fields corresponds to the smallest-degree Gowers norm that controls the counting operator of the progression over finite fields of large characteristic. We give a conjecture that…
Regardless of a system's complexity or scale, its growth can be considered to be a spontaneous thermodynamic response to a local convergence of down-gradient material flows. Here it is shown how growth can be constrained to a few distinct…
We study the limiting behavior of multiple ergodic averages involving sequences of integers that satisfy some regularity conditions and have polynomial growth. We show that for "typical" choices of Hardy field functions $a(t)$ with…
For a class of flows on polytopes, including many examples from Evolutionary Game Theory, we describe a piecewise linear model which encapsulates the asymptotic dynamics along the heteroclinic network formed out of the polytope's vertexes…
In this paper we study the existence of heteroclinic cycles in generic unfoldings of nilpotent singularities. Namely we prove that any nilpotent singularity of codimension four in $\mathbb{R}^4$ unfolds generically a bifurcation…
In this paper we study the dynamics of a general non-autonomous dynamical system generated by a family of continuous self maps on a compact space $X$. We derive necessary and sufficient conditions for the system to exhibit complex dynamical…
We consider the outer billiards map with contraction outside polygons. We construct a 1-parameter family of systems such that each system has an open set in which the dynamics is reduced to that of a piecewise contraction on the interval.…
In this paper, we show local smooth rigidity for higher rank ergodic nilpotent action by toral automorphisms and prove the existence of such action on any torus TN for any even N ? 6. We also give examples of smooth rigidity of actions…
Disordered systems theory provides powerful tools to analyze the generic behaviors of highdimensional systems, such as species-rich ecological communities or neural networks. By assuming randomness in their interactions, universality…
This paper characterizes the annealed, topological complexity (both of total critical points and of local minima) of the elastic manifold. This classical model of a disordered elastic system captures point configurations with…
A novel topological and computational method for 'motion' is described. Motion is constrained by inequalities in terms of Kolmogorov Complexity. Causality is obtained as the output of a high-pass filter, passing through only high values of…
Using tools from computable analysis we develop a notion of effectiveness for general dynamical systems as those group actions on arbitrary spaces that contain a computable representative in their topological conjugacy class. Most natural…
Any nonsingular function of spin j matrices always reduces to a matrix polynomial of order 2j. The challenge is to find a convenient form for the coefficients of the matrix polynomial. The theory of biorthogonal systems is a useful…
The complexity of the equation solvability problem is known for nilpotent groups, for not solvable groups and for some semidirect products of Abelian groups. We provide a new polynomial time algorithm for deciding the equation solvability…
We introduce a class of group endomorphisms -- those of finite combinatorial rank -- exhibiting slow orbit growth. An associated Dirichlet series is used to obtain an exact orbit counting formula, and in the connected case this series is…