# Local periods and binary partial words: An algorithm

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 Local periods and binary partial words: An algorithm F. Blanchet-Sadri and Ajay Chriscoe Department of Mathematical Sciences University of North Carolina P.O. Box Greensboro, NC , USA June 13, 2003 Abstract The study of the combinatorial properties of strings of symbols from a finite alphabet (also referred to as words) is profoundly connected to numerous fields such as biology, computer science, mathematics, and physics. Research in combinatorics on words goes back roughly a century. There is a renewed interest in combinatorics on words as a result of emerging new application areas such as molecular biology. Partial words were recently introduced in this context. The motivation behind the notion of a partial word is the comparison of genes (or proteins). Alignment of two genes (or two proteins) can be viewed as a construction of partial words that are said to be compatible. While a word can be described by a total function, a partial word can be described by a partial function. More precisely, a partial word of length n over a finite alphabet A is a partial function from {1,..., n} into A. Elements of {1,..., n} without an image are called holes. A word is just a partial word without holes. The notion of period of a word is central in combinatorics on words. In the case of partial words, there are two notions: one is that of period, the other is that of local period. This paper extends to partial words with one hole the well known result of Guibas and Odlyzko which states that for every word u, there exists a word v of same length as u over the alphabet {0, 1} such that the set of all periods of u coincides with the set of all periods of v. Our result states that for every partial word u with one hole, there exists a partial word v of same length as u with at most one hole over the alphabet {0, 1} such that the set of all periods of u coincides with the set of all periods of v and the set of all local periods of u coincides with the set of all local periods of v. To prove our result, we use the technique of Halava, Harju and Ilie which they used This material is based upon work supported by the National Science Foundation under Grants CCR and CCR A Research Assignment from the University of North Carolina at Greensboro is gratefully acknowledged. I thank Phuongchi Thi Le for very valuable comments and suggestions. She received a research assistantship from the University of North Carolina at Greensboro to work with me on this project. 1

2 to characterize constructively the set of periods of a given word. As a consequence of our constructive proof, we obtain a linear time algorithm which, given a partial word with one hole, computes a partial word with at most one hole over the alphabet {0, 1} with the same length and the same sets of periods and local periods. A World Wide Web server interface at has been established for automated use of the program. Keywords: Words, partial words, periods, and local periods. 1 Introduction The study of the combinatorial properties of strings of symbols from a finite alphabet, also referred to as words, is profoundly connected to numerous fields such as biology, computer science, mathematics, and physics. Research in combinatorics on words goes back roughly a century [12, 13]. There is a renewed interest in combinatorics on words as a result of emerging new application areas such as molecular biology. Partial words were recently introduced by Berstel and Boasson [1] in this context. The motivation behind the notion of a partial word is the comparison of two genes (or two proteins). Alignment of two such strings can be viewed as a construction of two partial words that are said to be compatible in a sense that will be described in Section 2.2. While a word can be described by a total function, a partial word can be described by a partial function. More precisely, a partial word of length n over a finite alphabet A is a partial function from {1,..., n} into A. Elements of {1,..., n} without an image are called holes. A word is just a partial word without holes. The notion of period of a word is central in combinatorics on words. There are many fundamental results on periods of words. Among them is the well known periodicity result of Fine and Wilf [8] which intuitively determines how far two periodic events have to match in order to guarantee a common period. This result was extended to partial words with one hole by Berstel and Boasson [1]. In our recent work [2, 4], we extend this result further, with the exclusion of a few pathological cases, to partial words with an arbitrary number of holes. Another fundamental result on periods of words is the well known and unexpected result of Guibas and Odlyzko [9] which states that the set of all periods of a word is independent of the alphabet size (alphabets with one symbol are excluded here). In other words, for every word u, there exists a word v over the alphabet {0, 1} such that u and v have the same length and the same set of periods. 2

3 In this paper, we extend Guibas and Odlyzko s result to partial words with one hole. We first review, in Section 2, basic properties of words and partial words, state, in Section 3, the fundamental periodicity result of Fine and Wilf as well as its extension to partial words with one hole, state, in Section 4, the periodicity result of Guibas and Odlyzko as well as Halava et al s algorithm for computing a binary word with the same length and the same set of periods as a given word, prove, in Section 5, our main result which states that the set of all periods and the set of all local periods of a partial word with one hole are independent of the alphabet size, and describe, in Section 6, a linear time algorithm that given a partial word u with one hole, computes a partial word v with at most one hole over the alphabet {0, 1} such that u and v have the same length, the same set of periods, and the same set of local periods. 2 Preliminaries This section is devoted to reviewing basic concepts on words and partial words. 2.1 Words For a detailed presentation of the matters discussed here, please refer to [6] or [11]. Let A be a nonempty finite set, or an alphabet. Elements of A are called letters and finite sequences of letters of A are called words over A. The unique sequence of length 0, denoted by ɛ, is called the empty word. The set of all words over A of finite length (greater than or equal to 0) is denoted by A. It is a monoid under the associative operation of concatenation or product of words (ɛ serves as identity) and is referred to as the free monoid generated by A. Similarly, the set of all nonempty words over A is denoted by A +. It is a semigroup under the operation of concatenation of words and is referred to as the free semigroup generated by A. A word of length n over A can be defined by a total function u : {1,..., n} A and is usually represented as u = a 1 a 2... a n with a i A (the length of u or n is denoted by u ). If u = a 1... a n with a i A, then a period of u is a positive integer p such that a i = a i+p for 1 i n p. The minimal period of u will be denoted by p(u). For a word u, the powers of u are defined inductively by u 0 = ɛ and, for any n 1, u n = uu n 1. A word u is primitive if there exists no word v such that u = v n with n 2. 3

