相关论文: Metric Properties of Diestel-Leader Groups

The degree-diameter problem seeks to find the largest possible number of vertices in a graph having given diameter and given maximum degree. Very often the problem is studied for restricted families of graph such as vertex-transitive or…

Binomial Cayley graphs are obtained by considering the binomial coefficient of the weight function of a given Cayley graph and a natural number. We introduce these objects and study two families: one associated with symmetric groups and the…

A Cayley graph Cay$(G;S)$ has the CI (Cayley Isomorphism) property if for every isomorphic graph Cay$(G;T)$, there is a group automorphism $\alpha$ of $G$ such that $S^\alpha=T$. The DCI (Directed Cayley Isomorphism) property is defined…

We classify the distance-regular Cayley graphs with least eigenvalue $-2$ and diameter at most three. Besides sporadic examples, these comprise of the lattice graphs, certain triangular graphs, and line graphs of incidence graphs of certain…

We study the geometry of Lie groups $G$ with a continuous Finsler metric, assuming the existence of a subgroup $K$ such that the metric is right-invariant for the action of $K$. We present a systematic study of the metric and geodesic…

We study properties of generic elements of groups of isometries of hyperbolic spaces. Under general combinatorial conditions, we prove that loxodromic elements are generic (i.e. they have full density with respect to counting in balls for…

An integer distance digraph is the Cayley graph $\Gamma(\mathbb{Z},S)$ of the additive group $\mathbb{Z}$ of all integers with respect to a finite subset $S\subseteq\mathbb{Z}$. The domination ratio of $\Gamma(\mathbb{Z},S)$, defined as the…

In contrast to being automatic, being Cayley automatic \emph{a priori} has no geometric consequences. Specifically, Cayley graphs of automatic groups enjoy a fellow traveler property. Here we study a distance function introduced by the…

Take $S \subset \mathrm{SL}_2(\mathbb{Z}) \times \mathrm{SL}_2(\mathbb{Z})\times \mathrm{SL}_2(\mathbb{Z})$ be finite symmetric and assume $S$ generates a group $G$ which is Zariski-dense in $\mathrm{SL}_2 \times \mathrm{SL}_2\times…

The commuting graph ${\Gamma(G)}$ of a group $G$ is the simple undirected graph with group elements as a vertex set and two elements $x$ and $y$ are adjacent if and only if $xy=yx$ in $G$. By eliminating the identity element of $G$ and all…

We study the geometry of horospherical products by providing a description of their distances, geodesics and visual boundary. These products contains both discrete and continuous examples, including Cayley graphs of lamplighter groups and…

The largest order $n(d,k)$ of a graph of maximum degree $d$ and diameter $k$ cannot exceed the Moore bound, which has the form $M(d,k)=d^k - O(d^{k-1})$ for $d\to\infty$ and any fixed $k$. Known results in finite geometries on generalised…

This book offers to study locally compact groups from the point of view of appropriate metrics that can be defined on them, in other words to study "Infinite groups as geometric objects", as Gromov writes it in the title of a famous…

In the present paper we study two sequences of real numbers associated to a symplectic diffeomorphism: the uniform norm of the differential of its n-th iteration and the word length of its n-th iteration. In the latter case we assume that…

We show that the directed labelled Cayley graphs coincide with the rooted deterministic vertex-transitive simple graphs. The Cayley graphs are also the strongly connected deterministic simple graphs of which all vertices have the same cycle…

We introduce a combinatorial method to construct indefinite Ricci-flat metrics on nice nilpotent Lie groups. We prove that every nilpotent Lie group of dimension $\leq6$, every nice nilpotent Lie group of dimension $\leq7$ and every…

A graph is called a GRR if its automorphism group acts regularly on its vertex-set. Such a graph is necessarily a Cayley graph. Godsil has shown that there are only two infinite families of finite groups that do not admit GRRs : abelian…

In this paper we systematically study various properties of the distance graph in ${\Bbb F}_q^d$, the $d$-dimensional vector space over the finite field ${\Bbb F}_q$ with $q$ elements. In the process we compute the diameter of distance…

An infinite graph G is minor excluded if there is a finite graph that is not a minor of G. We prove that minor excluded graphs have finite Assouad-Nagata dimension and study minor exclusion for Cayley graphs of finitely generated groups.…

According to the O'Nan--Scott Theorem, a finite primitive permutation group either preserves a structure of one of three types (affine space, Cartesian lattice, or diagonal semilattice), or is almost simple. However, diagonal groups are a…