Related papers: Reconstructing directed graphs from generalised ga…
We show that an arbitrary infinite graph $G$ can be compactified by its ends plus its critical vertex sets, where a finite set $X$ of vertices of an infinite graph is critical if its deletion leaves some infinitely many components each with…
For $G$ a symplectic or orthogonal $p$-adic group (not necessarily split), or an inner form of a general linear $p$-adic group, we compute the endomorphism algebras of some induced projective generators \`a la Bernstein of the category of…
The task of recognizing an algebraic surface from a single apparent contour can be reduced to the recovering of a homogeneous equation in four variables from its discriminant. In this paper, we use the fact that Darboux cyclides have a…
We introduce a new arc in directed graphs of integers. Among other things, we determine the positive integers that have arcs to all except a finite number of positive integers. We also propose some possible research problems at the end of…
In this paper, we count acyclic and strongly connected uniform directed labeled hypergraphs. For these combinatorial structures, we introduce a specific generating function allowing us to recover and generalize some results on the number of…
We propose a novel approach for learning node representations in directed graphs, which maintains separate views or embedding spaces for the two distinct node roles induced by the directionality of the edges. We argue that the previous…
Recent work on graph generative models has made remarkable progress towards generating increasingly realistic graphs, as measured by global graph features such as degree distribution, density, and clustering coefficients. Deep generative…
Leavitt path algebras associate to directed graphs a $\mathbb Z$-graded algebra and in their simplest form recover the Leavitt algebras L(1,n). In this note, we introduce iterated Leavitt path algebras associated to directed weighted graphs…
Kontsevich has proven that the Lie homology of the Lie algebra of symplectic vector fields can be computed in terms of the homology of a graph complex. We prove that the Leibniz homology of this Lie algebra can be computed in terms of the…
We generalise structure tree theory, which is based on removing finitely many edges, to removing finitely many vertices. This gives a significant generalization of Tutte's tree decomposition of 2-connected graphs into 3-connected blocks.…
A systematic method is presented for the construction and classification of algebras of gauge transformations for arbitrary high rank tensor gauge fields. For every tensor gauge field of a given rank, the gauge transformation will be…
Differential calculus on discrete sets is developed in the spirit of noncommutative geometry. Any differential algebra on a discrete set can be regarded as a `reduction' of the `universal differential algebra' and this allows a systematic…
In this paper we give a method for constructing systematically all simple 2-connected graphs with n vertices from the set of simple 2-connected graphs with n-1 vertices, by means of two operations: subdivision of an edge and addition of a…
Many types of detectors, such as cathode strip chambers and some MPGDs, allow us to reconstruct track positions by induced strip charges. There are two main types of algebraic methods for this reconstruction: center of gravity methods and…
In this short note we construct an embedding of the planar algebra for $\overline{\operatorname{Rep}(U_q(sl_3))}$ at $q = e^{2\pi i \frac{1}{24}}$ into the graph planar algebra of di Francesco and Zuber's candidate graph…
We present a method for associating labeled directed graphs to finite-dimensional Lie algebras, thereby enabling rapid identification of key structural algebraic features. To formalize this approach, we introduce the concept of…
We prove the title by constructing 2-colourable completely positive approximations for the Toeplitz algebra. Besides results about nuclear dimension and completely positive contractive order zero maps, our argument involves projectivity of…
Following the success of Word2Vec embeddings, graph embeddings (GEs) have gained substantial traction. GEs are commonly generated and evaluated extrinsically on downstream applications, but intrinsic evaluations of the original graph…
Realization by linear vector fields is constructed for any Lie algebra which admits a biorthogonal system and for its any suitable representation. The embedding into Lie algebras of linear vector fields is analogous to the classical…
We study the inverse eigenvector centrality problem on connected undirected graphs, namely, whether a given positive vector can be realized by assigning suitable edge weights. We provide a complete characterization in terms of stable sets…