Related papers: RAAGedy right-angled Coxeter groups
Much is known about random right-angled Coxeter groups (i.e., right-angled Coxeter groups whose defining graphs are random graphs under the Erd\"os-R\'enyi model). In this paper, we extend this model to study random general Coxeter groups…
We give a complete characterization of the graph products of cyclic groups admitting a Polish group topology, and show that they are all realizable as the group of automorphisms of a countable structure. In particular, we characterize the…
In recent years, there has been significant interest in characterizing the induced subgraph obstructions to bounded treewidth and pathwidth. While this has recently been resolved for pathwidth, the case of treewidth remains open, and prior…
The purpose of the present article is threefold. First of all, we rebuild the whole theory of cosimplicial models of mapping spaces by using systematically Kan adjunction techniques. Secondly, given two topological spaces X and Y, we…
A graph is called Rank-Ramsey if (i) Its clique number is small, and (ii) The adjacency matrix of its complement has small rank. We initiate a systematic study of such graphs. Our main motivation is that their constructions, as well as…
Twisted right-angled Artin groups are defined through presentation based on mixed graphs. Each vertex corresponds to a generator, each undirected edge yields a commuting relation and each directed edge gives a Klein bottle relation. If…
We compute the virtual cohomological dimension (VCD) of the group of partially symmetric outer automorphisms of a free group. We use this to obtain new upper and lower bounds on the VCD of the outer automorphism group of a two-dimensional…
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…
New criteria for which Cayley graphs of cyclic groups of any order can be completely determined--up to isomorphism--by the eigenvalues of their adjacency matrices is presented. Secondly, a new construction for pairs of nonisomorphic Cayley…
We classify a class of complex representations of an arbitrary Coxeter group via characters of the integral homology of certain graphs. Such representations can be viewed as a generalization of the geometric representation and correspond to…
One possible way to obtain the quasicrystallographic structures is the projections of the higher dimensional lattices into 2D or 3D subspaces. In this work we introduce a general technique applicable to any higher dimensional lattice. We…
Beyond-planarity focuses on the study of geometric and topological graphs that are in some sense nearly-planar. Here, planarity is relaxed by allowing edge crossings, but only with respect to some local forbidden crossing configurations.…
We construct a family of right-angled Coxeter groups which provide counter-examples to questions about the stable boundary of a group, one-endedness of quasi-geodesically stable subgroups, and the commensurability types of right-angled…
We give a geometric approach to groups defined by automata via the notion of enriched dual of an inverse transducer. Using this geometric correspondence we first provide some finiteness results, then we consider groups generated by the dual…
We prove that the mapping class group of a sphere with five punctures admits uncountably many coarsely equivariant coarse median structures. The same is shown for right-angled Artin groups whose defining graphs are connected, triangle- and…
We determine exactly which graph products, also known as Right Angled Artin Groups, embed into Richard Thompson's group $V$. It was shown by Bleak and Salazar-Diaz that $\mathbb{Z}^2 * \mathbb{Z}$ was an obstruction. We show that this is…
For a pair $(G,\mathcal{P})$ consisting of a group and finite collection of subgroups, we introduce a simplicial $G$-complex $\mathcal{K}(G,\mathcal{P})$ called the coset intersection complex. We prove that the quasi-isometry type and the…
Bipartite graphs model the relationships between two disjoint sets of entities in several applications and are naturally drawn as 2-layer graph drawings. In such drawings, the two sets of entities (vertices) are placed on two parallel lines…
If $A_\Gamma$ ($W_\Gamma$) is the Artin (Coxeter) group with defining graph $\Gamma$ we denote by $Sim(\Gamma)$ the number of vertices of the largest clique in $\Gamma$. We show that $asdimA_\Gamma \leq Sim(\Gamma)$, if $Sim(\Gamma)=2$. We…
Given vertex valencies admissible for a self-dual polyhedral graph, we describe an algorithm to explicitly construct such a polyhedron. Inputting in the algorithm permutations of the degree sequence can give rise to non-isomorphic graphs.…