Abstract
Consider a periodic sequence over a finite alphabet, say ..ababab.... This sequence can be specified by prohibiting the subwords aa and bb. In the paper, the maximum period of a word that can be defined by using k restrictions is determined. A sharp exponential bound is obtained: the period of a word determined by k restrictions cannot exceed the kth Fibonacci number. Thus, the period colength is estimated. The problem is studied in the context of Gröbner bases, namely, the growth of a Gröbner basis of an ideal (the cogrowth of an algebra). The proof uses the technique of Rauzy graphs.
Similar content being viewed by others
References
A. Belov, V. Borisenko, and V. Latyshev, Monomial Algebras (Plenum, New York, 1998).
V. N. Latyshev, J. Math. Sci. (N.Y.) 168 (1), 123–132 (2010).
An. A. Muchnik, Yu. L. Pritykin, and A. L. Semenov, Russ. Math. Surv. 64 (5), 805–871 (2009).
V. N. Latyshev, Combinatorial Theory of Rings: Standard Bases (Izd. Mosk. Univ., Moscow, 1988) [in Russian].
G. R. Chelnokov, Model. Anal. Inf. Syst. 14 (2), 12–16 (2007).
P. Lavrov, arXiv:1209.0220 [math.RA].
I. Mitrofanov, arXiv:1111.1999.
I. Mitrofanov, arXiv:1110.4780.
A. Kanel-Belov and I. Mitrofanov, arXiv:1107.0185.
F. Durand, arXiv:1204.5393.
F. Durand, arXiv:1111.3268.
A. Ya. Kanel-Belov and A. L. Chernyat’ev, Commun. Algebra 38 (7), 2588–2605 (2010).
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © P.A. Lavrov, 2016, published in Doklady Akademii Nauk, 2016, Vol. 468, No. 5, pp. 492–495.
Rights and permissions
About this article
Cite this article
Lavrov, P.A. Specifying periodic words by restrictions. Dokl. Math. 93, 300–303 (2016). https://doi.org/10.1134/S1064562416030224
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1064562416030224