Related papers: Tranched graphs: consequences for topology and dyn…
Given a directed graph G=(V,E) an independent set A of the vertices V is called quasi-kernel (quasi-sink) iff for each point v there is a path of length at most 2 from some point of A to v (from v to some point of A). Every finite directed…
We develop some basic results about full amalgamation classes with intrinsic trascendentals. These classes have generics whose models may have finite subsets whose intrinsic closure is not contained in its algebraic closure. We will show…
In recent years, a close connection between supergravity, string effective actions and generalized geometry has been discovered that typically involves a doubling of geometric structures. We investigate this relation from the point of view…
Comtraces (combined traces) are extensions of Mazurkiewicz traces that can model the "not later than" relationship. In this paper, we first introduce the novel notion of generalized comtraces, extensions of comtraces that can additionally…
The directions of an infinite graph $G$ are a tangle-like description of its ends: they are choice functions that choose compatibly for all finite vertex sets $X\subseteq V(G)$ a component of $G-X$. Although every direction is induced by a…
This paper considers metrics whose curvature tensor makes sense as a distribution. A class of such metrics, the regular metrics, was defined and studied by Geroch and Traschen. Here, we generalize their definition to form a wider class:…
We study the equivariant generalization of topological strings on toric manifolds, focusing in particular on defining the contributions of constant maps in the genus expansion of the partition function. This approach regularizes the…
We prove that if a rescaled mean curvature flow is a global graph over the round cylinder with small gradient and converges super-exponentially fast, then it must coincide with the cylinder itself. We also show that the result is sharp with…
Building upon [1], this study aims to introduce fractal geometry into graph theory, and to establish a potential theoretical foundation for complex networks. Specifically, we employ the method of substitution to create and explore…
Simple drawings are drawings of graphs in the plane or on the sphere such that vertices are distinct points, edges are Jordan arcs connecting their endpoints, and edges intersect at most once (either in a proper crossing or in a shared…
The problem of interpreting a set of ${\cal W}$-algebra constraints constructed in terms of an arbitrarily twisted scalar field as the recursion relations of a topological theory is addressed. In this picture, the conventional models of…
This review article consists of two parts. In the first part we use the formalism of (exceptional) generalized geometry to derive the scalar field space of SU(2)xSU(2)-structure compactifications. We show that in contrast to SU(3)xSU(3)…
In this work we study the topological properties of temporal hypergraphs. Hypergraphs provide a higher dimensional generalization of a graph that is capable of capturing multi-way connections. As such, they have become an integral part of…
Higher-rank graph generalisations of the Popescu-Poisson transform are constructed, allowing us to develop a dilation theory for higher rank operator tuples. These dilations are joint dilations of the families of operators satisfying…
We assign generalised convolutions (resp. traces) to graphs whose edges are decorated by smooth kernels (resp. smoothing operators) on a closed manifold. To do so, we introduce the concept of TraPs (Traces and Permutations), which roughly…
A graph drawing in the plane is called an almost embedding if images of any two non-adjacent simplices (i.e. vertices or edges) are disjoint. We introduce integer invariants of almost embeddings: winding number, cyclic and triodic Wu…
We study generalized quasirandom graphs whose vertex set consists of $q$ parts (of not necessarily the same sizes) with edges within each part and between each pair of parts distributed quasirandomly; such graphs correspond to the…
Twisted diagrams are "diagrams" with components in different categories. Structure maps are defined using auxiliary data which consists of functors relating the various categories to each other. Prime examples of the construction are…
We introduce a taxonomy of interaction types and show that graphs are focal hypergraphs: every graph is canonically a focal hypergraph via its closed neighbourhood structure, and every graph dynamical model is a special case of the general…
Characterizing graphs by their spectra is an important topic in spectral graph theory, which has attracted a lot of attention of researchers in recent years. It is generally very hard and challenging to show a given graph to be determined…