相关论文: The Right Angled Artin Group Functor as a Categori…
A finitely presented Bestvina-Brady group (BBG) admits a presentation involving only commutators. We show that if a graph admits a certain type of spanning trees, then the associated BBG is a right-angled Artin group (RAAG). As an…
Consider pairs of the form (G, N), with G a group and N \normal G, as objects of a category \PG. A morphism (G_1, N_1) \To (G_2, N_2) will be a group homomorphism f : G_1 \To G_2 such that f(N_1) \subset N_2. We introduce a functor Q : \PG…
Let $N$ be a closed nonorientable surface with or without marked points. In this paper we prove that, for every finite full subgraph $\Gamma$ of $\mathcal{C}^{\mathrm{two}}(N)$, the right-angled Artin group on $\Gamma$ can be embedded in…
Let $G_\Gamma$ be a graph product over a finite simplicial graph $\Gamma$, and let $K_\Gamma$ denote the kernel of the canonical homomorphism from $G_\Gamma$ to the direct product of its vertex groups. It is known that, up to isomorphism,…
Let $G$ be a right-angled Artin group with defining graph $\Gamma$ and let $H$ be a finitely generated group quasi-isometric to $G(\Gamma)$. We show if $G$ satisfies (1) its outer automorphism group is finite; (2) $\Gamma$ does not have…
In this paper we consider several classical and novel algorithmic problems for right-angled Artin groups, some of which are closely related to graph theoretic problems, and study their computational complexity. We study these problems with…
We characterize planar graphs and graph minors among other graph theoretic notions in terms of right-angled Artin groups (RAAGs). For this, we determine all sets of elements in RAAGs with ears as underlying graphs that are exactly the sets…
This paper is on $\Gamma$-convergence for degenerate integral functionals related to homogenisation problems in the Heisenberg group. Here both the rescaling and the notion of invariance or periodicity are chosen in a way motivated by the…
In this study, we focus on the graph representation learning (a.k.a. network embedding) in attributed graphs. Different from existing embedding methods that treat the incorporation of graph structure and semantic as the simple combination…
Let \Gamma be the generalized random bipartite graph that has two sides Rl and Rr with edges for every pair of vertices between R1 and Rr but no edges within each side, where all the edges are randomly colored by three colors P1; P2; P3. In…
Given a finite graph G there is a corresponding group given by the presentation with generators the vertices of G and a relation [x,y]=1 for generators x and y precisely when (x,y) is an edge of G. Such groups are known as partially…
Suppose that $\Gamma$ is a non-empty connected graph, $\mathfrak{G}$ is the fundamental group of a graph of groups over $\Gamma$, and $\mathcal{C}$ is a root class of groups (the last means that $\mathcal{C}$ contains non-trivial groups and…
We introduce a graph-theoretical interpretation of an induced action of Aut$(\Gamma)$ in the discrete de Rham cohomology of a finite graph $\Gamma$. This action produces a splitting of Aut$(\Gamma)$ that depends on the cycles of $\Gamma$.…
In this paper we study the elementary theory of graph products of groups and show that under natural conditions on the vertex groups we can recover (the core of) the underlying graph and the associated vertex groups. More precisely, we…
In this paper we study topological invariants of a class of random groups. Namely, we study right angled Artin groups associated to random graphs and investigate their Betti numbers, cohomological dimension and topological complexity. The…
Graph matching, also known as network alignment, refers to finding a bijection between the vertex sets of two given graphs so as to maximally align their edges. This fundamental computational problem arises frequently in multiple fields…
In this article, given two finite simplicial graphs $\Gamma_1$ and $\Gamma_2$, we state and prove a complete description of the possible morphisms $C(\Gamma_1) \to C(\Gamma_2)$ between the right-angled Coxeter groups $C(\Gamma_1)$ and…
Let $\Gamma$ be the Littlewood-Richardson tableau corresponding to an embedding $M$ of a subgroup in a finite abelian $p$-group. Each individual entry in $\Gamma$ yields information about the homomorphisms from $M$ into a particular…
A generalization of the random geometric graph (RGG) model is proposed by considering a set of points uniformly and independently distributed on a rectangle of unit area instead of on a unit square [0,1]^2. The topological properties of the…
We prove that every RAAG (a Right-Angled Artin Group) embeds in the group of Hamiltonian symplectomorphisms of the 2-sphere.