English
Related papers

Related papers: A bicombing that implies a sub-exponential isoperi…

200 papers

These lecture notes provide an introduction to automorphism groups of graphs. Some special families of graphs are then discussed, especially the families of Cayley graphs generated by transposition sets.

Discrete Mathematics · Computer Science 2012-06-28 Ashwin Ganesan

In \cite{Oh22}, the second author defined a complex of groups decomposition of the fundamental group of a finitely generated 2-dimensional special group, called an \emph{intersection complex}, which is a quasi-isometry invariant. In this…

Group Theory · Mathematics 2025-02-17 Byung Hee An , Sangrok Oh

A combing is a set of normal forms for a finitely generated group. This article investigates the language-theoretic and geometric properties of combings for nilpotent and polycyclic groups. It is shown that a finitely generated class 2…

Group Theory · Mathematics 2007-05-23 Robert H. Gilman , Derek F. Holt , Sarah Rees

The property that the polynomial cohomology with coefficients of a finitely generated discrete group is canonically isomorphic to the group cohomology is called the (weak) isocohomological property for the group. In the case when a group is…

Group Theory · Mathematics 2010-05-03 R. Ji , B. Ramsey

We prove an isoperimetric inequality for groups. As an application, we obtain lower bound on F{\o}lner functions in various nilpotent-by-cyclic groups. Under a regularity assumption, we obtain a characterization of F{\o}lner functions of…

Group Theory · Mathematics 2023-09-26 Anna Erschler , Tianyi Zheng

We summarize different approaches to the theory of quantum graphs and provide several ways to construct concrete examples. First, we classify all undirected quantum graphs on the quantum space $M_2$. Secondly, we apply the theory of…

Quantum Algebra · Mathematics 2022-12-15 Daniel Gromada

We study a natural discrete Bochner-type inequality on graphs, and explore its merit as a notion of curvature in discrete spaces. An appealing feature of this discrete version seems to be that it is fairly straightforward to compute this…

Combinatorics · Mathematics 2015-10-26 Bo'az Klartag , Gady Kozma , Peter Ralli , Prasad Tetali

Gromov (2003) constructed finitely generated groups whose Cayley graphs contain all graphs from a given infinite sequence of expander graphs of unbounded girth and bounded diameter-to-girth ratio. These so-called Gromov monster groups…

Group Theory · Mathematics 2023-12-14 Louis Esperet , Ugo Giocanti

We give the first examples of groups which admit a tame combing with linear radial tameness function with respect to any choice of finite presentation, but which are not minimally almost convex on a standard generating set. Namely, we…

Group Theory · Mathematics 2018-03-19 Sean Cleary , Susan Hermiller , Melanie Stein , Jennifer Taback

We consider the Bernoulli bond percolation process (with parameter $p$) on infinite graphs and we give a general criterion for bounded degree graphs to exhibit a non-trivial percolation threshold based either on a single isoperimetric…

Mathematical Physics · Physics 2015-06-12 Rogério G. Alves , Aldo Procacci , Remy Sanchis

A graph $\Gamma$ labelled by a set $S$ defines a group $G(\Gamma)$ whose generators are the set of labels $S$ and whose relations are all words which can be read on closed paths of this graph. We introduce the notion of aspherical graph and…

Group Theory · Mathematics 2022-06-17 Vadim Bereznyuk

Roundness of metric spaces was introduced by Per Enflo as a tool to study uniform structures of linear topological spaces. The present paper investigates geometric and topological properties detected by the roundness of general metric…

Metric Geometry · Mathematics 2007-05-23 J. -F. Lafont , S. Prassidis

This document is an expanded version of a lecture presented at a conference on "Thin Groups and Superstrong Approximation" held at the Mathematical Sciences Research Institute in February 2012. Superstrong approximation is a criterion on a…

Number Theory · Mathematics 2013-03-12 Jordan S. Ellenberg

We provide a treatment of isomorphism within a set-theoretic formulation of dependent type theory. Type expressions are assigned their natural set-theoretic compositional meaning. Types are divided into small and large types --- sets and…

Logic in Computer Science · Computer Science 2018-01-23 David McAllester

Given a morphism of (small) groupoids with injective object map, we provide sufficient and necessary conditions under which the induction and co-induction functors between the categories of linear representations are naturally isomorphic. A…

Representation Theory · Mathematics 2019-03-13 Juan Jesús Barbarán Sánchez , Laiachi EL Kaoutit

Let $G$ be a finite group. For each $m>1$ we define the symmetric canonical subset $S=S(m)$ of the Cartesian power $G^m$ and we consider the family of Cayley graphs $\mathscr{G}_m(G)=Cay(G^m,S)$. We describe properties of these graphs and…

Combinatorics · Mathematics 2019-11-14 Czesław Bagiński , Piotr Grzeszczuk

In this paper we are interested in the asymptotic enumeration of bipartite Cayley digraphs and Cayley graphs over abelian groups. Let $A$ be an abelian group and let $\iota$ be the automorphism of $A$ defined by $a^\iota=a^{-1}$, for every…

Combinatorics · Mathematics 2020-01-16 Jia-Li Du , Yan-Quan Feng , Pablo Spiga

This is a continuation of our previous work 0712.4092. It is well known that various isoperimetric inequalities imply their functional ``counterparts'', but in general this is not an equivalence. We show that under certain convexity…

Functional Analysis · Mathematics 2014-02-26 Emanuel Milman

A group-category is an additively semisimple category with a monoidal product structure in which the simple objects are invertible. For example in the category of representations of a group, 1-dimensional representations are the invertible…

Geometric Topology · Mathematics 2007-05-23 Frank Quinn

Following work of Rieffel, we define the Cayley compactification of an abelian group with specified generating set. We investigate its structure using methods from discrete geometry and commutative algebra.

Combinatorics · Mathematics 2007-05-23 Mike Develin