Related papers: Groups with free regular length functions in Z^n
Nous donnons des r\'esultats d'\'equidistribution d'\'el\'ements de corps de fonctions sur des corps finis, et d'irrationnels quadratiques sur ces corps, dans leurs corps locaux compl\'et\'es. Nous d\'eduisons ces r\'esultats de…
We consider weighted generating functions of trees where the weights are products of functions of the sizes of the subtrees. This work begins with the observation that three different communities, largely independently, found substantially…
A group with a geometric action on some hyperbolic space is necessarily word hyperbolic, but on the other hand every countable group acts (metrically) properly by isometries on a locally finite hyperbolic graph. In this paper we consider…
It is known that a finite group G can only act freely on affine n-space if K has positive characteristic p and G is a p-group. In that case the group action is "non-linear" and the ring of regular functions must be a trace-surjective…
We generalize the notion of isoperimetric profiles of finitely generated groups to their actions by measuring the boundary of finite subgraphings of the orbit graphing. We prove that like the classical isoperimetric profiles for groups,…
In this paper we first survey some basic results in the cohomology of finite groups, and then discuss recent work on constructing free actions of finite groups on products of spheres.
Let T be a k-regular tree (k>2) and A its automorphism group. We analyze a generic finitely generated subgroup Gamma of A. We show that Gamma is free and establish a trichotomy on the closure of Gamma: it is either discrete, compact or has…
Serre in "Trees" laid down the fundamentals of the theory of groups acting on simplicial trees. In particular, Bass-Serre theory makes it possible to extract information about the structure of a group from its action on a simplicial tree.…
Quasi-trees generalize trees in that the unique "path" between two nodes may be infinite and have any countable order type. They are used to define the rank-width of a countable graph in such a way that it is equal to the least upper-bound…
Gromov asked what a typical (finitely presented) group looks like, and he suggested a way to make the question precise in terms of limiting density. The typical finitely generated group is known to share some important properties with the…
In this paper we study the action of the fundamental group of a finite metric graph on its universal covering tree. We assume the graph is finite, connected and the degree of each vertex is at least three. Further, we assume an…
We propose a new look at the Julg-Valette theorem on K-theoretic amenability for groups operating on trees. The main tool is a generalization of a construction of uniformly bounded representations of the free groups due to Pytlik and…
First we identify the free algebras of the class of algebras of binary relations equipped with the composition and domain operations. Elements of the free algebras are pointed labelled finite rooted trees. Then we extend to the analogous…
Combinatorial objects such as rooted trees that carry a recursive structure have found important applications recently in both mathematics and physics. We put such structures in an algebraic framework of operated semigroups. This framework…
The present article continues the study of median groups initiated in [6, 9, 10]. Some classes of median groups are introduced and investigated with a stress upon the class of the so called A-groups which contains as remarkable subclasses…
This is Chapter 24 in the "AutoMathA" handbook. Finite automata have been used effectively in recent years to define infinite groups. The two main lines of research have as their most representative objects the class of automatic groups…
We study the automorphism groups of free-by-cyclic groups and show these are finitely generated in the following cases: (i) when defining automorphism has linear growth and (ii) when the rank of the underlying free group has rank at most 3.…
We use the notion of fixity for representations of finite groups to construct free and smooth actions on products of spheres. In particular we show that a finite p-group (for p>3) will act freely and smoothly on a product of two spheres if…
These are lecture notes on the algebraic approach to regular languages. The classical algebraic approach is for finite words; it uses semigroups instead of automata. However, the algebraic approach can be extended to structures beyond…
Let Gamma be a connected, locally finite graph of finite tree width and G be a group acting on it with finitely many orbits and finite node stabilizers. We provide an elementary and direct construction of a tree T on which G acts with…