Related papers: The Right Angled Artin Group Functor as a Categori…

In a recent paper [3], the authors introduced a map $\mathcal{F}$ which associates a Deitmar scheme (which is defined over the field with one element, denoted by $\mathbb{F}_1$) with any given graph $\Gamma$. By base extension, a scheme…

Exploring missing data in attributed graphs introduces unique challenges beyond those found in tabular datasets. In this work, we extend the taxonomy for missing data mechanisms to attributed graphs by proposing GAMM (Graph Attributes…

Graph is an abstract representation commonly used to model networked systems and structure. In problems across various fields, including computer vision and pattern recognition, and neuroscience, graphs are often brought into comparison (a…

We investigate restricted Lie algebras arising as analogues of (twisted) right-angled Artin groups and right-angled Coxeter groups over fields of characteristic two. These algebras are defined via quadratic relations determined by decorated…

The notion of homomorphism indistinguishability offers a combinatorial framework for characterizing equivalence relations of graphs, in particular equivalences in counting logics within finite model theory. That is, for certain graph…

Let ${\mathbb{D}}^{m\times n}$ be the set of $m\times n$ matrices over a division ring $\mathbb{D}$. Two matrices $A,B\in {\mathbb{D}}^{m\times n}$ are adjacent if ${\rm rank}(A-B)=1$. By the adjacency, ${\mathbb{D}}^{m\times n}$ is a…

A finite simple graph $\Gamma$ determines a quotient $P_\Gamma$ of the pure braid group, called a graphic arrangement group. We analyze homomorphisms of these groups defined by deletion of sets of vertices, using methods developed in prior…

Inspired by the generation power of generative adversarial networks (GANs) in image domains, we introduce a novel hierarchical architecture for learning characteristic topological features from a single arbitrary input graph via GANs. The…

Graph aggregation is the process of computing a single output graph that constitutes a good compromise between several input graphs, each provided by a different source. One needs to perform graph aggregation in a wide variety of…

Using abelian coverings of Salvetti complexes, embeddings of outer automorphism groups of right-angled Artin groups (RAAGs) into outer automorphism groups of their particular characteristic subgroups are constructed. Virtual embeddings of…

We introduce a new notation for representing labeled regular bipartite graphs of arbitrary degree. Several enumeration problems for labeled and unlabeled regular bipartite graphs have been introduced. A general algorithm for enumerating all…

Let $\mathcal{A}$ be a set of positive numbers. A graph $G$ is called an $\mathcal{A}$-embeddable graph in $\mathbb{R}^d$ if the vertices of $G$ can be positioned in $\mathbb{R}^d$ so that the distance between endpoints of any edge is an…

Using a notation of corner between edges when graph has a fixed rotation, i.e. cyclical order of edges around vertices, we define combinatorial objects - combinatorial maps as pairs of permutations, one for vertices and one for faces.…

We compute the relative divergence and the subgroup distortion of Bestvina-Brady subgroups. We also show that for each integer $n\geq 3$, there is a free subgroup of rank $n$ of some right-angled Artin group whose inclusion is not a…

Locally triangular graphs are known to be halved graphs of bipartite rectagraphs, which are connected triangle-free graphs in which every $2$-arc lies in a unique quadrangle. A graph $\Gamma$ is locally rank 3 if there exists $G\leq…

Consider a collection of random variables attached to the vertices of a graph. The reconstruction problem requires to estimate one of them given `far away' observations. Several theoretical results (and simple algorithms) are available when…

Let $p$ be a prime. The right-angled Artin pro-$p$ group $G_{\Gamma}$ associated to a fnite simplicial graph $\Gamma$ is the pro-$p$ completion of the right-angled Artin group associated to $\Gamma$. We prove that the following assertions…

Let $G$ and $G'$ be two right-angled Artin groups (RAAG). We show they are quasi-isometric iff they are isomorphic, under the assumption that $Out(G)$ and $Out(G')$ are finite. If only $Out(G)$ is finite, then $G'$ is quasi-isometric $G$…

We describe an underlying right angled building structure of any graph product of buildings. We describe the automorphism group of the graph product of buildings. We show that the notion of generalized graph product of a collection of…

In this paper we extend the notion of digraphical regular representations in the context of Haar digraphs. Given a group $G$, a {\em Haar digraph} $\Gamma$ over $G$ is a bipartite digraph having a bipartition $\{X,Y\}$ such that $G$ is a…