An extension of the Pascal triangle and the Sierpiński gasket to finite words. Joint work with Julien Leroy and Michel Rigo (ULiège)
|
|
- Paula Wilkerson
- 5 years ago
- Views:
Transcription
1 An extension of the Pascal triangle and the Sierpiński gasket to finite words Joint work with Julien Leroy and Michel Rigo (ULiège) Manon Stipulanti (ULiège) FRIA grantee LaBRI, Bordeaux (France) December 5, 27
2 Classical Pascal triangle ( m ) k k m Usual binomial coefficients of integers: ( ) m m! = k (m k)! k! Pascal s rule: vide ( ) ( ) ( ) m m m = + k k k Generalized Pascal triangles Manon Stipulanti (ULiège) 2
3 A specific construction Grid: intersection between N 2 and [, 2 n ] [, 2 n ] 2 n 2 n ( ) ( ) ( ) 2 n ( ) ( ) ( ) 2 n n ( 2 n ) ( 2 n ) ( 2 ) n 2 n 2 n N 2 [, 2 n ] 2 Generalized Pascal triangles Manon Stipulanti (ULiège) 3
4 Color the grid: Color the first 2 n rows and columns of the Pascal triangle (( ) ) m mod 2 k in white if ( ) m k mod 2 black if ( ) m k mod 2 m,k<2 n Generalized Pascal triangles Manon Stipulanti (ULiège) 4
5 Color the grid: Color the first 2 n rows and columns of the Pascal triangle (( ) ) m mod 2 k m,k<2 n in white if ( ) m k mod 2 black if ( ) m k mod 2 Normalize by a homothety of ratio /2 n (bring into [, ] [, ]) sequence belonging to [, ] [, ] Generalized Pascal triangles Manon Stipulanti (ULiège) 4
6 What happens for n {, } n = fantome Generalized Pascal triangles Manon Stipulanti (ULiège) 5
7 What happens for n {, } n = fantome ( ) Generalized Pascal triangles Manon Stipulanti (ULiège) 5
8 What happens for n {, } n = fantome ( ) Generalized Pascal triangles Manon Stipulanti (ULiège) 5
9 What happens for n {, } n = fantome ( ) Generalized Pascal triangles Manon Stipulanti (ULiège) 5
10 What happens for n {, } n = fantome ( ) n = fantome Generalized Pascal triangles Manon Stipulanti (ULiège) 5
11 What happens for n {, } n = fantome ( ) n = fantome 2 ( ) ( ) ( ) ( ) 2 Generalized Pascal triangles Manon Stipulanti (ULiège) 5
12 What happens for n {, } n = fantome ( ) n = fantome 2 ( ) ( ) ( ) ( ) Generalized Pascal triangles Manon Stipulanti (ULiège) 5
13 What happens for n {, } n = fantome ( ) n = fantome 2 ( ) ( ) ( ) ( ) Generalized Pascal triangles Manon Stipulanti (ULiège) 5 2
14 The first six elements of the sequence Generalized Pascal triangles Manon Stipulanti (ULiège) 6
15 The tenth element of the sequence Generalized Pascal triangles Manon Stipulanti (ULiège) 7
16 The Sierpiński gasket Generalized Pascal triangles Manon Stipulanti (ULiège) 8
17 The Sierpiński gasket Generalized Pascal triangles Manon Stipulanti (ULiège) 8
18 The Sierpiński gasket Generalized Pascal triangles Manon Stipulanti (ULiège) 8
19 Folklore fact The latter sequence converges to the Sierpiński gasket when n tends to infinity (for the Hausdorff distance). Generalized Pascal triangles Manon Stipulanti (ULiège) 9
20 Folklore fact The latter sequence converges to the Sierpiński gasket when n tends to infinity (for the Hausdorff distance). Definitions: ɛ-fattening of a subset S R 2 [S] ɛ = x S B(x, ɛ) (H(R 2 ), d h ) complete space of the non-empty compact subsets of R 2 equipped with the Hausdorff distance d h d h (S, S ) = min{ɛ R S [S ] ɛ and S [S] ɛ } Generalized Pascal triangles Manon Stipulanti (ULiège) 9
21 Remark (von Haeseler, Peitgen, Skordev, 992) The sequence also converges for other modulos. For instance, the sequence converges when the Pascal triangle is considered modulo p s where p is a prime and s is a positive integer. Generalized Pascal triangles Manon Stipulanti (ULiège)
22 This talk... Part I: Generalized Pascal triangle Part II: Counting Subword Occurrences Part III: Behavior of the Summatory Function Generalized Pascal triangles Manon Stipulanti (ULiège)
23 Part I: Generalized Pascal triangle
24 New idea Replace usual binomial coefficients of integers by binomial coefficients of finite words Generalized Pascal triangles Manon Stipulanti (ULiège) 3
25 Binomial coefficient of finite words Definition: A finite word is a finite sequence of letters belonging to a finite set called alphabet. Example:, {, } Generalized Pascal triangles Manon Stipulanti (ULiège) 4
26 Binomial coefficient of finite words Definition: A finite word is a finite sequence of letters belonging to a finite set called alphabet. Example:, {, } Binomial coefficient of words (Lothaire, 997) Let u, v be two finite words. The binomial coefficient ( u v) of u and v is the number of times v occurs as a subsequence of u (meaning as a scattered subword). Example: u = v = ( ) = 6 Generalized Pascal triangles Manon Stipulanti (ULiège) 4
27 Binomial coefficient of finite words Definition: A finite word is a finite sequence of letters belonging to a finite set called alphabet. Example:, {, } Binomial coefficient of words (Lothaire, 997) Let u, v be two finite words. The binomial coefficient ( u v) of u and v is the number of times v occurs as a subsequence of u (meaning as a scattered subword). Example: u = v = occurrence ( ) = 6 Generalized Pascal triangles Manon Stipulanti (ULiège) 4
28 Binomial coefficient of finite words Definition: A finite word is a finite sequence of letters belonging to a finite set called alphabet. Example:, {, } Binomial coefficient of words (Lothaire, 997) Let u, v be two finite words. The binomial coefficient ( u v) of u and v is the number of times v occurs as a subsequence of u (meaning as a scattered subword). Example: u = v = 2 occurrences ( ) = 6 Generalized Pascal triangles Manon Stipulanti (ULiège) 4
29 Binomial coefficient of finite words Definition: A finite word is a finite sequence of letters belonging to a finite set called alphabet. Example:, {, } Binomial coefficient of words (Lothaire, 997) Let u, v be two finite words. The binomial coefficient ( u v) of u and v is the number of times v occurs as a subsequence of u (meaning as a scattered subword). Example: u = v = 3 occurrences ( ) = 6 Generalized Pascal triangles Manon Stipulanti (ULiège) 4
30 Binomial coefficient of finite words Definition: A finite word is a finite sequence of letters belonging to a finite set called alphabet. Example:, {, } Binomial coefficient of words (Lothaire, 997) Let u, v be two finite words. The binomial coefficient ( u v) of u and v is the number of times v occurs as a subsequence of u (meaning as a scattered subword). Example: u = v = 4 occurrences ( ) = 6 Generalized Pascal triangles Manon Stipulanti (ULiège) 4
31 Binomial coefficient of finite words Definition: A finite word is a finite sequence of letters belonging to a finite set called alphabet. Example:, {, } Binomial coefficient of words (Lothaire, 997) Let u, v be two finite words. The binomial coefficient ( u v) of u and v is the number of times v occurs as a subsequence of u (meaning as a scattered subword). Example: u = v = 5 occurrences ( ) = 6 Generalized Pascal triangles Manon Stipulanti (ULiège) 4
32 Binomial coefficient of finite words Definition: A finite word is a finite sequence of letters belonging to a finite set called alphabet. Example:, {, } Binomial coefficient of words (Lothaire, 997) Let u, v be two finite words. The binomial coefficient ( u v) of u and v is the number of times v occurs as a subsequence of u (meaning as a scattered subword). Example: u = v = 6 occurrences ( ) = 6 Generalized Pascal triangles Manon Stipulanti (ULiège) 4
33 Binomial coefficient of finite words Definition: A finite word is a finite sequence of letters belonging to a finite set called alphabet. Example:, {, } Binomial coefficient of words (Lothaire, 997) Let u, v be two finite words. The binomial coefficient ( u v) of u and v is the number of times v occurs as a subsequence of u (meaning as a scattered subword). Example: u = v = ( ) = 6 Generalized Pascal triangles Manon Stipulanti (ULiège) 4
34 Remark: Natural generalization of binomial coefficients of integers With a one-letter alphabet {a} ( ) a m = a k ( m times {}}{) a a = a } {{ a} k times ( ) m k m, k N Generalized Pascal triangles Manon Stipulanti (ULiège) 5
35 Theoretical framework Definitions: rep 2 (n) greedy base-2 expansion of n N > beginning by rep 2 () := ε where ε is the empty word n rep 2 (n) ε {ε} {, } Generalized Pascal triangles Manon Stipulanti (ULiège) 6
36 Generalized Pascal triangle in base 2 ( u v) v ε ε u Binomial coefficient of finite words: ( u v) Rule (not local): ( ) ( ) ( ) ua u u = + δ a,b vb vb v Generalized Pascal triangles Manon Stipulanti (ULiège) 7
37 Generalized Pascal triangle in base 2 v ε ε u The classical Pascal triangle Generalized Pascal triangles Manon Stipulanti (ULiège) 7
38 Questions: After coloring and normalization can we expect the convergence to an analogue of the Sierpiński gasket? Could we describe this limit object? Generalized Pascal triangles Manon Stipulanti (ULiège) 8
39 Same construction Grid: intersection between N 2 and [, 2 n ] [, 2 n ] 2 n 2 n ( rep2 () rep 2 () ) ( rep2 ) () rep 2 () ( rep2 ) () rep 2 (2 n ) ( rep2 () rep 2 () ) ( rep2 ) () rep 2 () ( rep2 ) () rep 2 (2 n ) n ( rep2 (2 n ) rep 2 () ) ( rep2 (2 n ) rep 2 () ) ( rep2 ) (2 n ) rep 2 (2 n ) 2 n N 2 [, 2 n ] 2 Generalized Pascal triangles Manon Stipulanti (ULiège) 9
40 Color the grid: Color the first 2 n rows and columns of the generalized Pascal triangle (( ) ) rep2 (m) mod 2 rep 2 (k) m,k<2 n in white if ( rep 2 (m) rep 2 (k) ) mod 2 black if ( rep 2 (m) rep 2 (k) ) mod 2 Normalize by a homothety of ratio /2 n (bring into [, ] [, ]) sequence (U n ) n belonging to [, ] [, ] U n := 2 n u,v {ε} {,} s.t. ( u v) mod 2 Q := [, ] [, ] {(val 2 (v), val 2 (u)) + Q} Generalized Pascal triangles Manon Stipulanti (ULiège) 2
41 The elements U,..., U 5 ε ε ε 2 2 ε Generalized Pascal triangles Manon Stipulanti (ULiège) 2
42 The element U 2 /4 2/4 3/4 ε /4 2/4 3/4 ε ε, /4, 2/4 = /2, 3/4 w {ε} {, } with w 2 val 2(w) 2 2 Generalized Pascal triangles Manon Stipulanti (ULiège) 22
43 The element U 2 /4 2/4 3/4 ε /4 2/4 3/4 ε ε, /4, 2/4 = /2, 3/4 w {ε} {, } with w 2 val 2(w) 2 2 Generalized Pascal triangles Manon Stipulanti (ULiège) 22
44 Lines of different slopes... Generalized Pascal triangles Manon Stipulanti (ULiège) 23 The element U 9 9 9
45 The ( ) condition ( ) (u, v) satisfies ( ) iff ( u ( v u v ) u, v ε ) mod ( 2 = = u v) Example: (u, v) = (, ) satisfies ( ) ( ) = ( ) ( = ) = Generalized Pascal triangles Manon Stipulanti (ULiège) 24
46 Lemma: Completion (u, v) satisfies ( ) (u, v), (u, v) satisfy ( ) Proof: ( ) ( ) u u = v v }{{} = since ( ) ) ( > or u + ( ) u v }{{} mod 2 mod 2 If ( u v v) >, then v is a subsequence of u, which contradicts ( ). Same proof for (u, v). Generalized Pascal triangles Manon Stipulanti (ULiège) 25
47 Example: u =, v = U 3 U 4 U 5 Creation of segments of slope Endpoint (3/8, 5/8) = (val 2 ()/2 3, val 2 ()/2 3 ) Length S u,v [, ] [/2, ] endpoint (val 2 (v)/2 u, val 2 (u)/2 u ) length 2 2 u Generalized Pascal triangles Manon Stipulanti (ULiège) 26
48 Definition: Set of segments of slope A := (u,v) satisfying( ) S u,v [, ] [/2, ] Generalized Pascal triangles Manon Stipulanti (ULiège) 27
49 Modifying the slope Example: (, ) satisfies ( ) Segment S, endpoint (/2, /2) length Generalized Pascal triangles Manon Stipulanti (ULiège) 28
50 Modifying the slope Example: (, ) satisfies ( ) Segment S, endpoint (/2, /2) length Generalized Pascal triangles Manon Stipulanti (ULiège) 28
51 Modifying the slope Example: (, ) satisfies ( ) Segment S, endpoint (/2, /2) length Generalized Pascal triangles Manon Stipulanti (ULiège) 28
52 Modifying the slope Example: (, ) satisfies ( ) Segment S, endpoint (/2, /2) length Generalized Pascal triangles Manon Stipulanti (ULiège) 28
53 Modifying the slope Example: (, ) satisfies ( ) Segment S, endpoint (/2, /2) length Generalized Pascal triangles Manon Stipulanti (ULiège) 28
54 Definition: Set of segments of different slopes c : (x, y) (x/2, y/2) (homothety of center (, ), ratio /2) h : (x, y) (x, 2y) A n := i n j i h j (c i (A )) Generalized Pascal triangles Manon Stipulanti (ULiège) 29
55 Definition: Set of segments of different slopes c : (x, y) (x/2, y/2) (homothety of center (, ), ratio /2) h : (x, y) (x, 2y) A n := i n j i h j (c i (A )) Lemma: (A n ) n is a Cauchy sequence Generalized Pascal triangles Manon Stipulanti (ULiège) 29
56 Definition: Set of segments of different slopes c : (x, y) (x/2, y/2) (homothety of center (, ), ratio /2) h : (x, y) (x, 2y) A n := i n j i h j (c i (A )) Lemma: (A n ) n is a Cauchy sequence Definition: Limit object L Generalized Pascal triangles Manon Stipulanti (ULiège) 29
57 A key result Simple characterization of L: topological closure of a union of segments described through a simple combinatorial property Generalized Pascal triangles Manon Stipulanti (ULiège) 3 Theorem (Leroy, Rigo, S., 26) The sequence (U n ) n of compact sets converges to the compact set L when n tends to infinity (for the Hausdorff distance).
58 Extension modulo p Simplicity: coloring the cells of the grids regarding their parity Extension using Lucas theorem Everything still holds for binomial coefficients r mod p with base-2 expansions of integers p a prime r {,..., p } Theorem (Lucas, 878) Let p be a prime number. If m = m k p k + + m p + m and n = n k p k + + n p + n, then ( ) m k ( ) mi mod p. n i= n i Generalized Pascal triangles Manon Stipulanti (ULiège) 3
59 Example with p = 3, r = 2 Left: binomial coefficients 2 mod 3 Right: estimate of the corresponding limit object Generalized Pascal triangles Manon Stipulanti (ULiège) 32
60 Part II: Counting Subword Occurrences
61 Counting Subword Occurrences Generalized Pascal triangle in base 2 ( u v) v ε n S 2 (n) ε u Definition: S 2 (n) = # { m N ( ) } rep2 (n) > rep 2 (m) n = # (scattered) subwords in {ε} {, } of rep 2 (n) Generalized Pascal triangles Manon Stipulanti (ULiège) 34
62 The sequence (S 2 (n)) n in the interval [, 256] Palindromic structure regularity Generalized Pascal triangles Manon Stipulanti (ULiège) 35
63 Regularity in the sense of Allouche and Shallit (992) 2-kernel of s = (s(n)) n K 2 (s) ={(s(n)) n, (s(2n)) n, (s(2n + )) n, (s(4n)) n, (s(4n + )) n, (s(4n + 2)) n,...} ={(s(2 i n + j)) n i and j < 2 i } Generalized Pascal triangles Manon Stipulanti (ULiège) 36
64 Regularity in the sense of Allouche and Shallit (992) 2-kernel of s = (s(n)) n K 2 (s) ={(s(n)) n, (s(2n)) n, (s(2n + )) n, (s(4n)) n, (s(4n + )) n, (s(4n + 2)) n,...} ={(s(2 i n + j)) n i and j < 2 i } 2-regular if there exist (t (n)) n,..., (t l (n)) n s.t. each (t(n)) n K 2 (s) is a Z-linear combination of the t j s Generalized Pascal triangles Manon Stipulanti (ULiège) 36
65 The case of (S 2 (n)) n Theorem (Leroy, Rigo, S., 27) The sequence (S 2 (n)) n satisfies, for all n, S 2 (2n + ) = 3 S 2 (n) S 2 (2n) S 2 (4n) = S 2 (n) + 2 S 2 (2n) S 2 (4n + 2) = 4 S 2 (n) S 2 (2n). Proof using a special tree structure... Generalized Pascal triangles Manon Stipulanti (ULiège) 37
66 Corollary (Leroy, Rigo, S., 27) (S 2 (n)) n is 2-regular. Proof: Generators (S 2 (n)) n and (S 2 (2n)) n S 2 (n) = S 2 (n) S 2 (2n) = S 2 (2n) S 2 (2n + ) = 3S 2 (n) S 2 (2n) S 2 (4n) = S 2 (n) + 2S 2 (2n) S 2 (4n + ) = S 2 (2(2n) + ) = 3S 2 (2n) S 2 (4n) = 3S 2 (2n) ( S 2 (n) + 2S 2 (2n)) = S 2 (n) + S 2 (2n) S 2 (4n + 2) = 4S 2 (n) 2S 2 (2n) S 2 (4n + 3) = S 2 (2(2n + ) + ) = 3S 2 (2n + ) S 2 (4n + 2) etc. = 3 3S 2 (n) 3S 2 (2n) (4S 2 (n) 2S 2 (2n)) = 5S 2 (n) S 2 (2n) Generalized Pascal triangles Manon Stipulanti (ULiège) 38
67 Matrix representation to compute (S 2 (n)) n easily ( ) S2 (n) V (n) = S 2 (2n) ( ) ( ) ( S2 (2n) S2 (n) V (2n) = = S 2 (4n) 2 S 2 (2n) }{{} V (2n + ) = ( S2 (2n + ) S 2 (4n + 2) :=µ() ) ( ) 3 = 4 }{{} :=µ() If rep 2 (m) = m l m with m i {, }, then S 2 (m) = ( ) ( ) µ(m ) µ(m l ) ) ( S2 (n) S 2 (2n) ) Generalized Pascal triangles Manon Stipulanti (ULiège) 39
68 A special tree structure: the tree of subwords T () Generalized Pascal triangles Manon Stipulanti (ULiège) 4 Definition: w a word in {, } The tree of subwords of w is the tree T (w) root ε if u and ua are subwords of w with a {, }, then ua is a child of u Example: w = test test test test test test
69 A special tree structure: the tree of subwords T () Generalized Pascal triangles Manon Stipulanti (ULiège) 4 Definition: w a word in {, } The tree of subwords of w is the tree T (w) root ε if u and ua are subwords of w with a {, }, then ua is a child of u Example: w = length subwords ε 2 3 4
70 A special tree structure: the tree of subwords T () Generalized Pascal triangles Manon Stipulanti (ULiège) 4 Definition: w a word in {, } The tree of subwords of w is the tree T (w) root ε if u and ua are subwords of w with a {, }, then ua is a child of u Example: w = length subwords ε 2 3 4
71 A special tree structure: the tree of subwords T () Generalized Pascal triangles Manon Stipulanti (ULiège) 4 Definition: w a word in {, } The tree of subwords of w is the tree T (w) root ε if u and ua are subwords of w with a {, }, then ua is a child of u Example: w = length subwords ε 2 3 4
72 A special tree structure: the tree of subwords T () Generalized Pascal triangles Manon Stipulanti (ULiège) 4 Definition: w a word in {, } The tree of subwords of w is the tree T (w) root ε if u and ua are subwords of w with a {, }, then ua is a child of u Example: w = length subwords ε 2 3 4
73 A special tree structure: the tree of subwords T () Generalized Pascal triangles Manon Stipulanti (ULiège) 4 Definition: w a word in {, } The tree of subwords of w is the tree T (w) root ε if u and ua are subwords of w with a {, }, then ua is a child of u Example: w = length subwords ε 2 3 4
74 Convention in base 2: no leading delete the right part of the tree T (w) new tree T 2 (w) Example: w = length subwords ε 2, 3, 4 T 2 () Generalized Pascal triangles Manon Stipulanti (ULiège) 4
75 Usefulness: #nodes on level n of T 2 (w) =#subwords of length n of w in {, } {ε} Generalized Pascal triangles Manon Stipulanti (ULiège) 42
76 Usefulness: #nodes on level n of T 2 (w) =#subwords of length n of w Example: w = in {, } {ε} level #nodes subwords ε 2 2, 3 2, 4 Total 7 T 2 () Link with S 2 : val 2 () = 9 S 2 (9) = 7 Generalized Pascal triangles Manon Stipulanti (ULiège) 42
77 An example of a proof using T 2 Palindromic structure (Leroy, Rigo, S., 27) For all l > and all r < 2 l, S 2 (2 l + r) = S 2 (2 l+ r ). Example: l = 3, r = = 9 rep 2 (9) = 2 4 = 4 rep 2 (4) = T 2() T 2() T 2 () = T 2 () # nodes of T 2 () = # nodes of T 2 () S 2 (9) = S 2 (4) Generalized Pascal triangles Manon Stipulanti (ULiège) 43
78 Link with the Farey tree Definition: The Farey tree is a tree that contains every (reduced) positive rational less than exactly once S 2(n) Generalized Pascal triangles Manon Stipulanti (ULiège) 44
79 Part III: Behavior of the Summatory Function
80 Example: s(n) number of in rep 2 (n) s(2n) = s(n) s(2n+) = s(n)+ s is 2-regular Summatory function A: A() := n A(n) := s(j) n j= Theorem (Delange, 975) A(n) n = 2 log 2(n) + G(log 2 (n)) () where G continuous, nowhere differentiable, periodic of period. Generalized Pascal triangles Manon Stipulanti (ULiège) 46
81 Theorem (Allouche, Shallit, 23) Under some hypotheses, the summatory function of every b- regular sequence has a behavior analogous to (). Replacing s by S 2 : same behavior as () but does not satisfy the hypotheses of the theorem Generalized Pascal triangles Manon Stipulanti (ULiège) 47
82 Using several numeration systems Definition: A 2 () := n A 2 (n) := S 2 (j) n j= First few values:,, 3, 6, 9, 3, 8, 23, 27, 32, 39, 47, 54, 6, 69, 76, 8, 87, 96, 7,... Generalized Pascal triangles Manon Stipulanti (ULiège) 48
83 Using several numeration systems Definition: A 2 () := n A 2 (n) := S 2 (j) n j= First few values:,, 3, 6, 9, 3, 8, 23, 27, 32, 39, 47, 54, 6, 69, 76, 8, 87, 96, 7,... Lemma (Leroy, Rigo, S., 27) For all n, A 2 (2 n ) = 3 n. Generalized Pascal triangles Manon Stipulanti (ULiège) 48
84 Lemma (Leroy, Rigo, S., 27) Let l. If r 2 l, then A 2 (2 l + r) = 2 3 l + A 2 (2 l + r) + A 2 (r). If 2 l < r < 2 l, then A 2 (2 l +r) = 4 3 l 2 3 l A 2 (2 l +r ) A 2 (r ) where r = 2 l r. Generalized Pascal triangles Manon Stipulanti (ULiège) 49
85 Lemma (Leroy, Rigo, S., 27) Let l. If r 2 l, then A 2 (2 l + r) = 2 3 l + A 2 (2 l + r) + A 2 (r). If 2 l < r < 2 l, then A 2 (2 l +r) = 4 3 l 2 3 l A 2 (2 l +r ) A 2 (r ) where r = 2 l r. 3-decomposition: particular decomposition of A 2 (n) based on powers of 3 Generalized Pascal triangles Manon Stipulanti (ULiège) 49
86 Lemma (Leroy, Rigo, S., 27) Let l. If r 2 l, then A 2 (2 l + r) = 2 3 l + A 2 (2 l + r) + A 2 (r). If 2 l < r < 2 l, then A 2 (2 l +r) = 4 3 l 2 3 l A 2 (2 l +r ) A 2 (r ) where r = 2 l r. 3-decomposition: particular decomposition of A 2 (n) based on powers of 3 two numeration systems: base 2 and base 3 Generalized Pascal triangles Manon Stipulanti (ULiège) 49
87 Theorem (Leroy, Rigo, S., 27) There exists a continuous and periodic function H 2 of period such that, for all n, A 2 (n) = 3 log 2 (n) H 2 (log 2 (n)). Generalized Pascal triangles Manon Stipulanti (ULiège) 5
88 Conclusion In this talk: Generalization of the Pascal triangle in base 2 modulo a prime number 2-regularity of the sequence (S 2 (n)) n counting subword occurrences Behavior of the summatory function (A 2 (n)) n of the sequence (S 2 (n)) n Generalized Pascal triangles Manon Stipulanti (ULiège) 5
89 Other work Done: Generalization of the Pascal triangle modulo a prime number: extension to any Pisot Bertrand numeration system Regularity of the sequence counting subword occurrences: extension to any base b and the Fibonacci numeration system Behavior of the summatory function: extension to any base b (exact behavior) and the Fibonacci numeration system (asymptotics) What s next? Pisot Bertrand numeration systems, Apply the methods for sequences not related to Pascal triangles, etc. Generalized Pascal triangles Manon Stipulanti (ULiège) 52
90 Conus textile or Cloth of gold cone Color pattern of its shell Sierpiński gasket Generalized Pascal triangles Manon Stipulanti (ULiège) 53
91 References J.-P. Allouche, J. Shallit, The ring of k-regular sequences, Theoret. Comput. Sci. 98(2) (992), J.-P. Allouche, J. Shallit, Automatic sequences. Cambridge University Press, Cambridge, 23. Theory, applications, generalizations, H. Delange, Sur la fonction sommatoire de la fonction somme des chiffres, Enseignement Math. 2 (975), P. Dumas, Diviser pour régner : algèbre et analyse, Journées Aléa 26 (CIRM). F. von Haeseler, H.-O. Peitgen, G. Skordev, Pascal s triangle, dynamical systems and attractors, Ergod. Th. & Dynam. Sys. 2 (992), J. Leroy, M. Rigo, M. Stipulanti, Generalized Pascal triangle for binomial coefficients of words, Adv. in Appl. Math. 8 (26), J. Leroy, M. Rigo, M. Stipulanti, Counting the number of non-zero coefficients in rows of generalized Pascal triangles, Discrete Math. 34 (27) J. Leroy, M. Rigo, M. Stipulanti, Behavior of digital sequences through exotic numeration systems, Electron. J. Combin. 24 (27), no., Paper.44, 36 pp. J. Leroy, M. Rigo, M. Stipulanti, Counting Subword Occurrences in Base-b Expansions, submitted in April 27. M. Lothaire, Combinatorics On Words, Cambridge Mathematical Library, Cambridge University Press, Cambridge, 997. É. Lucas, Théorie des fonctions numériques simplement périodiques, Amer. J. Math. (878) M. Stipulanti, Convergence of Pascal-Like Triangles in Pisot Bertrand Numeration Systems, in progress. Generalized Pascal triangles Manon Stipulanti (ULiège) 54
A REMARK ON THE BOROS-MOLL SEQUENCE
#A49 INTEGERS 11 (2011) A REMARK ON THE BOROS-MOLL SEQUENCE J.-P. Allouche CNRS, Institut de Math., Équipe Combinatoire et Optimisation Université Pierre et Marie Curie, Paris, France allouche@math.jussieu.fr
More informationRECOGNIZABLE SETS OF INTEGERS
RECOGNIZABLE SETS OF INTEGERS Michel Rigo http://www.discmath.ulg.ac.be/ 1st Joint Conference of the Belgian, Royal Spanish and Luxembourg Mathematical Societies, June 2012, Liège In the Chomsky s hierarchy,
More informationÉmilie Charlier 1 Department of Mathematics, University of Liège, Liège, Belgium Narad Rampersad.
#A4 INTEGERS B () THE MINIMAL AUTOMATON RECOGNIZING m N IN A LINEAR NUMERATION SYSTEM Émilie Charlier Department of Mathematics, University of Liège, Liège, Belgium echarlier@uwaterloo.ca Narad Rampersad
More informationGames derived from a generalized Thue-Morse word
Games derived from a generalized Thue-Morse word Aviezri S. Fraenkel, Dept. of Computer Science and Applied Mathematics, Weizmann Institute of Science, Rehovot 76100, Israel; fraenkel@wisdom.weizmann.ac.il
More informationSYNTACTICAL AND AUTOMATIC PROPERTIES OF SETS OF POLYNOMIALS OVER FINITE FIELDS
SYNTACTICAL AND AUTOMATIC PROPERTIES OF SETS OF POLYNOMIALS OVER FINITE FIELDS MICHEL RIGO Abstract Syntactical properties of representations of integers in various number systems are well-known and have
More informationNOTES ON BARNSLEY FERN
NOTES ON BARNSLEY FERN ERIC MARTIN 1. Affine transformations An affine transformation on the plane is a mapping T that preserves collinearity and ratios of distances: given two points A and B, if C is
More informationCOUNTING SUBWORD OCCURRENCES IN BASE-b EXPANSIONS. Julien Leroy 1 Department of Mathematics, University of Liège, Liège, Belgium
#A13 INEGERS 18A (2018) COUNING SUBWORD OCCURRENCES IN BASE-b EXPANSIONS Julien Leroy 1 Department of Mathematics, University of Liège, Liège, Belgium JLeroy@uliegebe Michel Rigo Department of Mathematics,
More informationVon Koch and Thue-Morse revisited
Von Koch and Thue-Morse revisited arxiv:math/0610791v2 [math.nt] 1 Dec 2007 J.-P. Allouche CNRS, LRI Bâtiment 490 F-91405 Orsay Cedex (France) allouche@lri.fr Abstract G. Skordev CEVIS, Universität Bremen
More informationFrom p-adic numbers to p-adic words
From p-adic numbers to p-adic words Jean-Éric Pin1 1 January 2014, Lorentz Center, Leiden References I S. Eilenberg, Automata, Languages and Machines, Vol B, Acad. Press, New-York (1976). M. Lothaire,
More informationBinomial coefficients and k-regular sequences
Binomial coefficients and k-regular sequences Eric Rowland Hofstra University New York Combinatorics Seminar CUNY Graduate Center, 2017 12 22 Eric Rowland Binomial coefficients and k-regular sequences
More informationPutnam Pigeonhole Principle October 25, 2005
Putnam Pigeonhole Principle October 5, 005 Introduction 1. If n > m pigeons are placed into m boxes, then there exists (at least) one box with at least two pigeons.. If n > m, then any function f : [n]
More informationSolutions to Tutorial 8 (Week 9)
The University of Sydney School of Mathematics and Statistics Solutions to Tutorial 8 (Week 9) MATH3961: Metric Spaces (Advanced) Semester 1, 2018 Web Page: http://www.maths.usyd.edu.au/u/ug/sm/math3961/
More informationAutomata and Number Theory
PROCEEDINGS OF THE ROMAN NUMBER THEORY ASSOCIATION Volume, Number, March 26, pages 23 27 Christian Mauduit Automata and Number Theory written by Valerio Dose Many natural questions in number theory arise
More informationChapter 8. P-adic numbers. 8.1 Absolute values
Chapter 8 P-adic numbers Literature: N. Koblitz, p-adic Numbers, p-adic Analysis, and Zeta-Functions, 2nd edition, Graduate Texts in Mathematics 58, Springer Verlag 1984, corrected 2nd printing 1996, Chap.
More informationA geometrical characterization of factors of multidimensional Billiard words and some applications
Theoretical Computer Science 380 (2007) 286 303 www.elsevier.com/locate/tcs A geometrical characterization of factors of multidimensional Billiard words and some applications Jean-Pierre Borel XLim, UMR
More informationNOTES ON DIOPHANTINE APPROXIMATION
NOTES ON DIOPHANTINE APPROXIMATION Jan-Hendrik Evertse January 29, 200 9 p-adic Numbers Literature: N. Koblitz, p-adic Numbers, p-adic Analysis, and Zeta-Functions, 2nd edition, Graduate Texts in Mathematics
More informationSierpinski s Triangle and the Lucas Correspondence Theorem
Sierpinski s Triangle and the Lucas Correspondence Theorem Julian Trujillo, and George Kreppein Western Washington University November 30, 2012 History of Sierpinski s Triangle Sierpinski s triangle also
More information#A31 INTEGERS 11 (2011) COMPLETELY MULTIPLICATIVE AUTOMATIC FUNCTIONS
#A3 INTEGERS (20) COMPLETELY MULTIPLICATIVE AUTOMATIC FUNCTIONS Jan-Christoph Schlage-Puchta Department of Mathematics, Universiteit Gent, Gent, Belgium jcsp@cage.ugent.be Received: 3//0, Accepted: /6/,
More information(ABSTRACT) NUMERATION SYSTEMS
(ABSTRACT) NUMERATION SYSTEMS Michel Rigo Department of Mathematics, University of Liège http://www.discmath.ulg.ac.be/ OUTLINE OF THE TALK WHAT IS A NUMERATION SYSTEM? CONNECTION WITH FORMAL LANGUAGES
More informationGenerell Topologi. Richard Williamson. May 6, 2013
Generell Topologi Richard Williamson May 6, 2013 1 5 Tuesday 29th January 5.1 Limits points, closure, boundary continued Definition 5.1. Let (X, O X ) be a topological space, and let A be a subset of X.
More informationThe Pigeonhole Principle
The Pigeonhole Principle 2 2.1 The Pigeonhole Principle The pigeonhole principle is one of the most used tools in combinatorics, and one of the simplest ones. It is applied frequently in graph theory,
More informationON PATTERNS OCCURRING IN BINARY ALGEBRAIC NUMBERS
ON PATTERNS OCCURRING IN BINARY ALGEBRAIC NUMBERS B. ADAMCZEWSKI AND N. RAMPERSAD Abstract. We prove that every algebraic number contains infinitely many occurrences of 7/3-powers in its binary expansion.
More informationA relative of the Thue-Morse Sequence
A relative of the Thue-Morse Sequence Jean-Paul Allouche C.N.R.S. U.R.A. 0226, Math., Université Bordeaux I, F-33405 Talence cedex, FRANCE André Arnold LaBRI, Université Bordeaux I, F-33405 Talence cedex,
More informationCDMTCS Research Report Series Explicit Denition of the Binary Reected Gray Codes Marston Conder Department of Mathematics University of Auckland Auckl
CDMTCS Research Report Series Explicit Denition of the Binary Reected Gray Codes Marston Conder Department of Mathematics University of Auckland Auckland, New Zealand CDMTCS-041 June 1997 Centre for Discrete
More informationA MATRIX GENERALIZATION OF A THEOREM OF FINE
A MATRIX GENERALIZATION OF A THEOREM OF FINE ERIC ROWLAND To Jeff Shallit on his 60th birthday! Abstract. In 1947 Nathan Fine gave a beautiful product for the number of binomial coefficients ( n, for m
More informationON THE ASYMPTOTIC BEHAVIOR OF DENSITY OF SETS DEFINED BY SUM-OF-DIGITS FUNCTION IN BASE 2
#A58 INTEGERS 7 (7) ON THE ASYMPTOTIC BEHAVIOR OF DENSITY OF SETS DEFINED BY SUM-OF-DIGITS FUNCTION IN BASE Jordan Emme Aix-Marseille Université, CNRS, Centrale Marseille, Marseille, France jordanemme@univ-amufr
More informationPolygonal Chain Sequences in the Space of Compact Sets
1 3 47 6 3 11 Journal of Integer Sequences, Vol. 1 009, Article 09.1.7 Polygonal Chain Sequences in the Space of Compact Sets Steven Schlicker Grand Valley State University Allendale, MI 49401 USA schlicks@gvsu.edu
More informationPart IA Numbers and Sets
Part IA Numbers and Sets Definitions Based on lectures by A. G. Thomason Notes taken by Dexter Chua Michaelmas 2014 These notes are not endorsed by the lecturers, and I have modified them (often significantly)
More informationPart IA Numbers and Sets
Part IA Numbers and Sets Theorems Based on lectures by A. G. Thomason Notes taken by Dexter Chua Michaelmas 2014 These notes are not endorsed by the lecturers, and I have modified them (often significantly)
More informationOn divisibility of Narayana numbers by primes
On divisibility of Narayana numbers by primes Miklós Bóna Department of Mathematics, University of Florida Gainesville, FL 32611, USA, bona@math.ufl.edu and Bruce E. Sagan Department of Mathematics, Michigan
More informationRegular Sequences. Eric Rowland. School of Computer Science University of Waterloo, Ontario, Canada. September 5 & 8, 2011
Regular Sequences Eric Rowland School of Computer Science University of Waterloo, Ontario, Canada September 5 & 8, 2011 Eric Rowland (University of Waterloo) Regular Sequences September 5 & 8, 2011 1 /
More informationWords generated by cellular automata
Words generated by cellular automata Eric Rowland University of Waterloo (soon to be LaCIM) November 25, 2011 Eric Rowland (Waterloo) Words generated by cellular automata November 25, 2011 1 / 38 Outline
More informationThe Formal Inverse of the Period-Doubling Sequence
2 3 47 6 23 Journal of Integer Sequences, Vol. 2 (28), Article 8.9. The Formal Inverse of the Period-Doubling Sequence Narad Rampersad Department of Mathematics and Statistics University of Winnipeg 55
More informationArturo Carpi 1 and Cristiano Maggi 2
Theoretical Informatics and Applications Theoret. Informatics Appl. 35 (2001) 513 524 ON SYNCHRONIZED SEQUENCES AND THEIR SEPARATORS Arturo Carpi 1 and Cristiano Maggi 2 Abstract. We introduce the notion
More informationProblem Set 2: Solutions Math 201A: Fall 2016
Problem Set 2: s Math 201A: Fall 2016 Problem 1. (a) Prove that a closed subset of a complete metric space is complete. (b) Prove that a closed subset of a compact metric space is compact. (c) Prove that
More informationPERIODS OF FACTORS OF THE FIBONACCI WORD
PERIODS OF FACTORS OF THE FIBONACCI WORD KALLE SAARI Abstract. We show that if w is a factor of the infinite Fibonacci word, then the least period of w is a Fibonacci number. 1. Introduction The Fibonacci
More informationNAME: Mathematics 205A, Fall 2008, Final Examination. Answer Key
NAME: Mathematics 205A, Fall 2008, Final Examination Answer Key 1 1. [25 points] Let X be a set with 2 or more elements. Show that there are topologies U and V on X such that the identity map J : (X, U)
More informationDecomposition of Pascal s Kernels Mod p s
San Jose State University SJSU ScholarWorks Faculty Publications Mathematics January 2002 Decomposition of Pascal s Kernels Mod p s Richard P. Kubelka San Jose State University, richard.kubelka@ssu.edu
More information1 Take-home exam and final exam study guide
Math 215 - Introduction to Advanced Mathematics Fall 2013 1 Take-home exam and final exam study guide 1.1 Problems The following are some problems, some of which will appear on the final exam. 1.1.1 Number
More informationULTRAFILTER AND HINDMAN S THEOREM
ULTRAFILTER AND HINDMAN S THEOREM GUANYU ZHOU Abstract. In this paper, we present various results of Ramsey Theory, including Schur s Theorem and Hindman s Theorem. With the focus on the proof of Hindman
More informationPERIODS IMPLYING ALMOST ALL PERIODS FOR TREE MAPS. A. M. Blokh. Department of Mathematics, Wesleyan University Middletown, CT , USA
PERIODS IMPLYING ALMOST ALL PERIODS FOR TREE MAPS A. M. Blokh Department of Mathematics, Wesleyan University Middletown, CT 06459-0128, USA August 1991, revised May 1992 Abstract. Let X be a compact tree,
More informationAbout Duval Extensions
About Duval Extensions Tero Harju Dirk Nowotka Turku Centre for Computer Science, TUCS Department of Mathematics, University of Turku June 2003 Abstract A word v = wu is a (nontrivial) Duval extension
More informationMathematical Foundations of Computer Science
Mathematical Foundations of Computer Science CS 499, Shanghai Jiaotong University, Dominik Scheder Monday, 208-03-9, homework handed out Sunday, 208-03-25, 2:00: submit questions and first submissions.
More informationarxiv: v1 [math.nt] 29 Jul 2014
A PRIMALITY CRITERION BASED ON A LUCAS CONGRUENCE ROMEO MEŠTROVIĆ arxiv:407.7894v [math.nt] 29 Jul 204 ABSTRACT. Let p be a prime. In 878 É. Lucas proved that the congruence ( ) p ( ) (mod p) holds for
More informationThe Advantage Testing Foundation Solutions
The Advantage Testing Foundation 2016 Problem 1 Let T be a triangle with side lengths 3, 4, and 5. If P is a point in or on T, what is the greatest possible sum of the distances from P to each of the three
More informationJan Boronski A class of compact minimal spaces whose Cartesian squares are not minimal
Jan Boronski A class of compact minimal spaces whose Cartesian squares are not minimal Coauthors: Alex Clark and Piotr Oprocha In my talk I shall outline a construction of a family of 1-dimensional minimal
More informationContents Ordered Fields... 2 Ordered sets and fields... 2 Construction of the Reals 1: Dedekind Cuts... 2 Metric Spaces... 3
Analysis Math Notes Study Guide Real Analysis Contents Ordered Fields 2 Ordered sets and fields 2 Construction of the Reals 1: Dedekind Cuts 2 Metric Spaces 3 Metric Spaces 3 Definitions 4 Separability
More informationPALINDROMIC AND SŪDOKU QUASIGROUPS
PALINDROMIC AND SŪDOKU QUASIGROUPS JONATHAN D. H. SMITH Abstract. Two quasigroup identities of importance in combinatorics, Schroeder s Second Law and Stein s Third Law, share many common features that
More informationRamsey Theory. May 24, 2015
Ramsey Theory May 24, 2015 1 König s Lemma König s Lemma is a basic tool to move between finite and infinite combinatorics. To be concise, we use the notation [k] = {1, 2,..., k}, and [X] r will denote
More informationarxiv:math/ v1 [math.nt] 27 Feb 2004
arxiv:math/0402458v1 [math.nt] 27 Feb 2004 On simultaneous binary expansions of n and n 2 Giuseppe Melfi Université de Neuchâtel Groupe de Statistique Espace de l Europe 4, CH 2002 Neuchâtel, Switzerland
More informationPascal s Triangle: Cellular Automata and Attractors
Chapter 8 Pascal s Triangle: Cellular Automata and Attractors Mathematics is often defined as the science of space and number [...] It was not until the recent resonance of computers and mathematics that
More information27 th Annual ARML Scrimmage
27 th Annual ARML Scrimmage Featuring: Howard County ARML Team (host) Baltimore County ARML Team ARML Team Alumni Citizens By Raymond Cheong May 23, 2012 Reservoir HS Individual Round (10 min. per pair
More information#A63 INTEGERS 17 (2017) CONCERNING PARTITION REGULAR MATRICES
#A63 INTEGERS 17 (2017) CONCERNING PARTITION REGULAR MATRICES Sourav Kanti Patra 1 Department of Mathematics, Ramakrishna Mission Vidyamandira, Belur Math, Howrah, West Bengal, India souravkantipatra@gmail.com
More informationPart V. Chapter 19. Congruence of integers
Part V. Chapter 19. Congruence of integers Congruence modulo m Let m be a positive integer. Definition. Integers a and b are congruent modulo m if and only if a b is divisible by m. For example, 1. 277
More informationOn the counting function of sets with even partition functions by
Author manuscript, published in "Publ. Math. Debrecen 79, 3-4 2011) 687-697" DOI : 10.5486/PMD.2011.5106 On the counting function of sets with even partition functions by F. Ben Saïd Université de Monastir
More informationTopological properties of Z p and Q p and Euclidean models
Topological properties of Z p and Q p and Euclidean models Samuel Trautwein, Esther Röder, Giorgio Barozzi November 3, 20 Topology of Q p vs Topology of R Both R and Q p are normed fields and complete
More informationSome properties of a Rudin Shapiro-like sequence
Some properties of a Rudin Shapiro-like sequence Narad Rampersad (Joint work with Philip Lafrance and Randy Yee) Department of Mathematics and Statistics University of Winnipeg Digital sequences there
More informationConference on Diophantine Analysis and Related Fields 2006 in honor of Professor Iekata Shiokawa Keio University Yokohama March 8, 2006
Diophantine analysis and words Institut de Mathématiques de Jussieu + CIMPA http://www.math.jussieu.fr/ miw/ March 8, 2006 Conference on Diophantine Analysis and Related Fields 2006 in honor of Professor
More informationTHE p-adic VALUATION OF LUCAS SEQUENCES
THE p-adic VALUATION OF LUCAS SEQUENCES CARLO SANNA Abstract. Let (u n) n 0 be a nondegenerate Lucas sequence with characteristic polynomial X 2 ax b, for some relatively prime integers a and b. For each
More information7 Asymptotics for Meromorphic Functions
Lecture G jacques@ucsd.edu 7 Asymptotics for Meromorphic Functions Hadamard s Theorem gives a broad description of the exponential growth of coefficients in power series, but the notion of exponential
More informationRamsey theory of homogeneous structures
Ramsey theory of homogeneous structures Natasha Dobrinen University of Denver Notre Dame Logic Seminar September 4, 2018 Dobrinen big Ramsey degrees University of Denver 1 / 79 Ramsey s Theorem for Pairs
More informationZEROS OF SPARSE POLYNOMIALS OVER LOCAL FIELDS OF CHARACTERISTIC p
ZEROS OF SPARSE POLYNOMIALS OVER LOCAL FIELDS OF CHARACTERISTIC p BJORN POONEN 1. Statement of results Let K be a field of characteristic p > 0 equipped with a valuation v : K G taking values in an ordered
More informationRing Sums, Bridges and Fundamental Sets
1 Ring Sums Definition 1 Given two graphs G 1 = (V 1, E 1 ) and G 2 = (V 2, E 2 ) we define the ring sum G 1 G 2 = (V 1 V 2, (E 1 E 2 ) (E 1 E 2 )) with isolated points dropped. So an edge is in G 1 G
More informationCLASS NOTES FOR APRIL 14, 2000
CLASS NOTES FOR APRIL 14, 2000 Announcement: Section 1.2, Questions 3,5 have been deferred from Assignment 1 to Assignment 2. Section 1.4, Question 5 has been dropped entirely. 1. Review of Wednesday class
More informationNumber Theory, Algebra and Analysis. William Yslas Vélez Department of Mathematics University of Arizona
Number Theory, Algebra and Analysis William Yslas Vélez Department of Mathematics University of Arizona O F denotes the ring of integers in the field F, it mimics Z in Q How do primes factor as you consider
More informationALMOST DISJOINT AND INDEPENDENT FAMILIES. 1. introduction. is infinite. Fichtenholz and Kantorovich showed that there is an independent family
ALMOST DISJOINT AND INDEPENDENT FAMILIES STEFAN GESCHKE Abstract. I collect a number of proofs of the existence of large almost disjoint and independent families on the natural numbers. This is mostly
More informationPaul Glendinning and Nikita Sidorov
Mathematical Research Letters 8, 535 543 (2001) UNIQUE REPRESENTATIONS OF REAL NUMBERS IN NON-INTEGER BASES Paul Glendinning and Nikita Sidorov 1. Introduction Problems related to the expansions of real
More informationSolutions to Practice Final
s to Practice Final 1. (a) What is φ(0 100 ) where φ is Euler s φ-function? (b) Find an integer x such that 140x 1 (mod 01). Hint: gcd(140, 01) = 7. (a) φ(0 100 ) = φ(4 100 5 100 ) = φ( 00 5 100 ) = (
More informationSelf-similar Fractals: Projections, Sections and Percolation
Self-similar Fractals: Projections, Sections and Percolation University of St Andrews, Scotland, UK Summary Self-similar sets Hausdorff dimension Projections Fractal percolation Sections or slices Projections
More informationAutomata for arithmetic Meyer sets
Author manuscript, published in "LATIN 4, Buenos-Aires : Argentine (24)" DOI : 1.17/978-3-54-24698-5_29 Automata for arithmetic Meyer sets Shigeki Akiyama 1, Frédérique Bassino 2, and Christiane Frougny
More informationUNCOUNTABLE ω-limit SETS WITH ISOLATED POINTS
UNCOUNTABLE ω-limit SETS WITH ISOLATED POINTS CHRIS GOOD, BRIAN RAINES, AND ROLF SUABEDISSEN Abstract. We give two examples of tent maps with uncountable (as it happens, post-critical) ω-limit sets, which
More informationFractals and Dimension
Chapter 7 Fractals and Dimension Dimension We say that a smooth curve has dimension 1, a plane has dimension 2 and so on, but it is not so obvious at first what dimension we should ascribe to the Sierpinski
More informationCONGRUENCES FOR BERNOULLI - LUCAS SUMS
CONGRUENCES FOR BERNOULLI - LUCAS SUMS PAUL THOMAS YOUNG Abstract. We give strong congruences for sums of the form N BnVn+1 where Bn denotes the Bernoulli number and V n denotes a Lucas sequence of the
More informationODD PARTITIONS IN YOUNG S LATTICE
Séminaire Lotharingien de Combinatoire 75 (2016), Article B75g ODD PARTITIONS IN YOUNG S LATTICE ARVIND AYYER, AMRITANSHU PRASAD, AND STEVEN SPALLONE Abstract. We show that the subgraph induced in Young
More informationModular Arithmetic Instructor: Marizza Bailey Name:
Modular Arithmetic Instructor: Marizza Bailey Name: 1. Introduction to Modular Arithmetic If someone asks you what day it is 145 days from now, what would you answer? Would you count 145 days, or find
More informationDefinition 6.1 (p.277) A positive integer n is prime when n > 1 and the only positive divisors are 1 and n. Alternatively
6 Prime Numbers Part VI of PJE 6.1 Fundamental Results Definition 6.1 (p.277) A positive integer n is prime when n > 1 and the only positive divisors are 1 and n. Alternatively D (p) = { p 1 1 p}. Otherwise
More informationMatrix compositions. Emanuele Munarini. Dipartimento di Matematica Politecnico di Milano
Matrix compositions Emanuele Munarini Dipartimento di Matematica Politecnico di Milano emanuelemunarini@polimiit Joint work with Maddalena Poneti and Simone Rinaldi FPSAC 26 San Diego Motivation: L-convex
More informationNotes on Rauzy Fractals
Notes on Rauzy Fractals It is a tradition to associate symbolic codings to dynamical systems arising from geometry or mechanics. Here we introduce a classical result to give geometric representations to
More informationAbstract β-expansions and ultimately periodic representations
Journal de Théorie des Nombres de Bordeaux 17 (2005), 283 299 Abstract -expansions and ultimately periodic representations par Michel RIGO et Wolfgang STEINER Résumé. Pour les systèmes de numération abstraits
More information1987 IMO Shortlist. IMO Shortlist 1987
IMO Shortlist 1987 1 Let f be a function that satisfies the following conditions: (i) If x > y and f(y) y v f(x) x, then f(z) = v + z, for some number z between x and y. (ii) The equation f(x) = 0 has
More informationDiscrete Mathematics
Discrete Mathematics 310 (2010) 109 114 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: www.elsevier.com/locate/disc Total palindrome complexity of finite words Mira-Cristiana
More informationDISTRIBUTION RESULTS FOR LOW-WEIGHT BINARY REPRESENTATIONS FOR PAIRS OF INTEGERS
DISTRIBUTION RESULTS FOR LOW-WEIGHT BINARY REPRESENTATIONS FOR PAIRS OF INTEGERS PETER J. GRABNER, CLEMENS HEUBERGER, AND HELMUT PRODINGER Abstract. We discuss an optimal method for the computation of
More informationOn the number of cycles in a graph with restricted cycle lengths
On the number of cycles in a graph with restricted cycle lengths Dániel Gerbner, Balázs Keszegh, Cory Palmer, Balázs Patkós arxiv:1610.03476v1 [math.co] 11 Oct 2016 October 12, 2016 Abstract Let L be a
More informationArithmetic properties of lacunary sums of binomial coefficients
Arithmetic properties of lacunary sums of binomial coefficients Tamás Mathematics Department Occidental College 29th Journées Arithmétiques JA2015, July 6-10, 2015 Arithmetic properties of lacunary sums
More informationarxiv: v5 [math.nt] 23 May 2017
TWO ANALOGS OF THUE-MORSE SEQUENCE arxiv:1603.04434v5 [math.nt] 23 May 2017 VLADIMIR SHEVELEV Abstract. We introduce and study two analogs of one of the best known sequence in Mathematics : Thue-Morse
More informationCOMBINATORIAL CONSTRUCTIONS FOR THE ZECKENDORF SUM OF DIGITS OF POLYNOMIAL VALUES
COMBINATORIAL CONSTRUCTIONS FOR THE ZECKENDORF SUM OF DIGITS OF POLYNOMIAL VALUES THOMAS STOLL Abstract. Let p(x) Z[X] with p(n) N be of degree h 2 and denote by s F (n) the sum of digits in the Zeckendorf
More informationCourse 2BA1: Trinity 2006 Section 9: Introduction to Number Theory and Cryptography
Course 2BA1: Trinity 2006 Section 9: Introduction to Number Theory and Cryptography David R. Wilkins Copyright c David R. Wilkins 2006 Contents 9 Introduction to Number Theory and Cryptography 1 9.1 Subgroups
More informationOn the Average Complexity of Brzozowski s Algorithm for Deterministic Automata with a Small Number of Final States
On the Average Complexity of Brzozowski s Algorithm for Deterministic Automata with a Small Number of Final States Sven De Felice 1 and Cyril Nicaud 2 1 LIAFA, Université Paris Diderot - Paris 7 & CNRS
More informationMinimal Symmetric Differences of lines in Projective Planes
Minimal Symmetric Differences of lines in Projective Planes Paul Balister University of Memphis Mississippi Discrete Mathematics Workshop November 15, 2014 Joint work with Béla Bollobás, Zoltán Füredi,
More informationA CONGRUENTIAL IDENTITY AND THE 2-ADIC ORDER OF LACUNARY SUMS OF BINOMIAL COEFFICIENTS
A CONGRUENTIAL IDENTITY AND THE 2-ADIC ORDER OF LACUNARY SUMS OF BINOMIAL COEFFICIENTS Gregory Tollisen Department of Mathematics, Occidental College, 1600 Campus Road, Los Angeles, USA tollisen@oxy.edu
More informationDiscrete mathematics , Fall Instructor: prof. János Pach
Discrete mathematics 016-017, Fall Instructor: prof. János Pach - covered material - Lecture 1. Counting problems To read: [Lov]: 1.. Sets, 1.3. Number of subsets, 1.5. Sequences, 1.6. Permutations, 1.7.
More informationBinomial Coefficient Identities/Complements
Binomial Coefficient Identities/Complements CSE21 Fall 2017, Day 4 Oct 6, 2017 https://sites.google.com/a/eng.ucsd.edu/cse21-fall-2017-miles-jones/ permutation P(n,r) = n(n-1) (n-2) (n-r+1) = Terminology
More informationON PARTITION FUNCTIONS OF ANDREWS AND STANLEY
ON PARTITION FUNCTIONS OF ANDREWS AND STANLEY AE JA YEE Abstract. G. E. Andrews has established a refinement of the generating function for partitions π according to the numbers O(π) and O(π ) of odd parts
More informationCS 250/251 Discrete Structures I and II Section 005 Fall/Winter Professor York
CS 250/251 Discrete Structures I and II Section 005 Fall/Winter 2013-2014 Professor York Practice Quiz March 10, 2014 CALCULATORS ALLOWED, SHOW ALL YOUR WORK 1. Construct the power set of the set A = {1,2,3}
More informationOn the Recognizability of Self-Generating Sets
2 3 47 6 23 Journal of Integer Sequences, Vol. 3 (200), Article 0.2.2 On the Recognizability of Self-Generating Sets Tomi Kärki University of Turku Department of Mathematics FI-2004 Turku Finland topeka@utu.fi
More information1 Sequences and Summation
1 Sequences and Summation A sequence is a function whose domain is either all the integers between two given integers or all the integers greater than or equal to a given integer. For example, a m, a m+1,...,
More informationX(^+(2^i) = i + X02^r + i.
Peter R. Christopher Department of Mathematics Sciences Worcester Polytechnic Institute, Worcester, MA 69 John W. Kennedy Mathematics Department, Pace University, New York, NY 38 (Submitted May 995). INTRODUCTION
More informationOn The Discriminator of Lucas Sequences
On The Discriminator of Lucas Sequences Bernadette Faye Ph.D Student FraZA, Bordeaux November 8, 2017 The Discriminator Let a = {a n } n 1 be a sequence of distinct integers. The Discriminator is defined
More informationLONG CYCLES IN ABC PERMUTATIONS
LONG CYCLES IN ABC PERMUTATIONS IGOR PAK AND AMANDA REDLICH Abstract. An abc-permutation is a permutation σ abc S n obtained by exchanging an initial block of length a a final block of length c of {1,...,
More informationMix-Automatic Sequences
Mix-Automatic Sequences Jörg Endrullis 1, Clemens Grabmayer 2, and Dimitri Hendriks 1 1 VU University Amsterdam 2 Utrecht University Abstract. Mix-automatic sequences form a proper extension of the class
More information