COMBINATORICS 2006 | Sciweavers

10

COMBINATORICS
2006

141views more COMBINATORICS 2006»

Binary Words Containing Infinitely Many Overlaps

13 years 4 months ago

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

claim paper

Read More »

8

click to vote

COMBINATORICS
2006

107views more COMBINATORICS 2006»

A Note on the Number of Hamiltonian Paths in Strong Tournaments

13 years 4 months ago

Download www.univie.ac.at

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

claim paper

Read More »

8

click to vote

COMBINATORICS
2006

107views more COMBINATORICS 2006»

Covering Codes for Hats-on-a-line

13 years 4 months ago

Download www.combinatorics.org

Sarang Aravamuthan, Sachin Lodha

claim paper

Read More »

42

click to vote

COMBINATORICS
2006

290views more COMBINATORICS 2006»

On the Limiting Distribution for the Length of the Longest Alternating Sequence in a Random Permutation

13 years 4 months ago

Download www.maths.tcd.ie

Harold Widom

claim paper

Read More »

14

click to vote

COMBINATORICS
2006

98views more COMBINATORICS 2006»

Restricted Walks in Regular Trees

13 years 4 months ago

Download www.emis.de

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

claim paper

Read More »

12

click to vote

COMBINATORICS
2006

153views more COMBINATORICS 2006»

Combinatorics of the Free Baxter Algebra

13 years 4 months ago

Download www.math.tamu.edu

Marcelo Aguiar, Walter Moreira

claim paper

Read More »

7

click to vote

COMBINATORICS
2006

101views more COMBINATORICS 2006»

Optimal Penney Ante Strategy via Correlation Polynomial Identities

13 years 4 months ago

Download www.combinatorics.org

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

claim paper

Read More »

11

click to vote

COMBINATORICS
2006

158views more COMBINATORICS 2006»

Reduced Canonical Forms of Stoppers

13 years 4 months ago

Download www.combinatorics.org

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

claim paper

Read More »

7

click to vote

COMBINATORICS
2006

95views more COMBINATORICS 2006»

Nilpotent Singer Groups

13 years 4 months ago

Download www.univie.ac.at

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

claim paper

Read More »

44

click to vote

COMBINATORICS
2006

286views more COMBINATORICS 2006»

On a Balanced Property of Derangements

13 years 4 months ago