Page 1

Displaying 1 – 13 of 13

Showing per page

Testing Cayley graph densities

Goulnara N. Arzhantseva, Victor S. Guba, Martin Lustig, Jean-Philippe Préaux (2008)

Annales mathématiques Blaise Pascal

We present a computer-assisted analysis of combinatorial properties of the Cayley graphs of certain finitely generated groups: given a group with a finite set of generators, we study the density of the corresponding Cayley graph, that is, the least upper bound for the average vertex degree (= number of adjacent edges) of any finite subgraph. It is known that an m -generated group is amenable if and only if the density of the corresponding Cayley graph equals to 2 m . We test amenable and non-amenable...

The combinatorial derivation and its inverse mapping

Igor Protasov (2013)

Open Mathematics

Let G be a group and P G be the Boolean algebra of all subsets of G. A mapping Δ: P G → P G defined by Δ(A) = {g ∈ G: gA ∩ A is infinite} is called the combinatorial derivation. The mapping Δ can be considered as an analogue of the topological derivation d: P X→ P X, A ↦ A d, where X is a topological space and A d is the set of all limit points of A. We study the behaviour of subsets of G under action of Δ and its inverse mapping ∇. For example, we show that if G is infinite and I is an ideal in...

Transition operators on co-compact G-spaces.

Laurent Saloff-Coste, Wolfgang Woess (2006)

Revista Matemática Iberoamericana

We develop methods for studying transition operators on metric spaces that are invariant under a co-compact group which acts properly. A basic requirement is a decomposition of such operators with respect to the group orbits. We then introduce reduced transition operators on the compact factor space whose norms and spectral radii are upper bounds for the Lp-norms and spectral radii of the original operator. If the group is amenable then the spectral radii of the original and reduced operators coincide,...

Currently displaying 1 – 13 of 13

Page 1