Related papers: Quasi-isometry classification of certain graph $2$…
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…
We provide an explicit construction that allows one to easily decompose a graph braid group as a graph of groups. This allows us to compute the braid groups of a wide range of graphs, as well as providing two general criteria for a graph…
Let $G$ be a finite group. Denoting by ${\rm{cd}}(G)$ the set of the degrees of the irreducible complex characters of $G$, we consider the {\it character degree graph} of $G$: this is the (simple, undirected) graph whose vertices are the…
We prove that for every pair of quantum isomorphic graphs, their block trees and their block graphs are isomorphic, and that such an isomorphism can be chosen so that the corresponding blocks are quantum isomorphic -- in particular,…
We study manifolds endowed with an (almost) even Clifford (hermitian) structure and admitting a large automorphism group. We classify them when they are simply connected and the dimension of the automorphism group is maximal, and also prove…
Extended admissible groups belong to a particular class of graphs of groups that admit a decomposition generalizing those of non-geometric 3-manifold groups and Croke-Kleiner admissible groups. In this paper, we study several…
A graph $\Gamma$ is said to be a semi-Cayley graph over a group $G$ if it admits $G$ as a semiregular automorphism group with two orbits of equal size. We say that $\Gamma$ is normal if $G$ is a normal subgroup of ${\rm Aut}(\Gamma)$. We…
A group is coherent if all its finitely generated subgroups are finitely presented. In this article we provide a criterion for positively determining the coherence of a group. This criterion is based upon the notion of the perimeter of a…
We introduce the notion of a braid group parametrized by a ring, which is defined by generators and relations and based on the geometric idea of painted braids. We show that the parametrized braid group is isomorphic to the semi-direct…
We construct a family of infinite simple groups that we call \emph{twisted Brin-Thompson groups}, generalizing Brin's higher-dimensional Thompson groups $sV$ ($s\in\mathbb{N}$). We use twisted Brin-Thompson groups to prove a variety of…
We study the complexity of the Graph Isomorphism problem on graph classes that are characterized by a finite number of forbidden induced subgraphs, focusing mostly on the case of two forbidden subgraphs. We show hardness results and develop…
We generalize the notion of quasirandom which concerns a class of equivalent properties that random graphs satisfy. We show that the convergence of a graph sequence under the spectral distance is equivalent to the convergence using the…
We characterize convex cocompact subgroups of mapping class groups that arise as subgroups of specially embedded right-angled Artin groups. That is, if the right-angled Artin group G in Mod(S) satisfies certain conditions that imply G is…
Let B be a finite collection of geometric (not necessarily convex) bodies in the plane. Clearly, this class of geometric objects naturally generalizes the class of disks, lines, ellipsoids, and even convex polygons. We consider geometric…
We introduce a new quasi-isometry invariant for finitely generated groups and show that every group with this property admits a subshift which is effectively closed by patterns and that cannot be realized as the topological factor of any…
Let $\Gamma$ be a simplicial, finite, connected graph such that $\Gamma$ does not decompose as a nontrivial join. We prove that two notions of strong quasiconvexity and stability are equivalent in the right-angled Artin group $A_\Gamma$…
In this note, we announce the first results on quasi-isometric rigidity of non-nilpotent polycyclic groups. In particular, we prove that any group quasi-isometric to the three dimenionsional solvable Lie group Sol is virtually a lattice in…
In this work we introduce the notion of almost-symmetry for generalized numerical semigroups. In addition to the main properties occurring in this new class, we present several characterizations for its elements. In particular we show that…
It has been known since 1991 that the problem of recognizing grid intersection graphs is NP-complete. Here we use a modified argument of the above result to show that even if we restrict to the class of unit grid intersection graphs…
Classifying groups up to quasi-isometry is a fundamental problem in geometric group theory. In the context of hyperbolic and relatively hyperbolic groups, one of the key invariants in this classification is the boundary at infinity. F.…