Related papers: Reconstructing directed graphs from generalised ga…

A new algebraic Cayley graph is constructed using finite fields. Its connectedness and diameter bound are studied via Weil's estimate for character sums. These graphs provide a new source of expander graphs, extending classical results of…

We focus on the algorithm underlying the main result of [A. Mestre, R. Oeckl, Generating loop graphs via Hopf algebra in quantum field theory. J. Math. Phys., 47, 122302, 2006]. This is an algebraic formula to generate all connected graphs…

The graph reconstruction conjecture states that all graphs on at least three vertices are determined up to isomorphism by their deck. In this paper, a general framework for this problem is proposed to simply explain the reconstruction of…

In recent work, we developed a method to construct invertible and non-invertible symmetries of finite-group gauge theories as topological domain walls on the lattice. In the present work, we consider abelian and non-abelian finite-group…

Given a finite, simple, vertex-weighted graph, we construct a graded associative (non-commutative) algebra, whose generators correspond to vertices and whose ideal of relations has generators that are graded commutators corresponding to…

The eccentricity matrix $\epsilon(G)$, of a connected graph $G$ is obtained by retaining the maximum distance from each row and column of the distance matrix of $G$ and the other entries are assigned with 0. In this paper, we discuss the…

A basic question about the directed landscape is how much of it can be reconstructed simply by knowing the shapes of its geodesics. We prove that the directed landscape can be reconstructed from the shapes of its semi-infinite geodesics. In…

To an arbitrary directed graph we associate a row-finite directed graph whose C*-algebra contains the C*-algebra of the original graph as a full corner. This allows us to generalize results for C*-algebras of row-finite graphs to…

Transseries in the sense of \'Ecalle are constructed using a topological approach. A general contractive mapping principle is formulated and proved, showing the closure of transseries under a wide class of operations. In the second part we…

Graphlets are subgraphs rooted at a fixed vertex. The number of occurrences of graphlets aligned to a particular vertex, called graphlet degree sequence (gds), gives a topological description of the surrounding of the analyzed vertex.…

We study in how far it is possible to reconstruct a graph from various Banach algebras associated to its universal covering, and extensions thereof to quantum statistical mechanical systems. It turns out that most the boundary operator…

Let $G$ be a group of permutations acting on an $n$-vertex set $V$, and $X$ and $Y$ be two simple graphs on $V$. We say that $X$ and $Y$ are $G$-isomorphic if $Y$ belongs to the orbit of $X$ under the action of $G$. One can naturally…

We introduce a new model of indeterminacy in graphs: instead of specifying all the edges of the graph, the input contains all triples of vertices that form a connected subgraph. In general, different (labelled) graphs may have the same set…

A theorem of Kontsevich relates the homology of certain infinite dimensional Lie algebras to graph homology. We formulate this theorem using the language of reversible operads and mated species. All ideas are explained using a pictorial…

This paper explores the properties of directed graphs, termed generalized action graphs, which exhibit a strong connection to certain number sequences. Focusing on the structural and combinatorial aspects, we investigate the conditions…

This paper focuses on certain finite dimensional point derivations for the non-selfadjoint operator algebras corresponding to directed graphs. We begin by analyzing the derivations corresponding to full matrix representations of the tensor…

Given an arbitrary countable directed graph $G$ we prove the C*-envelope of the tensor algebra $T_+(G)$ coincides with the universal Cuntz-Krieger algebra associated with $G$. Our approach is concrete in nature and does not rely on Hilbert…

We construct, by contraction of a suitable complex vector bundle, the Weil representation of the finite symplectic group $Sp(A)$. We give an explicit description of the space of all lagrangian subspaces, which we use to compute the cocycle…

We consider directed graphs E which have been obtained by adding a sink to a fixed graph G. We associate an element of Ext(C*(G)) to each such E, and show that the classes of two such graphs are equal in Ext(C*(G)) if and only if the…

We show an isomorphism between an algebra which is naturally constructed from the Toeplitz algebra generated by d-shifts, and an ideal of the C * -algebra of the (2d + 1)-dimensional Heisenberg group. This is a particular case of a more…