Related papers: Discontinuity points of a function with a closed a…
We adapt the classical 3-decomposition of any 2-connected graph to the case of simple graphs (no loops or multiple edges). By analogy with the block-cutpoint tree of a connected graph, we deduce from this decomposition a bicolored tree…
It is a classical theorem of Alexandroff that a locally compact Hausdorff space has a one-point Hausdorff compactification if and only if it is non-compact. The one-point Hausdorff compactification is indeed obtained by adding the so called…
We axiomatize and generalize Markov's approach to the continuity problem for Type 1 computable functions, i.e. the problem of finding sufficient conditions on a computable topological space to obtain a theorem of the form "computable…
In this article it is proved, that every locally compact second countable group has a left invariant metric d, which generates the topology on G, and which is proper, ie. every closed d-bounded set in G is compact. Moreover, we obtain the…
Associativity of a two-place function $T: [0,1]^2\rightarrow [0,1]$ defined by $T(x,y)=f^{(-1)}(T^*(f(x),f(y)))$ where $T^*:[0,1]^2\rightarrow[0,1]$ is an associative function with neutral element in $[0,1]$, $f: [0,1]\rightarrow [0,1]$ is…
We observe a correspondence between collections of closed subgroups and normal subgroups in totally disconnected locally compact groups. This correspondence is applied to prove structure theorems for two classes of totally disconnected…
We prove that if $X$ is a paracompact space, $Y$ is a metric space and $f:X\to Y$ is a functionally fragmented map, then (i) $f$ is $\sigma$-discrete and functionally $F_\sigma$-measurable; (ii) $f$ is a Baire-one function, if $Y$ is weak…
We show that recent results of U. Baumgartner and G.A. Willis concerning contraction groups of automorphisms of metrizable, totally disconnected, locally compact groups remain valid also in the non-metrizable case, if one restricts…
The series of papers is devoted to the study of convergence for pairs of surfaces and smooth functions thereon. We model such pairs with varifolds and multiple-valued functions to capture their limits. In the present paper, we study Young…
We define direct sums and a corresponding notion of connectedness for graph limits. Every graph limit has a unique decomposition as a direct sum of connected components. As is well-known, graph limits may be represented by symmetric…
Associativity of a two-place function $T: [0,1]^2\rightarrow [0,1]$ defined by $T(x,y)=f^{(-1)}(F(f(x),f(y)))$ where $F:[0,\infty]^2\rightarrow[0,\infty]$ is an associative function, $f: [0,1]\rightarrow [0,\infty]$ is a monotone function…
A recent development in graph-minor theory is to study local separators, vertex-sets that separate graphs locally but not necessarily globally. The local separators of a graph roughly correspond to the genuine separators of its local…
We can approximate a continuous self-map $f$ of a compact metric space by discretizing the space into a grid. Through either the map itself or a time series, $f$ induces a multivalued grid map $\mathcal F$. The dynamical properties of…
A consistent path system in a graph $G$ is an collection of paths, with exactly one path between any two vertices in $G$. A path system is said to be consistent if it is intersection-closed. We say that $G$ is strictly metrizable if every…
We show that a continuous map $f$ from a quasi-graph $G$ to itself is pointwise recurrent if and only if one of the following two statements holds: (1) $X$ is a simple closed curve and $f$ is topologically conjugate to an irrational…
The connective constant $\mu(G)$ of a quasi-transitive graph $G$ is the exponential growth rate of the number of self-avoiding walks from a given origin. We prove a locality theorem for connective constants, namely, that the connective…
This paper is concerned with conditions under which a metric continuum (a compact connected metric space) contains a non-degenerate chainable continuum.
In this paper, we present new incremental algorithms for maintaining data structures that represent all connectivity cuts of size one in directed graphs (digraphs), and the strongly connected components that result by the removal of each of…
It is proved that any one-to-one edge map f from a 3-connected graph G onto a graph H, G and H possibly infinite, satisfying f(C) is a circuit in H whenever C is a circuit in G is induced by a vertex isomorphism. This generalizes a result…
In a series of three papers we develop an end space theory for digraphs. Here in the second paper we introduce the topological space $|D|$ formed by a digraph $D$ together with its ends and limit edges. We then characterise those digraphs…