Related papers: Tangle structure trees II: trees of tangles and ta…
Contour trees have been developed to visualize or encode scalar data in imaging technologies and scientific simulations. Contours are defined on a continuous scalar field. For discrete data, a continuous function is first interpolated,…
A variant of the topological twist, involving SL(2,Z) dualities and hence named topological duality twist, is introduced and explicitly applied to describe a U(1) N=4 super Yang-Mills theory on a Kaehler space with holomorphically…
This paper develops a fundamental theory of realizations of linear and group codes on general graphs using elementary group theory, including basic group duality theory. Principal new and extended results include: normal realization…
In this paper we introduce the horizon visibility graph, a simple extension to the popular horizontal visibility graph representation of a time series, and show that it possesses a rigorous mathematical foundation in computational algebraic…
We study sets and groups definable in tame expansions of o-minimal structures. Let $\mathcal {\widetilde M}= \langle \mathcal M, P\rangle$ be an expansion of an o-minimal $\mathcal L$-structure $\cal M$ by a dense set $P$, such that three…
We represent the further development of S-tree technique of the study the structure of clusters of galaxies. The S-tree technique developed by Gurzadyan et al enables one to analyse the substructures of clusters via self-consistent use of…
A family T of digraphs is a complete set of obstructions for a digraph H if for an arbitrary digraph G the existence of a homomorphism from G to H is equivalent to the non-existence of a homomorphism from any member of T to G. A digraph H…
Trees are partial orderings where every element has a linearly ordered set of smaller elements. We define and study several natural notions of completeness of trees, extending Dedekind completeness of linear orders and Dedekind-MacNeille…
In [W. Mader, Connectivity keeping paths in $k$-connected graphs, J. Graph Theory 65 (2010) 61-69.], Mader conjectured that for every positive integer $k$ and every finite tree $T$ with order $m$, every $k$-connected, finite graph $G$ with…
This paper establishes an equivalence between two distinct frameworks for constructing and relating smooth manifolds: the geometric theory of \emph{$\star$-diagrams} and the string-theory-inspired notion of \emph{spherical T-duality}. We…
Invariants for complicated objects such as those arising in phylogenetics, whether they are invariants as matrices, polynomials, or other mathematical structures, are important tools for distinguishing and working with such objects. In this…
We consider questions related to the existence of spanning trees in graphs with the property that after the removal of any path in the tree the graph remains connected. We show that, for planar graphs, the existence of trees with this…
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…
Explaining why and how a tree $t$ structurally differs from another tree $t^\star$ is a question that is encountered throughout computer science, including in understanding tree-structured data such as XML or JSON data. In this article, we…
Entanglement is a complexity measure of digraphs that origins in fixed-point logics. Its combinatorial purpose is to measure the nested depth of cycles in digraphs. We address the problem of characterizing the structure of graphs of…
In this paper a Bass-Serre theory in the groupoid setting is developed and a structure theorem is established. Any groupoid action without inversion of edges on a forest induces a graph of groupoids, while any graph of groupoids satisfying…
Tangent category theory is a well-established categorical framework for differential geometry. A long list of fundamental geometric constructions, such as the tangent bundle functor, vector fields, Euclidean spaces, and vector bundles have…
A self-contained account of the theory of structure trees for edge cuts in networks is given. Applications include a generalisation of the Max-Flow Min-Cut Theorem to infinite networks and a short proof of a conjecture of Kropholler. This…
A linear F-manifold is an F-manifold (E, \circ , e) defined on the total space of a vector bundle \pi : E \rightarrow M for which the multiplication and unit field are linear tensor fields. We develop a systematic treatment of linear…
Let $T$ be a tree, a vertex of degree one is a leaf of $T$ and a vertex of degree at least three is a branch vertex of $T$. For two distinct vertices $u,v$ of $T$, let $P_T[u,v]$ denote the unique path in $T$ connecting $u$ and $v.$ For a…