Search arXivSearch

arXiv · 1112.5241

Introduction aux dynamiques catégoriques connectives

Abstract

This text is a continuation to my former article "On Connectivity Spaces". It takes into account that connectivity spaces gives rise to phenomena which are essentially dynamic. In a first stage, the representation of finite connectivity spaces by links (Brunn-Debrunner-Kanenobu's theorem) leads to the notion of connective representation. But examples of connective representations often come from dynamical systems. And this is even more obvious when we study the adjoint notion of connective foliation. To apply those notions to dynamics, we first need to consider dynamical systems in an unified way. This is done with a categorical point of view on temporalities and dynamics. It is then possible to define categorical connective dynamics, and to apply to them the various connective notions, specially the connectivity order of a connectivity space.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Stéphane Dugowson. 2011-12-22. Introduction aux dynamiques catégoriques connectives. https://arxiv.org/abs/1112.5241

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Effective equidistribution of orbits under semisimple groups on congruence quotients

We prove an effective equidistribution result for periodic orbits of semisimple groups on congruence quotients of an ambient semisimple group.This extends a previous work of Einsiedler, Margulis and Venkatesh. The main new feature is that we allow for periodic orbits of semisimple groups with nontrivial centralizer in the ambient group. Our proof uses crucially an effective closing lemma from work of the author with Lindenstrauss, Margulis,Mohammadi, and Shah.

math.DS

Generalized entropy of measure-induced maps

A classical result by E. Glasner and B. Weiss states that the topological entropy of a map $f$ is zero if and only if the topological entropy of its measure-induced map $f_*$ is zero, where $f_*$ is defined as the push-forward of a measure. In this work, we use generalized entropy to distinguish the complexity of these maps and prove that the measure-induced map is much more complex than the original map. Moreover, we introduce the generalized mean dimension, an invariant that is useful for distinguishing dynamical systems with zero mean dimension, including those with the small-boundary property, and we show a relationship between this new invariant and generalized entropy.

math.DS

The endpoint problem for $\varepsilon$-hypercyclicity

For a fixed $0<\varepsilon<1$, F. Bayart asked in 2024 whether there exists an operator $T$ such that, for every $0<δ<1$, $T$ is $δ$-hypercyclic if and only if $δ\in[\varepsilon,1)$. We answer this question affirmatively by constructing a weighted backward shift on $\ell_2(\mathbb N_0,\ell_2(\mathbb N_0))$ with this property.

math.DS