Related papers: Cartesian subgroups in graph products of groups
Let $G$ be a group. We define the coprime graph of subgroups of $G$, denoted by $\mathcal P(G)$, is a graph whose vertex set is the set of all proper subgroups of $G$, and two distinct vertices are adjacent if and only if the order of the…
We study the automorphisms of graph products of cyclic groups, a class of groups that includes all right-angled Coxeter and right-angled Artin groups. We show that the group of automorphism generated by partial conjugations is itself a…
In this paper we obtain the Wedderburn-Artin decomposition of a semisimple group algebra associated to a direct product of finite groups. We also provide formulae for the number of all possible group codes, and their dimensions, that can be…
We classify all compact quantum groups whose C*-algebra sits inside that of the free unitary quantum groups $U_{N}^{+}$. In other words, we classify all discrete quantum subgroups of $\widehat{U}_{N}^{+}$, thereby proving a quantum variant…
In this paper, we study geodesic growth of numbered graph products; these are a generalization of right-angled Coxeter groups, defined as graph products of finite cyclic groups. We first define a graph-theoretic condition called…
The 'boxicity' ('cubicity') of a graph G is the minimum natural number k such that G can be represented as an intersection graph of axis-parallel rectangular boxes (axis-parallel unit cubes) in $R^k$. In this article, we give estimates on…
We study the question of polytopality of graphs: when is a given graph the graph of a polytope? We first review the known necessary conditions for a graph to be polytopal, and we provide several families of graphs which satisfy all these…
This paper deals with graph automaton groups associated with trees and some generalizations. We start by showing some algebraic properties of tree automaton groups. Then we characterize the associated semigroup, proving that it is…
There has been substantial investigation in recent years of subdirect products of limit groups and their finite presentability and homological finiteness properties. To contrast the results obtained for limit groups, Baumslag, Bridson, Holt…
A "clique minor" in a graph G can be thought of as a set of connected subgraphs in G that are pairwise disjoint and pairwise adjacent. The "Hadwiger number" h(G) is the maximum cardinality of a clique minor in G. This paper studies clique…
We prove that the lattice of normal subgroups of ultraproducts of compact simple non-abelian groups is distributive. In the case of ultraproducts of finite simple groups or compact connected simple Lie groups of bounded rank the set of…
We determine when certain natural classes of subgroups of right-angled Coxeter groups (RACGs) and right-angled Artin groups (RAAGs) are themselves RAAGs. We characterize finite-index visual RAAG subgroups of 2-dimensional RACGs. As an…
Finite group extensions offer a natural language to quantum computing. In a nutshell, one roughly describes the action of a quantum computer as consisting of two finite groups of gates: error gates from the general Pauli group P and…
We introduce an axiomatization of the notion of a semidirect product of locally compact quantum groups and study properties. Our approach is slightly different from the one introduced in the thesis of S.~Roy and, unlike the investigations…
Gaussian graphical models have become a well-recognized tool for the analysis of conditional independencies within a set of continuous random variables. From an inferential point of view, it is important to realize that they are composite…
The present work aims to exploit the interplay between the algebraic properties of rings and the graph-theoretic structures of their associated graphs. We introduce commutatively closed graphs and investigate properties of commutatively…
We build on the description of left congruences on an inverse semigroup in terms of the kernel and trace due to Petrich and Rankin. The notion of an inverse kernel for a left congruence is developed. Various properties of both the trace and…
The structure of transformation semigroups on a finite set is analyzed by introducing a hierarchy of functions mapping subsets to subsets. The resulting hierarchy of semigroups has a corresponding hierarchy of minimal ideals, or kernels.…
This is an introduction to graph theory, from a geometric and analytic viewpoint. A finite graph $X$ is described by its adjacency matrix $d\in M_N(0,1)$, which can be thought of as being a kind of discrete Laplacian, and we first discuss…
We consider groups defined by non-empty balanced presentations with the property that each relator is of the form R(x,y), where x and y are distinct generators and R(.,.) is determined by some fixed cyclically reduced word R(a,b) that…