Convergence rates in generalized Zeckendorf decomposition problems
|
|
- Magdalen King
- 5 years ago
- Views:
Transcription
1 Convergence rates in generalized Zeckendorf decomposition problems Ray Li 1 Steven J Miller (sjm1@williams.edu) 2 Zhao Pan (zhaop@andrew.cmu.edu) 3 Huanzhong Xu (huanzhox@andrew.cmu.edu) 4 1 Carnegie Mellon 2 Williams College 3 Carnegie Mellon 4 Carnegie Mellon Workshop on Combinatorial and Additive Number Theory New York, NY, May 26, 2016
2 Summary Review Zeckendorf-type decompositions
3 Summary Review Zeckendorf-type decompositions Discuss new approaches to asymptotic behavior of variance
4 Summary Review Zeckendorf-type decompositions Discuss new approaches to asymptotic behavior of variance Discuss new results on Gaussian behavior of gaps between summands
5 Previous Results
6 Definitions: Zeckendorf Decomposition Theorem (Zeckendorf) Let {F n } n N denote the Fibonacci numbers with F 1 = 1 and F 2 = 2. Every positive integer can be written uniquely as a sum of non-consecutive Fibonacci numbers.
7 Definitions: Zeckendorf Decomposition Theorem (Zeckendorf) Let {F n } n N denote the Fibonacci numbers with F 1 = 1 and F 2 = 2. Every positive integer can be written uniquely as a sum of non-consecutive Fibonacci numbers. Example 101 = = F 10 + F 5 + F 3 + F 1
8 Definitions: Positive Linear Recurrence Sequence Definition A Positive Linear Recurrence Sequence (PLRS) is a sequence {G n } satisfying G n = c 1 G n c L G n L with nonegative integer coefficients c i with c 1, c L, L 1 and initial conditions G 1 = 1 and G n = c 1 G n 1 + c 2 G n c n 1 G for 1 n L.
9 Examples of PLRS 1 Fibonacci numbers: L = 2, c 1 = c 2 = 1. G 1 = 1, G 2 = 2, G 3 = 3, G 4 = 5,....
10 Examples of PLRS 1 Fibonacci numbers: L = 2, c 1 = c 2 = 1. G 1 = 1, G 2 = 2, G 3 = 3, G 4 = 5, Powers of b: L = 2, c 1 = b 1, c 2 = b. G 1 = 1, G 2 = b, G 3 = b 2, G 4 = b 3,....
11 Examples of PLRS 1 Fibonacci numbers: L = 2, c 1 = c 2 = 1. G 1 = 1, G 2 = 2, G 3 = 3, G 4 = 5, Powers of b: L = 2, c 1 = b 1, c 2 = b. G 1 = 1, G 2 = b, G 3 = b 2, G 4 = b 3, d-bonacci numbers: L = d, c 1 = c 2 = = c d = 1, G n = 2 n 1 for n d.
12 Definition: Generalized Zeckendorf Decomposition Definition (Generalized Zeckendorf Decomposition) Let {G n } be a PLRS and m be a positive integer. Then m = N a i G N+1 i i=1 is a legal decomposition if a 1 > 0 and the other a i 0, and one of the following conditions holds. 1 We have N < L and a i = c i for 1 i N. 2 There exists an s {1,..., L} such that a 1 = c 1, a 2 = c 2,..., a s 1 = c s 1, a s < c s, and {b i } N s i=1 (with b i = a s+i ) is either legal or empty.
13 Example Consider the PLRS: G n = 3G n 1 + 2G n 2 + 2G n 4. Examples of legal decompositions: m = 3G 9 + 2G 8 + G 6 + 3G 5 + G 4 + 2G 1. m = 3G 9 + 2G 8 + G 6 + 3G 5 + G 4 + 3G 1. Examples of NOT legal decompositions: m = 4G 9. m = 3G 9 + 2G 8 + G 7. m = 3G 9 + 2G 8 + 2G 6.
14 Theorem: Generalized Zeckendorf Decomposition Theorem Let {G n } be a PLRS. Then there is a unique legal decomposition for every positive integer m.
15 Definitions and Notations Definition Probability Space Ω n : The set of legal decompositions of integers in [G n, G n+1 ). Probability Measure: Let each of the G n+1 G n legal decompositions be weighted equally. Random Variables K n : Set K n (ω) equal to the number of summands of ω Ω n.
16 Asymptotic Behavior of Variance
17 Old Result Theorem (Miller and Wang, 2012) When {G n } is a PLRS, there exists constants A, B, C, D, γ 1 (0, 1), γ 2 (0, 1) such that E[K n ] = An + B + o(γ n 1) (1) Var[K n ] = Cn + D + o(γ n 2) (2) Remark Proof of (1) is easy. Proof of (2) is hard. Key difficulty: bound of C.
18 Main New Result Theorem When {G n } is a PLRS with length L, there exists C min > 0 such that Var[K n ] > C min n for all n > L.
19 Definition of Blocks Definition We define a Type 1 block as an integer sequence corresponding to Condition 1. We define a Type 2 block as an integer sequence corresponding to Condition 2. Example G n = 2G n 1 + 2G n 2 + 2G n 4 Suppose m = G 5 + 2G 3 + G 2 + 2G 1, we write the decomposition into an integer sequence: [1, 0, 2, 1, 2]. The Type 2 Blocks: [1], [0], [2, 1], [1]. The Type 1 Block: [2].
20 Definition of Blocks Definition We define the size of a block as the total number of summands in it. We define the length of a block as the total number of indices in it. Example G n = 2G n 1 + 3G n 3 + 2G n 4 A possible Type 2 Block is [2, 0, 3, 1]. It has size 6 and length 4.
21 Key Observations of Type 1 Blocks Properties: It appears at most once in any legal decomposition. So, It has to be the last block if it does exist. Type 1 block matters little when n is large. Second to last block has to be a Type 2 block.
22 Key Observations of Type 2 Blocks The length of a Type 2 block is fully determined by its size. So we can define a function l(t) such that a Type 2 block with size t has length l(t).
23 Key Observations of Type 2 Blocks The length of a Type 2 block is fully determined by its size. So we can define a function l(t) such that a Type 2 block with size t has length l(t). A Type 2 block always has nonnegative size and strictly positive length.
24 Key Observations of Type 2 Blocks The length of a Type 2 block is fully determined by its size. So we can define a function l(t) such that a Type 2 block with size t has length l(t). A Type 2 block always has nonnegative size and strictly positive length. A legal decomposition will stay legal if we add a Type 2 block to it or remove a Type 2 block from it.
25 Key Idea Lemma For a fixed t, there is a bijection h t between: all legal decompositions with total length n and the second to last block with size t, and all legal decompositions with total length n l(t). Example G n = 2G n 1 + 2G n G n 4. m = G 6 + G 5 + 2G 4 + G 1. Its block representation: [1], [1], [2, 0], [0], [1]. After removing [0]: [1], [1], [2, 0], [1]. The resulting legal decomposition: G 5 + G 4 + 2G 3 + G 1.
26 Key Idea Set Z n (ω) equal to the size of the second to last block for the legal decomposition ω Ω n. Then if Z n (ω) = t, we have K n (ω) = K n l(t) (h t (ω)) + t.
27 Key Idea Set Z n (ω) equal to the size of the second to last block for the legal decomposition ω Ω n. Then if Z n (ω) = t, we have K n (ω) = K n l(t) (h t (ω)) + t. In other words, we get the conditional expectations: E[K n Z n = t] = E[K n l(t) ] + t E[Kn 2 Z n = t] = E[(K n l(t) + t) 2 ] = E[Kn l(t)] 2 + 2t E[K n l(t) ] + t 2.
28 Proof of Main Theorem We first explicitly choose C min. Then, we use strong induction on n to prove Var[K n ] > C min n.
29 Proof of Main Theorem We first explicitly choose C min. Then, we use strong induction on n to prove Var[K n ] > C min n. From previous results, we know E[K n ] = An + B + f (n) for some f (n) = o(γ n 1 ).
30 Proof of Main Theorem We first explicitly choose C min. Then, we use strong induction on n to prove Var[K n ] > C min n. From previous results, we know E[K n ] = An + B + f (n) for some f (n) = o(γ n 1 ). From induction hypothesis, we can bound E[K 2 n l(t) ] by estimating Var[K n l(t) ] + (E[K n l(t) ]) 2.
31 Proof of Main Theorem We first explicitly choose C min. Then, we use strong induction on n to prove Var[K n ] > C min n. From previous results, we know E[K n ] = An + B + f (n) for some f (n) = o(γ n 1 ). From induction hypothesis, we can bound E[K 2 n l(t) ] by estimating Var[K n l(t) ] + (E[K n l(t) ]) 2. In inductive step, we will be able to bound Var[K n ] by estimating E[K 2 n ] (E[K n ]) 2.
32 Further Works Can we lift the constraint that the recurrence relationship is positive linear?
33 Further Works Can we lift the constraint that the recurrence relationship is positive linear? Can we generalize to more general sequences? Even without a recurrence relation?
34 Further Works Can we lift the constraint that the recurrence relationship is positive linear? Can we generalize to more general sequences? Even without a recurrence relation? Can we define legal decompositions and blocks for other sequences?
35 Gaussian Behavior of Gaps
36 Technical Note For the rest of the talk, assume PLRS refers to recurrences with c i > 0 for 1 i L. G n = c 1 G n c L G n L (Previoiusly, we only needed c 1, c L > 0 and c i 0 for 1 < i < L.)
37 Gaps in Decompositions Definition Let m be a positive integer with decomposition m = N a i G N+1 i = G i1 + G i2 + + G ik i=1 and i 1 i 2 i k. Then the gaps in the decomposition of m are the numbers i 1 i 2, i 2 i 3,..., i k 1 i k.
38 Gaps in Decompositions Definition Let m be a positive integer with decomposition m = N a i G N+1 i = G i1 + G i2 + + G ik i=1 and i 1 i 2 i k. Then the gaps in the decomposition of m are the numbers i 1 i 2, i 2 i 3,..., i k 1 i k. Example The gaps for the decomposition of m = 101 are 5, 2, = F 10 + F 5 + F 3 + F 1.
39 Gaps in Decompositions Recall: Let k(m) be the number of summands in the decomposition of m. Let K n be k(m) for an m chosen uniformly in [G n, G n+1 ).
40 Gaps in Decompositions Let k(m) be the number of summands in the decomposition of m. Let K n be k(m) for an m chosen uniformly in [G n, G n+1 ). Let k g (m) be the number of size-g gaps in the decomposition of m. Let K g,n be k g (m) for an m chosen uniformly in [G n, G n+1 ).
41 Gaps in Decompositions k(m) : number of summands in m k g (m) : number of size-g gaps in m Example 101 = F 10 + F 5 + F 3 + F 1 k(101) = 4, k 2 (101) = 2, k 3 (101) = k 4 (101) = 0, k 5 (101) = 1
42 Gaps in Decompositions k(m) : number of summands in m k g (m) : number of size-g gaps in m Example 101 = F 10 + F 5 + F 3 + F 1 k(101) = 4, k 2 (101) = 2, k 3 (101) = k 4 (101) = 0, k 5 (101) = 1 Fact k(m) = 1 + k g (m) g=0
43 Results Understand: Distribution of number of summands: K n
44 Results Understand: Distribution of number of summands: K n Don t Understand: Distribution of number of size-g gaps: K g,n
45 Results: Mean and Variance K n : number of summands in random m [G n, G n+1 ) Theorem (Lekkerkerker, 1951) When {G n } is Fibonacci, E[K n ] = C Lek n + O(1) for C Lek = 1 ϕ (C lek 0.276) Theorem (Miller and Wang, 2012) When {G n } is a PLRS, there exists A > 0, B, and γ 1 (0, 1) such that E[K n ] = An + B + O(γ n 1 ). Theorem (Miller and Wang, 2012) When {G n } is a PLRS, there exists C > 0, D, and γ 2 (0, 1) such that Var[K n ] = Cn + D + O(γ n 2 ).
46 Results: Mean and Variance K g,n : number of size-g gaps in random m [G n, G n+1 ) Theorem (Main Result 1: Lekkerkerker for gaps) When {G n } is a PLRS, for every integer g 0, there exists A g, B g and γ g,1 (0, 1) such that E[K g,n ] = A g n + B g + O(γ n g,1 ). By Bower et al. 2013, A g is known for all PLRS {G n } and g. Theorem (Main Result 2: Variance is linear for gaps) When {G n } is a PLRS, for every integer g 0, there exists C g, D g and γ g,2 (0, 1) such that Var[K g,n ] = C g n + D g + O(γ n g,2 ).
47 Results: Asymptotic Gaussianity K n : number of summands in random m [G n, G n+1 ) K g,n : number of size-g gaps in random m [G n, G n+1 ) Theorem (Kopp, Kolo glu, Miller, and Wang, 2011) When {G n } is Fibonacci, as n, K n approaches Gaussian. Theorem (Miller and Wang, 2012) When {G n } is PLRS, as n, K n approaches Gaussian. Theorem (Main Result 3: Gaussian Behavior for Gaps) When {G n } is PLRS, as n, K g,n approaches Gaussian.
48 Results: Summary Theorem (Main Results, Summary) The mean µ g,n and variance σ 2 g,n of K g,n grow linearly in n, and (K g,n µ g,n )/σ g,n converges to the standard normal N(0, 1) as n.
49 Proof Sketch Theorem (Main Result 3: Fibonacci Numbers, g = 2) When {G n } is Fibonacci, as n, (K 2,n µ 2,n )/σ 2,n converges to standard normal.
50 Proof Sketch Theorem (Main Result 3: Fibonacci Numbers, g = 2) When {G n } is Fibonacci, as n, (K 2,n µ 2,n )/σ 2,n converges to standard normal. Let p 2,n,k = #{m [F n, F n+1 ) with k size-2 gaps}. Pr[K 2,n = k] p 2,n,k.
51 Proof Sketch p 2,n,k = #{m [F n, F n+1 ) with k size-2 gaps}.
52 Proof Sketch p 2,n,k = #{m [F n, F n+1 ) with k size-2 gaps}. Lemma p 2,n,k = p 2,n 1,k + p 2,n 2,k 1 + p 2,n 3,k 1 p 2,n 3,k
53 Proof Sketch Lemma (Key Lemma) If a n,k is a nice two dimensional homogenous recurrence a n,k = i 0 i=1 j 0 j=0 t i,j a n i,k j for constants t i,j, then the random variable X n given by Pr[X n = k] a n,k approaches Gaussian as n.
54 Proof Sketch Lemma (Key Lemma) If a n,k is a nice two dimensional homogenous recurrence then the random variable X n given by Pr[X n = k] a n,k approaches Gaussian as n. Famous example: a n,k = a n 1,k + a n 1,k 1 gives...
55 Proof Sketch Lemma (Key Lemma) If a n,k is a nice two dimensional homogenous recurrence then the random variable X n given by Pr[X n = k] a n,k approaches Gaussian as n. Famous example: a n,k = a n 1,k + a n 1,k 1 gives... the binomials: a n,k = ( n k)!
56 Proof Sketch Lemma (Key Lemma) If a n,k is a nice two dimensional homogenous recurrence then the random variable X n given by Pr[X n = k] a n,k approaches Gaussian as n. Applications a n,k = a n 1,k + a n 1,k 1 X n = # heads after n coin flips (Pr[X n = k] = k) (n ) 2 n a n,k = a n 1,k + a n 2,k 1 + a n 3,k 1 a n 3,k X n = # size-2 gaps of random m [F n, F n+1 ) (a n,k = p 2,n,k, X n = K 2,n ) a n,k = a n 1,k + a n 2,k 1 X n = # summands of random m [F n, F n+1 ) (X n = K n )
57 Proof Sketch Lemma (Key Lemma) If a n,k is a nice two dimensional homogenous recurrence then the random variable X n given by Pr[X n = k] a n,k approaches Gaussian as n. Let µ n (m) = E[(X n µ n ) m ]. Lemma (Method of Moments) Suffices to prove lim n µ n (2m) µ n (2m + 1) = (2m 1)!! lim µ n (2) m n µ n (2) m+ 1 2 = 0.
58 Proof Sketch Let µ n (m) = E[(X n µ n ) m ]. We have µ n (m) = m l=0 ( m l ) t i,j 0 F n i t i,j F n (j + µ n i µ n ) l µ n i (m l).
59 Proof Sketch Let µ n (m) = E[(X n µ n ) m ]. We have µ n (m) = m l=0 ( m l ) t i,j 0 F n i t i,j F n (j + µ n i µ n ) l µ n i (m l). Lemma For each integer m 0, there exist degree m polynomials Q 2m, Q 2m+1 and γ 2m, γ 2m+1 (0, 1) such that µ n (2m) = Q 2m (n) + O(γ n 2m) µ n (2m + 1) = Q 2m+1 (n) + O(γ n 2m+1). Furthermore, if C 2m is the leading coefficient of Q 2m, then for all m, C 2m = (2m 1)!! C m 2.
60 Future Work Are there other meaningful two-dimensional recurrences to which we can apply our asymptotic Gaussianity result?
61 Future Work Are there other meaningful two-dimensional recurrences to which we can apply our asymptotic Gaussianity result? Can you lift the constraint that every coefficient c i must be positive?
62 Future Work Are there other meaningful two-dimensional recurrences to which we can apply our asymptotic Gaussianity result? Can you lift the constraint that every coefficient c i must be positive? What is the rate at which our K g,n converges to a normal distribution?
Distribution of summands in generalized Zeckendorf decompositions
Distribution of summands in generalized Zeckendorf decompositions Amanda Bower (UM-Dearborn), Louis Gaudet (Yale University), Rachel Insoft (Wellesley College), Shiyu Li (Berkeley), Steven J. Miller and
More informationCookie Monster Meets the Fibonacci Numbers. Mmmmmm Theorems!
Cookie Monster Meets the Fibonacci Numbers. Mmmmmm Theorems! Steven J. Miller (MC 96) http://www.williams.edu/mathematics/sjmiller/public_html Yale University, April 14, 2014 Introduction Goals of the
More informationFrom Fibonacci Quilts to Benford s Law through Zeckendorf Decompositions
From Fibonacci Quilts to Benford s Law through Zeckendorf Decompositions Steven J. Miller (sjm1@williams.edu) http://www.williams.edu/mathematics/sjmiller/public_html AMS Special Session on Difference
More informationFrom Fibonacci Numbers to Central Limit Type Theorems
From Fibonacci Numbers to Central Limit Type Theorems Murat Koloğlu, Gene Kopp, Steven J. Miller and Yinghui Wang Williams College, October 1st, 010 Introduction Previous Results Fibonacci Numbers: F n+1
More informationDistribution of the Longest Gap in Positive Linear Recurrence Sequences
Distribution of the Longest Gap in Positive Linear Recurrence Sequences Shiyu Li 1, Philip Tosteson 2 Advisor: Steven J. Miller 2 1 University of California, Berkeley 2 Williams College http://www.williams.edu/mathematics/sjmiller/
More informationCookie Monster Meets the Fibonacci Numbers. Mmmmmm Theorems!
Cookie Monster Meets the Fibonacci Numbers. Mmmmmm Theorems! Olivial Beckwith, Murat Koloğlu, Gene Kopp, Steven J. Miller and Yinghui Wang http://www.williams.edu/mathematics/sjmiller/public html Colby
More informationCookie Monster Meets the Fibonacci Numbers. Mmmmmm Theorems!
Cookie Monster Meets the Fibonacci Numbers. Mmmmmm Theorems! Murat Koloğlu, Gene Kopp, Steven J. Miller and Yinghui Wang http://www.williams.edu/mathematics/sjmiller/public html Smith College, January
More informationCookie Monster Meets the Fibonacci Numbers. Mmmmmm Theorems!
Cookie Monster Meets the Fibonacci Numbers. Mmmmmm Theorems! Murat Koloğlu, Gene Kopp, Steven J. Miller and Yinghui Wang http://www.williams.edu/mathematics/sjmiller/public html College of the Holy Cross,
More informationFrom Fibonacci Quilts to Benford s Law through Zeckendorf Decompositions
From Fibonacci Quilts to Benford s Law through Zeckendorf Decompositions Steven J. Miller (sjm1@williams.edu) http://www.williams.edu/mathematics/sjmiller/ public_html CANT 2015 (May 19), Graduate Center
More informationFROM FIBONACCI NUMBERS TO CENTRAL LIMIT TYPE THEOREMS
FROM FIBONACCI NUMBERS TO CENTRAL LIMIT TYPE THEOREMS STEVEN J. MILLER AND YINGHUI WANG Abstract A beautiful theorem of Zeckendorf states that every integer can be written uniquely as a sum of non-consecutive
More informationSpringboards to Mathematics: From Zombies to Zeckendorf
Springboards to Mathematics: From Zombies to Zeckendorf Steven J. Miller http://www.williams.edu/mathematics/sjmiller/public_html Zombies General Advice: What are your tools and how can they be used? Zombine
More informationCookie Monster Meets the Fibonacci Numbers. Mmmmmm Theorems!
Cookie Monster Meets the Fibonacci Numbers. Mmmmmm Theorems! Steven J Miller, Williams College Steven.J.Miller@williams.edu http://www.williams.edu/go/math/sjmiller CANT 2010, CUNY, May 29, 2010 Summary
More informationON THE NUMBER OF SUMMANDS IN ZECKENDORF DECOMPOSITIONS
ON THE NUMBER OF SUMMANDS IN ZECKENDORF DECOMPOSITIONS MURAT KOLOĞLU, GENE S. KOPP, STEVEN J. MILLER, AND YINGHUI WANG Abstract. Zecendorf proved that every positive integer has a unique representation
More informationOn Summand Minimality of Generalized Zeckendorf Decompositions
On Summand Minimality of Generalized Zeckendorf Decompositions Katherine Cordwell 1, Magda Hlavacek 2 SMALL REU, Williams College ktcordwell@gmail.com mhlavacek@hmc.edu 1 University of Maryland, College
More informationMSTD Subsets and Properties of Divots in the Distribution of Missing Sums
MSTD Subsets and Properties of Divots in the Distribution of Missing Sums Steven J Miller, Williams College sjm1@williams.edu Victor Xu, Carnegie Mellon University vzx@andrew.cmu.edu Xiaorong Zhang, Carnegie
More informationREPRESENTING POSITIVE INTEGERS AS A SUM OF LINEAR RECURRENCE SEQUENCES
REPRESENTING POSITIVE INTEGERS AS A SUM OF LINEAR RECURRENCE SEQUENCES NATHAN HAMLIN AND WILLIAM A. WEBB Abstract. The Zeckendorf representation, using sums of Fibonacci numbers, is widely known. Fraenkel
More informationThe Fibonacci Quilt Sequence
The Sequence Minerva Catral, Pari Ford*, Pamela Harris, Steven J. Miller, Dawn Nelson AMS Section Meeting Georgetown University March 7, 2015 1 1 2 1 2 3 1 2 3 4 1 2 3 4 5 Fibonacci sequence Theorem (
More informationContinued Fraction Digit Averages and Maclaurin s Inequalities
Continued Fraction Digit Averages and Maclaurin s Inequalities Steven J. Miller, Williams College sjm1@williams.edu, Steven.Miller.MC.96@aya.yale.edu Joint with Francesco Cellarosi, Doug Hensley and Jake
More informationWhy Cookies And M&Ms Are Good For You (Mathematically)
Why Cookies And M&Ms Are Good For You (Mathematically) Steven J. Miller, Williams College Steven.J.Miller@williams.edu http://web.williams.edu/mathematics/sjmiller/public_html/ Stuyvesant High School,
More informationMath 324 Summer 2012 Elementary Number Theory Notes on Mathematical Induction
Math 4 Summer 01 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If
More informationMath 341: Probability Eighth Lecture (10/6/09)
Math 341: Probability Eighth Lecture (10/6/09) Steven J Miller Williams College Steven.J.Miller@williams.edu http://www.williams.edu/go/math/sjmiller/ public html/341/ Bronfman Science Center Williams
More informationAnalysis of Algorithms I: Asymptotic Notation, Induction, and MergeSort
Analysis of Algorithms I: Asymptotic Notation, Induction, and MergeSort Xi Chen Columbia University We continue with two more asymptotic notation: o( ) and ω( ). Let f (n) and g(n) are functions that map
More informationMATH 324 Summer 2011 Elementary Number Theory. Notes on Mathematical Induction. Recall the following axiom for the set of integers.
MATH 4 Summer 011 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If
More informationDIFFERENCES OF MULTIPLE FIBONACCI NUMBERS. Hannah Alpert Department of Mathematics, University of Chicago,Chicago, IL
#A57 INTEGERS 9 (2009), 745-749 DIFFERENCES OF MULTIPLE FIBONACCI NUMBERS Hannah Alpert Department of Mathematics, University of Chicago,Chicago, IL hcalpert@uchicago.edu Received: 9/11/09, Revised: 10/8/09,
More informationuniform distribution theory
uniform distribution theory DOI: 0.55/udt-207 0002 Unif. Distrib. Theory 2 (207), no., 27 36 INDIVIDUAL GAP MEASURES FROM GENERALIZED ZECKENDORF DECOMPOSITIONS Robert DorwardμPari L. FordμEva Fourakis
More informationA GENERALIZATION OF ZECKENDORF S THEOREM VIA CIRCUMSCRIBED m-gons
A GENERALIZATION OF ZECKENDORF S THEOREM VIA CIRCUMSCRIBED m-gons ROBERT DORWARD, PARI L. FORD, EVA FOURAKIS, PAMELA E. HARRIS, STEVEN J. MILLER, EYVI PALSSON, AND HANNAH PAUGH Abstract. Zeckendorf s theorem
More informationPartition of Integers into Distinct Summands with Upper Bounds. Partition of Integers into Even Summands. An Example
Partition of Integers into Even Summands We ask for the number of partitions of m Z + into positive even integers The desired number is the coefficient of x m in + x + x 4 + ) + x 4 + x 8 + ) + x 6 + x
More informationRecurrence Relations
Recurrence Relations Winter 2017 Recurrence Relations Recurrence Relations A recurrence relation for the sequence {a n } is an equation that expresses a n in terms of one or more of the previous terms
More informationLecture 9. d N(0, 1). Now we fix n and think of a SRW on [0,1]. We take the k th step at time k n. and our increments are ± 1
Random Walks and Brownian Motion Tel Aviv University Spring 011 Lecture date: May 0, 011 Lecture 9 Instructor: Ron Peled Scribe: Jonathan Hermon In today s lecture we present the Brownian motion (BM).
More informationEVERY POSITIVE K-BONACCI-LIKE SEQUENCE EVENTUALLY AGREES WITH A ROW OF THE K-ZECKENDORF ARRAY
EVERY POSITIVE K-BONACCI-LIKE SEQUENCE EVENTUALLY AGREES WITH A ROW OF THE K-ZECKENDORF ARRAY PETER G. ANDERSON AND CURTIS COOPER Abstract. For k 2, a fixed integer, we work with the k-bonacci sequence,
More informationFrom M&Ms to Mathematics, or, How I learned to answer questions and help my kids love math.
From M&Ms to Mathematics, or, How I learned to answer questions and help my kids love math. Cameron, Kayla and Steven J. Miller, Williams College sjm1@williams.edu, Steven.Miller.MC.96@aya.yale.edu http://web.williams.edu/mathematics/sjmiller/public_html
More information1 Examples of Weak Induction
More About Mathematical Induction Mathematical induction is designed for proving that a statement holds for all nonnegative integers (or integers beyond an initial one). Here are some extra examples of
More informationSOLUTION SETS OF RECURRENCE RELATIONS
SOLUTION SETS OF RECURRENCE RELATIONS SEBASTIAN BOZLEE UNIVERSITY OF COLORADO AT BOULDER The first section of these notes describes general solutions to linear, constant-coefficient, homogeneous recurrence
More information17 Advancement Operator Equations
November 14, 2017 17 Advancement Operator Equations William T. Trotter trotter@math.gatech.edu Review of Recurrence Equations (1) Problem Let r(n) denote the number of regions determined by n lines that
More informationEdge-disjoint induced subgraphs with given minimum degree
Edge-disjoint induced subgraphs with given minimum degree Raphael Yuster Department of Mathematics University of Haifa Haifa 31905, Israel raphy@math.haifa.ac.il Submitted: Nov 9, 01; Accepted: Feb 5,
More information18440: Probability and Random variables Quiz 1 Friday, October 17th, 2014
18440: Probability and Random variables Quiz 1 Friday, October 17th, 014 You will have 55 minutes to complete this test. Each of the problems is worth 5 % of your exam grade. No calculators, notes, or
More informationRandom Variable. Pr(X = a) = Pr(s)
Random Variable Definition A random variable X on a sample space Ω is a real-valued function on Ω; that is, X : Ω R. A discrete random variable is a random variable that takes on only a finite or countably
More informationApplications. More Counting Problems. Complexity of Algorithms
Recurrences Applications More Counting Problems Complexity of Algorithms Part I Recurrences and Binomial Coefficients Paths in a Triangle P(0, 0) P(1, 0) P(1,1) P(2, 0) P(2,1) P(2, 2) P(3, 0) P(3,1) P(3,
More informationq-counting hypercubes in Lucas cubes
Turkish Journal of Mathematics http:// journals. tubitak. gov. tr/ math/ Research Article Turk J Math (2018) 42: 190 203 c TÜBİTAK doi:10.3906/mat-1605-2 q-counting hypercubes in Lucas cubes Elif SAYGI
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 informationNamed numbres. Ngày 25 tháng 11 năm () Named numbres Ngày 25 tháng 11 năm / 7
Named numbres Ngày 25 tháng 11 năm 2011 () Named numbres Ngày 25 tháng 11 năm 2011 1 / 7 Fibonacci, Catalan, Stirling, Euler, Bernoulli Many sequences are famous. 1 1, 2, 3, 4,... the integers. () Named
More informationSome Thoughts on Benford s Law
Some Thoughts on Benford s Law Steven J. Miller ovember, 004 Abstract For many systems, there is a bias in the distribution of the first digits. For example, if one looks at the first digit of n in base
More informationAlgorithm Analysis Recurrence Relation. Chung-Ang University, Jaesung Lee
Algorithm Analysis Recurrence Relation Chung-Ang University, Jaesung Lee Recursion 2 Recursion 3 Recursion in Real-world Fibonacci sequence = + Initial conditions: = 0 and = 1. = + = + = + 0, 1, 1, 2,
More informationODD FIBBINARY NUMBERS AND THE GOLDEN RATIO
ODD FIBBINARY NUMBERS AND THE GOLDEN RATIO LINUS LINDROOS, ANDREW SILLS, AND HUA WANG Abstract. The fibbinary numbers are positive integers whose binary representation contains no consecutive ones. We
More informationMath/Stat 341 and Math 433 Probability and Mathematical Modeling II: Continuous Systems
Math/Stat 341 and Math 433 Probability and Mathematical Modeling II: Continuous Systems Steven J Miller Williams College sjm1@williams.edu http://www.williams.edu/mathematics/sjmiller/public_html/341 Lawrence
More informationA PROBABILISTIC APPROACH TO GENERALIZED ZECKENDORF DECOMPOSITIONS
SIAM J. DISCRETE MATH. Vol. 30, No. 2, pp. 302 332 c 206 Society for Industrial and Applied Mathematics A PROBABILISTIC APPROACH TO GENERALIZED ZECKENDORF DECOMPOSITIONS IDDO BEN-ARI AND STEVEN J. MILLER
More informationWeek 9-10: Recurrence Relations and Generating Functions
Week 9-10: Recurrence Relations and Generating Functions April 3, 2017 1 Some number sequences An infinite sequence (or just a sequence for short is an ordered array a 0, a 1, a 2,..., a n,... of countably
More informationOn Aperiodic Subtraction Games with Bounded Nim Sequence
On Aperiodic Subtraction Games with Bounded Nim Sequence Nathan Fox arxiv:1407.2823v1 [math.co] 10 Jul 2014 Abstract Subtraction games are a class of impartial combinatorial games whose positions correspond
More informationNumber Theory and Probability
Number Theory and Probability Nadine Amersi, Thealexa Becker, Olivia Beckwith, Alec Greaves-Tunnell, Geoffrey Iyer, Oleg Lazarev, Ryan Ronan, Karen Shen, Liyang Zhang Advisor Steven Miller (sjm1@williams.edu)
More information3 Integration and Expectation
3 Integration and Expectation 3.1 Construction of the Lebesgue Integral Let (, F, µ) be a measure space (not necessarily a probability space). Our objective will be to define the Lebesgue integral R fdµ
More informationarxiv: v1 [math.co] 17 Dec 2007
arxiv:07.79v [math.co] 7 Dec 007 The copies of any permutation pattern are asymptotically normal Milós Bóna Department of Mathematics University of Florida Gainesville FL 36-805 bona@math.ufl.edu Abstract
More informationGeneralized Lucas Sequences Part II
Introduction Generalized Lucas Sequences Part II Daryl DeFord Washington State University February 4, 2013 Introduction Èdouard Lucas: The theory of recurrent sequences is an inexhaustible mine which contains
More informationFibonacci Nim and a Full Characterization of Winning Moves
Fibonacci Nim and a Full Characterization of Winning Moves Cody Allen and Vadim Ponomarenko January 8, 2014 Abstract In this paper we will fully characterize all types of winning moves in the takeaway
More information4 Sums of Independent Random Variables
4 Sums of Independent Random Variables Standing Assumptions: Assume throughout this section that (,F,P) is a fixed probability space and that X 1, X 2, X 3,... are independent real-valued random variables
More informationGreat Expectations, or: Expect More, Work Less (2/3/10)
Great Expectations, or: Expect More, Work Less (2/3/10) Steven J Miller Williams College Steven.J.Miller@williams.edu http://www.williams.edu/go/math/sjmiller/ public html/wellesley/ Wellesley College,
More informationJumping Sequences. Steve Butler 1. (joint work with Ron Graham and Nan Zang) University of California Los Angelese
Jumping Sequences Steve Butler 1 (joint work with Ron Graham and Nan Zang) 1 Department of Mathematics University of California Los Angelese www.math.ucla.edu/~butler UCSD Combinatorics Seminar 14 October
More informationFibonacci numbers. Chapter The Fibonacci sequence. The Fibonacci numbers F n are defined recursively by
Chapter Fibonacci numbers The Fibonacci sequence The Fibonacci numbers F n are defined recursively by F n+ = F n + F n, F 0 = 0, F = The first few Fibonacci numbers are n 0 5 6 7 8 9 0 F n 0 5 8 55 89
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 informationFrom M&Ms to Mathematics, or, How I learned to answer questions and help my kids love math.
From M&Ms to Mathematics, or, How I learned to answer questions and help my kids love math. Steven J. Miller, Williams College sjm1@williams.edu, Steven.Miller.MC.96@aya.yale.edu (with Cameron and Kayla
More informationAn Application of First-Order Logic to a Problem in Combinatorics 1
An Application of First-Order Logic to a Problem in Combinatorics 1 I. The Combinatorial Background. A. Families of objects. In combinatorics, one frequently encounters a set of objects in which a), each
More informationLecture 5: January 30
CS71 Randomness & Computation Spring 018 Instructor: Alistair Sinclair Lecture 5: January 30 Disclaimer: These notes have not been subjected to the usual scrutiny accorded to formal publications. They
More informationNotes 1 : Measure-theoretic foundations I
Notes 1 : Measure-theoretic foundations I Math 733-734: Theory of Probability Lecturer: Sebastien Roch References: [Wil91, Section 1.0-1.8, 2.1-2.3, 3.1-3.11], [Fel68, Sections 7.2, 8.1, 9.6], [Dur10,
More informationWhen Sets Can and Cannot Have Sum-Dominant Subsets
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 21 (2018), Article 18.8.2 When Sets Can and Cannot Have Sum-Dominant Subsets Hùng Việt Chu Department of Mathematics Washington and Lee University Lexington,
More informationMa/CS 6b Class 15: The Probabilistic Method 2
Ma/CS 6b Class 15: The Probabilistic Method 2 By Adam Sheffer Reminder: Random Variables A random variable is a function from the set of possible events to R. Example. Say that we flip five coins. We can
More informationCDM. Recurrences and Fibonacci
CDM Recurrences and Fibonacci Klaus Sutner Carnegie Mellon University 20-fibonacci 2017/12/15 23:16 1 Recurrence Equations Second Order The Fibonacci Monoid Recurrence Equations 3 We can define a sequence
More informationCDM. Recurrences and Fibonacci. 20-fibonacci 2017/12/15 23:16. Terminology 4. Recurrence Equations 3. Solution and Asymptotics 6.
CDM Recurrences and Fibonacci 1 Recurrence Equations Klaus Sutner Carnegie Mellon University Second Order 20-fibonacci 2017/12/15 23:16 The Fibonacci Monoid Recurrence Equations 3 Terminology 4 We can
More informationThe cogrowth series for BS(N,N) is D-finite
The cogrowth series for BS(N,N) is D-finite Murray Elder, (U Newcastle, Australia) Andrew Rechnitzer, (UBC, Canada) Buks van Rensburg, (York U, Canada) Tom Wong, (UBC, Canada) AustMS 2013, Group Actions
More informationExponential Metrics. Lecture by Sarah Cannon and Emma Cohen. November 18th, 2014
Exponential Metrics Lecture by Sarah Cannon and Emma Cohen November 18th, 2014 1 Background The coupling theorem we proved in class: Theorem 1.1. Let φ t be a random variable [distance metric] satisfying:
More informationOscillation Criteria for Delay Neutral Difference Equations with Positive and Negative Coefficients. Contents
Bol. Soc. Paran. Mat. (3s.) v. 21 1/2 (2003): 1 12. c SPM Oscillation Criteria for Delay Neutral Difference Equations with Positive and Negative Coefficients Chuan-Jun Tian and Sui Sun Cheng abstract:
More informationJournal of Inequalities in Pure and Applied Mathematics
Journal of Inequalities in Pure and Applied Mathematics ASYMPTOTIC EXPANSION OF THE EQUIPOISE CURVE OF A POLYNOMIAL INEQUALITY ROGER B. EGGLETON AND WILLIAM P. GALVIN Department of Mathematics Illinois
More informationSampling Contingency Tables
Sampling Contingency Tables Martin Dyer Ravi Kannan John Mount February 3, 995 Introduction Given positive integers and, let be the set of arrays with nonnegative integer entries and row sums respectively
More informationA NICE DIOPHANTINE EQUATION. 1. Introduction
A NICE DIOPHANTINE EQUATION MARIA CHIARA BRAMBILLA Introduction One of the most interesting and fascinating subjects in Number Theory is the study of diophantine equations A diophantine equation is a polynomial
More informationBenford Behavior of Generalized Zeckendorf Decompositions
Benford Behavior of Generalized Zeckendorf Decompositions Andrew Best, Patrick Dynes, Xixi Edelsbrunner, Brian McDonald, Steven J. Miller, Kimsy Tor, Caroline Turnage-Butterbaugh and Madeleine Weinstein
More informationIn other words, we are interested in what is happening to the y values as we get really large x values and as we get really small x values.
Polynomial functions: End behavior Solutions NAME: In this lab, we are looking at the end behavior of polynomial graphs, i.e. what is happening to the y values at the (left and right) ends of the graph.
More informationIntroduction to Probability
Introduction to Probability Math 353, Section 1 Fall 212 Homework 9 Solutions 1. During a season, a basketball team plays 7 home games and 6 away games. The coach estimates at the beginning of the season
More informationFebruary 2017 February 18, 2017
February 017 February 18, 017 Combinatorics 1. Kelvin the Frog is going to roll three fair ten-sided dice with faces labelled 0, 1,,..., 9. First he rolls two dice, and finds the sum of the two rolls.
More informationSolutions to Exercises 4
Discrete Mathematics Lent 29 MA2 Solutions to Eercises 4 () Define sequence (b n ) n by b n ( n n..., where we use n ) for > n. Verify that b, b 2 2, and that, for every n 3, we have b n b n b n 2. Solution.
More informationNotes on Discrete Probability
Columbia University Handout 3 W4231: Analysis of Algorithms September 21, 1999 Professor Luca Trevisan Notes on Discrete Probability The following notes cover, mostly without proofs, the basic notions
More informationMath 180B Homework 4 Solutions
Math 80B Homework 4 Solutions Note: We will make repeated use of the following result. Lemma. Let (X n ) be a time-homogeneous Markov chain with countable state space S, let A S, and let T = inf { n 0
More informationA matrix over a field F is a rectangular array of elements from F. The symbol
Chapter MATRICES Matrix arithmetic A matrix over a field F is a rectangular array of elements from F The symbol M m n (F ) denotes the collection of all m n matrices over F Matrices will usually be denoted
More informationIntroduction to Empirical Processes and Semiparametric Inference Lecture 09: Stochastic Convergence, Continued
Introduction to Empirical Processes and Semiparametric Inference Lecture 09: Stochastic Convergence, Continued Michael R. Kosorok, Ph.D. Professor and Chair of Biostatistics Professor of Statistics and
More informationCMSC Discrete Mathematics SOLUTIONS TO FIRST MIDTERM EXAM October 18, 2005 posted Nov 2, 2005
CMSC-37110 Discrete Mathematics SOLUTIONS TO FIRST MIDTERM EXAM October 18, 2005 posted Nov 2, 2005 Instructor: László Babai Ryerson 164 e-mail: laci@cs This exam contributes 20% to your course grade.
More informationData Structures and Algorithms Running time and growth functions January 18, 2018
Data Structures and Algorithms Running time and growth functions January 18, 2018 Measuring Running Time of Algorithms One way to measure the running time of an algorithm is to implement it and then study
More informationFIFTH ROOTS OF FIBONACCI FRACTIONS. Christopher P. French Grinnell College, Grinnell, IA (Submitted June 2004-Final Revision September 2004)
Christopher P. French Grinnell College, Grinnell, IA 0112 (Submitted June 2004-Final Revision September 2004) ABSTRACT We prove that when n is odd, the continued fraction expansion of Fn+ begins with a
More informationEXPLICIT CONSTRUCTIONS OF LARGE FAMILIES OF GENERALIZED MORE SUMS THAN DIFFERENCES SETS
EXPLICIT CONSTRUCTIONS OF LARGE FAMILIES OF GENERALIZED MORE SUMS THAN DIFFERENCES SETS STEVEN J. MILLER, LUC ROBINSON AND SEAN PEGADO ABSTRACT. A More Sums Than Differences (MSTD) set is a set of integers
More informationLecture Notes 2 Random Variables. Discrete Random Variables: Probability mass function (pmf)
Lecture Notes 2 Random Variables Definition Discrete Random Variables: Probability mass function (pmf) Continuous Random Variables: Probability density function (pdf) Mean and Variance Cumulative Distribution
More informationWelsh s problem on the number of bases of matroids
Welsh s problem on the number of bases of matroids Edward S. T. Fan 1 and Tony W. H. Wong 2 1 Department of Mathematics, California Institute of Technology 2 Department of Mathematics, Kutztown University
More informationSome new representation problems involving primes
A talk given at Hong Kong Univ. (May 3, 2013) and 2013 ECNU q-series Workshop (Shanghai, July 30) Some new representation problems involving primes Zhi-Wei Sun Nanjing University Nanjing 210093, P. R.
More informationMath 210 Exam 2 - Practice Problems. 1. For each of the following, determine whether the statement is True or False.
Math 20 Exam 2 - Practice Problems. For each of the following, determine whether the statement is True or False. (a) {a,b,c,d} TRE (b) {a,b,c,d} FLSE (c) {a,b, } TRE (d) {a,b, } TRE (e) {a,b} {a,b} FLSE
More informationEnumerating Distinct Chessboard Tilings and Generalized Lucas Sequences Part I
Enumerating Distinct Chessboard Tilings and Generalized Lucas Sequences Part I Daryl DeFord Washington State University January 28, 2013 Roadmap 1 Problem 2 Symmetry 3 LHCCRR as Vector Spaces 4 Generalized
More informationAN INVESTIGATION OF THE CHUNG-FELLER THEOREM AND SIMILAR COMBINATORIAL IDENTITIES
AN INVESTIGATION OF THE CHUNG-FELLER THEOREM AND SIMILAR COMBINATORIAL IDENTITIES ELI A. WOLFHAGEN Abstract. In this paper, we shall prove the Chung-Feller Theorem in multiple ways as well as extend its
More informationDerangements with an additional restriction (and zigzags)
Derangements with an additional restriction (and zigzags) István Mező Nanjing University of Information Science and Technology 2017. 05. 27. This talk is about a class of generalized derangement numbers,
More informationSums and Products. a i = a 1. i=1. a i = a i a n. n 1
Sums and Products -27-209 In this section, I ll review the notation for sums and products Addition and multiplication are binary operations: They operate on two numbers at a time If you want to add or
More informationFrom M&Ms to Mathematics, or, How I learned to answer questions and help my kids love math.
From M&Ms to Mathematics, or, How I learned to answer questions and help my kids love math. Steven J. Miller, Williams College Steven.J.Miller@williams.edu http://web.williams.edu/mathematics/sjmiller/public_html/
More informationAsymptotic Analysis. Slides by Carl Kingsford. Jan. 27, AD Chapter 2
Asymptotic Analysis Slides by Carl Kingsford Jan. 27, 2014 AD Chapter 2 Independent Set Definition (Independent Set). Given a graph G = (V, E) an independent set is a set S V if no two nodes in S are joined
More informationCHAPTER 3. Sequences. 1. Basic Properties
CHAPTER 3 Sequences We begin our study of analysis with sequences. There are several reasons for starting here. First, sequences are the simplest way to introduce limits, the central idea of calculus.
More informationShih-sen Chang, Yeol Je Cho, and Haiyun Zhou
J. Korean Math. Soc. 38 (2001), No. 6, pp. 1245 1260 DEMI-CLOSED PRINCIPLE AND WEAK CONVERGENCE PROBLEMS FOR ASYMPTOTICALLY NONEXPANSIVE MAPPINGS Shih-sen Chang, Yeol Je Cho, and Haiyun Zhou Abstract.
More informationAn Entropy Bound for Random Number Generation
244 An Entropy Bound for Random Number Generation Sung-il Pae, Hongik University, Seoul, Korea Summary Many computer applications use random numbers as an important computational resource, and they often
More informationRecursion: Introduction and Correctness
Recursion: Introduction and Correctness CSE21 Winter 2017, Day 7 (B00), Day 4-5 (A00) January 25, 2017 http://vlsicad.ucsd.edu/courses/cse21-w17 Today s Plan From last time: intersecting sorted lists and
More informationInduced subgraphs with many repeated degrees
Induced subgraphs with many repeated degrees Yair Caro Raphael Yuster arxiv:1811.071v1 [math.co] 17 Nov 018 Abstract Erdős, Fajtlowicz and Staton asked for the least integer f(k such that every graph with
More information