4 2.2 Partial words For a detailed presentation of the matters discussed here, please refer to [1]. A partial word u of length n over A is a partial function u : {1,..., n} A. For 1 i n, if u(i) is defined, then we say that i belongs to the domain of u (denoted by i D(u)), otherwise we say that i belongs to the set of holes of u (denoted by i H(u)). A word over A is a partial word over A with an empty set of holes (we will sometimes refer to words as full words). If u is a partial word of length n over A, then the companion of u (denoted by u ) is the total function u : {1,..., n} A { } defined by { u(i) if i D(u), u (i) = otherwise. The bijectivity of the map u u allows us to define for partial words concepts such as concatenation and powers in a trivial way. The symbol is viewed as a do not know symbol and not as a do not care symbol as in pattern matching. The word u = abb b cbb is the companion of the partial word u of length 9 where D(u) = {1, 2, 3, 5, 7, 8, 9} and H(u) = {4, 6}. A period of a partial word u over A is a positive integer p such that u(i) = u(j) whenever i, j D(u) and i j mod p. In such a case, we call u p-periodic. Similarly, a local period of u is a positive integer p such that u(i) = u(i+p) whenever i, i+p D(u). In such a case, we call u locally p-periodic. The partial word with companion abb bbcbb is locally 3-periodic but is not 3-periodic. The latter shows a difference between partial words and words since every locally p-periodic word is p-periodic. Another difference worth noting is the fact that even if the length of a partial word u is a multiple of a local period of u, then u is not necessarily a power of a shorter partial word. We will denote by p(u) the minimal period of u and by p (u) the minimal local period of u. The set of all periods of u will be denoted by P(u) and the set of all local periods of u will be denoted by P (u). Note that, for any partial word u, P(u), since u P(u) (a similar statement holds for P (u)). If u and v are two partial words of equal length, then u is said to be contained in v, denoted by u v, if D(u) D(v) and u(i) = v(i) for all i D(u). The order u v on partial words is obtained when we let < a and a a for all a A. The partial words u and v are called compatible, denoted by u v, if there exists a partial word w such that u w 4

5 and v w. We denote by u v the least upper bound of u and v (in other words, u u v and v u v and D(u v) = D(u) D(v)). As an example, u = aba a and v = a b a are the companions of two partial words u and v that are compatible and (u v) = abab a. We can extend the notion of a word being primitive to a partial word being primitive as follows: A partial word u is primitive if there exists no word v such that u v n with n 2. We end this section with a construction of a word of length n from a given word u of length n over the alphabet A { }. Let S be a subset of {1,..., n} and a A { }. We define the word u(s, a) as follows: { u(i) if i S, u(s, a)(i) = a otherwise. As an example, consider the word u = abb cbba over the alphabet {a, b, c, }. We can see that u({1, 4, 5}, a) = abbaabba. If S is the singleton set {s}, then we will sometimes abbreviate u(s, a) by u(s, a). 3 Fine and Wilf s periodicity result In this section, we review Fine and Wilf s periodicity result as well as its extension to partial words with one hole. The fundamental periodicity result of Fine and Wilf can be stated as follows. Theorem 1 (Fine and Wilf [8]) If a word u has periods p and q and u p+q gcd(p, q), then u has period gcd(p, q). The bound p + q gcd(p, q) turns out to be optimal, since, for example, abaababaaba has periods 5 and 8, has length 11 = gcd(5, 8) 1, but does not have period 1. Berstel and Boasson proved a variant of Fine and Wilf s result for partial words with one hole. Theorem 2 (Berstel and Boasson [1]) If a partial word u with one hole is locally p- periodic and locally q-periodic and u p + q, then u is gcd(p, q)-periodic. The bound p + q turns out to be optimal since, for example, aaaabaaaa aa has one hole, is locally 5-periodic and locally 8-periodic, has length 12 = , but is not 1-periodic. 5

6 Theorem 2 does not hold for two holes since, for example, ab aba ba has two holes, is locally 3-periodic and locally 5-periodic, has length 3 + 5, but is not 1-periodic. Note that if gcd(p, q) = 1, then Theorem 2 implies Theorem 1 by considering v = u or v = u where u is a word satisfying Theorem 1 s assumptions. In our recent paper [4], we extend Theorem 2 to partial words with two or three holes. The strenghtening to an arbitrary number of holes is done in our paper [2]. 4 Guibas and Odlyzko s periodicity result In the next section, we characterize the periods and local periods of partial words with one hole (see Theorem 4). This is done by extending to partial words with one hole the following result of Guibas and Odlyzko. Theorem 3 (Guibas and Odlyzko [9]) For every word u over an alphabet A, there exists a word v of length u over the alphabet {0, 1} such that P(v) = P(u). The proof given by Guibas and Odlyzko of Theorem 3 uses properties of correlation and is somewhat complicated. In [10], Halava et al give an elementary short constructive proof for this result. As a consequence, a linear time algorithm (Algorithm 1) is described which, given a word, computes a word over the alphabet {0, 1} with the same length and the same periods. Halava et al s algorithm is based on the following properties of words (among others). Lemma 1 (Halava, Harju and Ilie [10]) Let u be a word over an alphabet A. If q is a period of u satisfying u p(u) + q, then q is a multiple of p(u). Lemma 2 (Halava, Harju and Ilie [10]) Let u be a word over the alphabet {0, 1}. Then u0 or u1 is primitive. Lemma 3 (Halava, Harju and Ilie [10]) Let u be a word over an alphabet A with minimal period p(u). Then there are words v, w (possibly v = ɛ) and a positive integer k such that u = (vw) k v, w ɛ and p(u) = vw. Lemma 4 (Halava, Harju and Ilie [10]) Let u be as in Lemma 3 with k > 1, and let q be such that u p(u) < q < u. Put q = (k 1)p(u) + r where v < r < v + p(u). Then q P(u) if and only if r P(vwv). 6

7 We now describe Halava et al s algorithm. Algorithm 1 (Halava, Harju and Ilie [10]) Given as input a word u over an alphabet A, the following algorithm computes a word Bin(u) of length u over the alphabet {0, 1} such that P(Bin(u)) = P(u). Find the minimal period p(u) of u. 1. If p(u) = u, then output Bin(u) = 01 u If p(u) u, then find words satisfying Lemma 3. (a) If k = 1, then compute Bin(v), find c {0, 1} such that Bin(v)1 w 1 c is primitive, and output Bin(u) = Bin(v)1 w 1 cbin(v). (b) If k > 1, then compute Bin(vwv) = v w v where v = v and w = w and output Bin(u) = (v w ) k v. Note that if u ɛ, then Bin(u) begins with 0 (Bin(ɛ) = ɛ). We end this section with a few examples. Example 1 period If u = abbcbb, then Bin(u) = Both u and Bin(u) have only the 2. If u = abbcbabbcba, then u = (a(bbcb)) 2 a, Bin((a)(bbcb)(a)) = Bin(a)1110Bin(a) = (0)(1110)(0), and Bin(u) = Both u and Bin(u) have the set of periods {5, 10, 11}. Another possible value for Bin(u) is Our main result In this section, we extend Theorem 3 to partial words with one hole. We prove that for every partial word u with one hole over an alphabet A, there exists a partial word v of length u with at most one hole over the alphabet {0, 1} such that P(v) = P(u) and P (v) = P (u) (Theorem 4). If u = a bc, then P(u) = P (u) = {4}. It is easily seen that no partial word v with one hole over {0, 1} satisfies the desired properties, but the full word 0111 does. In the sequel, 0 denotes 1 and 1 denotes 0. 7

8 Our first step in characterizing the set of periods and local periods of a partial word with one hole is to extend to partial words with one hole the properties of words and periods needed in Halava et al s proof. The following lemma gives the structure of the set of local periods of a partial word u with one hole. Lemma 5 Let u be a partial word with one hole over an alphabet A. If q is a local period of u satisfying u p (u) + q, then q is a multiple of p (u). Proof. By Theorem 2, gcd(p (u), q) is a period of u since u p (u) + q. Since p(u) is the minimal period of u and p (u) is the minimal local period of u, we get p (u) p(u) gcd(p (u), q). We conclude that p (u) = gcd(p (u), q) and so p (u) divides q. As a consequence, if p (u) u /2, then P (u) can be partitioned into two sets: the first set including p (u) and its multiples and the second set including all the local periods greater than u p (u). Lemma 6 Let u be a partial word with one hole over the alphabet {0, 1} which is not of the form x x for any x. Then u0 or u1 is primitive. Proof. Assume that u0 v k, u1 w l for some primitive words v, w and integers k, l 2. Both v and w are periods of u, and, since k, l 2, u = k v 1 = l w 1 2 max{ v, w } 1 v + w 1. Case 1. u = v + w 1. Here v = w. Since v ends with 0 and w with 1, put v = x0 and w = y1. We get u x0x and u y1y with x = y. We conclude that u = x x where x = y, a contradiction. Case 2. u > v + w 1. By Theorem 2, u is also gcd( v, w )-periodic. However, gcd( v, w ) divides v and w, and so u x m with x = gcd( v, w ). Since v ends with 0 and w with 1, we get that x ends with 0 and 1, a contradiction. Lemma 7 Let u be a partial word with one hole over an alphabet A with minimal local period p (u). Then one of the following holds: 1. There are partial words v, w 1, w 2,..., w k (possibly v = ɛ) such that 8

9 u = vw 1 vw 2... vw k v, where p (u) = vw 1 = vw 2 = = vw k and where there exists 1 i k such that w i = x y, w j = xay if j < i, and w j = xby if j > i for some a, b A and x, y A. 2. There are partial words w, v 1, v 2,..., v k+1 such that u = v 1 wv 2 w... v k wv k+1, where p (u) = v 1 w = v 2 w = = v k w = v k+1 w, w ɛ, k 1, and where there exists 1 i k + 1 such that v i = x y, v j = xay if j < i, and v j = xby if j > i for some a, b A and x, y A. Proof. Let u be a partial word with one hole over A with minimal local period p (u). Then u = kp (u)+r where 0 r < p (u). Put u = v 1 w 1 v 2 w 2... v k w k v k+1 where v 1 w 1 = v 2 w 2 = = v k w k = p (u) and v 1 = v 2 = = v k = v k+1 = r. Two cases arise. Case 1. There exists 1 i k such that the hole is in w i. In this case, v 1 = v 2 = = v k = v k+1 = v for some possibly empty v. Here we get the situation described in Statement 1. Case 2. There exists 1 i k + 1 such that the hole is in v i. In this case, w 1 = w 2 = = w k = w for some nonempty w (if w is empty, then r = v k+1 = v k = p (u), a contradiction). Note that k 1 (otherwise, u = v k+1 and u has local period v k+1 < p (u) contradicting the fact that p (u) is the minimal local period of u). Here we get the situation described in Statement 2. Lemma 8 1. Let u be as in Lemma 7(1) with k > 1, and let q be such that u p (u) < q < u. Put q = (k 1)p (u) + r where v < r < v + p (u). Also put H(vw i v) = {h}. Then q P(u) if and only if q P (u). Moreover, q P (u) if and only if the following three conditions hold: (a) r P (vw i v). (b) If i 1 and h + r v + p (u), then (vw i v)(h + r) = a. (c) If i k and r < h, then (vw i v)(h r) = b. 9

10 2. Let u be as in Lemma 7(2) with k > 1, and let q be such that u p (u) < q < u. Put q = (k 1)p (u) + r where v i < r < v i + p (u). Then q P(u) if and only if q P (u). (a) If i k + 1 and H(v i ) = {h}, then q P (u) if and only if the following two conditions hold: i. r P (v i wv i+1 ). ii. If i 1 and h + r v i + p (u), then (v i wv i+1 )(h + r) = a. (b) If i 1 and H(v i 1 wv i ) = {h}, then q P (u) if and only if the following two conditions hold: i. r P (v i 1 wv i ). ii. If i k + 1 and r < h, then (v i 1 wv i )(h r) = b. Proof. We first prove Statement 1. For any 0 < j u q = p (u) + v r, we have u (j) = (vw 1 v) (j) and u (j + q) = (vw k v) (j + r). Hence u(j) = u(j + q) if and only if (vw 1 v)(j) = (vw k v)(j + r). The latter implies that q P (u) if and only if Conditions (a)-(c) hold. To see this, first let us assume that q P (u) and let j, j + r D(vw i v). We have j D(vw 1 v) and j + r D(vw k v) and so j, j + q D(u). We get u(j) = u(j + q) and so (vw i v)(j) = (vw 1 v)(j) = (vw k v)(j + r) = (vw i v)(j + r) showing that Condition (a) holds. To see that Condition (b) holds, note that h D(u) and h + q D(u). We have (vw i v)(h+r) = (vw k v)(h+r) = u(h+q) = u(h) = (vw 1 v)(h) = a. To see that Condition (c) holds, note that h r D(u) and h r+q D(u). We have (vw i v)(h r) = (vw 1 v)(h r) = u(h r) = u(h r + q) = (vw k v)(h) = b. Now, let us show that if Conditions (a)-(c) hold, then q P (u). Let j, j + q D(u). We get j D(vw 1 v) and j + r D(vw k v). If j {h, h r}, then j D(vw i v) and j + r D(vw i v). In this case, (vw 1 v)(j) = (vw i v)(j) = (vw i v)(j + r) = (vw k v)(j + r) since Condition (a) holds, and so u(j) = u(j + q). If j = h, then i 1 and j + r D(vw i v). In this case, u(j) = (vw 1 v)(j) = (vw i v)(j + r) = (vw k v)(j + r) = u(j + q) since Condition (b) holds. If j = h r, then i k and j D(vw i v). In this case, u(j) = (vw 1 v)(j) = (vw i v)(j) = (vw k v)(j + r) = u(j + q) since Condition (c) holds. We now prove Statement 2. For any 0 < j u q = p (u) + v i r, we have u (j) = (v 1 wv 2 ) (j) and u (j + q) = (v k wv k+1 ) (j + r). Hence u(j) = u(j + q) if and only if 10

11 (v 1 wv 2 )(j) = (v k wv k+1 )(j + r). The proof is similar to that of Statement 1. Our algorithm 2, that will be described fully in Section 6, works as follows: Let A be an alphabet not containing the special symbol. Given as input a partial word u with one hole over A where H(u) = {h}, Algorithm 2 computes a triple T (u) = [Bin (u), α u, β u ], where Bin (u) is a partial word of length u over the alphabet {0, 1} such that Bin (u) does not begin with 1, H(Bin (u)) {h}, where P(Bin (u)) = P(u) and P (Bin (u)) = P (u), and where α u = and { if h p (u) < 1, u(h p (u)) otherwise, { if h + p β u = (u) > u, u(h + p (u)) otherwise. In particular, T ( ) = [0,, ], and if a A and k > 1, then T ( a k 1 ) = [0 k,, a]. Moreover, if P(u) P (u), then H(Bin (u)) = {h} and α u = u(h p (u)) u(h + p (u)) = β u. Also, if α u and β u, then H(Bin (u)) = {h}. Lemma 9 Let u be as in Lemma 7(1) with k = 1. Assume that Bin(v) begins with 0. For c {0, 1} such that Bin(v)1 w1 1 c is primitive, P (u ) = P(u ) = P(u) = P (u), for the binary word u = Bin(v)1 w1 1 cbin(v). Proof. Put w 1 = w. Obviously, P (u ) = P(u ), and P (u) = P(u) holds since every local period of u is greater than or equal to p (u). Clearly, P(u) P(u ), since P(Bin(v)) = P(v) and all periods q of u satisfy q p(u) p (u) = vw = Bin(v)1 w 1 c. Assume then that there exists q P(u ) \ P(u) and also that q is minimal with this property. Either q < Bin(v) or Bin(v) + w 1 q < u, since Bin(v) does not begin with 1. If q < Bin(v), then, by the minimality of q, q is the minimal period of u, and Lemma 1 implies that p (u) is a multiple of q, and so Bin(v)1 w 1 c is not primitive, a contradiction. If q = Bin(v) + w 1, then c = 0. In this case, if w > 1, we get Bin(v)1 = 0Bin(v), which is impossible, and if w = 1, we get that Bin(v) consists of 0 s only, that 1 is a period of v and hence of u = v v, and that 1 = p (u) = v and so v = ɛ and Bin(v) = ɛ, a contradiction. 11

12 Therefore q > Bin(v) + w 1, and q > p (u) = vw since p (u) P(u ) \ P(u). Put q = p (u) + r where r > 0. Then r is a period of Bin(v) and hence of v. But this implies q P(u), a contradiction. Lemma 10 Let u be as in Lemma 7(2) with k = 1. Assume that v 1 = x y and v 2 = xby. Assume that T (v 1 ) = [Bin (v 1 ), α, β] with H(Bin (v 1 )) H(v 1 ) = {h}. 1. If β =, then let c {0, 1} be such that Bin(v 2 )1 w 1 c is primitive. Then P (u ) = P(u ) = P(u) = P (u), for the binary word u = Bin(v 2 )1 w 1 cbin(v 2 ). 2. If β, then define d as follows: Bin (v 1 )(h p (v 1 )) if α and b = α, d = Bin (v 1 )(h p (v 1 )) if α and b α, 1 otherwise. (a) If Bin (v 1 ) = 0 x 1 y, then let c = 1. (b) Otherwise, if Bin (v 1 )1 w 1 is not of the form z z for any z, then let c {0, 1} be such that Bin (v 1 )1 w 1 c is primitive. (c) Otherwise, if Bin (v 1 )1 w 1 is of the form z z for some z, then let c = d. Then P (u ) = P(u ) = P(u) = P (u), for the binary partial word u = Bin (v 1 )1 w 1 cbin (v 1 )(H(Bin (v 1 )), d). Proof. We first prove Statement 1. There exists c {0, 1} such that Bin(v 2 )1 w 1 c is primitive by Lemma 2. The equality P (u) = P(u) holds since every local period of u is greater than or equal to p (u), and the equality P (u ) = P(u ) holds trivially. To see that P(u) P(u ), first note that P(Bin(v 2 )) = P(v 2 ), and all periods q of u satisfy q p (u). If q = p (u), then q is a period of u. If q > p (u), put q = p (u) + r where r > 0. Then r is a local period of v 1. If β =, then h + r h + p (v 1 ) > v 1. In this case, r is a period of v 2 and hence of Bin(v 2 ), and so q P(u ). 12

13 Assume then that there exists q P(u ) \ P(u) and also that q is minimal with this property. Either q < Bin(v 2 ) or Bin(v 2 ) + w 1 q < u, since Bin(v 2 ) does not begin with 1. If q < Bin(v 2 ), then, by the minimality of q, q is the minimal period of u, and Lemma 1 implies that p (u) is a multiple of q, and so Bin(v 2 )1 w 1 c is not primitive, a contradiction. If q = Bin(v 2 ) + w 1, then c = 0. In this case, if w > 1, we get Bin(v 2 )1 = 0Bin(v 2 ), which is impossible, and if w = 1, we get that Bin(v 2 ) consists of 0 s only and therefore Bin(v 2 )1 w 1 c = Bin(v 2 )0 is not primitive. Hence q > Bin(v 2 ) + w 1, and q > p (u) since p (u) P(u ) \ P(u). By putting q = p (u) + r where r > 0, we get that r is a period of Bin(v 2 ) and hence of v 2. Therefore q P(u). We now prove Statement 2 when Bin (v 1 ) has a hole (when Bin (v 1 ) is full, we have that α = and the proof is simpler). We first prove Statements 2(a) and 2(b) when Bin (v 1 ) begins with 0. Note that in the case of Statement 2(a) where Bin (v 1 ) = 0 x 1 y, we have that Bin (v 1 )1 w 1 c = 0 x 1 y + w is primitive. In the case of Statement 2(b), Lemma 6 implies that there exists c {0, 1} such that Bin (v 1 )1 w 1 c is primitive since Bin (v 1 )1 w 1 is not of the form z z. Now, the equality P (u) = P(u) holds since every local period of u is greater than or equal to p (u). To see that P (u ) = P(u ), first we note that the inclusion P(u ) P (u ) clearly holds. So let q P (u ). If q u p (u), then u = u p (u) + q p (u ) + q and by Theorem 2, gcd(p (u ), q) P(u ) and so gcd(p (u ), q) P (u ). By the minimality of p (u ), we have gcd(p (u ), q) = p (u ), and therefore p (u ) divides q, which implies q P(u ) since p (u ) P(u ). If q > u p (u), then clearly q P(u ). To see that P(u) P(u ), first note that P(Bin (v 1 )) = P(v 1 ), P (Bin (v 1 )) = P (v 1 ), and all periods q of u satisfy q p (u). If q = p (u), then q is a period of u. If q > p (u), put q = p (u) + r where r > 0. If r h, then r is a period of v 1 and hence of Bin (v 1 ). In this case, q P(u ). If r < h, then r is a local period of v 1 and hence of Bin (v 1 ). Here α since p (v 1 ) r < h and v 1 > p (v 1 ) + r since β. By Lemma 5, r is a multiple of p (v 1 ). We have α = v 1 (h p (v 1 )) = v 1 (h r) = v 2 (h) = b and Bin (v 1 )(h r) = Bin (v 1 )(h p (v 1 )) = d = Bin (v 1 )(h, d)(h), and so q P(u ). Assume then that there exists q P(u ) \ P(u) and also that q is minimal with this property. Either q < Bin (v 1 ) or Bin (v 1 ) + w 1 q < u, since Bin (v 1 ) does not 13

14 begin with 1 or. If q < Bin (v 1 ), then, by the minimality of q, q is the minimal period of u, and Lemma 5 implies that p (u) is a multiple of q, and so Bin (v 1 )1 w 1 c is not primitive, a contradiction. If q = Bin (v 1 ) + w 1, then c = 0. In this case, if w > 1 and d = 0, we get Bin (v 1 )1 = 0Bin (v 1 )(h, 0), which is impossible. If w > 1 and d = 1, we get that Bin (v 1 ) looks like 0 x 1 y and therefore that c = 1, a contradiction. If w = 1 and d = 0, we get that Bin (v 1 ) consists of 0 s only and therefore that Bin (v 1 )1 w 1 c = Bin (v 1 )0 is not primitive. And if w = 1 and d = 1, we get an impossible situation. Therefore q > Bin (v 1 ) + w 1, and q > p (u) since p (u) P(u ) \ P(u). By putting q = p (u) + r where r > 0, we get that r is a local period of Bin (v 1 ) and hence of v 1. If r h, then q P(u). If r < h, then α and v 1 > p (v 1 ) + r. By Lemma 5, r is a multiple of p (v 1 ). We have Bin (v 1 )(h r) = Bin (v 1 )(h, d)(h) and so d = Bin (v 1 )(h p (v 1 )). Then b = α and so v 1 (h r) = v 1 (h p (v 1 )) = α = b = v 2 (h) and q P(u). We now prove Statements 2(a) and 2(b) and 2(c) when Bin (v 1 ) begins with a hole (here α = ). The case where Bin (v 1 ) = 1 y is impossible here. There exists c {0, 1} such that Bin (v 1 )1 w 1 c is primitive since Bin (v 1 )1 w 1 cannot be of the form z z (otherwise z = ɛ and v 1 = and Bin (v 1 ) = 0). The equalities P (u) = P(u) and P (u ) = P(u ) hold as above, as well as the inclusion P(u) P(u ). Assume then that there exists q P(u )\P(u) and also that q is minimal with this property. The cases q < Bin (v 1 ) and Bin (v 1 ) + w 1 < q < u follow as above. If q = Bin (v 1 ) + w 1, then we consider the following cases: If w > 1, we get that Bin (v 1 ) looks like 1 y which is an impossible situation (the same is true when w = 1 and c = 1). And if w = 1 and c = 0, we get an impossible situation. If Bin (v 1 ) q < Bin (v 1 ) + w 1 and c = 1, then we get that Bin (v 1 ) looks like 1 y which is impossible. And if Bin (v 1 ) q < Bin (v 1 ) + w 1 and c = 0, then we get an impossible situation or we get that Bin (v 1 )1 w 1 c is not primitive. We are left to prove Statement 2(c) when Bin (v 1 ) begins with 0 (or when z begins with 0). Bin (v 1 )1 w 1 is of the form z z, and consequently Bin (v 1 ) = z 1 1 w 1 z 1 for some z 1 that begins with 0. If p (v 1 ) = z 1 w, then v 1 satisfies Lemma 7(1) and our algorithm (based on Lemma 9 in this case) returns a full binary word, a contradiction. If w > 1 and z 1 p (v 1 ) z 1 + w 1, then z 1 begins with 1, a contradiction. If w = 1 and p (v 1 ) = z 1, then Bin (v 1 ) = 0 0 and α. Put v 1 = e e for some letter e. We have u = v 1 wv 2 = e ewebe and since p (u) = v 1 w = 4, we get b w and (e b or e w). If 14

15 b = α, then c = 1 and d = 0 and u = satisfies the required properties. If b α, then c = 0 and d = 1 and u = satisfies the required properties. If p (v 1 ) < z 1, then we argue as follows. Here both p (v 1 ) and z 1 + w are local periods of v 1. Since v 1 p (v 1 ) + z 1 + w, Theorem 2 says that gcd(p (v 1 ), z 1 + w ) P(v 1 ). But since p (v 1 ) is the minimal local period of v 1, we get that gcd(p (v 1 ), z 1 + w ) = p (v 1 ) and so p (v 1 ) divides z 1 + w. Therefore x can be written as (x 1 e) n x 1 where n > 0, p (v 1 ) = x 1 e, e is a letter, and x 1 is a word. We consider the case where w = 1 and then the case where w > 1. If w = 1, then u = (x 1 e) n x 1 (x 1 e) n x 1 w(x 1 e) n x 1 b(x 1 e) n x 1. Since p (u) = v 1 w, we get b w and (e b or e w). If b = α, then u = (z 2 d) n z 2 (z 2 d) n z 2 d(z2 d) n z 2 d(z 2 d) n z 2 for some z 2. And if b α, then u = (z 2 d) n z 2 (z 2 d) n z 2 d(z2 d) n z 2 d(z 2 d) n z 2 for some z 2. In either case, u satisfies the required properties. If w > 1, then x 1 w. Put w = w 1 f and x 1 = x 2 w 2 where f is a letter, x 2 is a nonempty word, and w 1, w 2 are words of length w 1. Here u = (x 2 w 2 e) n x 2 w 2 (x 2 w 2 e) n x 2 w 1 f(x 2 w 2 e) n x 2 w 2 b(x 2 w 2 e) n x 2. Since p (u) = v 1 w, we get w 1 f w 2 b and (e b or w 1 f w 2 e). If b = α, then u = (z 2 1 w 1 d) n z 2 1 w 1 (z 2 1 w 1 d) n z 2 1 w 1 d(z2 1 w 1 d) n z 2 1 w 1 d(z 2 1 w 1 d) n z 2 for some z 2. And if b α, then u = (z 2 1 w 1 d) n z 2 1 w 1 (z 2 1 w 1 d) n z 2 1 w 1 d(z2 1 w 1 d) n z 2 1 w 1 d(z 2 1 w 1 d) n z 2 for some z 2. In either case, u satisfies the required properties. Lemma 11 Let u be as in Lemma 7(2) with k = 1. Assume that v 1 = xay and v 2 = x y. Assume that T (v 2 ) = [Bin (v 2 ), α, β] with H(Bin (v 2 )) H(v 2 ) = {h}. 1. If α =, then let c {0, 1} be such that Bin(v 1 )1 w 1 c is primitive. Then P (u ) = P(u ) = P(u) = P (u), for the binary word u = Bin(v 1 )1 w 1 cbin(v 1 ). 2. If α, then define d as follows: Bin (v 2 )(h + p (v 2 )) if β and a = β, d = Bin (v 2 )(h + p (v 2 )) if β and a β, 0 otherwise. 15

16 Let c {0, 1} be such that Bin (v 2 )(H(Bin (v 2 )), d)1 w 1 c is primitive (let c = 1 in the case where Bin (v 2 ) = 0 x 1 y ). Then P (u ) = P(u ) = P(u) = P (u), for the binary partial word u = Bin (v 2 )(H(Bin (v 2 )), d)1 w 1 cbin (v 2 ). Proof. We first prove Statement 1. There exists c {0, 1} such that Bin(v 1 )1 w 1 c is primitive by Lemma 2. The equality P (u) = P(u) holds since every local period of u is greater than or equal to p (u), and the equality P (u ) = P(u ) holds trivially. To see that P(u) P(u ), first note that P(Bin(v 1 )) = P(v 1 ), and all periods q of u satisfy q p (u). If q = p (u), then q is a period of u. If q > p (u), put q = p (u) + r where r > 0. Then r is a local period of v 2. If α =, then r p (v 2 ) h. In this case, r is a period of v 1 and hence of Bin(v 1 ), and so q P(u ). Assume then that there exists q P(u ) \ P(u) and also that q is minimal with this property. Either q < Bin(v 1 ) or Bin(v 1 ) + w 1 q < u, since Bin(v 1 ) does not begin with 1. If q < Bin(v 1 ), then, by the minimality of q, q is the minimal period of u, and Lemma 1 implies that p (u) is a multiple of q, and so Bin(v 1 )1 w 1 c is not primitive, a contradiction. If q = Bin(v 1 ) + w 1, then c = 0. In this case, if w > 1, we get Bin(v 1 )1 = 0Bin(v 1 ), which is impossible, and if w = 1, we get that Bin(v 1 ) consists of 0 s only and therefore Bin(v 1 )1 w 1 c = Bin(v 1 )0 is not primitive. Hence q > Bin(v 1 ) + w 1, and q > p (u) since p (u) P(u ) \ P(u). By putting q = p (u) + r where r > 0, we get that r is a period of Bin(v 1 ) and hence of v 1. Therefore q P(u). We now prove Statement 2 when Bin (v 2 ) has a hole (when Bin (v 2 ) is full, we have that β = and the proof is simpler). Note that Bin (v 2 )(h, d) begins with 0 (otherwise, h = 1 and α = ). Note also that in the case where Bin (v 2 ) = 0 x 1 y, we have that Bin (v 2 )(h, d)1 w 1 c = 0 x d1 y + w is primitive. As in the proof of Lemma 10, P (u) = P(u) and P (u ) = P(u ). To see that P(u) P(u ), first note that all periods q of u satisfy q p (u) = v 1 w = Bin (v 2 )(h, d)1 w 1 c. Clearly p (u) P(u) and p (u) P(u ). So put q = p (u) + r with r > 0. We get that r is a local period of v 2 and hence r is a local period of Bin (v 2 ). We consider the case where h + r > v 2, and then the case where h + r v 2. If h + r > v 2, then q P(u ). If h + r v 2, then β since h + p (v 2 ) h + r v 2 and v 2 > p (v 2 ) + r 16

17 since α. By Lemma 5, r is a multiple of p (v 2 ). We have v 2 (h + r) = v 1 (h) and so β = v 2 (h + p (v 2 )) = v 2 (h + r) = v 1 (h) = a. In this case, d = Bin (v 2 )(h + p (v 2 )) and so Bin (v 2 )(h + r) = Bin (v 2 )(h, d)(h) implying q P(u ). To see that P(u ) P(u), assume that there exists q P(u ) \ P(u) and also that q is minimal with this property. Either q < v 1 or v 1 + w 1 q < u, since Bin (v 2 )(h, d) does not begin with 1. If q < v 1, then, by the minimality of q, q is the minimal period of u, and Lemma 5 implies that p (u) is a multiple of q, and so we get a contradiction with the choice of c. If q = v 1 + w 1, then c = 0. In this case, if w > 1 and d = 1, we get Bin (v 2 )(h, 1)1 = 0Bin (v 2 ), which is impossible. If w > 1 and d = 0, we get that Bin (v 2 ) looks like 0 x 1 y and therefore that c = 1, a contradiction. If w = 1 and d = 1, we get an impossible situation. And if w = 1 and d = 0, we get that Bin (v 2 )(h, 0) consists of 0 s only and therefore that Bin (v 2 )(h, 0)1 w 1 c = Bin (v 2 )(h, 0)0 is not primitive. Therefore q > v 1 + w 1, and q > p (u) since p (u) P(u ) \ P(u). Put q = p (u) + r where r > 0. We get that r is a local period of Bin (v 2 ) and hence of v 2. If h + r > v 2, then q P(u). If h + r v 2, then β and v 2 > p (v 2 ) + r. By Lemma 5, r is a multiple of p (v 2 ). We get Bin (v 2 )(h + r) = Bin (v 2 )(h, d)(h) and so d = Bin (v 2 )(h + r) = Bin (v 2 )(h + p (v 2 )). In this case, a = β and so v 1 (h) = a = β = v 2 (h + p (v 2 )) = v 2 (h + r) implying q P(u). Lemma 12 Let u be as in Lemma 7(1) with k > 1. Assume that T (vw i v) = [Bin (vw i v), α, β] with H(Bin (vw i v)) H(vw i v) = {h}. 1. Assume that i = 1. (a) If β =, then put Bin(vw k v) = v w v where v = v and w = w k. Then P (u ) = P(u ) = P(u) = P (u), for the binary word u = (v w ) k v. (b) If α = and β, then put Bin (vw i v) = v w v where v = v and w = w i. Then P (u ) = P(u ) = P(u) = P (u), for the binary partial word u = (v w )(h, )((v w )(h, d)) k 1 v where d is defined as follows: { 1 if v = ɛ and x ɛ, d = 0 otherwise. 17

18 (c) If α and β, then put Bin (vw i v) = v w v where v = v and w = w i. Then P (u ) = P(u ) = P(u) = P (u), for the binary partial word u = v w ((v w )(h, d)) k 1 v where d is defined as follows: 2. Assume that i = k. d = { Bin (vw i v)(h p (vw i v)) if b = α, Bin (vw i v)(h p (vw i v)) if b α. (a) If α =, then put Bin(vw 1 v) = v w v where v = v and w = w 1. Then P (u ) = P(u ) = P(u) = P (u), for the binary word u = (v w ) k v. (b) If α and β =, then put Bin (vw i v) = v w v where v = v and w = w i. Then P (u ) = P(u ) = P(u) = P (u), for the binary partial word where d is defined as follows: u = ((v w )(h, d)) k 1 (v w )(h, )v { 1 if v = ɛ and y ɛ, d = 0 otherwise. (c) If α and β, then put Bin (vw i v) = v w v where v = v and w = w i. Then P (u ) = P(u ) = P(u) = P (u), for the binary partial word u = ((v w )(h, d)) k 1 v w v where d is defined as follows: d = { Bin (vw i v)(h + p (vw i v)) if a = β, Bin (vw i v)(h + p (vw i v)) if a β. 3. Assume that 1 < i < k and a = b. Put Bin(vw 1 v) = v w v where v = v and w = w 1. Then P (u ) = P(u ) = P(u) = P (u), for the binary partial word u = (v w ) i 1 (v w )(h, )(v w ) k i v. 18

19 4. Assume that 1 < i < k and a b. (a) If α and β =, then put Bin(vw k v) = v w v where v = v and w = w k, and put d = (v w )(h). Then P(u ) = P(u) and P (u ) = P (u), for the binary partial word u = ((v w )(h, d)) i 1 (v w )(h, )((v w )(h, d)) k i v. (b) If β and x = ɛ, then put Bin(vw 1 v) = v w v where v = v and w = w 1, and put d = (v w )(h). Then P(u ) = P(u) and P (u ) = P (u), for the binary partial word u = ((v w )(h, d)) i 1 (v w )(h, )((v w )(h, d)) k i v. (c) If (α = and β = ) or (β and x ɛ), then put Bin (vw i v) = v w v where v = v and w = w i. Then P(u ) = P(u) and P (u ) = P (u), for the binary partial word where d is defined as follows: d = u = ((v w )(h, d)) i 1 (v w )(h, )((v w )(h, d)) k i v Bin (vw i v)(h p (vw i v)) if α and b = α and a = β, Bin (vw i v)(h p (vw i v)) if α and (b α or a β), Bin (vw i v)(h + p (vw i v)) if α = and β and a = β, Bin (vw i v)(h + p (vw i v)) if α = and β and a β, 0 otherwise. Proof. First, let us show that P (u) = P(u) for Statements 1, 2 and 3. The inclusion P(u) P (u) clearly holds. So let q P (u). If q u p (u), then q is a multiple of p (u) by Lemma 5. In this case, since p (u) P(u), also q P(u). If q > u p (u), then clearly q P(u). Now, let us show that P(u ) = P(u). Obviously, u P(u) and u P(u ). First, consider q with q u p (u). If q P(u), then Lemma 5 gives that q is a multiple of p (u), and therefore q {p (u), 2p (u),..., (k 1)p (u)}. For Statements 1, 2 and 3 we get q P(u ) since p (u) P(u ), and for Statement 4 it is impossible. On the other hand, assume that q P(u ). Now, u = u p (u) + q, and thus, by Theorem 1 or Theorem 2, gcd(p (u), q) P(u ). For Statement 1(a), since p (u) = v w is a multiple of gcd(p (u), q), 19

20 we get that gcd(p (u), q) is a period of v w v and hence of vw k v. So gcd(p (u), q) P(u) and since q is a multiple of gcd(p (u), q), we also get q P(u). For Statement 1(c), we have that v w v has a hole and that gcd(p (u), q) is a period of (v w )(h, d)v. We get that gcd(p (u), q) is a period of vw k v and q P(u) as above. Statement 2 is handled similarly as Statement 1, and Statement 3 as Statement 2(a). For Statement 4, since p (u) = v w is a multiple of gcd(p (u), q), we get that gcd(p (u), q) is a period of both (v w )(h, d)v and (v w )(h, d)v. We get gcd(p (u), q) = p (u) which is impossible. Second, consider q with u p (u) < q < u, and put q = (k 1)p (u) + r where v < r < p (u) + v. For Statement 3, q P(u) if and only if r P(vw 1 v) if and only if r P(v w v ) if and only if q P(u ). We now prove that q P(u) if and only if q P(u ) for Statement 1 (this is proved similarly for Statement 2). For Statement 1(a), q P(u) if and only if r P(vw k v) if and only if r P(v w v ) if and only if q P(u ). For Statements 1(b) and 1(c), if q P(u), then the conditions of Lemma 8(1)(a)(c) hold. Here r P (vw i v) by Lemma 8(1)(a). We consider the following two cases: Case 1. r < h. We have v < r < h and so x ɛ (otherwise vx < r < h which is impossible since h = vx + 1). Here α since p (vw i v) r < h. Here vw i v p (vw i v) + r (otherwise vw i v < p (vw i v + r < p (vw i v) + h and β =, a contradiction). By Lemma 5, r is a multiple of p (vw i v). Since i k, we have (vw i v)(h r) = b by Lemma 8(1)(c) and so b = (vw i v)(h r) = (vw i v)(h p (vw i v)) = α. For Statement 1(c), we get (v w v )(h r) = d since d = (v w v )(h p (vw i v)) and q P(u ) by Lemma 8(1). Case 2. r h. For Statement 1(b), we have r P(v w v ). We conclude that r P ((v w )(h, )v ) and q P(u ). For Statement 1(c), we have r P (v w v ) and the result follows by Lemma 8(1). The cases r h and r < h are handled similarly as above in order to show that if q P(u ) then q P(u). Note that for Statement 1(b), we have that r P ((v w )(h, )v ). If v w v has a hole, we get r P (v w v ) = P (vw i v). If v w v is full, then r P((v w )(h, d)v ). So r P(v w v ) by the definition of d. Hence r P (vw i v). For Statement 1(c), we have that r P (v w v ) = P (vw i v). For Statement 4, we first show that if q P(u) then q P(u ). If q P(u), then the 20

21 three conditions of Lemma 8(1) hold. Here r P (vw i v) by Lemma 8(1)(a). We consider the following six cases: Case 3. h + r > vw i v and r h. For Statement 4(a), r is a period of vw k v and hence of Bin(vw k v) = v w v, and so r P ((v w )(h, )v ) and q P(u ). For Statement 4(b), r is a period of vw 1 v and the result follows similarly. For Statement 4(c), we get r P ((v w )(h, )v ) since r P (v w v ). Case 4. h + r vw i v and r h and vw i v p (vw i v) + r. Here vw i v p (vw i v) + r p (vw i v) + h, and so β. By Lemma 5, r is a multiple of p (vw i v). Since i 1, we have (vw i v)(h+r) = a by Lemma 8(1)(b) and so a = (vw i v)(h+r) = (vw i v)(h + p (vw i v)) = β. For Statement 4(c) with α =, we get ((v w )(h, )v )(h + r) = d since d = (v w v )(h + p (vw i v)) = (v w v )(h + r), and so q P(u ). For Statement 4(c) with α, we consider the case where b = α and then the case where b α. If b = α, then α = b a = β and d = (v w v )(h p (vw i v)), and so ((v w )(h, )v )(h + r) = d since d = (v w v )(h+p (vw i v)) = (v w v )(h+r). If b α, then d = (v w v )(h p (vw i v)). In this case, p (vw i v) = gcd(p (vw i v), r) P(vw i v) = P(v w v ). We get d = (v w v )(h p (vw i v)) = (v w v )(h + p (vw i v)) = (v w v )(h + r) and so ((v w )(h, )v )(h + r) = d. For Statement 4(b), we get that r is a period of vw 1 v and hence of v w v and so ((v w )(h, )v )(h + r) = (v w v )(h + r) = (v w v )(h) = d. Case 5. h + r > vw i v and r < h and vw i v p (vw i v) + r. We have v < r < h and so x ɛ (otherwise vx < r < h which is impossible since h = vx + 1). Here α since p (vw i v) r < h. By Lemma 5, r is a multiple of p (vw i v). Since i k, we have (vw i v)(h r) = b by Lemma 8(1)(c) and so b = (vw i v)(h r) = (vw i v)(h p (vw i v)) = α. For Statement 4(a), we get that r is a period of vw k v and hence of (v w )(h, d)v = v w v and so ((v w )(h, )v )(h r) = d since (v w v )(h r) = (v w v )(h) = d. For Statement 4(c), we get ((v w )(h, )v )(h r) = d since d = (v w v )(h p (vw i v)). Case 6. h + r vw i v and r < h. We have v < r < h and so x ɛ (otherwise vx < r < h which is impossible since h = vx + 1). Here vw i v p (vw i v) + r (otherwise, r + p (vw i v) < h + p (vw i v) h + r vw i v < p (vw i v) + r, a contradiction). By Lemma 5, r is a multiple of p (vw i v). We have α since p (vw i v) r < h, and β since h + p (vw i v) h + r vw i v. Since i 1, we have (vw i v)(h + r) = a by Lemma 8(1)(b) and so a = (vw i v)(h + r) = 21

22 (vw i v)(h + p (vw i v)) = β. Since i k, we have (vw i v)(h r) = b by Lemma 8(1)(c) and so b = (vw i v)(h r) = (vw i v)(h p (vw i v)) = α. Then β = a b = α and for Statement 4(c), we get ((v w )(h, )v )(h + r) = d and ((v w )(h, )v )(h r) = d since d = (v w v )(h p (vw i v)) and the result follows. Case 7. h + r vw i v and r h and vw i v < p (vw i v) + r. Here α = since h + r vw i v < p (vw i v) + r and so h < p (vw i v), but β since h + p (vw i v) h + r vw i v. Since i 1, we have (vw i v)(h + r) = a by Lemma 8(1)(b). For Statement 4(b), we get that r is a period of vw 1 v and hence of (v w )(h, d)v = v w v, and so ((v w )(h, )v )(h + r) = (v w v )(h + r) = (v w v )(h) = d. For Statement 4(c), we get that r is a period of vw 1 v and hence of (v w )(h, d)v, and so ((v w )(h, )v )(h + r) = ((v w )(h, d)v )(h + r) = ((v w )(h, d)v )(h) = d. Case 8. h + r > vw i v and r < h and vw i v < p (vw i v) + r. Here β = since vw i v < p (vw i v)+r < p (vw i v)+h, but α since p (vw i v) r < h. Since i k, we have (vw i v)(h r) = b by Lemma 8(1)(c). For Statement 4(a), we get that r is a period of vw k v and hence of (v w )(h, d)v = v w v, and so ((v w )(h, )v )(h r) = (v w v )(h r) = (v w v )(h) = d. We show similarly that if q P(u ) then q P(u). Note that for Statement 4(a), we have that r P ((v w )(h, )v ) and also r P((v w )(h, d)v ) = P(v w v ). It follows that r P(vw k v) and r P (vw i v). For Statement 4(b), we have that r P ((v w )(h, )v ) and also r P((v w )(h, d)v ) = P(v w v ). It follows that r P(vw 1 v) and r P (vw i v). For Statement 4(c) when v w v has a hole, we have that r P ((v w )(h, )v ) = P (v w v ) = P (vw i v). When v w v has no hole, we have that α =. In this case, if β =, then r P ((v w )(h, )v ) and r P((v w )(h, 0)v ) and r P((v w )(h, 1)v ), and so r P(v w v ) and r P (vw i v). If β, then r P ((v w )(h, )v ) and r P((v w )(h, d)v ). So r P(v w v ) by the definition of d. Hence r P (vw i v). Last, let us show that P (u ) = P (u). Obviously, u P (u) and u P (u ). Note that p (u) = vw 1 = = vw k = v w and so p (u) P (u) and p (u) P (u ). Consider q with q u p (u). If q P (u), then Lemma 5 gives that q is a multiple of p (u), and therefore q {p (u), 2p (u),..., (k 1)p (u)}. We get q P (u ) (for Statement 4, we get q = p (u)). On the other hand, if q P (u ), then u = u p (u) + q, and thus, by Theorem 1 or Theorem 2, gcd(p (u), q) P(u ). Since P(u ) = P(u) P (u), we get 22

23 that gcd(p (u), q) P (u). By the minimality of p (u), we have gcd(p (u), q) = p (u), and therefore p (u) divides q. We get q P (u) (for Statement 4, we get q = p (u)). Now, consider q with u p (u) < q < u, and put q = (k 1)p (u) + r where v < r < p (u)+ v. We show that P (u) P (u ) (the inclusion P (u ) P (u) is proved similarly). If q P (u), then q P(u). Since P(u) = P(u ), we get that q P(u ) and hence q P (u ). Lemma 13 Let u be as in Lemma 7(2) with k > Assume that i = 1. Put Bin (v i wv i+1 ) = v w v where v = v = v i and w = w. Then P (u ) = P(u ) = P(u) = P (u), for the binary partial word u = v (w v ) k. 2. Assume that i = k + 1. Put Bin (v i 1 wv i ) = v w v where v = v = v i and w = w. Then P (u ) = P(u ) = P(u) = P (u), for the binary partial word u = (v w ) k v. 3. Assume that 1 < i < k + 1 and a = b. Assume that T (v i ) = [Bin (v i ), α, β] with H(Bin (v i )) H(v i ) = {h}. (a) If α =, then put Bin (v i 1 wv i ) = v w v where v = v = v i and w = w. Then P (u ) = P(u ) = P(u) = P (u), for the binary partial word u = (v w ) i 1 v (h, )(w v ) k i+1. (b) If α, then put Bin (v i wv i+1 ) = v w v where v = v = v i and w = w. Then P (u ) = P(u ) = P(u) = P (u), for the binary partial word u = (v w ) i 1 v (h, )(w v ) k i Assume that 1 < i < k + 1 and a b. Assume that T (v i ) = [Bin (v i ), α, β] with H(Bin (v i )) H(v i ) = {h}. (a) If (α = and β and a = β) or x = ɛ, then put Bin (v i 1 wv i ) = v w v where v = v = v i and w = w, and put d = v (h). Then P(u ) = P(u) and P (u ) = P (u), for the binary partial word 23

24 u = (v (h, d)w ) i 1 v (h, )(w v (h, d)) k i+1. (b) If (α or β = or a β) and x ɛ, then put Bin (v i wv i+1 ) = v w v where v = v = v i and w = w, and put d = v (h). Then P(u ) = P(u) and P (u ) = P (u), for the binary partial word u = (v (h, d)w ) i 1 v (h, )(w v (h, d)) k i+1. Proof. For Statements 1, 2, and 3, the equality P (u) = P(u) is proved as in Lemma 12. For Statements 1, 2, 3, and 4, the equality P (u ) = P (u) follows as in Lemma 12 once the equality P(u ) = P(u) is proved. First, let us show the equality P(u ) = P(u) for Statement 2 (Statement 1 is similar but uses Lemma 8(2)(a) instead of Lemma 8(2)(b)). The case where q P(u) with q u p (u) is proved as in Lemma 12. The case where q P(u ) with q u p (u) is proved as follows. We have u = u p (u) + q, and thus, by Theorem 1 or Theorem 2, gcd(p (u), q) P(u ). Since p (u) = v w is a multiple of gcd(p (u), q), we also have that gcd(p (u), q) is a period of v w v and hence of v i 1 wv i. So gcd(p (u), q) P(u) and since q is a multiple of gcd(p (u), q), we also get q P(u). The case where u p (u) < q < u is proved as follows. Here q = (k 1)p (u) + r with v i < r < p (u) + v i. By Lemma 8(2)(b), q P(u) if and only if r P (v i 1 wv i ) = P (v w v ) which, by Lemma 4 or Lemma 8(2)(b), is equivalent with q P(u ). Now, let us show the equality P(u ) = P(u) for Statement 3. Again, the case where q P(u) with q u p (u) is proved as in Lemma 12. The case where q P(u ) with q u p (u) is proved as follows. We have u = u p (u) + q, and thus, by Theorem 2, gcd(p (u), q) P(u ). For Statement 3(a), since p (u) = v w is a multiple of gcd(p (u), q), we also have that gcd(p (u), q) is a period of v w v and hence of v w v and of v i 1 wv i. So gcd(p (u), q) P(u) and since q is a multiple of gcd(p (u), q), we also get q P(u). The result follows similarly for Statement 3(b). The case where q P(u) with u p (u) < q < u is proved as follows (we show similarly the case where q P(u ) with u p (u) < q < u ). Here q = (k 1)p (u) + r with v i < r < p (u) + v i. For Statement 3(a), the two conditions of Lemma 8(2)(b) hold. Here r P (v i 1 wv i ) and hence r P (v w v ) and r P (v w v (h, )). If r h + p (u), then q P(u ) by Lemma 8(2)(b). If r < h + p (u), then (v i 1 wv i )(h + p (u) r) = b by 24

25 Lemma 8(2)(b)(ii). We consider the case where r = p (u), the case where r > p (u), and then the case where r < p (u). If r = p (u), then (v w v (h, ))(h + p (u) p (u)) = v (h) and q P(u ) by Lemma 8(2)(b). If r > p (u), then r p (u) is a local period of v i and so r p (u) p (v i ). Since r < h + p (u), we get r p (u) < h. Since α =, we get r p (u) < h p (v i ) which yields a contradiction. If r < p (u), then p (u) r is a local period of v i and so p (v i ) p (u) r. If h + p (u) r v i, then v i 1 (h) = a = b = (v i 1 wv i )(h + p (u) r) = v i 1 (h + p (u) r) and so v (h) = v (h + p (u) r). We conclude that (v w v (h, ))(h + p (u) r) = v (h + p (u) r) = v (h), and q P(u ) by Lemma 8(2)(b). If h + p (u) r > v i, then (v i 1 wv i )(h + p (u) r) = b = a = v i 1 (h) and so (v w v (h, ))(h + p (u) r) = v (h) as desired. For Statement 3(b), the two conditions of Lemma 8(2)(a) hold. Here r P (v i wv i+1 ) and hence r P (v w v ) and r P (v (h, )w v ). If h + r > v i wv i+1, then q P(u ) by Lemma 8(2)(a). If h + r v i wv i+1, then (v i wv i+1 )(h + r) = a by Lemma 8(2)(a)(ii). We consider the case where r = p (u), the case where r > p (u), and then the case where r < p (u). If r = p (u), then (v (h, )w v )(h + p (u)) = v (h) and q P(u ) by Lemma 8(2)(a). If r > p (u), then r p (u) is a local period of v i and so r p (u) p (v i ). Since h+r v i wv i+1, we get h + r p (u) v i. We deduce that h + p (v i ) h + r p (u) v i and so β and v = v (h, ). We have v i+1 (h) = a = (v i wv i+1 )(h + r) = (v i wv i+1 )(h + r p (u) + p (u)) = v i+1 (h + r p (u)) and so v (h) = v (h + r p (u)). We get (v (h, )w v )(h + r) = (v (h, )w v )(h+r p (u)+p (u)) = v (h+r p (u)) = v (h) and q P(u ) by Lemma 8(2)(a). If r < p (u), then p (u) r is a local period of v i and so p (u) r p (v i ). If h+r p (u) > 0, then v i+1 (h) = a = (v i wv i+1 )(h + r) = (v i wv i+1 )(h + r p (u) + p (u)) = v i+1 (h + r p (u)) = v i+1 (h (p (u) r)) and so v (h) = v (h (p (u) r)). We get (v (h, )w v )(h + r) = (v (h, )w v )(h + r p (u) + p (u)) = v (h + r p (u)) = v (h (p (u) r)) = v (h), and q P(u ) by Lemma 8(2)(a). If h + r p (u) 0, then (v i wv i+1 )(h + r) = a = b = v i+1 (h) and so (v (h, )w v )(h + r) = v (h) as desired. Now, let us show the equality P(u ) = P(u) for Statement 4. Again, the case where q P(u) with q u p (u) is proved as in Lemma 12. The case where q P(u ) with q u p (u) is proved as follows. We have u = u p (u) + q, and thus, by Theorem 2, gcd(p (u), q) P(u ). Since p (u) = v w is a multiple of gcd(p (u), q), we also have that gcd(p (u), q) is a period of v (h, d)w v (h, d) which is impossible. 25

### Fundamentele Informatica II

Fundamentele Informatica II Answer to selected exercises 1 John C Martin: Introduction to Languages and the Theory of Computation M.M. Bonsangue (and J. Kleijn) Fall 2011 Let L be a language. It is clear

### Elementary Number Theory We begin with a bit of elementary number theory, which is concerned

CONSTRUCTION OF THE FINITE FIELDS Z p S. R. DOTY Elementary Number Theory We begin with a bit of elementary number theory, which is concerned solely with questions about the set of integers Z = {0, ±1,

### Mathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson

Mathematics for Computer Science/Software Engineering Notes for the course MSM1F3 Dr. R. A. Wilson October 1996 Chapter 1 Logic Lecture no. 1. We introduce the concept of a proposition, which is a statement

### I. GROUPS: BASIC DEFINITIONS AND EXAMPLES

I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called

### Finite Sets. Theorem 5.1. Two non-empty finite sets have the same cardinality if and only if they are equivalent.

MATH 337 Cardinality Dr. Neal, WKU We now shall prove that the rational numbers are a countable set while R is uncountable. This result shows that there are two different magnitudes of infinity. But we

### A glimpse of combinatorics on words

A glimpse of combinatorics on words Benny George K Tata Institute of Fundamental Research,Mumbai India Indo Russian Workshop 2008 Ural State Univeristy Kenkireth TIFR (INDIA) A glimpse of combinatorics

### FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z

FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z DANIEL BIRMAJER, JUAN B GIL, AND MICHAEL WEINER Abstract We consider polynomials with integer coefficients and discuss their factorization

### a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.

Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given

### POWER SETS AND RELATIONS

POWER SETS AND RELATIONS L. MARIZZA A. BAILEY 1. The Power Set Now that we have defined sets as best we can, we can consider a sets of sets. If we were to assume nothing, except the existence of the empty

### 6.2 Permutations continued

6.2 Permutations continued Theorem A permutation on a finite set A is either a cycle or can be expressed as a product (composition of disjoint cycles. Proof is by (strong induction on the number, r, of

### The Goldberg Rao Algorithm for the Maximum Flow Problem

The Goldberg Rao Algorithm for the Maximum Flow Problem COS 528 class notes October 18, 2006 Scribe: Dávid Papp Main idea: use of the blocking flow paradigm to achieve essentially O(min{m 2/3, n 1/2 }

### POLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS

POLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS RUSS WOODROOFE 1. Unique Factorization Domains Throughout the following, we think of R as sitting inside R[x] as the constant polynomials (of degree 0).

### Ri and. i=1. S i N. and. R R i

The subset R of R n is a closed rectangle if there are n non-empty closed intervals {[a 1, b 1 ], [a 2, b 2 ],..., [a n, b n ]} so that R = [a 1, b 1 ] [a 2, b 2 ] [a n, b n ]. The subset R of R n is an

### Characterization of some binary words with few squares

Characterization of some binary words with few squares Golnaz Badkobeh a, Pascal Ochem b a Department of Computer Science, University of Sheffield, UK b CNRS - LIRMM, Montpellier, France Abstract Thue

### CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e.

CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e. This chapter contains the beginnings of the most important, and probably the most subtle, notion in mathematical analysis, i.e.,

### k, then n = p2α 1 1 pα k

Powers of Integers An integer n is a perfect square if n = m for some integer m. Taking into account the prime factorization, if m = p α 1 1 pα k k, then n = pα 1 1 p α k k. That is, n is a perfect square

### minimal polyonomial Example

Minimal Polynomials Definition Let α be an element in GF(p e ). We call the monic polynomial of smallest degree which has coefficients in GF(p) and α as a root, the minimal polyonomial of α. Example: We

### Metric Spaces. Chapter 1

Chapter 1 Metric Spaces Many of the arguments you have seen in several variable calculus are almost identical to the corresponding arguments in one variable calculus, especially arguments concerning convergence

### INCIDENCE-BETWEENNESS GEOMETRY

INCIDENCE-BETWEENNESS GEOMETRY MATH 410, CSUSM. SPRING 2008. PROFESSOR AITKEN This document covers the geometry that can be developed with just the axioms related to incidence and betweenness. The full

### Computing Cubic Fields in Quasi-Linear Time

Computing Cubic Fields in Quasi-Linear Time K. Belabas Département de mathématiques (A2X) Université Bordeaux I 351, cours de la Libération, 33405 Talence (France) belabas@math.u-bordeaux.fr Cubic fields

### GROUPS SUBGROUPS. Definition 1: An operation on a set G is a function : G G G.

Definition 1: GROUPS An operation on a set G is a function : G G G. Definition 2: A group is a set G which is equipped with an operation and a special element e G, called the identity, such that (i) the

### 8 Divisibility and prime numbers

8 Divisibility and prime numbers 8.1 Divisibility In this short section we extend the concept of a multiple from the natural numbers to the integers. We also summarize several other terms that express

### CHAPTER 5. Number Theory. 1. Integers and Division. Discussion

CHAPTER 5 Number Theory 1. Integers and Division 1.1. Divisibility. Definition 1.1.1. Given two integers a and b we say a divides b if there is an integer c such that b = ac. If a divides b, we write a

### This asserts two sets are equal iff they have the same elements, that is, a set is determined by its elements.

3. Axioms of Set theory Before presenting the axioms of set theory, we first make a few basic comments about the relevant first order logic. We will give a somewhat more detailed discussion later, but

### Section 3 Sequences and Limits, Continued.

Section 3 Sequences and Limits, Continued. Lemma 3.6 Let {a n } n N be a convergent sequence for which a n 0 for all n N and it α 0. Then there exists N N such that for all n N. α a n 3 α In particular

### MODULAR ARITHMETIC. a smallest member. It is equivalent to the Principle of Mathematical Induction.

MODULAR ARITHMETIC 1 Working With Integers The usual arithmetic operations of addition, subtraction and multiplication can be performed on integers, and the result is always another integer Division, on

### No: 10 04. Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics

No: 10 04 Bilkent University Monotonic Extension Farhad Husseinov Discussion Papers Department of Economics The Discussion Papers of the Department of Economics are intended to make the initial results

### WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT?

WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT? introduction Many students seem to have trouble with the notion of a mathematical proof. People that come to a course like Math 216, who certainly

### 1 Approximating Set Cover

CS 05: Algorithms (Grad) Feb 2-24, 2005 Approximating Set Cover. Definition An Instance (X, F ) of the set-covering problem consists of a finite set X and a family F of subset of X, such that every elemennt

### An example of a computable

An example of a computable absolutely normal number Verónica Becher Santiago Figueira Abstract The first example of an absolutely normal number was given by Sierpinski in 96, twenty years before the concept

### SCORE SETS IN ORIENTED GRAPHS

Applicable Analysis and Discrete Mathematics, 2 (2008), 107 113. Available electronically at http://pefmath.etf.bg.ac.yu SCORE SETS IN ORIENTED GRAPHS S. Pirzada, T. A. Naikoo The score of a vertex v in

### = 2 + 1 2 2 = 3 4, Now assume that P (k) is true for some fixed k 2. This means that

Instructions. Answer each of the questions on your own paper, and be sure to show your work so that partial credit can be adequately assessed. Credit will not be given for answers (even correct ones) without

### Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011

Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011 A. Miller 1. Introduction. The definitions of metric space and topological space were developed in the early 1900 s, largely

### Problem Set I: Preferences, W.A.R.P., consumer choice

Problem Set I: Preferences, W.A.R.P., consumer choice Paolo Crosetto paolo.crosetto@unimi.it Exercises solved in class on 18th January 2009 Recap:,, Definition 1. The strict preference relation is x y

### Degree Hypergroupoids Associated with Hypergraphs

Filomat 8:1 (014), 119 19 DOI 10.98/FIL1401119F Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Degree Hypergroupoids Associated

### Factorization Algorithms for Polynomials over Finite Fields

Degree Project Factorization Algorithms for Polynomials over Finite Fields Sajid Hanif, Muhammad Imran 2011-05-03 Subject: Mathematics Level: Master Course code: 4MA11E Abstract Integer factorization is

### On the independence number of graphs with maximum degree 3

On the independence number of graphs with maximum degree 3 Iyad A. Kanj Fenghui Zhang Abstract Let G be an undirected graph with maximum degree at most 3 such that G does not contain any of the three graphs

### Formal Languages and Automata Theory - Regular Expressions and Finite Automata -

Formal Languages and Automata Theory - Regular Expressions and Finite Automata - Samarjit Chakraborty Computer Engineering and Networks Laboratory Swiss Federal Institute of Technology (ETH) Zürich March

### Prime Numbers and Irreducible Polynomials

Prime Numbers and Irreducible Polynomials M. Ram Murty The similarity between prime numbers and irreducible polynomials has been a dominant theme in the development of number theory and algebraic geometry.

### On the generation of elliptic curves with 16 rational torsion points by Pythagorean triples

On the generation of elliptic curves with 16 rational torsion points by Pythagorean triples Brian Hilley Boston College MT695 Honors Seminar March 3, 2006 1 Introduction 1.1 Mazur s Theorem Let C be a

### Partitioning edge-coloured complete graphs into monochromatic cycles and paths

arxiv:1205.5492v1 [math.co] 24 May 2012 Partitioning edge-coloured complete graphs into monochromatic cycles and paths Alexey Pokrovskiy Departement of Mathematics, London School of Economics and Political

### GREATEST COMMON DIVISOR

DEFINITION: GREATEST COMMON DIVISOR The greatest common divisor (gcd) of a and b, denoted by (a, b), is the largest common divisor of integers a and b. THEOREM: If a and b are nonzero integers, then their

### CS 103X: Discrete Structures Homework Assignment 3 Solutions

CS 103X: Discrete Structures Homework Assignment 3 s Exercise 1 (20 points). On well-ordering and induction: (a) Prove the induction principle from the well-ordering principle. (b) Prove the well-ordering

### CS103B Handout 17 Winter 2007 February 26, 2007 Languages and Regular Expressions

CS103B Handout 17 Winter 2007 February 26, 2007 Languages and Regular Expressions Theory of Formal Languages In the English language, we distinguish between three different identities: letter, word, sentence.

### Continued Fractions and the Euclidean Algorithm

Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction

### Mathematics Course 111: Algebra I Part IV: Vector Spaces

Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are

### (IALC, Chapters 8 and 9) Introduction to Turing s life, Turing machines, universal machines, unsolvable problems.

3130CIT: Theory of Computation Turing machines and undecidability (IALC, Chapters 8 and 9) Introduction to Turing s life, Turing machines, universal machines, unsolvable problems. An undecidable problem

### Introduction to Finite Fields (cont.)

Chapter 6 Introduction to Finite Fields (cont.) 6.1 Recall Theorem. Z m is a field m is a prime number. Theorem (Subfield Isomorphic to Z p ). Every finite field has the order of a power of a prime number

### PROBLEM SET 7: PIGEON HOLE PRINCIPLE

PROBLEM SET 7: PIGEON HOLE PRINCIPLE The pigeonhole principle is the following observation: Theorem. Suppose that > kn marbles are distributed over n jars, then one jar will contain at least k + marbles.

### CONTINUED FRACTIONS AND PELL S EQUATION. Contents 1. Continued Fractions 1 2. Solution to Pell s Equation 9 References 12

CONTINUED FRACTIONS AND PELL S EQUATION SEUNG HYUN YANG Abstract. In this REU paper, I will use some important characteristics of continued fractions to give the complete set of solutions to Pell s equation.

### CHAPTER 7 GENERAL PROOF SYSTEMS

CHAPTER 7 GENERAL PROOF SYSTEMS 1 Introduction Proof systems are built to prove statements. They can be thought as an inference machine with special statements, called provable statements, or sometimes

### Irreducibility criteria for compositions and multiplicative convolutions of polynomials with integer coefficients

DOI: 10.2478/auom-2014-0007 An. Şt. Univ. Ovidius Constanţa Vol. 221),2014, 73 84 Irreducibility criteria for compositions and multiplicative convolutions of polynomials with integer coefficients Anca

### The Prime Numbers. Definition. A prime number is a positive integer with exactly two positive divisors.

The Prime Numbers Before starting our study of primes, we record the following important lemma. Recall that integers a, b are said to be relatively prime if gcd(a, b) = 1. Lemma (Euclid s Lemma). If gcd(a,

### SYSTEMS OF PYTHAGOREAN TRIPLES. Acknowledgements. I would like to thank Professor Laura Schueller for advising and guiding me

SYSTEMS OF PYTHAGOREAN TRIPLES CHRISTOPHER TOBIN-CAMPBELL Abstract. This paper explores systems of Pythagorean triples. It describes the generating formulas for primitive Pythagorean triples, determines

### Invertible elements in associates and semigroups. 1

Quasigroups and Related Systems 5 (1998), 53 68 Invertible elements in associates and semigroups. 1 Fedir Sokhatsky Abstract Some invertibility criteria of an element in associates, in particular in n-ary

### Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm.

Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm. We begin by defining the ring of polynomials with coefficients in a ring R. After some preliminary results, we specialize

### Large induced subgraphs with all degrees odd

Large induced subgraphs with all degrees odd A.D. Scott Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, England Abstract: We prove that every connected graph of order

### Sets and Cardinality Notes for C. F. Miller

Sets and Cardinality Notes for 620-111 C. F. Miller Semester 1, 2000 Abstract These lecture notes were compiled in the Department of Mathematics and Statistics in the University of Melbourne for the use

### Regular Expressions with Nested Levels of Back Referencing Form a Hierarchy

Regular Expressions with Nested Levels of Back Referencing Form a Hierarchy Kim S. Larsen Odense University Abstract For many years, regular expressions with back referencing have been used in a variety

### THIN GROUPS OF FRACTIONS

Contemporary Mathematics THIN GROUPS OF FRACTIONS Patrick DEHORNOY Abstract. A number of properties of spherical Artin Tits groups extend to Garside groups, defined as the groups of fractions of monoids

### Labeling outerplanar graphs with maximum degree three

Labeling outerplanar graphs with maximum degree three Xiangwen Li 1 and Sanming Zhou 2 1 Department of Mathematics Huazhong Normal University, Wuhan 430079, China 2 Department of Mathematics and Statistics

University of Oslo MAT2 Project The Banach-Tarski Paradox Author: Fredrik Meyer Supervisor: Nadia S. Larsen Abstract In its weak form, the Banach-Tarski paradox states that for any ball in R, it is possible

### E3: PROBABILITY AND STATISTICS lecture notes

E3: PROBABILITY AND STATISTICS lecture notes 2 Contents 1 PROBABILITY THEORY 7 1.1 Experiments and random events............................ 7 1.2 Certain event. Impossible event............................

### The Halting Problem is Undecidable

185 Corollary G = { M, w w L(M) } is not Turing-recognizable. Proof. = ERR, where ERR is the easy to decide language: ERR = { x { 0, 1 }* x does not have a prefix that is a valid code for a Turing machine

### Fairness in Routing and Load Balancing

Fairness in Routing and Load Balancing Jon Kleinberg Yuval Rabani Éva Tardos Abstract We consider the issue of network routing subject to explicit fairness conditions. The optimization of fairness criteria

### Solutions to In-Class Problems Week 4, Mon.

Massachusetts Institute of Technology 6.042J/18.062J, Fall 05: Mathematics for Computer Science September 26 Prof. Albert R. Meyer and Prof. Ronitt Rubinfeld revised September 26, 2005, 1050 minutes Solutions

### Reading 13 : Finite State Automata and Regular Expressions

CS/Math 24: Introduction to Discrete Mathematics Fall 25 Reading 3 : Finite State Automata and Regular Expressions Instructors: Beck Hasti, Gautam Prakriya In this reading we study a mathematical model

### 11 Ideals. 11.1 Revisiting Z

11 Ideals The presentation here is somewhat different than the text. In particular, the sections do not match up. We have seen issues with the failure of unique factorization already, e.g., Z[ 5] = O Q(

### Mathematical Induction

Mathematical Induction Victor Adamchik Fall of 2005 Lecture 2 (out of three) Plan 1. Strong Induction 2. Faulty Inductions 3. Induction and the Least Element Principal Strong Induction Fibonacci Numbers

### Research Article Stability Analysis for Higher-Order Adjacent Derivative in Parametrized Vector Optimization

Hindawi Publishing Corporation Journal of Inequalities and Applications Volume 2010, Article ID 510838, 15 pages doi:10.1155/2010/510838 Research Article Stability Analysis for Higher-Order Adjacent Derivative

### MA651 Topology. Lecture 6. Separation Axioms.

MA651 Topology. Lecture 6. Separation Axioms. This text is based on the following books: Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology by Nicolas Bourbaki Counterexamples

### Bounded Cost Algorithms for Multivalued Consensus Using Binary Consensus Instances

Bounded Cost Algorithms for Multivalued Consensus Using Binary Consensus Instances Jialin Zhang Tsinghua University zhanggl02@mails.tsinghua.edu.cn Wei Chen Microsoft Research Asia weic@microsoft.com Abstract

### 8. Matchings and Factors

8. Matchings and Factors Consider the formation of an executive council by the parliament committee. Each committee needs to designate one of its members as an official representative to sit on the council,

### 24. The Branch and Bound Method

24. The Branch and Bound Method It has serious practical consequences if it is known that a combinatorial problem is NP-complete. Then one can conclude according to the present state of science that no

### x a x 2 (1 + x 2 ) n.

Limits and continuity Suppose that we have a function f : R R. Let a R. We say that f(x) tends to the limit l as x tends to a; lim f(x) = l ; x a if, given any real number ɛ > 0, there exists a real number

### Measuring Rationality with the Minimum Cost of Revealed Preference Violations. Mark Dean and Daniel Martin. Online Appendices - Not for Publication

Measuring Rationality with the Minimum Cost of Revealed Preference Violations Mark Dean and Daniel Martin Online Appendices - Not for Publication 1 1 Algorithm for Solving the MASP In this online appendix

### MINIMAL BOOKS OF RATIONALES

MINIMAL BOOKS OF RATIONALES José Apesteguía Miguel A. Ballester D.T.2005/01 MINIMAL BOOKS OF RATIONALES JOSE APESTEGUIA AND MIGUEL A. BALLESTER Abstract. Kalai, Rubinstein, and Spiegler (2002) propose

### Integer Factorization using the Quadratic Sieve

Integer Factorization using the Quadratic Sieve Chad Seibert* Division of Science and Mathematics University of Minnesota, Morris Morris, MN 56567 seib0060@morris.umn.edu March 16, 2011 Abstract We give

### GRAPH THEORY LECTURE 4: TREES

GRAPH THEORY LECTURE 4: TREES Abstract. 3.1 presents some standard characterizations and properties of trees. 3.2 presents several different types of trees. 3.7 develops a counting method based on a bijection

### Automata and Formal Languages

Automata and Formal Languages Winter 2009-2010 Yacov Hel-Or 1 What this course is all about This course is about mathematical models of computation We ll study different machine models (finite automata,

### Mathematical Induction. Lecture 10-11

Mathematical Induction Lecture 10-11 Menu Mathematical Induction Strong Induction Recursive Definitions Structural Induction Climbing an Infinite Ladder Suppose we have an infinite ladder: 1. We can reach

### it is easy to see that α = a

21. Polynomial rings Let us now turn out attention to determining the prime elements of a polynomial ring, where the coefficient ring is a field. We already know that such a polynomial ring is a UF. Therefore

### A REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE. 1. Introduction and Preliminaries

Acta Math. Univ. Comenianae Vol. LXVI, 2(1997), pp. 285 291 285 A REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE E. T. BASKORO, M. MILLER and J. ŠIRÁŇ Abstract. It is well known that Moore digraphs do

### HOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!

Math 7 Fall 205 HOMEWORK 5 SOLUTIONS Problem. 2008 B2 Let F 0 x = ln x. For n 0 and x > 0, let F n+ x = 0 F ntdt. Evaluate n!f n lim n ln n. By directly computing F n x for small n s, we obtain the following

### SOLUTIONS TO ASSIGNMENT 1 MATH 576

SOLUTIONS TO ASSIGNMENT 1 MATH 576 SOLUTIONS BY OLIVIER MARTIN 13 #5. Let T be the topology generated by A on X. We want to show T = J B J where B is the set of all topologies J on X with A J. This amounts

### Notes: Chapter 2 Section 2.2: Proof by Induction

Notes: Chapter 2 Section 2.2: Proof by Induction Basic Induction. To prove: n, a W, n a, S n. (1) Prove the base case - S a. (2) Let k a and prove that S k S k+1 Example 1. n N, n i = n(n+1) 2. Example

### A Load Balancing Technique for Some Coarse-Grained Multicomputer Algorithms

A Load Balancing Technique for Some Coarse-Grained Multicomputer Algorithms Thierry Garcia and David Semé LaRIA Université de Picardie Jules Verne, CURI, 5, rue du Moulin Neuf 80000 Amiens, France, E-mail:

### Chapter 6: Episode discovery process

Chapter 6: Episode discovery process Algorithmic Methods of Data Mining, Fall 2005, Chapter 6: Episode discovery process 1 6. Episode discovery process The knowledge discovery process KDD process of analyzing

### 3. Applications of Number Theory

3. APPLICATIONS OF NUMBER THEORY 163 3. Applications of Number Theory 3.1. Representation of Integers. Theorem 3.1.1. Given an integer b > 1, every positive integer n can be expresses uniquely as n = a

### We give a basic overview of the mathematical background required for this course.

1 Background We give a basic overview of the mathematical background required for this course. 1.1 Set Theory We introduce some concepts from naive set theory (as opposed to axiomatic set theory). The

### SEQUENCES OF MAXIMAL DEGREE VERTICES IN GRAPHS. Nickolay Khadzhiivanov, Nedyalko Nenov

Serdica Math. J. 30 (2004), 95 102 SEQUENCES OF MAXIMAL DEGREE VERTICES IN GRAPHS Nickolay Khadzhiivanov, Nedyalko Nenov Communicated by V. Drensky Abstract. Let Γ(M) where M V (G) be the set of all vertices

### 3. Mathematical Induction

3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)

### Modern Algebra Lecture Notes: Rings and fields set 4 (Revision 2)

Modern Algebra Lecture Notes: Rings and fields set 4 (Revision 2) Kevin Broughan University of Waikato, Hamilton, New Zealand May 13, 2010 Remainder and Factor Theorem 15 Definition of factor If f (x)

### THE TURING DEGREES AND THEIR LACK OF LINEAR ORDER

THE TURING DEGREES AND THEIR LACK OF LINEAR ORDER JASPER DEANTONIO Abstract. This paper is a study of the Turing Degrees, which are levels of incomputability naturally arising from sets of natural numbers.

### ALGEBRAIC APPROACH TO COMPOSITE INTEGER FACTORIZATION

ALGEBRAIC APPROACH TO COMPOSITE INTEGER FACTORIZATION Aldrin W. Wanambisi 1* School of Pure and Applied Science, Mount Kenya University, P.O box 553-50100, Kakamega, Kenya. Shem Aywa 2 Department of Mathematics,

### Factoring & Primality

Factoring & Primality Lecturer: Dimitris Papadopoulos In this lecture we will discuss the problem of integer factorization and primality testing, two problems that have been the focus of a great amount

### CONTRIBUTIONS TO ZERO SUM PROBLEMS

CONTRIBUTIONS TO ZERO SUM PROBLEMS S. D. ADHIKARI, Y. G. CHEN, J. B. FRIEDLANDER, S. V. KONYAGIN AND F. PAPPALARDI Abstract. A prototype of zero sum theorems, the well known theorem of Erdős, Ginzburg