Related papers: Connectedness in structures on the real numbers: o…
We continue the analysis of definably compact groups definable in a real closed field $\mathcal{R}$. In [3], we proved that for every definably compact definably connected semialgebraic group $G$ over $\mathcal{R}$ there are a connected…
We study the subsets of metric spaces that are negligible for the infimal length of connecting curves; such sets are called metrically removable. In particular, we show that every totally disconnected set with finite Hausdorff measure of…
We develop tame topology over dp-minimal structures equipped with definable uniformities satisfying certain assumptions. Our assumptions are enough to ensure that definable sets are tame: there is a good notion of dimension on definable…
A $k$-connected set in an infinite graph, where $k > 0$ is an integer, is a set of vertices such that any two of its subsets of the same size $\ell \leq k$ can be connected by $\ell$ disjoint paths in the whole graph. We characterise the…
A bound for Betti numbers of sets definable in o-minimal structures is presented. An axiomatic complexity measure is defined, allowing various concrete complexity measures for definable functions to be covered. This includes common concrete…
Proper classes of extensions of real field was defined and topological properties of these extensions were studied. These extensions can be connected, in this case such set is not closed under binary operations (addition and…
Let $\mathfrak{P}$ be a topological property. We study the relation between the order structure of the set of all $\mathfrak{P}$-extensions of a completely regular space $X$ with compact remainder (partially ordered by the standard partial…
We continue investigating the structure of externally definable sets in NIP theories and preservation of NIP after expanding by new predicates. Most importantly: types over finite sets are uniformly definable; over a model, a family of…
The distinguishing number of a structure is the smallest size of a partition of its elements so that only the trivial automorphism of the structure preserves each cell of the partition. We show that for any countable subset of the positive…
The connectivity of a graph is an important parameter to evaluate its reliability. $k$-restricted connectivity (resp. $R^h$-restricted connectivity) of a graph $G$ is the minimum cardinality of a set $S$ of vertices in $G$, if exists, whose…
We show quantifier elimination theorems for real closed valued fields with separated analytic structure and overconvergent analytic structure in their natural one-sorted languages and deduce that such structures are weakly o-minimal. We…
We design an algorithm for computing connectivity in hypergraphs which runs in time $\hat O_r(p + \min\{\lambda^{\frac{r-3}{r-1}} n^2, n^r/\lambda^{r/(r-1)}\})$ (the $\hat O_r(\cdot)$ hides the terms subpolynomial in the main parameter and…
We study the structure of infinite discrete sets D definable in expansions of ordered Abelian groups whose theories are strong and definably complete, with particular emphasis on the set D' comprised of differences between successive…
We study the structure of the asymptotic expansion of the probability that a combinatorial object is connected. We show that the coefficients appearing in those asymptotics are integers and can be interpreted as the counting sequences of…
Bakker, Brunebarbe, Tsimerman showed in \cite{bakker2022minimal} that the definable structure sheaf $\mathcal{O}_{\mathbb{C}^n}$ of $\mathbb{C}^n$ is a coherent $\mathcal{O}_{\mathbb{C}^n}$-module as a sheaf on the site…
We prove the Zil'ber Trichotomy Principle for all 1-dimensional structures which are definable in o-minimal ones. In particular, we show that any stable 1-dimensional structure is necessarily locally modular. The main tool is a theory for…
This paper addresses some questions about dimension theory for P-minimal structures. We show that, for any definable set A, the dimension of the frontier of A is strictly smaller than the dimension of A itself, and that A has a…
The structures $\langle M,\subseteq^M\rangle$ arising as the inclusion relation of a countable model of sufficient set theory $\langle M,\in^M\rangle$, whether well-founded or not, are all isomorphic. These structures $\langle…
Connectivity is a fundamental structural feature of a network that determines the outcome of any dynamics that happens on top of it. However, an analytical approach to obtain connection probabilities between nodes associated to paths of…
We first prove that for all compact metrizable spaces, there exists a topological embedding of the compact metrizable space into each of the sets of compact metric spaces which are connected, path-connected, geodesic, or CAT(0), in the…