Asymmetric Rhythms and Tiling Canons Dr. Rachel Hall Saint Joseph’s University Vassar College May 8, 2007.

Slides:



Advertisements
Similar presentations
Math 3121 Abstract Algebra I Lecture 8 Sections 9 and 10.
Advertisements

Mathematics of Cryptography Part II: Algebraic Structures
Section 4.1: The Basics of Counting As we have seen, one way to count the number of objects in a finite set S is to produce a one-to-one correspondence.
Section 11 Direct Products and Finitely Generated Abelian Groups One purpose of this section is to show a way to use known groups as building blocks to.
slides also by John Chase
Asymmetric Rhythms and Tiling Canons
GROUP MEMBERS-  ZION- PROJECT LEADER  TYRESE-CHIEF RESEARCHER  MUSKAN-COMMUNICATIONS DIRECTOR  GHAZAL-DIGITAL ENGINEER.
Week 5 - Friday.  What did we talk about last time?  Sequences  Summation and production notation  Proof by induction.
1 Chapter 7– Introduction to Number Theory Instructor: 孫宏民 Room: EECS 6402, Tel: , Fax :
Contents Introduction Related problems Constructions –Welch construction –Lempel construction –Golomb construction Special properties –Periodicity –Nonattacking.
So far we have learned about:
More Counting Lecture 16: Nov 9 A B …… f. Counting Rule: Bijection If f is a bijection from A to B, then |A| = |B| A B …… f.
Sequence A list of objects arranged in a particular order.
MULTIPLES OF 2 By Preston, Lincoln and Blake. 2 X 1 =2 XX 2X1=2 1+1=2.
Scott Vaughen, Professor of Mathematics
Patrick March, Lori Burns. History Islamic thinks and the discovery of the latin square. Leonhard Euler, a Swiss mathematician from the 18 th century,
Prime Factors. What are they? All composite numbers can be written as the product of prime numbers. This product is known as the prime factorisation of.
Great Theoretical Ideas in Computer Science.
Chapter 2 The Fundamentals: Algorithms, the Integers, and Matrices
FINITE FIELDS 7/30 陳柏誠.
More Counting Lecture 13 A B …… f. Counting Rule: Bijection If f is a bijection from A to B, then |A| = |B| A B …… f.
Information Security and Management 4. Finite Fields 8
Lesson #12 : Cut Time (stds 2,5,6/9.1, 9.3) All contents of this presentation: © 2008 TB Music.
Chapter 7: Polynomials This chapter starts on page 320, with a list of key words and concepts.
Discrete Mathematics, 1st Edition Kevin Ferland
Counting. Techniques for counting Rule 1 Suppose we carry out have a sets A 1, A 2, A 3, … and that any pair are mutually exclusive (i.e. A 1  A 2 =
1 Melikyan/DM/Fall09 Discrete Mathematics Ch. 6 Counting and Probability Instructor: Hayk Melikyan Today we will review sections 6.4,
Basic Counting. This Lecture We will study some basic rules for counting. Sum rule, product rule, generalized product rule Permutations, combinations.
APPLICATIONS OF MODERN ALGEBRA: BURNSIDE’S LEMMA Anisha Dhalla 1.
Copyright © Cengage Learning. All rights reserved. CHAPTER 5 SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION.
1 Problem Solving using computers Data.. Representation & storage Representation of Numeric data The Binary System.
Analysis of Algorithms
6.3 Permutation groups and cyclic groups  Example: Consider the equilateral triangle with vertices 1 , 2 , and 3. Let l 1, l 2, and l 3 be the angle bisectors.
Basic Concepts in Number Theory Background for Random Number Generation 1.For any pair of integers n and m, m  0, there exists a unique pair of integers.
Set, Combinatorics, Probability & Number Theory Mathematical Structures for Computer Science Chapter 3 Copyright © 2006 W.H. Freeman & Co.MSCS Slides Set,
Relations, Functions, and Matrices Mathematical Structures for Computer Science Chapter 4 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesFunctions.
Math 3121 Abstract Algebra I Lecture 9 Finish Section 10 Section 11.
Great Theoretical Ideas in Computer Science.
Functions Is Fibonacci Repeated or Recursive? Created by: Rachel Oakley.
Chapter 7.  d4 d4  Mathematics is concerned with finding answers.
THE DOT Classical Voice Conservatory- Theory I. REVIEW: DOTTED HALF NOTE.
Kevin Bogel, Jim Delgado, Tomas Dakan, Charlie Haakensen
Music Theory Grade 1 Based on the ABRSM Syllabus Associated Board of the Royal School of Musicians.
Foundations of Discrete Mathematics Chapters 5 By Dr. Dalia M. Gil, Ph.D.
Math 3121 Abstract Algebra I Lecture 7: Finish Section 7 Sections 8.
Mathematical Writing chapter 7 Roozbeh Izadian Fall 2015.
Some other set notation We will use the notation to mean that e is an element of A. We will use the notation to mean that e is not an element of A.
Math 3121 Abstract Algebra I
CS Lecture 14 Powerful Tools     !. Build your toolbox of abstract structures and concepts. Know the capacities and limits of each tool.
Chapter 29 Symmetry and Counting. Consider the task of coloring the vertices of a regular hexagon so that three are black and three are white. There are.
1 Finding a decomposition of a graph T into isomorphic copies of a graph G is a classical problem in Combinatorics. The G-decomposition of T is balanced.
Reed-Solomon Codes Rong-Jaye Chen.
Chapter 7: Polynomials This chapter starts on page 320, with a list of key words and concepts.
CS480 Cryptography and Information Security
Musical Structure. Sound As the pressure of air changes rapidly, the ear- brain detects the changes as sound (sound waves/vibrations). Some sounds are.
Math 3121 Abstract Algebra I Lecture 6 Midterm back over+Section 7.
Page : 1 bfolieq.drw Technical University of Braunschweig IDA: Institute of Computer and Network Engineering  W. Adi 2011 Lecture-5 Mathematical Background:
Maths Year 2 Autumn 1: Numbers within 100; Add and subtract 2-digit and 3-digit numbers Autumn 2: Addition and subtraction problems; Multiplication and.
Relations, Functions, and Matrices
Analysis of Algorithms
Rhythm.
Mathematical Induction Recursion
Instructions and Examples Version 1.5
Basic Counting.
Advanced Algorithms Analysis and Design
I. Finite Field Algebra.
The Music of Math The Pythagorean discovery that “all things known have number – for without this, nothing could be thought of or known” – was made in.
Mathematical Background: Extension Finite Fields
Presentation transcript:

Asymmetric Rhythms and Tiling Canons Dr. Rachel Hall Saint Joseph’s University Vassar College May 8, 2007

May 8th, 2007Asymmetric rhythms and tiling canons2 Feel the beat Classic 4/4 beat Syncopated 4/4 beat How are these rhythms different? We will explore ways of describing rhythm mathematically.

May 8th, 2007Asymmetric rhythms and tiling canons3 Math for drummers The mathematical analysis of rhythm has a long history. In fact, ancient Indian scholars discovered the Fibonacci numbers, Pascal’s triangle, and the rudiments of the binary number system by enumerating rhythms in Sanskrit poetry. They discovered the Fibonacci numbers fifty years before Fibonacci, and Pascal’s triangle 18 centuries before Pascal!

May 8th, 2007Asymmetric rhythms and tiling canons4 Beats, rhythms, and notes In music, the beat is the basic unit of time. A rhythm is a sequence of attacks (drum hits) or note onsets. A note is the interval between successive attacks. We will assume that every note begins on some beat.

May 8th, 2007Asymmetric rhythms and tiling canons5 Notation Here are several ways to represent the same rhythm: Standard Western notation Drum tablature: x..x..x. Binary: or

May 8th, 2007Asymmetric rhythms and tiling canons6 Periodic rhythms If a rhythm is played repeatedly, it’s hard to tell where it starts. Two periodic rhythms are equivalent if one of them is the same as the other delayed by some number of beats. For example,.x.x..x. is equivalent to x..x..x. The set of all rhythms that are equivalent to a given pattern is called a rhythm cycle.

May 8th, 2007Asymmetric rhythms and tiling canons7 Composition 001 Choose a rhythm (not the same as mine!) Write down all the patterns that are equivalent to your rhythm. x... x....x.xx...x. etc.

May 8th, 2007Asymmetric rhythms and tiling canons8 Binary necklaces You can represent your rhythm as a necklace of black and white beads, called a binary necklace. The necklace can be rotated (giving you all the equivalent patterns) but not turned over.

May 8th, 2007Asymmetric rhythms and tiling canons9 Questions How many different rhythm patterns with six beats are possible? How many are in your rhythm cycle? What are the possible answers to the previous question? What does “six” have to do with it?

May 8th, 2007Asymmetric rhythms and tiling canons10 Counting rhythm cycles There are 64 rhythm patterns with six beats. Counting rhythm cycles is much more difficult. (Can you explain why?) It turns out that there are only 14 rhythm cycles with six beats. Burnside’s lemma is used to count these cycles.

May 8th, 2007Asymmetric rhythms and tiling canons11 Fourteen rhythm cycles of six beats

May 8th, 2007Asymmetric rhythms and tiling canons12 Burnside’s lemma Suppose a group G acts on a set X. Then the number n of equivalence classes in X under the action of G is the average, over G, of the number of elements of X that each element of G fixes. That is, In this case, X is a set of rhythm patterns, G is a group of cyclic permutations, and n is the number of rhythm cycles.

May 8th, 2007Asymmetric rhythms and tiling canons13 Burnside’s lemma in action n = number of cycles 0º rotation 90º rotation 180º rotation 270º rotation G = group of 90º rotations The number of times a pattern appears on this matrix equals the number of rotations fixing it. X = set of (distinct) patterns By inspection, there are n = six four-beat cycles

May 8th, 2007Asymmetric rhythms and tiling canons14 Using the formula to find n Suppose we didn’t know that n = 6. Then G = group of 90° rotations; |G| = 4. Number of patterns fixed by 0° rotation = 2 4 = 16. Number of patterns fixed by 90° rotation = 2 1 = 2. Number of patterns fixed by 180° rotation = 2 2 = 4. Number of patterns fixed by 270° rotation = 2 1 = 2.

May 8th, 2007Asymmetric rhythms and tiling canons15 General formula for number of N -beat cycles In general, where  is the Euler phi-function:  (d) = number of positive integers less than or equal to d that are relatively prime to d

May 8th, 2007Asymmetric rhythms and tiling canons16 Asymmetric rhythms A rhythm is syncopated if it avoids a beat that is normally accented (the first and middle beats of the measure). Can a rhythm cycle be syncopated? A rhythm cycle is asymmetric if all its component rhythm patterns are syncopated.

May 8th, 2007Asymmetric rhythms and tiling canons17 Examples Asymmetric cycle x..x..x..x..x..x x.x..x...x.x..x...x.x..x x..x.x...x..x.x...x..x.x Non-asymmetric cycle x.x...x..x.x...x x.x.x....x.x.x....x.x.x....x.x.x x...x.x..x...x.x

May 8th, 2007Asymmetric rhythms and tiling canons18 xx.... DIY! How can I fill in the rest of the beats to make a pattern belonging to an asymmetric cycle? In general, there are 3 N patterns of length 2 N that are members of asymmetric cycles.

May 8th, 2007Asymmetric rhythms and tiling canons19 Counting asymmetric rhythm cycles The number of asymmetric rhythm cycles of period 2 N is

May 8th, 2007Asymmetric rhythms and tiling canons20 Rhythmic canons A canon, or round, occurs when two or more voices sing the same tune, starting at different times. A rhythmic canon occurs when two or more voices play the same rhythm, starting at different times.

May 8th, 2007Asymmetric rhythms and tiling canons21 Example Schumann, “Kind im Einschlummern” Voice 1: x.xxxx..x.xxxx.. Voice 2: x.xxxx..x.xxxx..

May 8th, 2007Asymmetric rhythms and tiling canons22 More on canons Messaien, Harawi, “Adieu” Voice 1: x..x....x x....x..x...x..x......x..x...x.x.x..x....x.. Voice 2: x..x....x x....x..x...x..x......x..x...x.x.x..x....x.. Voice 3: x..x....x x....x..x...x..x......x..x...x.x.x..x....x.. A canon is complementary if no more than one voice sounds on every beat. If exactly one voice sounds on each beat, the canon is a tiling canon.

May 8th, 2007Asymmetric rhythms and tiling canons23 Make your own canon Fill in the template in your worksheet to make your rhythm into a canon. Is your canon complementary? If so, is it a tiling canon? What is the relationship to asymmetry?

May 8th, 2007Asymmetric rhythms and tiling canons24 Asymmetric rhythms and complementary canons To make a rhythm asymmetric, you make the canon complementary. When will you get a tiling canon? xx.... xx....

May 8th, 2007Asymmetric rhythms and tiling canons25 Canons with more than 2 voices A three-voice tiling canon x.....x..x.x|:x.....x..x.x:| x.....x.|:.x.xx.....x.:| x...|:..x..x.xx...:| The methods of constructing n-voice canons, where the voices are equally spaced from one another, are similar to the asymmetric rhythm construction. repeat sign

May 8th, 2007Asymmetric rhythms and tiling canons26 A four-voice tiling canon Voice 1: x.x.....|:x.x.....:| Voice 2: x.x....|:.x.x....:| Voice 3: x.x.|:....x.x.:| Voice 4: x.x|:.....x.x:| Entries: ee..ee..|:ee..ee..:| inner rhythm = x.x..... outer rhythm = ee..ee..

May 8th, 2007Asymmetric rhythms and tiling canons27 Tiling canons of maximal category A tiling canon has maximal category if the inner and outer rhythms have the same (primitive) period. None exist for periods less than 72 beats. Here’s one of period 72. You’ll hear the whistle sound the outer rhythm about halfway through.

May 8th, 2007Asymmetric rhythms and tiling canons28 Tiling the integers A tiling of the integers is a finite set A of integers (the tile) together with a set of translations B such that every integer may be written in a unique way as an element of A plus an element of B. Example: A = {0, 2} B = {…, 0, 1, 4, 5, 8, 9, …}

May 8th, 2007Asymmetric rhythms and tiling canons29 Example (continued) A = {0, 2} B = {…, 0, 1, 4, 5, 8, 9, …} Every rhythmic tiling canon corresponds to an integer tiling! ……

May 8th, 2007Asymmetric rhythms and tiling canons30 Results and questions Theorem (Newman, 1977): All tilings of the integers are periodic. Can a given set A tile the integers? If so, what are the possible translation sets?

May 8th, 2007Asymmetric rhythms and tiling canons31 Partial answers Only the case where the size of the tile is divisible by less than four primes has been solved (Coven, Meyerowitz,Granville et al.). The proof uses results about the factorization of polynomials over the field of integers modulo N. In this case, there is an algorithm for constructing the translation set. The answer is unknown for more than three primes.

May 8th, 2007Asymmetric rhythms and tiling canons32 Inversion and monohedral tiling Playing a rhythm backwards gives you its inversion. Tiling canons using a rhythm and its inversion are called monohedral. Monohedral tiling canons can be aperiodic. Beethoven (Op. 59, no. 2) uses x..x.x and.xx.x. to form a monohedral tiling canon. Not much is known about monohedral tiling. Maybe you will make some discoveries!