Related papers: On systems disjoint from all minimal systems

Let $(X, T)$ be a topological dynamical system. Denote by $h (T, K)$ and $h^B (T, K)$ the covering entropy and dimensional entropy of $K\subseteq X$, respectively. $(X, T)$ is called D-{\it lowerable} (resp. {\it lowerable}) if for each…

We prove that for every $\epsilon>0$ there exists a minimal diffeomorphism $f:\T^{2}\rightarrow\T^{2}$ of class $C^{3-\epsilon}$ and semiconjugate to an ergodic traslation, and have the following properties: zero entropy, sensitivity with…

We classify all finite 2-groups that have a cyclic or dihedral maximal subgroup and determine their automorphism groups. Based on this result, we classify all pairs $ (G,\mathcal{M}) $, such that $ G $ is a finite 2-group and $ \mathcal{M}…

If T is an ergodic automorphism of a Lebesgue probability space (X,A,m), the set of coboundries B = db =T(b)+b with symmetric difference + form a subgroup of the set of cocycles A. Using tools from descriptive set theory, Greg Hjorth showed…

We show that every sufficiently large r-regular digraph G which has linear degree and is a robust outexpander has an approximate decomposition into edge-disjoint Hamilton cycles, i.e. G contains a set of r-o(r) edge-disjoint Hamilton…

We study the automorphism groups of countable homogeneous directed graphs (and some additional homogeneous structures) from the point of view of topological dynamics. We determine precisely which of these automorphism groups are amenable…

We introduce (weak) oddomorphisms of graphs which are homomorphisms with additional constraints based on parity. These maps turn out to have interesting properties (e.g., they preserve planarity), particularly in relation to homomorphism…

It is shown how to model any automorphism of a totally disconnected, locally compact group by a symbolic dynamical system. The model is an inverse limit of a product of a full-shift, on a finite number of symbols, with one of two types of…

We characterize the class of infinite connected graphs $ G $ for which there exists a $ T $-join for any choice of an infinite $ T \subseteq V(G) $. We also show that the following well-known fact remains true in the infinite case. If $ G $…

We show that every simple planar near-triangulation with minimum degree at least three contains two disjoint total dominating sets. The class includes all simple planar triangulations other than the triangle. This affirms a conjecture of…

A dynamical version of the Bourgain-Fremlin-Talagrand dichotomy shows that the enveloping semigroup of a dynamical system is either very large and contains a topological copy of $\beta \N$, or it is a "tame" topological space whose topology…

A compact space $X$ is said to be minimal if there exists a map $f:X\to X$ such that the forward orbit of any point is dense in $X$. We consider rigid minimal spaces, motivated by recent results of Downarowicz, Snoha, and Tywoniuk [J. Dyn.…

For two not necessarily commutative topological groups G and T, let H(G,T) denote the space of all continuous homomorphisms from G to T with the compact-open topology. We prove that if G is metrizable and T is compact then H(G,T) is a…

For an infinite discrete group $G$ acting on a compact metric space $X$, we introduce several weak versions of equicontinuity along subsets of $G$ and show that if a minimal system $(X,G)$ admits an invariant measure then $(X,G)$ is distal…

It is known that if a compact metric space X admits a minimal expansive homeomorphism then X is totally disconnected. In this note we give a short proof of this result and we analyze its extension to expansive flows.

In this note we consider dynamical systems $(X,G)$ on a Cantor set $X$ satisfying some mild technical conditions. The considered class includes, in particular, minimal and transitive aperiodic systems. We prove that two such systems…

A graph is a ``$k$-Kuratowski graph'' if it has exactly $k$ components, each isomorphic to $K_5$ or to $K_{3,3}$. We prove that if a graph $G$ contains no $k$-Kuratowski graph as a minor,then there is a set $X$ of boundedly many vertices…

In this paper we characterize the definiteness of the discrete symplectic system, study a nonhomogeneous discrete symplectic system, and introduce the minimal and maximal linear relations associated with these systems. Fundamental…

The {\em disjointness graph} of a set system is a graph whose vertices are the sets, two being connected by an edge if and only if they are disjoint. It is known that the disjointness graph $G$ of any system of segments in the plane is {\em…

Bermond and Thomassen conjectured that every digraph with minimum outdegree at least $2k-1$ contains $k$ vertex disjoint cycles. So far the conjecture was verified for $k\le 3$. Here we generalise the question asking for all outdegree…