Recherche
Voici les éléments 1-4 de 4
Dejean's conjecture holds for n ≥ 27
(EDP Sciences, 2009)
We show that Dejean’s conjecture holds for n ≥ 27. This brings the final resolution of the conjecture by the approach of Moulin Ollagnier within range of the computationally feasible.
Least Periods of Factors of Infinite Words
(EDP Sciences, 2009)
We show that any positive integer is the least period of a factor of the Thue-Morse word. We also characterize the set of least periods of factors of a Sturmian word. In particular, the corresponding set for the Fibonacci ...
Self-Complementary Hypergraphs
(University of Ottawa, 2009)
In this thesis, we survey the current research into self-complementary hypergraphs,
and present several new results.
We characterize the cycle type of the permutations on n elements with order equal
to a power of 2 which ...
Vertex-transitive self-complementary uniform hypergraphs of prime order
(Discrete Mathematics, 2009-09)
For an integer n and a prime p, let n(p)=max{i:pidividesn}. In this paper, we present a construction for vertex-transitive self-complementary k-uniform hypergraphs of order n for each integer n such that pn(p)≡1(mod2ℓ+1) ...