Subword complexity of profinite words and subgroups of free profinite semigroups / Almeida J,Volkov MV // INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION. - 2006. - V. 16, l. 2. - P. 221-258.

ISSN/EISSN:

0218-1967 / нет данных

Type:

Article

Abstract:

We study free profinite subgroups of free profinite semigroups of the same rank using, as main tools, iterated continuous endomorphisms, subword complexity, and the associated entropy. Main results include a general scheme to produce such subgroups and a proof that the complement of the minimal ideal in a free profinite semigroup on more than one generator is closed under all implicit operations that do not lie in the minimal ideal and even under their infinite iteration.

Author keywords:

free profinite semigroup; profinite word; implicit operator; free profinite group; group-generic endornorphism; iteration; subword complexity; entropy PSEUDOVARIETIES

DOI:

10.1142/S0218196706002883

Web of Science ID:

ISI:000238364600001

Соавторы в МНС:

—

Другие поля

Поле	Значение
Month	APR
Publisher	WORLD SCIENTIFIC PUBL CO PTE LTD
Address	5 TOH TUCK LINK, SINGAPORE 596224, SINGAPORE
Language	English
Keywords-Plus	PSEUDOVARIETIES
Research-Areas	Mathematics
Web-of-Science-Categories	Mathematics
Author-Email	jalmeida@fc.up.pt Mikhail.Volkov@usu.ru
ResearcherID-Numbers	Volkov, Mikhail/F-1407-2014 Almeida, Jorge /B-8575-2015
ORCID-Numbers	Volkov, Mikhail/0000-0002-9327-243X Almeida, Jorge /0000-0002-3829-2382
Number-of-Cited-References	30
Journal-ISO	Int. J. Algebr. Comput.
Doc-Delivery-Number	054GK