Recherche
Voici les éléments 1-3 de 3
There Exist Binary Circular 5/2+ Power Free Words of Every Length
(The Electronic Journal of Combinatorics, 2004-01-23)
We show that there exist binary circular 5/2+ power free words of every length.
Regular Two-Graphs and Equiangular Lines
(University of Winnipeg, 2004)
Regular two-graphs are antipodal distance-regular double coverings of the complete graph, and they have many interesting combinatorial properties. We derive a construction for regular two-graphs containing cliques of ...
The Number of Ternary Words Avoiding Abelian Cubes Grows Exponentially
(2004-06-19)
We show that the number of ternary words of length n avoiding abelian cubes grows
faster than r^n, where r = 2^{1/24}