Abstract
We present a formula that expresses the number of admissible words for an arbitrary system of prohibitions in terms of the generating series. We also indicate applications of this formula to the calculation of the topological entropy of symbolic systems and to the calculation of growth functions of groups and algebras.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
G. I. Revesz,Introduction to Formal Languages, McGraw-Hill Book Company, New York (1983).
A. N. Lifshits, “On the problem of isomorphism of Bernoulli schemes,”Teor. Veroyatnost. i Primenen. [Theory Probab. Appl.],19, No. 2, 409–416 (1974).
R. I. Grigorchuk and A. M. Stepin, “On coding of Markov shifts,” in:Sbornik Dokladov VII Vsesoyuznoi Konferentsii po Teorii Kodirovaniya i Peredachi Informatsii (Abstracts of Reports of the Seventh All-Union Conference on Coding Theory and Information Transmission), Part 1, Moscow-Vilnius (1978), pp. 41–46.
A. M. Stepin and A. T. Tagi-Zade, “A combinatorial interpretation of the entropy of symbolic systems,”Mat. Zametki [Math. Notes],46, No. 2, 114–121 (1989).
D. J. Anik, “On the homology of associative algebras,”Trans. Amer. Math. Soc.,296, 641–659 (1986).
E. S. Golod and I. R. Shafarevich, “On the class field tower,”Izv. Akad. Nauk SSSR, Ser. Mat. [Math. USSR-Izv.],28, 261–272 (1964).
N. Bourbaki,Groupes et algèbres de Lie, Hermann, Paris (1968).
J. W. Cannon,The Growth of the Closed Surface Groups and the Compact Hyperbolic Coxeter Groups, Preprint, Boston (1979).
J.-P. Serre, “Cohomologie des groupes discrets,” in:Prospects in Mathematics, Ann. Math. Stud., No. 70, Princeton (1971).
W. Parry, “Counterexamples involving growth series and the Euler characteristic,”Proc. Amer. Math. Soc.,102, No. 1, 49–51 (1988).
D. E. Cohen, “String rewriting: a survey for group theorists,”Geometric Group Theory, Vol. 1, Sussex (1991);London Math. Soc. Lect. Notes Series,181, pp. 37–47 (1993).
D. B. Epstein, J. W. Cannon, D. F. Holt, S. V. F. Levy, M. S. Paterson, and W. P. Thurston,Word processing in groups, Jones and Bartlett, Boston (1992).
M. Dzh. Mamagani, “Growth functions of surface groups,”Mat. Zametki [Math. Notes],58, No. 5, 681–693 (1995).
J. R. J. Groves, “Rewriting systems and homology of groups,”Proceedings of Canberra Group Theory Conf., L. G. Kovacs (ed.), In:Lect. Notes in Math., Springer, New York (1995).
C. C. Squier, “Word problems and a homological finiteness conditions for monoids,”J. Pure Appl. Algebra,49, 201–217 (1987).
K. S. Brown, “The geometry of rewriting systems: a proof of the Anik-Groves-Squier Theorem,” in:Algorithms and Classification in Group Theory, MSRI Publication No. 23, Springer, New York (1992), pp. 137–163.
G. M. Bergman, “The diamond lemma for ring theory,”Adv. in Math.,29, 178–218 (1978).
N. Smythe, “Growth functions and Euler series,”Invent. Math. 77, 517–531 (1984).
V. A. Ufnarovskii, “On the use of graphs for calculating the basis, growth, and Hilbert series of associative algebras,”Mat. Sb. [Math. USSR-Sb.],180, No. 11 (1989).
Author information
Authors and Affiliations
Additional information
Translated fromMatematicheskie Zametki, Vol. 58, No. 5, pp. 653–668, November, 1995.
This research was partially supported by the Russian Foundation for Basic Research under grant No. 94-01-00820 and by the International Science Foundation grant MV1000.
Rights and permissions
About this article
Cite this article
Grigorchuk, R.I. Growth functions, rewriting systems, and the Euler characteristic. Math Notes 58, 1136–1146 (1995). https://doi.org/10.1007/BF02304997
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02304997