Searcharxiv⌕ 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

Sobriety of Scott topologies under countability conditions

In this paper, we focus on the sobriety of the Scott topology in countable case. Specifically, we show that: (1) every meet-continuous core-compact countable dcpo is sober with respect to the Scott topology; (2)every countable locally compact dcpo is sober endowed with the Scott topology; (3) the lattice of all open sets for the rational numbers space Q equipped with the Scott topology is not sober.

math.GN↗
arXiv2026

Scott--Isbell Coincidence for Continuous Dcpos beyond Bicompleteness

Lawson and Mislove posed the following problem in 1990 as Problem~535 in \emph{Open Problems in Topology}: for a core-compact space \(X\) and a dcpo \(P\) equipped with its Scott topology, under what conditions on \(P\) do the Isbell and Scott topologies on \(C(X,P)\) agree?It was proved that, for a nonempty bicomplete continuous dcpo \(P\), the Isbell and Scott topologies on \(C(X,P)\) coincide for every core-compact space \(X\) if and only if \(P\) is bounded complete; for every compact core-compact space \(X\) if and only if \(P\) is conditionally bounded complete; and for every RW-space \(X\) if and only if \(P\) is a pointed continuous \(L\)-domain.We remove the bicompleteness assumption from all three classifications by combining the forbidden-retract theorem of Jia, Jung and Li with a separation theorem for powers of downward well-ordered chains and suitable Alexandrov test spaces.

math.GN↗
arXiv2026

Primeless proofs of the Menger and Rothberger games

We continue the study of the Menger and Rothberger games on lattices initiated in arXiv:2102.12901. This time, we extend the earlier results by dropping some hypotheses that turned out to be unnecessary, and use Stone duality to recover known game characterizations for dense open families. We also give a formulation of Ufin for partially ordered sets and prove its game characterization without any lattice assumption. Finally, almost disjoint families give complete distributive lattices on which the selection principles and the corresponding games differ. We obtain lower bounds $\operatorname{cov}(\mathcal M)$ and $\mathfrak d$ for the least sizes of such counterexamples.

math.GN↗