Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 0707.2542

Representation of finite connective spaces

Stéphane Dugowson
View original source ↗Read source document ↗Export metadata ↓

Abstract

After recalling the definition of connectivity spaces and some of their main properties, a way is proposed to represent finite connectivity spaces by directed simple graphs. Then a connectivity structure is associated to each tame link. It is showed that all spaces of a certain class (the iterated Brunnian ones) admit representations by links. Finally, I conjecture that every finite connectivity space is representable by a link. ----- Apres un rappel de la definition des espaces connectifs et de certaines de leurs principales proprietes, nous proposons une maniere de representer les espaces connectifs finis par des graphes simples orientes, puis nous associons a tout entrelacs une structure connective. Nous montrons que tout espace d'une certaine classe (les espaces brunniens iteres) admet une representation par entrelacs, et nous conjecturons finalement que tout espace connectif fini est representable par entrelacs.

Explore related subjects

math.GNmath.AT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Stéphane Dugowson. 2007-07-17. Representation of finite connective spaces. https://arxiv.org/abs/0707.2542

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

KEEP EXPLORING

Related papers

arXiv2026

Explicit Witnesses at Every Gap of the Depth Filtration of $β\mathbb{N}$

Let $Σ_{1} = \mathbb{N}^*$ and $Σ_{k+1} = \overline{\mathbb{N}^* + Σ_{k}}$ be the cumulative depth filtration of $β\mathbb{N}$, the analogue for $(\mathbb{N},+)$ of a chain of closed ideals that Protasov and Protasova studied for discrete groups, where strict descent follows from a theorem of Lutsenko and Protasov. For every $k$ we give an explicit set whose closure meets $Σ_{k}$ but not $Σ_{k+1}$. Fix the doubly exponential sequence $e_{n} = 2^{2^{n}}$, partition it into $k$ subsequences $E_{0}, \dots, E_{k-1}$ by the residue of the index modulo $k$, and set $A_{k} = E_{0} + \cdots + E_{k-1}$. We prove that any sum $q_{0} + \cdots + q_{k-1}$ of free ultrafilters with $E_{t} \in q_{t}$ lies in $Σ_{k} \setminus Σ_{k+1}$. The engine is a master lemma, proved by induction on $j$: if a sum $F_{1} + \cdots + F_{j}$ of subsequences of $\{e_{n}\}$ with pairwise disjoint index sets belongs to a free ultrafilter $s$, then $s \notin Σ_{j+1}$. The proof rests on a single rigidity of the doubly exponential sequence: a fixed difference forces the largest index in any shift-intersection, once it is large, to cancel within its own subsequence, which makes every shift-intersection descend by at least one level. The same witnesses lie in the gaps of the pure filtration.

math.GN↗
arXiv2026

Plasticity in graph metric spaces and their hyperspaces

A metric space is plastic if every bijective nonexpansive self-map is an isometry. We prove that the hyperspace of nonempty compact subsets of every connected, locally finite, regular graph, equipped with the Hausdorff metric associated with the path metric, is plastic. The proof identifies the sets with smallest unit balls as the nonempty subsets of adjacent-twin classes and shows that every nonexpansive bijection induces an automorphism of the quotient graph preserving the sizes of these classes. Singletons are preserved when there are no adjacent twins, but need not be preserved in general. We also prove that $\mathcal{K}(K\times G)$ is plastic for every compact connected metric space $K$ and every connected, locally finite, regular graph $G$, with the supremum metric on the product, and give a more general criterion for such products. Further results include a plastic metric space whose hyperspace is not plastic, plasticity of every tree, and plasticity of the hyperspace of a connected, locally finite graph with only finitely many vertices of minimum degree.

math.GN↗