Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Harmonic and gold Sturmian words
Carpi A., de Luca A. European Journal of Combinatorics25 (5):685-705,2004.Type:Article
Date Reviewed: Sep 23 2004

In this tour de force, the authors introduce two easily-defined proper subsets of the set PER of all finite words w on {a, b} having two relatively prime periods p and q, such that |w| = p + q - 2. These subsets, Harm and Gold, and the sets of “harmonic words” and “gold words,” respectively, share PER’s property that their factor sets equal the set of finite factors of all Sturmian words. The work contains proofs of numerous interesting results about Gold and Harm, including simple formulas for the number of harmonic words of any given length. It also contains several intriguing conjectures, including an amusing one that, if true, implies that Goldbach’s conjecture is true, and another that is true if there are infinitely many twin primes.

The work is exceptionally well written. It is replete with examples, and directs the reader clearly to references that define or explain those few necessary terms and concepts that it does not. Its proofs are complete, and easy to follow. In summary, the work simultaneously represents a real advance in the art, and whets the appetite of those unfamiliar with the subject to learn more about this fascinating field.

Reviewer:  Wes Munsil Review #: CR130173
Bookmark and Share
  Reviewer Selected
 
 
Permutations And Combinations (G.2.1 ... )
 
 
Generating Functions (G.2.1 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Permutations And Combinations": Date
Computing short generator sequences
Driscoll J., Furst M. Information and Computation 72(2): 117-132, 1987. Type: Article
Jan 1 1988
Permutations of bounded degree generate groups of polynomial diameter
McKenzie P. (ed) Information Processing Letters 19(5): 253-254, 1984. Type: Article
Aug 1 1985
How to construct pseudorandom permutations from pseudorandom functions
Luby M. (ed), Rackoff C. SIAM Journal on Computing 17(2): 373-386, 1988. Type: Article
Jul 1 1989
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy