Related papers: Topologically mildly mixing of higher orders along…
For a given topological dynamical system $(X,T)$ over a compact set $X$ with a metric $d$, the "variational principle" states that \begin{equation*} \sup_{\mu}h_\mu(T) = h(T) = h_d(T), \end{equation*} where $h_\mu(T)$ is the…
We investigate topological mixing for Z and R actions associated with primitive substitutions on two letters. The characterization is complete if the second eigenvalue $\theta_2$ of the substitution matrix satisfies $|\theta_2|\ne 1$. If…
We consider a class of mechanical particle systems with deterministic particle-disk interactions coupled to Gibbs heat reservoirs at possibly different temperatures. We show that there exists a unique (non-equilibrium) steady state. This…
In this work we give a full characterization of sets of multiple polynomial recurrence in Weyl systems, which are ergodic unipotent affine transformations on products of tori and finite abelian groups. In particular, we show that measurable…
This paper defines and discusses the dimension notion of topological slow entropy of any subset for Z^d actions. Also, the notion of measure-theoretic slow entropy for Z^d actions is presented, which is modified from Brin and Katok [2].…
The symmetric inverse semigroup $I(X)$ on a set $X$ is the collection of all partial bijections between subsets of $X$ with composition as the algebraic operation. We study a minimal Hausdorff inverse semigroup topologies on $I(X)$. When…
In this note we study the topology of 3-dimensional initial data sets with horizons of a sort associated with asymptotically locally anti-de Sitter spacetimes. We show that, within this class, those initial data sets which contain no…
We show that the generator of a conservative IID random system whose dynamics expands on average codimension $1$ planes has an essential spectral radius strictly smaller than $1$ on Sobolev spaces of small positive index index.…
Let $G$ be a group, $\mathcal{P}_G$ be the family of all subsets of $G$. For a subset $A\subseteq G$, we put $\Delta(A)=\{g\in G:|gA\cap A|=\infty\}$. The mapping $\Delta:\mathcal{P}_G\rightarrow\mathcal{P}_G$, $A\mapsto\Delta(A)$, is…
We study the computational complexity of decomposing finite discrete dynamical systems (FDDSs) in terms of the semiring operations of alternative and synchronous execution, which is useful for the analysis of discrete phenomena in science…
In this paper we examine the percolation properties of higher-order networks that have non-trivial clustering and subgraph-based assortative mixing (the tendency of vertices to connect to other vertices based on subgraph joint degree). Our…
We study distribution of orbits sampled at polynomial times for uniquely ergodic topological dynamical systems $(X, T)$. First, we prove that if there exists an increasing sequence $(q_n)$ for which the rigidity condition \[…
This paper investigates the existence of Denjoy minimal sets and, more generally, strictly ergodic sets in the dynamics of iterated homeomorphisms. It is shown that for the full two-shift, the collection of such invariant sets with the weak…
A graph is said to be well-dominated if all its minimal dominating sets are of the same size. The class of well-dominated graphs forms a subclass of the well studied class of well-covered graphs. While the recognition problem for the class…
A graph $G$ is a DTDP-graph if it has a pair $(D,T)$ of disjoint sets of vertices of $G$ such that $D$ is a dominating set and $T$ is a total dominating set of $G$. Such graphs were studied in a number of research papers. In this paper we…
This paper studies topological definitions of chain recurrence and shadowing for continuous endomorphisms of topological groups generalizing the relevant concepts for metric spaces. It is proved that in this case the sets of chain recurrent…
We study nontrivial entropy invariants in the class of parabolic flows on homogeneous spaces, quasi-unipotent flows. We show that topological complexity (ie, slow entropy) can be computed directly from the Jordan block structure of the…
The vector field of a mixed-monotone system is decomposable via a decomposition function into increasing (cooperative) and decreasing (competitive) components, and this decomposition allows for, e.g., efficient computation of reachable sets…
In this paper, we describe a method for estimating the joint probability density from data samples by assuming that the underlying distribution can be decomposed as a mixture of product densities with few mixture components. Prior works…
Topological Signal Processing (TSP) over simplicial complexes is a framework that has been recently proposed, as a generalization of graph signal processing (GSP), to extend GSP to analyzing signals defined over sets of any order (i.e., not…