beatty sequences and integers in golden mean base
play

Beatty sequences and integers in golden mean base Michel Dekking - PowerPoint PPT Presentation

Feb 28, 2024 •47 likes •647 views

Beatty sequences and integers in golden mean base Michel Dekking CIRM November 6, 2019 11:40-12:20 CIRM November 5, 2019 17:50-18:30 Integers in golden mean base := (1 + 5) / 2 Base phi representations / beta-expansions of the natural

  1. Beatty sequences and integers in golden mean base Michel Dekking CIRM November 6, 2019 11:40-12:20 CIRM November 5, 2019 17:50-18:30

  2. Integers in golden mean base √ ϕ := (1 + 5) / 2 Base phi representations / beta-expansions of the natural numbers (beta = ϕ ) George Bergman in 1957.

  3. Integers in golden mean base √ ϕ := (1 + 5) / 2 Base phi representations / beta-expansions of the natural numbers (beta = ϕ ) George Bergman in 1957. A natural number N is written in base phi if N has the form ∞ � d i ϕ i , N = i = −∞ with digits d i = 0 or 1, and where d i d i +1 = 11 is not allowed. We write these representations as β ( N ) = d L d L − 1 . . . d 1 d 0 · d − 1 d − 2 . . . d R +1 d R .

  4. Integers in golden mean base √ ϕ := (1 + 5) / 2 Base phi representations / beta-expansions of the natural numbers (beta = ϕ ) George Bergman in 1957. A natural number N is written in base phi if N has the form ∞ � d i ϕ i , N = i = −∞ with digits d i = 0 or 1, and where d i d i +1 = 11 is not allowed. We write these representations as β ( N ) = d L d L − 1 . . . d 1 d 0 · d − 1 d − 2 . . . d R +1 d R . “Significant digits”: d L = d R = 1

  5. Integers in golden mean base, examples The base phi representation of a number N is unique (Bergman).

  6. Integers in golden mean base, examples The base phi representation of a number N is unique (Bergman). Examples.

  7. Integers in golden mean base, examples The base phi representation of a number N is unique (Bergman). ϕ 2 = 1 + ϕ Examples. 1 = 1.

  8. Integers in golden mean base, examples The base phi representation of a number N is unique (Bergman). ϕ 2 = 1 + ϕ Examples. 1 = 1. 2 = 10.01

  9. Integers in golden mean base, examples The base phi representation of a number N is unique (Bergman). ϕ 2 = 1 + ϕ Examples. 1 = 1. 2 = 10.01 ϕ + ϕ − 2 = 2 ⇔ ϕ + 1 / (1 + ϕ ) = 2

  10. Integers in golden mean base, examples The base phi representation of a number N is unique (Bergman). ϕ 2 = 1 + ϕ Examples. 1 = 1. 2 = 10.01 ϕ + ϕ − 2 = 2 ⇔ ϕ + 1 / (1 + ϕ ) = 2 ⇔ (1+ ϕ ) ϕ +1 = 2+2 ϕ ⇔ ϕ + 1+ ϕ = 1+2 ϕ.

  11. Integers in golden mean base, examples The base phi representation of a number N is unique (Bergman). ϕ 2 = 1 + ϕ Examples. 1 = 1. 2 = 10.01 ϕ + ϕ − 2 = 2 ⇔ ϕ + 1 / (1 + ϕ ) = 2 ⇔ (1+ ϕ ) ϕ +1 = 2+2 ϕ ⇔ ϕ + 1+ ϕ = 1+2 ϕ. 3 = 2+1 =

  12. Integers in golden mean base, examples The base phi representation of a number N is unique (Bergman). ϕ 2 = 1 + ϕ Examples. 1 = 1. 2 = 10.01 ϕ + ϕ − 2 = 2 ⇔ ϕ + 1 / (1 + ϕ ) = 2 ⇔ (1+ ϕ ) ϕ +1 = 2+2 ϕ ⇔ ϕ + 1+ ϕ = 1+2 ϕ. 3 = 2+1 = 10.01 + 1.0 =

  13. Integers in golden mean base, examples The base phi representation of a number N is unique (Bergman). ϕ 2 = 1 + ϕ Examples. 1 = 1. 2 = 10.01 ϕ + ϕ − 2 = 2 ⇔ ϕ + 1 / (1 + ϕ ) = 2 ⇔ (1+ ϕ ) ϕ +1 = 2+2 ϕ ⇔ ϕ + 1+ ϕ = 1+2 ϕ. 3 = 2+1 = 10.01 + 1.0 = 11.01 =

  14. Integers in golden mean base, examples The base phi representation of a number N is unique (Bergman). ϕ 2 = 1 + ϕ Examples. 1 = 1. 2 = 10.01 ϕ + ϕ − 2 = 2 ⇔ ϕ + 1 / (1 + ϕ ) = 2 ⇔ (1+ ϕ ) ϕ +1 = 2+2 ϕ ⇔ ϕ + 1+ ϕ = 1+2 ϕ. 3 = 2+1 = 10.01 + 1.0 = 11.01 = 100.01

  15. Integers in golden mean base, examples The base phi representation of a number N is unique (Bergman). ϕ 2 = 1 + ϕ Examples. 1 = 1. 2 = 10.01 ϕ + ϕ − 2 = 2 ⇔ ϕ + 1 / (1 + ϕ ) = 2 ⇔ (1+ ϕ ) ϕ +1 = 2+2 ϕ ⇔ ϕ + 1+ ϕ = 1+2 ϕ. 3 = 2+1 = 10.01 + 1.0 = 11.01 = 100.01 4 = 3+1 = 100.01 + 1.0 = 101.01

  16. Integers in golden mean base, examples The base phi representation of a number N is unique (Bergman). ϕ 2 = 1 + ϕ Examples. 1 = 1. 2 = 10.01 ϕ + ϕ − 2 = 2 ⇔ ϕ + 1 / (1 + ϕ ) = 2 ⇔ (1+ ϕ ) ϕ +1 = 2+2 ϕ ⇔ ϕ + 1+ ϕ = 1+2 ϕ. 3 = 2+1 = 10.01 + 1.0 = 11.01 = 100.01 4 = 3+1 = 100.01 + 1.0 = 101.01 5 = 4+1 = 101.01 + 1.0 =

  17. Integers in golden mean base, examples The base phi representation of a number N is unique (Bergman). ϕ 2 = 1 + ϕ Examples. 1 = 1. 2 = 10.01 ϕ + ϕ − 2 = 2 ⇔ ϕ + 1 / (1 + ϕ ) = 2 ⇔ (1+ ϕ ) ϕ +1 = 2+2 ϕ ⇔ ϕ + 1+ ϕ = 1+2 ϕ. 3 = 2+1 = 10.01 + 1.0 = 11.01 = 100.01 4 = 3+1 = 100.01 + 1.0 = 101.01 5 = 4+1 = 101.01 + 1.0 = 102.01 =

  18. Integers in golden mean base, examples The base phi representation of a number N is unique (Bergman). ϕ 2 = 1 + ϕ Examples. 1 = 1. 2 = 10.01 ϕ + ϕ − 2 = 2 ⇔ ϕ + 1 / (1 + ϕ ) = 2 ⇔ (1+ ϕ ) ϕ +1 = 2+2 ϕ ⇔ ϕ + 1+ ϕ = 1+2 ϕ. 3 = 2+1 = 10.01 + 1.0 = 11.01 = 100.01 4 = 3+1 = 100.01 + 1.0 = 101.01 5 = 4+1 = 101.01 + 1.0 = 102.01 = 110.02 =

  19. Integers in golden mean base, examples The base phi representation of a number N is unique (Bergman). ϕ 2 = 1 + ϕ Examples. 1 = 1. 2 = 10.01 ϕ + ϕ − 2 = 2 ⇔ ϕ + 1 / (1 + ϕ ) = 2 ⇔ (1+ ϕ ) ϕ +1 = 2+2 ϕ ⇔ ϕ + 1+ ϕ = 1+2 ϕ. 3 = 2+1 = 10.01 + 1.0 = 11.01 = 100.01 4 = 3+1 = 100.01 + 1.0 = 101.01 5 = 4+1 = 101.01 + 1.0 = 102.01 = 110.02 = 1000.1001

  20. Integers in golden mean base, a list N β ( N ) N N in base 2 1 1 1 1 2 10 · 01 2 10 3 100 · 01 3 11 4 101 · 01 4 100 5 1000 · 1001 5 101 6 110 6 1010 · 0001 7 10000 · 0001 7 111 8 1000 8 10001 · 0001 9 10010 · 0101 9 1001 10 10100 · 0101 10 1010 11 10101 · 0101 11 1011 12 100000 · 101001 12 1100 13 100010 · 001001 13 1101 14 100100 · 001001 14 1110 15 1111 15 100101 · 001001

  21. Distribution of k th digit d k = d k ( N ) ? Distribution of d k = d k ( N ) over the natural numbers N ∈ N , where k is an integer.

  22. Distribution of k th digit d k = d k ( N ) ? Distribution of d k = d k ( N ) over the natural numbers N ∈ N , where k is an integer. Distribution in the frequency sense: The case k = 0 conjectured by Bergman, and proved in 1999 by E. Hart and L. Sanchis, On the occurrence of F n in the Zeckendorf decomposition of nF n : THEOREM The frequency of 1’s in ( d 0 ( N )) exists, and √ N 1 ϕ + 2 = 5 − 1 5 � lim d 0 ( M ) = . N 10 N →∞ M =1

  23. Distribution of digit d 0 = d 0 ( N ) and d 1 = d 1 ( N ) Stronger property for d 0 (Baruchel 2018): CONJECTURE 1 Digit d 0 ( N ) = 1 if and only if N = ⌊ n ϕ ⌋ + 2 n + 1 for some natural number n , or N = 1.

  24. Distribution of digit d 0 = d 0 ( N ) and d 1 = d 1 ( N ) Stronger property for d 0 (Baruchel 2018): CONJECTURE 1 Digit d 0 ( N ) = 1 if and only if N = ⌊ n ϕ ⌋ + 2 n + 1 for some natural number n , or N = 1. ( ⌊ n ϕ ⌋ ) = 1 , 3 , 4 , 6 , 8 , 9 , 11 , 12 , 14 , 16 , 17 , 19 , 21 , 22 , 24 , 25 , 27 , ... is the well known lower Wythoff sequence.

  25. Distribution of digit d 0 = d 0 ( N ) and d 1 = d 1 ( N ) Stronger property for d 0 (Baruchel 2018): CONJECTURE 1 Digit d 0 ( N ) = 1 if and only if N = ⌊ n ϕ ⌋ + 2 n + 1 for some natural number n , or N = 1. ( ⌊ n ϕ ⌋ ) = 1 , 3 , 4 , 6 , 8 , 9 , 11 , 12 , 14 , 16 , 17 , 19 , 21 , 22 , 24 , 25 , 27 , ... is the well known lower Wythoff sequence. Corresponding property for digit d 1 (Kimberling 2012): CONJECTURE 2 Digit d 1 ( N ) = 1 if and only if N = ⌊ n ϕ ⌋ + 2 n − 1 for some natural number n .

  26. Generalized Beatty sequences In the conjectures occur sequences V of the type V ( n ) = p ⌊ n α ⌋ + q n + r , n ≥ 1, where α is a real number, and p , q , and r are integers.

  27. Generalized Beatty sequences In the conjectures occur sequences V of the type V ( n ) = p ⌊ n α ⌋ + q n + r , n ≥ 1, where α is a real number, and p , q , and r are integers. If S is a sequence then ∆ S ( n ) = S ( n + 1) − S ( n ) , for n = 1 , 2 . . . .

  28. Generalized Beatty sequences In the conjectures occur sequences V of the type V ( n ) = p ⌊ n α ⌋ + q n + r , n ≥ 1, where α is a real number, and p , q , and r are integers. If S is a sequence then ∆ S ( n ) = S ( n + 1) − S ( n ) , for n = 1 , 2 . . . . The sequence ∆( ⌊ n ϕ ⌋ ) is equal to the Fibonacci word x 2 , 1 = 21221212 . . . on the alphabet { 2 , 1 } .

  29. Generalized Beatty sequences In the conjectures occur sequences V of the type V ( n ) = p ⌊ n α ⌋ + q n + r , n ≥ 1, where α is a real number, and p , q , and r are integers. If S is a sequence then ∆ S ( n ) = S ( n + 1) − S ( n ) , for n = 1 , 2 . . . . The sequence ∆( ⌊ n ϕ ⌋ ) is equal to the Fibonacci word x 2 , 1 = 21221212 . . . on the alphabet { 2 , 1 } . LEMMA (JPA & FMD, 2019) Let V ( n ) = p ⌊ n ϕ ⌋ + qn + r be a golden mean GBS. Then ∆ V = x 2 p + q , p + q . Conversely, if x a , b is the Fibonacci word on the alphabet { a , b } , then any V with ∆ V = x a , b is a GBS V = (( a − b ) ⌊ n ϕ ⌋ ) + (2 b − a ) n + r ) for some integer r .

  30. Morphisms Morphism: is a map from the set of infinite words over an alphabet to itself, respecting the concatenation operation. Example: Fibonacci morphism σ on { 0 , 1 } σ (0) = 01 , σ (1) = 0 .

  31. Morphisms Morphism: is a map from the set of infinite words over an alphabet to itself, respecting the concatenation operation. Example: Fibonacci morphism σ on { 0 , 1 } σ (0) = 01 , σ (1) = 0 . A central role in this talk: γ on the alphabet { A , B , C , D } γ ( A ) = AB , γ ( B ) = C , γ ( C ) = D , γ ( D ) = ABC .

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Data (Some repeating CS1083, ECE course) bits and bit sequences integers (signed and

Data (Some repeating CS1083, ECE course) bits and bit sequences integers (signed and

Data (Some repeating CS1083, ECE course) bits and bit sequences integers (signed and unsigned) bit vectors strings and characters floating point numbers hexadecimal and octal notations Bits and Bit Sequences

885 views • 64 slides
Data (Some repeating CS1083, ECE course) bits and bit sequences integers (signed and

Data (Some repeating CS1083, ECE course) bits and bit sequences integers (signed and

Data (Some repeating CS1083, ECE course) bits and bit sequences integers (signed and unsigned) bit vectors strings and characters floating point numbers hexadecimal and octal notations Bits and Bit Sequences

887 views • 65 slides
Balfour Beatty Competing in a Lean Environment AGENDA ABOUT BALFOUR BEATTY DEFINING LEAN IN

Balfour Beatty Competing in a Lean Environment AGENDA ABOUT BALFOUR BEATTY DEFINING LEAN IN

Balfour Beatty Competing in a Lean Environment AGENDA ABOUT BALFOUR BEATTY DEFINING LEAN IN CONSTRUCTION A LEAN COMPETITIVE ADVANTAGE LEAN IMPLEMENTATION LEAN BEHAVIOR Meet Balfour Beatty Our Locations A recognized leader in the U.S.

1.14k views • 21 slides
CS 220: Discrete Structures and their Applications sequences, recurrence relations, summations

CS 220: Discrete Structures and their Applications sequences, recurrence relations, summations

CS 220: Discrete Structures and their Applications sequences, recurrence relations, summations zybooks sections 6.1-6.3 sequences A sequence is a special type of function in which the domain is a consecutive set of integers. Example:

835 views • 12 slides
A base composition analysis of natural patterns for the preprocessing of metagenome sequences

A base composition analysis of natural patterns for the preprocessing of metagenome sequences

Introduction Contribution Materials and Methods Results Conclusions A base composition analysis of natural patterns for the preprocessing of metagenome sequences Oliver Bonham-Carter, Dhundy Bastola, Hesham Ali College of Information Science

374 views • 33 slides
Balfour Beatty Half Year Results Presentation 17th August 2016 1 Balfour Beatty Leo Quinn,

Balfour Beatty Half Year Results Presentation 17th August 2016 1 Balfour Beatty Leo Quinn,

Balfour Beatty Half Year Results Presentation 17th August 2016 1 Balfour Beatty Leo Quinn, Chief Executive Officer Phil Harrison, Finance Director QUESTIONS FROM Joe Brent, Liberum Gregor Kuglitsch, UBS Stephen Rawlinson, Whitman Howard

467 views • 24 slides
An Introduction to Balfour Beatty Campus Solutions Presentation to Napa Valley College 1 About

An Introduction to Balfour Beatty Campus Solutions Presentation to Napa Valley College 1 About

An Introduction to Balfour Beatty Campus Solutions Presentation to Napa Valley College 1 About Balfour Beatty We found the right Applies Public-Private partner in Balfour Higher Education Partnership (P3) Beatty. From quality of

455 views • 10 slides
Balfour Beatty Half-year Results Presentation 16th August 2017 1 Balfour Beatty Leo Quinn,

Balfour Beatty Half-year Results Presentation 16th August 2017 1 Balfour Beatty Leo Quinn,

Balfour Beatty Half-year Results Presentation 16th August 2017 1 Balfour Beatty Leo Quinn, Group Chief Executive Phil Harrison, Chief Financial Officer Questions From Gregor Kuglitsch, UBS Howard Seymour, Numis Joe Brent, Liberum Andrew

645 views • 22 slides
CS 4803 If a, N are integers with N > 0 then there are unique integers r , q such that a = Nq

CS 4803 If a, N are integers with N > 0 then there are unique integers r , q such that a = Nq

Let Z = {. . . , 2, 1, 0, 1, 2, . . .} denote the set of integers. Let Z+ = {1, 2, . . .} denote the set of positive integers and N = {0, 1, 2, . . .} the set of non-negative integers. CS 4803 If a, N are integers with N > 0 then there

166 views • 4 slides
Reimagine Redevelopment South Beatty & Mignonette Streets Opportunity From om P Par

Reimagine Redevelopment South Beatty & Mignonette Streets Opportunity From om P Par

Reimagine Redevelopment South Beatty & Mignonette Streets Opportunity From om P Par arking t to o Plac acem emak aking The Beatty Apartment Block turns vacant lots into a place for Families to make their home Neighbors to make

638 views • 24 slides
3.2 SEQUENCES AND SUMMATIONS def: A sequence in a set A is a function f from a subset of the

3.2 SEQUENCES AND SUMMATIONS def: A sequence in a set A is a function f from a subset of the

3.2.1 Section 3.2 Sequences and Summations 3.2 SEQUENCES AND SUMMATIONS def: A sequence in a set A is a function f from a subset of the integers (usually { 0 , 1 , 2 , . . . } or { 1 , 2 , 3 , . . . } ) to A . The values of a sequence are

326 views • 11 slides
20-03-06 7. Learning Sequences/Behaviors How to use sequences/behaviors? Sequences and more

20-03-06 7. Learning Sequences/Behaviors How to use sequences/behaviors? Sequences and more

20-03-06 7. Learning Sequences/Behaviors How to use sequences/behaviors? Sequences and more generally behaviors are about Sequences are used integrating the concept of time into what is learned. In } to analyze time dependent data general,

298 views • 6 slides
Sequences Sequences are ordered lists of elements, e.g. 2, 3, 5, 7, 11, 13, 17, 19, . . . or a , b

Sequences Sequences are ordered lists of elements, e.g. 2, 3, 5, 7, 11, 13, 17, 19, . . . or a , b

Sequences, sums, cardinality 1 Myrto Arapinis School of Informatics University of Edinburgh October 1, 2014 1 Slides mainly borrowed from Richard Mayr 1 / 21 Sequences Sequences are ordered lists of elements, e.g. 2, 3, 5, 7, 11, 13, 17, 19, .

570 views • 39 slides
A Golden Investment Opportunity 1 Golden Eagle Mining An Overview Golden Eagle

A Golden Investment Opportunity 1 Golden Eagle Mining An Overview Golden Eagle

Main document title here 08 March 2011 A Golden Investment Opportunity 1 Golden Eagle Mining An Overview Golden Eagle Mining (GEM) is a mineral exploration and development company with a primary focus on gold, in proven

573 views • 15 slides
MAT 132 8.1 Sequences n th term Examples In a sequence order {1,1,1,1,..} matters and elements

MAT 132 8.1 Sequences n th term Examples In a sequence order {1,1,1,1,..} matters and elements

An (infinite) sequence is a an infinite list of numbers written in order. An (infinite) sequence is thus a function, where the domain is the set of positive integers and the range is the real numbers. MAT 132 8.1 Sequences n th term Examples

274 views • 6 slides
Positional notation of unsigned integers The base - b positional representation of an integer

Positional notation of unsigned integers The base - b positional representation of an integer

Computer Architecture applied computer science 02.02 Binary arithmetic urbino worldwide campus 02 Information theory 02.02 Binary arithmetic Positional notation Unsigned integers Unsigned fixed-point Signed numbers

123 views • 9 slides
Sequence Based 100,071 genomes 96,985 pass quality checks (96.9%)

Sequence Based 100,071 genomes 96,985 pass quality checks (96.9%)

TOPMed Sequencing as of December 2017* http://nhlbi.sph.umich.edu/ Sequence Based 100,071 genomes 96,985 pass quality checks (96.9%) 1,689 flagged for low coverage

671 views • 16 slides
Model-theoretic approach to multi-dimensional de Finetti theory Artem Chernikov UCLA 2015 RIMS

Model-theoretic approach to multi-dimensional de Finetti theory Artem Chernikov UCLA 2015 RIMS

Model-theoretic approach to multi-dimensional de Finetti theory Artem Chernikov UCLA 2015 RIMS Model Theory Workshop Model theoretic aspects of the notion of independence and dimension Kyoto, Dec 14, 2015 Joint work with Ita Ben

478 views • 24 slides
PSC LSD & LAW 2019 February 7, 2019 Outline 1. Motivation 2. Basic Concepts 3. BADPM

PSC LSD & LAW 2019 February 7, 2019 Outline 1. Motivation 2. Basic Concepts 3. BADPM

On-line Searching in IUPAC Nucleotide Sequences Jan Holub (joint work with Petr Prochzka) The Prague Stringology Club Faculty of Information Technology Czech Technical University in Prague PSC LSD & LAW 2019 February 7, 2019 Outline

630 views • 27 slides
Next Generation Sequencing Technologies What is first generation? Sanger Sequencing DNA

Next Generation Sequencing Technologies What is first generation? Sanger Sequencing DNA

Next Generation Sequencing Technologies What is first generation? Sanger Sequencing DNA Polymerase Base-adding reaction +H +

640 views • 32 slides
Delta: a Toolset for the Structural Analysis of Biological Sequences on a 3D Triangular Lattice

Delta: a Toolset for the Structural Analysis of Biological Sequences on a 3D Triangular Lattice

Motivation The Delta Toolset Applications Summary Delta: a Toolset for the Structural Analysis of Biological Sequences on a 3D Triangular Lattice Minghui Jiang Martin Mayne Joel Gillespie Department of Computer Science, Utah State

763 views • 45 slides
Sequence Labeling Prof. Sameer Singh CS 295: STATISTICAL NLP WINTER 2017 January 31, 2017

Sequence Labeling Prof. Sameer Singh CS 295: STATISTICAL NLP WINTER 2017 January 31, 2017

Sequence Labeling Prof. Sameer Singh CS 295: STATISTICAL NLP WINTER 2017 January 31, 2017 Based on slides from Nathan Schneider, Noah Smith, Yejin Choi, and everyone else they copied from. Outline Sequence Labelling and POS Tagging

439 views • 31 slides
SEQUENCE QUERY PROCESSING Praveen Seshadri, Miron Livny, Raghu Ramakrishnan (CS Department,

SEQUENCE QUERY PROCESSING Praveen Seshadri, Miron Livny, Raghu Ramakrishnan (CS Department,

SEQUENCE QUERY PROCESSING Praveen Seshadri, Miron Livny, Raghu Ramakrishnan (CS Department, University of Wisconsin-Madison, WI) Sedat Behar and Yevgeny Ioffe REFERENCES Praveen Sheshadri, Management of Sequence Data (PhD Thesis)

1.14k views • 22 slides
Mathematical Induction Jason Filippou CMSC250 @ UMCP 06-27-2016 Jason Filippou (CMSC250 @ UMCP)

Mathematical Induction Jason Filippou CMSC250 @ UMCP 06-27-2016 Jason Filippou (CMSC250 @ UMCP)

Mathematical Induction Jason Filippou CMSC250 @ UMCP 06-27-2016 Jason Filippou (CMSC250 @ UMCP) Induction 06-27-2016 1 / 48 Outline 1 Sequences and series Sequences Series and partial sums 2 Weak Induction Intro to Induction Practice 3

1.17k views • 81 slides

More recommend