Now showing items 70-73 of 73

    • Unary patterns under permutations 

      Currie, James D.; Nowotka, Dirk; Manea, Florin; Reshadi, Kamellia (Elsevier, 2018-06-04)
      Thue characterized completely the avoidability of unary patterns. Adding function variables gives a general setting capturing avoidance of powers, avoidance of patterns with palindromes, avoidance of powers under coding, ...
    • Vertex-transitive self-complementary uniform hypergraphs of prime order 

      Gosselin, Shonda (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) ...
    • Words with many palindrome pair factors 

      Borchert, Adam; Rampersad, Narad (The Electronic Journal of Combinatorics, 2015-10-30)
      Motivated by a conjecture of Frid, Puzynina, and Zamboni, we investigate infinite words with the property that for infinitely many n, every length-n factor is a product of two palindromes. We show that every Sturmian word ...
    • Words without Near-Repetitions 

      Currie, J.; Bendor-Samuel, A. (Canadian Mathematical Society, 1992-06-01)
      We find an infinite word w on four symbols with the following property: Two occurrences of any block in w must be separated by more than the length of the block. That is, in any subword of w of the form xyx, the length of ...