Related papers: Tangles and the Stone-Cech compactification of inf…
A \emph{thrackle} is a graph drawn in the plane so that every pair of its edges meet exactly once, either at a common end vertex or in a proper crossing. Conway's thrackle conjecture states that the number of edges is at most the number of…
Indecomposable symmetric Lorentzian manifolds of non-constant curvature are called Cahen-Wallach spaces. Their isometry classes are described by continuous families of real parameters. We derive necessary and sufficient conditions for the…
Tangle is a concept in graph theory that has a dual relationship with branch-width which is well-known graph width parameter. Ultrafilter, a fundamental notion in mathematics, is similarly known to have a dual relationship with branch-width…
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…
The Boolean algebra of regular closed sets is prominent in topology, particularly as a dual for the Stone-Cech compactification. This algebra is also central for the theory of geometric computation, as a representation for combinatorial…
A circle packing is a collection of disks with disjoint interiors in the plane. It naturally defines a graph by tangency. It is shown that there exists $p>0$ such that the following holds for every circle packing: If each disk is retained…
The (torsion) complexity of a finite signed graph is defined to be the order of the torsion subgroup of the abelian group presented by its Laplacian matrix. When $G$ is $d$-periodic (i.e., $G$ has a free ${\mathbb Z}^d$-action by graph…
The foldings of a connected graph $G$ are defined as follows. First, $G$ is a folding of itself. Let $G'$ be a graph obtained from $G$ by identifying two vertices at distance 2 in $G$. Then every folding of $G'$ is a folding of $G$. The…
Traditional clustering identifies groups of objects that share certain qualities. Tangles do the converse: they identify groups of qualities that often occur together. They can thereby identify and discover 'types': of behaviour, views,…
The manifold M being compact and connected and H being a Tonelli Hamiltonian such that the cotangent bundle of M is equal to the dual tiered Mane set, we prove that there is a partition of the cotangent bundle of M into invariant C0…
A tree with at most k leaves is called k-ended tree, and a tree with exactly k leaves is called k-end tree, where a leaf is a vertex of degree one. Contraction of a graph G along the edge e means deleting the edge e and identifying its end…
The tangled closure of a collection of subsets of a topological space is the largest subset in which each member of the collection is dense. This operation models a logical `tangle modality' connective, of significance in finite model…
We generalise the notion of a Barge-Diamond complex, in the one-dimensional case, to a mixed system of tiling substitutions. This gives a way of describing the associated tiling space as an inverse limit of Barge-Diamond complexes. We give…
In a series of three papers we develop an end space theory for directed graphs. As for undirected graphs, the ends of a digraph are points at infinity to which its rays converge. Unlike for undirected graphs, some ends are joined by limit…
We study how the number $c(X)$ of components of a graph $X$ can be expressed through the number and properties of the components of a quotient graph $X/\sim.$ We partially rely on classic qualifications of graph homomorphisms such as…
We outline the scheme for quantization of classical Banach space results associated with some prototypes of dynamical maps and describe the quantization of correlations as well. A relation between these two areas is discussed.
We define and count lattice points in the moduli space of stable genus g curves with n labeled points. This extends a construction of the second author for the uncompactified moduli space. The enumeration produces polynomials with top…
The space of topological decompositions into triangulations of a surface has a natural graph structure where two triangulations share an edge if they are related by a so-called flip. This space is a sort of combinatorial Teichm\"uller space…
A coarse compactification of a proper metric space $X$ is any compactification of $X$ that is dominated by its Higson compactification. In this paper we describe the maximal coarse compactification of $X$ whose corona is of dimension $0$.…
We construct a 2-generated group $\Gamma $ such that its Cayley graph possesses finite connected subsets with arbitrarily big finite Heesch number.