arXiv:1209.4700 Abstract | arXiv Analytics

Published 2012-09-21Version 1

For fast computation of the Arnold complexity of length $2^{n}$ binary words we obtain an upper bound for the Shannon function $Sh(n)$

Comments: 7 pages

Categories: math.CO, cs.IT, math.IT

Subjects: 68R15

Keywords: binary words, arnold complexity, fast computation, upper bound

Related articles: Most relevant | Search more

arXiv:2306.07870 [math.CO] (Published 2023-06-13)

Subsequence frequency in binary words

arXiv:math/0605486 [math.CO] (Published 2006-05-17)

An upper bound for Cubicity in terms of Boxicity

arXiv:1001.2777 [math.CO] (Published 2010-01-15)

Equivelar and d-Covered Triangulations of Surfaces. I