English
Related papers

Related papers: An answer to Furstenberg's problem on topological …

200 papers

We show that topological mixing, weak mixing and total transitivity are equivalent for coded systems. We provide an example of a mixing coded system which cannot be approximated by any increasing sequence of mixing shifts of finite type,…

Dynamical Systems · Mathematics 2015-03-11 Jeremias Epperlein , Dominik Kwietniak , Piotr Oprocha

This work is a continuation of [13]. We study the linear disjointness between higher-order oscillating sequences and nonlinear dynamical systems. Specifically, we prove that any oscillating sequence of order $m=d+k-1$ and any simple…

Dynamical Systems · Mathematics 2025-11-12 Yunping Jiang

It is proved that any countable topological group in which the filter of neighborhoods of the identity element is not rapid contains a discrete set with precisely one nonisolated point. This gives a negative answer to Protasov's question on…

General Topology · Mathematics 2021-04-29 Evgenii Reznichenko , Ol'ga Sipacheva

In this work, we investigate the dynamics of a general non-autonomous system generated by a commutative family of homeomorphisms. In particular, we investigate properties such as periodicity, equicontinuity, minimality and transitivity for…

Dynamical Systems · Mathematics 2023-10-06 Sushmita Yadav , Puneet Sharma

Isaak posed the following problem. Suppose $T$ is a tournament having a minimum feedback arc set which induces an acyclic digraph with a hamiltonian path. Is it true that the maximum number of arc-disjoint cycles in $T$ equals the…

Combinatorics · Mathematics 2012-06-26 Jan Florek

In this paper, we consider the decomposition of multigraphs under minimum degree constraints and give a unified generalization of several results by various researchers. Let $G$ be a multigraph in which no quadrilaterals share edges with…

Combinatorics · Mathematics 2020-09-07 Qinghou Zeng , Chunlei Zu

A criterion is established for the transitivity of connectedness in a transfinite graph. Its proof is much shorter than a prior argument published previously for that criterion.

Combinatorics · Mathematics 2007-05-23 A. H. Zemanian

We proved in a previous work that Cattani-Sassone's higher dimensional transition systems can be interpreted as a small-orthogonality class of a topological locally finitely presentable category of weak higher dimensional transition…

Category Theory · Mathematics 2014-01-31 Philippe Gaucher

A topological dynamical system $(X,T)$ is called CF-Nil($k$) if it is strictly ergodic and the maximal measurable and maximal topological $k$-step pro-nilfactors coincide as measure preserving systems. Through constructing specific…

Dynamical Systems · Mathematics 2025-10-21 Kangbo Ouyang , Qinqi Wu

Let $X$ be a partially ordered set with the property that each family of order intervals of the form $[a,b],[a,\rightarrow )$ with the finite intersection property has a nonempty intersection. We show that every directed subset of $X$ has a…

General Topology · Mathematics 2018-09-25 Rafael Espínola , Andrzej Wiśnicki

Menger's theorem says that, for $k\ge0$, if $S, T$ are sets of vertices in a graph $G$, then either there are $k + 1$ vertex-disjoint paths between $S$ and $T$, or there is a set X of at most $k$ vertices such that every $S$-$T$ path passes…

Combinatorics · Mathematics 2025-09-10 Tung Nguyen , Alex Scott , Paul Seymour

We study metric versions of transitivity, mixing, and hypercyclicity for continuous maps, based on intersections of the form \( f^{n}(U)\cap B_{\delta}(V)\neq\varnothing. \) We introduce $\delta$-topological transitivity,…

Functional Analysis · Mathematics 2026-04-21 Hadi Obaid Alshammari , Otmane Benchiheb , Dimitrios Chiotis

We consider finite systems of contractive homeomorphisms of a complete metric space, which are non-redundant on every level. In general this separation condition is weaker than the strong open set condition and is not equivalent to the weak…

Dynamical Systems · Mathematics 2009-11-12 T. Bedford , S. Borodachov , J. Geronimo

Let $G$ be the Grassmannian $G(d,n)$, let $X$ and $Y$ be complete irreducible varieties, and let $X\rightarrow G$ and $Y\rightarrow G$ be morphisms. Hansen proved that $X \times_G Y$ is connected when $codim f(X) + codim g(Y) < n$. We show…

alg-geom · Mathematics 2015-06-30 Olivier Debarre

In this work, we present several new findings regarding the concepts of orbit-transitivity, strict orbit-transitivity, $\omega$-transitivity, and $\mu$-open-set transitivity for self-maps on generalized topological spaces. Let $(X,\mu)$…

General Topology · Mathematics 2025-12-15 M. R. Ahmadi Zand , N. Baimani

Let $X$ be a compact metric space and let $f:X\rightarrow X$ be a homeomorphism on $X$. We show that if $f$ is both pointwise recurrent and expansive, then the dynamical system $(X, f)$ is topologically conjugate to a subshift of some…

Dynamical Systems · Mathematics 2022-01-04 Enhui Shi , Hui Xu , Ziqi Yu

A tantalizing open problem, posed independently by Stiebitz in 1995 and by Alon in 2006, asks whether for every pair of integers $s,t \ge 1$ there exists a finite number $F(s,t)$ such that the vertex set of every digraph of minimum…

Combinatorics · Mathematics 2025-07-02 Micha Christoph , Kalina Petrova , Raphael Steiner

Let $(X,T)$ and $(Y,S)$ be two topological dynamical systems, where $(X,T)$ has the weak specification property. Let $\xi$ be an invariant measure on the product system $(X\times Y, T\times S)$ with marginals $\mu$ on $X$ and $\nu$ on $Y$,…

Dynamical Systems · Mathematics 2024-11-20 Tomasz Downarowicz , Benjamin Weiss

The well-quasi-ordering (i.e., a well-founded quasi-ordering such that all antichains are finite) that defines well-structured transition systems (WSTS) is shown not to be the weakest hypothesis that implies decidability of the coverability…

Logic in Computer Science · Computer Science 2019-03-14 Michael Blondin , Alain Finkel , Pierre McKenzie

In this paper, we study properties of sensitivity, transitivity and chaos for non-autonomous discrete systems(NDS). Firstly, we present some different sufficient conditions for NDS to be chaotic. Then, we relate the transitivity with the…

Dynamical Systems · Mathematics 2024-10-18 Hongbo Zeng