Sciweavers

COMBINATORICS
2006
141views more  COMBINATORICS 2006»
13 years 11 months ago
Binary Words Containing Infinitely Many Overlaps
We characterize the squares occurring in infinite overlap-free binary words and construct various power-free binary words containing infinitely many overlaps.
James D. Currie, Narad Rampersad, Jeffrey Shallit
COMBINATORICS
2006
107views more  COMBINATORICS 2006»
13 years 11 months ago
A Note on the Number of Hamiltonian Paths in Strong Tournaments
We prove that the minimum number of distinct hamiltonian paths in a strong tournament of order n is 5 n-1 3 . A known construction shows this number is best possible when n 1 mod...
Arthur H. Busch
COMBINATORICS
2006
107views more  COMBINATORICS 2006»
13 years 11 months ago
Covering Codes for Hats-on-a-line
Sarang Aravamuthan, Sachin Lodha
COMBINATORICS
2006
98views more  COMBINATORICS 2006»
13 years 11 months ago
Restricted Walks in Regular Trees
Let T be the Cayley graph of a finitely generated free group F. Given two vertices in T consider all the walks of a given length between these vertices that at a certain time must...
Laura Ciobanu, Sasa Radomirovic
COMBINATORICS
2006
153views more  COMBINATORICS 2006»
13 years 11 months ago
Combinatorics of the Free Baxter Algebra
Marcelo Aguiar, Walter Moreira
COMBINATORICS
2006
101views more  COMBINATORICS 2006»
13 years 11 months ago
Optimal Penney Ante Strategy via Correlation Polynomial Identities
In the game of Penney Ante two players take turns publicly selecting two distinct words of length n using letters from an alphabet of size q. They roll a fair q sided die having ...
Daniel Felix
COMBINATORICS
2006
158views more  COMBINATORICS 2006»
13 years 11 months ago
Reduced Canonical Forms of Stoppers
The reduced canonical form of a loopfree game G is the simplest game infinitesimally close to G. Reduced canonical forms were introduced by Calistrate, and Grossman and Siegel pro...
Aaron N. Siegel
COMBINATORICS
2006
95views more  COMBINATORICS 2006»
13 years 11 months ago
Nilpotent Singer Groups
Let N be a nilpotent group normal in a group G. Suppose that G acts transitively upon the points of a finite non-Desarguesian projective plane P. We prove that, if P has square or...
Nick Gill
COMBINATORICS
2006
286views more  COMBINATORICS 2006»
13 years 11 months ago
On a Balanced Property of Derangements
Miklós Bóna