论文信息 - GRAPHS WITH POLYNOMIAL GROWTH

GRAPHS WITH POLYNOMIAL GROWTH

Let be a connected locally finite vertex-symmetric graph, the number of vertices of at a distance not more than from some fixed vertex. The equivalence of the following assertions is proved:(a) is bounded above by a polynomial.(b) There is an imprimitivity system with finite blocks of on the set of vertices of such that is finitely generated nilpotent-by-finite and the stabilizer of a vertex of in is finite.Thus, in a certain sense, a description is obtained of the connected locally finite vertex-symmetric graphs with polynomial growth.Bibliography. 8 titles.

V. Trofimov | V I Trofimov

[1] M. Gromov. Groups of polynomial growth and expanding maps , 1981 .

[2] Hyman Bass,et al. The Degree of Polynomial Growth of Finitely Generated Nilpotent Groups , 1972 .

[3] S. Helgason. Differential Geometry and Symmetric Spaces , 1964 .

[4] J. Wolf. Growth of finitely generated solvable groups and curvature of Riemannian manifolds , 1968 .