相关论文: Tadpole Labelled Oriented Graph Groups and Cyclica…

The Hanna Neumann Conjecture (HNC) for a free group $G$ predicts that $\overline{\chi}(U\cap V)\leq \overline{\chi} (U)\overline{\chi}(V)$ for all finitely generated subgroups $U$ and $V$, where $\overline{\chi}(H) = \max\{-\chi(H),0\}$…

The fundamental group of the complement of a hyperplane arrangement plays an important role in studying the corresponding arrangements. In particular, for large families of hyperplane arrangements, this fundamental group, being isomorphic…

In the framework of homological characterizations of relative hyperbolicity, Groves and Manning posed the question of whether a simply connected $2$-complex $X$ with a linear homological isoperimetric inequality, a bound on the length of…

We show that the class of groups where EDT0L languages can be used to describe solution sets to systems of equations is closed under direct products, wreath products with finite groups, and passing to finite index subgroups. We also add the…

Developing an idea of Kapranov and Voevodsky, we introduce a model of weak omega-categories based on directed complexes, combinatorial presentations of pasting diagrams. We propose this as a convenient framework for higher-dimensional…

A mixed dihedral group is a group $H$ with two disjoint subgroups $X$ and $Y$, each elementary abelian of order $2^n$, such that $H$ is generated by $X\cup Y$, and $H/H'\cong X\times Y$. In this paper, for each $n\geq 2$, we construct a…

For every finite dimensional Lie group one can consider the group of all smooth loops on it, called its loop group. Such loop groups have long been studied for, among other reasons, their relations to conformal field theories and…

We generalize the notion of a graph automatic group introduced by Kharlampovich, Khoussainov and Miasnikov (arXiv:1107.3645) by replacing the regular languages in their definition with more powerful language classes. For a fixed language…

We introduce and analyse ensembles of 2-regular random graphs with a tuneable distribution of short cycles. The phenomenology of these graphs depends critically on the scaling of the ensembles' control parameters relative to the number of…

These lecture notes are on automorphism groups of Cayley graphs and their applications to optimal fault-tolerance of some interconnection networks. We first give an introduction to automorphisms of graphs and an introduction to Cayley…

Homotopy type theory is a logical setting based on Martin-L\"of type theory in which geometric constructions and proofs can be carried out synthetically. Here, types can be interpreted as spaces up to homotopy, and proofs as…

The paper consists of two parts. In the first one we show that a relatively hyperbolic group $G$ splits as a star graph of groups whose central vertex group is finitely generated and the other vertex groups are maximal parabolic subgroups.…

Homophily principle, \ie{} nodes with the same labels or similar attributes are more likely to be connected, has been commonly believed to be the main reason for the superiority of Graph Neural Networks (GNNs) over traditional Neural…

We study the quasi-isometric rigidity of a large family of finitely generated groups that split as graphs of groups with virtually free vertex groups and two-ended edge groups. Let $G$ be a group that is one-ended, hyperbolic relative to…

The family of graphs of reduced words of a certain subcollection of permutations in the union $\cup_{n\geq 4}\frak{S}_{n}$ of symmetic groups is investigated. The subcollection is characterised by the hook cycle type $(n-2,1,1)$ with…

Consider a pseudogroup on (C,0) generated by two local diffeomorphisms having analytic conjugacy classes a priori fixed in Diff(C,0). We show that a generic pseudogroup as above is such that every point has (possibly trivial) cyclic…

We give a uniform construction that, on input of a recursive presentation $P$ of a group, outputs a recursive presentation of a torsion-free group, isomorphic to $P$ whenever $P$ is itself torsion-free. We use this to re-obtain a known…

$\lambda$-graph systems are labeled Bratteli diagram with shift operations. They present subshifts. Their matrix presentations are called symbolic matrix systems. We define skew products of $\lambda$-graph systems and study extensions of…

In recent work, Stokes and Vermant considered graph-of-groups realisations of hypergraphs as a new description of rigidity-theoretic problems. In this paper, we show that the infinitesimal aspects of graph-of-groups realisations can be…

We present a new notion of non-positively curved groups: the collection of discrete countable groups acting (AU-)acylindrically on finite products of $\delta$-hyperbolic spaces with general type factors. Inspired by the classical theory of…