Title
Words strongly avoiding fractional powers
Abstract
Let k be fixed, 1 < k < 2. There exists an infinite word over a finite alphabet which contains no subword of the form xyz with \xyz\/\xy\ greater than or equal to k and where z is a permutation of x. (C) 1999 Academic Press.
Year
DOI
Venue
1999
10.1006/eujc.1999.0329
Eur. J. Comb.
Keywords
Field
DocType
fractional power
Combinatorics,Existential quantification,Of the form,Permutation,Arithmetic,Mathematics,Alphabet
Journal
Volume
Issue
ISSN
20
8
0195-6698
Citations 
PageRank 
References 
4
0.82
5
Authors
2
Name
Order
Citations
PageRank
Julien Cassaigne128240.80
James D. Currie224042.86