Results 1  10
of
20
The GouldenJackson cluster method: extensions, applications, and implementations
 J. Differ. Equations Appl
, 1999
"... Abstract: The powerful (and so far underutilized) GouldenJackson Cluster method for finding the generating function for the number of words avoiding, as factors, the members of a prescribed set of ‘dirty words’, is tutorialized and extended in various directions. The authors’ Maple implementations ..."
Abstract

Cited by 31 (1 self)
 Add to MetaCart
(Show Context)
Abstract: The powerful (and so far underutilized) GouldenJackson Cluster method for finding the generating function for the number of words avoiding, as factors, the members of a prescribed set of ‘dirty words’, is tutorialized and extended in various directions. The authors’ Maple implementations, contained in several Maple packages available from this paper’s website
There are more than 2 n/17 nletter ternary squarefree words
 J. Integer Seq
, 1998
"... Abstract: We prove that the ‘connective constant ’ for ternary squarefree words is at least 2 1/17 = 1.0416..., improving on Brinkhuis and Brandenburg’s lower bounds of 2 1/24 = 1.0293... and 2 1/22 = 1.032... respectively. This is the first improvement since 1983. A word is squarefree if it never ..."
Abstract

Cited by 16 (0 self)
 Add to MetaCart
(Show Context)
Abstract: We prove that the ‘connective constant ’ for ternary squarefree words is at least 2 1/17 = 1.0416..., improving on Brinkhuis and Brandenburg’s lower bounds of 2 1/24 = 1.0293... and 2 1/22 = 1.032... respectively. This is the first improvement since 1983. A word is squarefree if it never stutters, i.e. if it cannot be written as axxb for words a,b and nonempty word x. For example, ‘example ’ is squarefree, but ‘exampample ’ is not. See Steven Finch’s famous Mathematical Constants site[3] for a thorough discussion and many references. Let a(n) be the number of ternary squarefree nletter words ( A006156, M2550 in the SloanePlouffe[4] listing, 1,3,6,12,18,30,42,...). Brinkhuis[2] and Brandenburg[1] showed that a(n) ≥ 2 n/24, and a(n) ≥ 2 n/22 respectively. Here we show, by extending the method of [2], that a(n) ≥ 2 n/17, and hence that µ: = limn→ ∞ a(n) 1/n ≥ 2 1/17 = 1.0416.... Definition: A triplepair [[U0,V0], [U1,V1], [U2,V2]] where U0,V0,U1,V1,U2,V2 are words in the alphabet {0,1,2} of the same length k, will be called a kBrinkhuis triplepair if the following conditions are satisfied. • The 24 words of length 2k,
Improved bounds on the number of ternary squarefree words
 J. Integer Seq
"... Abstract. Improved upper and lower bounds on the number of squarefree ternary words are obtained. The upper bound is based on the enumeration of squarefree ternary words up to length 110. The lower bound is derived by constructing generalised Brinkhuis triples. The problem of finding such triples c ..."
Abstract

Cited by 14 (2 self)
 Add to MetaCart
(Show Context)
Abstract. Improved upper and lower bounds on the number of squarefree ternary words are obtained. The upper bound is based on the enumeration of squarefree ternary words up to length 110. The lower bound is derived by constructing generalised Brinkhuis triples. The problem of finding such triples can essentially be reduced to a combinatorial problem, which can efficiently be treated by computer. In particular, it is shown that the number of squarefree ternary words of length n grows at least as 65 n/40, replacing the previous best lower bound of 2 n/17. 1.
New Lower Bound on the Number of Ternary SquareFree Words
 J. Integer Sequences
