The geometry of profinite graphs with applications to free groups and finite monoids

We initiate the study of the class of profinite graphs defined by the following geometric property: for any two vertices and of , there is a (unique) smallest connected profinite subgraph of containing them; such graphs are called tree-like. Profinite trees in the sense of Gildenhuys and Ribes are tree-like, but the converse is not true. A profinite group is then said to be dendral if it has a tree-like Cayley graph with respect to some generating set; a Bass-Serre type characterization of dendral groups is provided. Also, such groups (including free profinite groups) are shown to enjoy a certain small cancellation condition.

We define a pseudovariety of groups to be arboreous if all finitely generated free pro- groups are dendral (with respect to a free generating set). Our motivation for studying such pseudovarieties of groups is to answer several open questions in the theory of profinite topologies and the theory of finite monoids. We prove, for arboreous pseudovarieties , a pro- analog of the Ribes and Zalesski product theorem for the profinite topology on a free group. Also, arboreous pseudovarieties are characterized as precisely the solutions to the much studied pseudovariety equation .