Related papers: Tranched graphs: consequences for topology and dyn…
To every directed graph $E$ one can associate a \emph{graph inverse semigroup} $G(E)$, where elements roughly correspond to possible paths in $E$. These semigroups generalize polycylic monoids, and they arise in the study of Leavitt path…
In an earlier paper the authors proved that limits of convergent graph sequences can be described by various structures, including certain 2-variable real functions called graphons, random graph models satisfying certain consistency…
We connect quantum graphs with infinite leads, and turn them to scattering systems. We show that they display all the features which characterize quantum scattering systems with an underlying classical chaotic dynamics: typical poles, delay…
We exhibit a bijection between acyclic orientations of a Dyck graph and Tymoczko cells of a regular nilpotent Hessenberg variety. This implies the Shareshian-Wachs formula for the sum of the coefficients of the chromatic quasi-symmetric…
In this work, we will introduce the notion of generalized topological groups using generalized topological structure and generalized continuity defined by ?A. Cs?asz?ar [2]. We will discuss some basic properties of this kind of structures…
A rigidity theory is developed for the Euclidean and non-Euclidean placements of countably infinite simple graphs in R^d with respect to the classical l^p norms, for d>1 and 1<p<\infty. Generalisations are obtained for the Laman and…
We show that one can define and effectively compute Stallings graphs for quasi-convex subgroups of automatic groups (\textit{e.g.} hyperbolic groups or right-angled Artin groups). These Stallings graphs are finite labeled graphs, which are…
Network complexity has been studied for over half a century and has found a wide range of applications. Many methods have been developed to characterize and estimate the complexity of networks. However, there has been little research with…
In this paper, we introduce the notion of a dual topological graph of a given topological graph, and show that it defines a C*-algebra isomorphic to the C*-algebra of the given one. Repeating to take a dual, and taking a projective limit,…
Quasi-trees generalize trees in that the unique "path" between two nodes may be infinite and have any countable order type. They are used to define the rank-width of a countable graph in such a way that it is equal to the least upper-bound…
Following Alspach and Parsons, a {\em metacirculant graph} is a graph admitting a transitive group generated by two automorphisms $\rho$ and $\sigma$, where $\rho$ is $(m,n)$-semiregular for some integers $m \geq 1$, $n \geq 2$, and where…
The signature of a $p$-weakly geometric rough path summarises a path up to a generalised notion of reparameterisation. The quotient space of equivalence classes on which the signature is constant yields unparameterised path space. The study…
We show that the degree distributions of graphs do not suffice to characterize the synchronization of systems evolving on them. We prove that, for any given degree sequence satisfying certain conditions, there exists a connected graph…
We prove a number of convexity results for strata of the diagonal pants graph of a surface, in analogy with the extrinsic geometric properties of strata in the Weil-Petersson completion. As a consequence, we exhibit convex flat subgraphs of…
We will consider P-graph complexes, where P is a cyclic operad. P-graph complexes are natural generalizations of Kontsevich's graph complexes -- for P = the operad for associative algebras it is the complex of ribbon graphs, for P = the…
In this note, we study non-transitive graphs and prove a number of results when they satisfy a coarse version of transitivity. Also, for each finitely generated group $G$, we produce continuum many pairwise non-quasi-isometric regular…
We extend the Cauchy residue theorem to a large class of domains including differential chains that represent, via canonical embedding into a space of currents, divergence free vector fields and non-Lipschitz curves. That is, while the…
Let $G$ be a simple topological graph and let $\Gamma$ be a polyline drawing of $G$. We say that $\Gamma$ \emph{partially preserves the topology} of $G$ if it has the same external boundary, the same rotation system, and the same set of…
By adding or removing appropriate structures to Gauss diagram, one can create useful objects related to virtual links. In this paper few objects of this kind are studied: twisted virtual links generalizing virtual links; signed chord…
In 2010, Turaev introduced knotoids as a variation on knots that replaces the embedding of a circle with the embedding of a closed interval with two endpoints which here we call poles. We define generalized knotoids to allow arbitrarily…