, 2003
"... A new lower bound on the number of nletter ternary squarefree words is presented: 110 , which improves the previous best result of 65 . ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
(Show Context)
A new lower bound on the number of nletter ternary squarefree words is presented: 110 , which improves the previous best result of 65 .
On the Entropy and Letter Frequencies of Ternary SquareFree Words
, 2003
"... We enumerate all ternary lengthℓ squarefree words, which are words avoiding squares of words up to length ℓ, for ℓ ≤ 24. We analyse the singular behaviour of the corresponding generating functions. This leads to new upper entropy bounds for ternary squarefree words. We then consider ternary squar ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
(Show Context)
We enumerate all ternary lengthℓ squarefree words, which are words avoiding squares of words up to length ℓ, for ℓ ≤ 24. We analyse the singular behaviour of the corresponding generating functions. This leads to new upper entropy bounds for ternary squarefree words. We then consider ternary squarefree words with fixed letter densities, thereby proving exponential growth for certain ensembles with various letter densities. We derive consequences for the free energy and entropy of ternary squarefree words.
Topological entropy and the preimage structure of maps
 Real Analysis Exchange, vol
, 2003
"... My aim in this article is to provide an accessible introduction to the notion of topological entropy and (for context) its measure theoretic analogue, and then to present some recent work applying related ideas to the structure of iterated preimages for a continuous (in general noninvertible) map o ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
(Show Context)
My aim in this article is to provide an accessible introduction to the notion of topological entropy and (for context) its measure theoretic analogue, and then to present some recent work applying related ideas to the structure of iterated preimages for a continuous (in general noninvertible) map of a compact metric space to itself. These ideas will be illustrated by two classes of examples, from circle maps and symbolic dynamics. My focus is on motivating and explaining definitions; most results are stated with at most a sketch of the proof. The informed reader will recognize imagery from Bowen’s exposition of topological entropy [Bow78] which I have freely adopted for motivation. 1 Measuretheoretic entropy How much can we learn from observations using an instrument with finite resolution? A simple model of a single observation on a ”state space ” X is a finite partition P = {A1,..., AN} of X into atoms, grouping the points (states) in X according to the reading they induce on our instrument. A measure µ on X with total measure µ(X) = 1 defines the probability of a given reading as pi = µ(Ai), i = 1,..., N. Shannon [Sha63] (see also [Khi57]) noted that the ”entropy ” of the partition H(P): = − N� i=0
A PROOF OF DEJEAN’S CONJECTURE
, 905
"... Abstract. We prove Dejean’s conjecture. Specifically, we show that Dejean’s conjecture holds for the last remaining open values of n, namely 15 ≤ n ≤ 26. 1. ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Abstract. We prove Dejean’s conjecture. Specifically, we show that Dejean’s conjecture holds for the last remaining open values of n, namely 15 ≤ n ≤ 26. 1.
Dejean’s conjecture holds for n ≥ 27
, 2009
"... We show that Dejean’s conjecture holds for n ≥ 27. Repetitions in words have been studied since the beginning of the previous century [13, 14]. Recently, there has been much interest in repetitions with fractional exponent [1, 3, 5, 6, 7, 9]. For rational 1 < r ≤ 2, a fractional rpower is a non ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We show that Dejean’s conjecture holds for n ≥ 27. Repetitions in words have been studied since the beginning of the previous century [13, 14]. Recently, there has been much interest in repetitions with fractional exponent [1, 3, 5, 6, 7, 9]. For rational 1 < r ≤ 2, a fractional rpower is a nonempty word w = xx ′ such that x ′ is the prefix of x of length (r − 1)x. For example, 010 is a 3/2power. A basic problem is that of identifying the repetitive threshold for each alphabet size n> 1: What is the infimum of r such that an infinite sequence on n letters exists, not containing any factor of exponent greater than r? The infimum is called the repetitive threshold of an nletter alphabet, denoted by RT(n). Dejean’s conjecture [5] is that ⎨ 7/4, n = 3 RT(n) = 7/5, n = 4 n/(n − 1) n ̸ = 3, 4 Thue, Dejean and Pansiot, respectively [14, 5, 12] established the values RT(2), RT(3), RT(4). MoulinOllagnier [11] verified Dejean’s conjecture for 5 ≤ n ≤ 11, and MohammadNoori and Currie [10] proved the conjecture for 12 ≤ n ≤ 14.