Related papers: Generalized Recurrence and the Nonwandering Set fo…

Let $(X,T)$ be a topological dynamical system. Given a continuous vector-valued function $F \in C(X, \mathbb{R}^{d})$ called a potential we define its rotation set $R(F)$ as the set of integrals of $F$ with respect to all $T$-invariant…

Given two regular graphs with consistent rotation maps, we produce a constructive method for a consistent rotation map on their Cartesian product. This method will be given as a simple set of rules of addition and table look ups. We assume…

Different notions on regularity of sets and of collection of sets play an important role in the analysis of the convergence of projection algorithms in nonconvex scenarios. While some projection algorithms can be applied to feasibility…

We consider the period-doubling and intermittency transitions in iterated nonlinear one-dimensional maps to corroborate unambiguously the validity of Tsallis' non-extensive statistics at these critical points. We study the map…

In this paper, we introduce a commutative mappings satisfying the class of generalized non-expansive mappings which is wider than the class of mappings satisfying the condition (C), so called Condition B gamma, mu. The results obtained in…

In the present paper, for a pair $(G,N)$ of a group $G$ and its normal subgroup $N$, we consider the mixed commutator length $\mathrm{cl}_{G,N}$ on the mixed commutator subgroup $[G,N]$. We focus on the setting of wreath products: $…

Given a topological group $ G $ and a Hausdorff topological group $ A $ on which $ G $ acts continuously and compatibly with the group operation of $ A $, we study the set of continuous cocycles of $ G $ with value in $ A $. This set is a…

We introduce a new matrix product, that we call the wreath product of matrices. The name is inspired by the analogous product for graphs, and the following important correspondence is proven: the wreath product of the adjacency matrices of…

The goal of this article is to show a rigidity property of conjugacies of generalized interval exchange transformations (GIETs). More precisely, we show that if two piecewise $C^3$ GIETs $f$ and $g$ of generic rotation number with…

A longest sequence $(v_1,\ldots,v_k)$ of vertices of a graph $G$ is a Grundy total dominating sequence of $G$ if for all $i$, $N(v_i) \setminus \bigcup_{j=1}^{i-1}N(v_j)\not=\emptyset$. The length $k$ of the sequence is called the Grundy…

The warped product $N_1\times_f N_2$ of two Riemannian manifolds $(N_1,g_1)$ and $(N_2,g_2)$ is the product manifold $N_1\times N_2$ equipped with the warped product metric $g=g_1+f^2 g_2$, where $f$ is a positive function on $N_1$. The…

We study chain-recurrence and chain-transitivity in compact dynamical systems without any regularity assumptions on the map. We prove that every compact system has a chain-recurrent point and a closed, invariant, chain-transitive subsystem.…

On a reduced analytic space $X$ we introduce the concept of a generalized cycle, which extends the notion of a formal sum of analytic subspaces to include also a form part. We then consider a suitable equivalence relation and corresponding…

Let $F \subseteq \mathbb{R}^2$ be a Bedford-McMullen carpet defined by multiplicatively independent exponents, and suppose that either $F$ is not a product set, or it is a product set with marginals of dimension strictly between $0$ and…

Generic computability has been studied in group theory and we now study it in the context of classical computability theory. A set A of natural numbers is generically computable if there is a partial computable function f whose domain has…

Let $(X,d)$ be a compact metric space and $(X,\mathcal{A},\mu,T)$ a measure preserving dynamical system. Furthermore, given a real, positive function $\psi$, let $W(T, \psi)$ and $ R(T,\psi) $ respectively denote the shrinking target set…

Suppose that G and H are finite, connected graphs, G regular, X is a lazy random walk on G and Z is a reversible ergodic Markov chain on H. The generalized lamplighter chain X* associated with X and Z is the random walk on the wreath…

All physical observations are made relative to a reference frame, which is a system in its own right. If the system of interest admits a group symmetry, the reference frame observing it must transform commensurately under the group to…

Gated recurrent units (GRUs) are specialized memory elements for building recurrent neural networks. Despite their incredible success on various tasks, including extracting dynamics underlying neural data, little is understood about the…

The Eynard-Orantin topological recursion relies on the geometry of a Riemann surface S and two meromorphic functions x and y on S. To formulate the recursion, one must assume that x has only simple ramification points. In this paper we…