Related papers: Geometry and combinatorics via right-angled Artin …

We compute the $p$-central and exponent-$p$ series of all right angled Artin groups, and compute the dimensions of their subquotients. We also describe their associated Lie algebras, and relate them to the cohomology ring of the group as…

We introduce a homology theory for subspace arrangements, and use it to extract a new system of numerical invariants from the Bieri-Neumann-Strebel invariant of a group. We use these to characterize when the set of basis conjugating outer…

Associated to any graph is a toric ideal whose generators record relations among the cuts of the graph. We study these ideals and the geometry of the corresponding toric varieties. Our theorems and conjectures relate the combinatorial…

We prove that every finitely-generated right-angled Artin group can be embedded into some Brin-Thompson group $nV$. It follows that many other groups can be embedded into some $nV$ (e.g., any finite extension of any of Haglund and Wise's…

We provide a framework for abstract reconstruction problems using the $K$-theory of categories with covering families, which we then apply to reformulate the edge reconstruction conjecture in graph theory. Along the way, we state some…

We derive functional relationships between spherical generating functions of graph monoids, right-angled Artin groups and right-angled Coxeter groups. We use these relationships to express the spherical generating function of a right-angled…

This chapter introduces and elaborates on the fruitful interplay of coding theory and algebraic combinatorics, with most of the focus on the interaction of codes with combinatorial designs, finite geometries, simple groups, sphere packings,…

This article is a survey on the braid groups, the Artin groups, and the Garside groups. It is a presentation, accessible to non-experts, of various topological and algebraic aspects of these groups. It is also a report on three points of…

Recently, additive combinatorics has blossomed into a vibrant area in mathematical sciences. But it seems to be a difficult area to define - perhaps because of a blend of ideas and techniques from several seemingly unrelated contexts which…

We study the class N of graphs, the right-angled Artin groups defined on which do not contain surface subgroups. We prove that a presumably smaller class N' is closed under amalgamating along complete subgraphs, and also under adding…

In this paper, we show how certain three-class association schemes and orthogonal arrays give rise to partial geometric designs. We also investigate the connections between partial geometric designs and certain regular graphs having three…

In this thesis, we study connections between metric and combinatorial graphs from a Dirichlet space point of view.

In this dissertation, we explore the structure of inversion graphs of permutations--a class of graphs that naturally arises by representing each permutation as a graph, where vertices correspond to entries and edges encode inversions.…

This is an investigation of the role of shuffling and concatenating in the theory of graph drawing. A simple syntactic description of these and related operations is proved complete in the context of finite partial orders, as general as…

We give a short proof of the following theorem of Sang-hyun Kim: if $A(\Gamma)$ is a right-angled Artin group with defining graph $\Gamma$, then $A(\Gamma)$ contains a hyperbolic surface subgroup if $\Gamma$ contains an induced subgraph…

The notion of i-bounded geometry generalises simultaneously bounded geometry and the geometry of punctured torus Kleinian groups. We show that the limit set of a surface Kleinian group of i-bounded geometry is locally connected by…

We give a combinatorial criterion for determining which Bestvina--Brady group is isomorphic to a right-angled Artin group.

We define and study extensions of Artin's representation and braid monodromy representation to the case of topological and algebraical generalisations of braid groups. In particular we provide faithful representations of braid groups of…

In this paper we consider the class of 2-dimensional Artin groups with connected, large type, triangle-free defining graphs (type CLTTF). We classify these groups up to isomorphism, and describe a generating set for the automorphism group…

The sandpile group of a graph is a well-studied object that combines ideas from algebraic graph theory, group theory, dynamical systems, and statistical physics. A graph's sandpile group is part of a larger algebraic structure on the graph,…