Periodic Recurrence Relations and Reflection Groups JG, October 2009.

Slides:



Advertisements
Similar presentations
How to Factor Quadratics of the Form
Advertisements

Hikorski Triples By Jonny Griffiths UEA, May 2010.
An Introduction to Elliptic Curves with reference to Lyness cycles Jonny Griffiths, UEA, November 2010.
Lyness Cycles, Elliptic Curves, and Hikorski Triples Jonny Griffiths, Maths Dept Paston Sixth Form College Open University, June 2012.
An Introduction to Elliptic Curves ATM Conference, Telford Jonny Griffiths, April 2011.
Hikorski Triples By Jonny Griffiths UEA, May 2010.
1 We are now ready to move to the orthorhombic system. There are 59 orthorhombic space groups. Orthorhombic crystals belong to crystal classes 222, mm2.
Sequences and Mathematical Induction
Binary Operations Let S be any given set. A binary operation  on S is a correspondence that associates with each ordered pair (a, b) of elements of S.
4/16/2015 MATH 224 – Discrete Mathematics Counting Basic counting techniques are important in many aspects of computer science. For example, consider the.
Counters. In class excercise How to implement a “counter”, which will count as 0,3,1,4,5,7,0,3,1,…… Q2Q1Q0D2D1D
Generalized Derangements Anthony Fraticelli Missouri State University REUJuly 30, 2009 Advisor: Dr. Les Reid.
Natalie Weires Kathy Lin.  We take an arbitrary triangle and bisect its angles to create three new triangles. If we repeat this process on each generated.
CSE115/ENGR160 Discrete Mathematics 02/21/12
What is the best way to start? 1.Plug in n = 1. 2.Factor 6n 2 + 5n Let n be an integer. 4.Let n be an odd integer. 5.Let 6n 2 + 5n + 4 be an odd.
Survey of Mathematical Ideas Math 100 Chapter 1 John Rosson Tuesday January 23, 2007.
COUNTING PRINCIPALS, PERMUTATIONS, AND COMBINATIONS.
Mrs. Martinez CHS MATH DEPT.
Basic Counting. This Lecture We will study some basic rules for counting. Sum rule, product rule, generalized product rule Permutations, combinations.
Absolute vs. Conditional Convergence Alternating Series and the Alternating Series Test.
Activity 2-17: Zeroes of a Recurrence Relation
Lecture#16 Discrete Mathematics. Recursion Now, 1 is an odd positive integer by the definition base. With k = 1, = 3, so 3 is an odd positive integer.
375 students took the number sense common formative assessments this school year. These are their stories. (Please view as a slide show)
CSNB143 – Discrete Structure Topic 9 – Graph. Learning Outcomes Student should be able to identify graphs and its components. Students should know how.
Activity 2-2: Mapping a set to itself
Operations with integers can be modeled using two-colored counters. Positive +1 Negative.
Section 2.4. Section Summary Sequences. Examples: Geometric Progression, Arithmetic Progression Recurrence Relations Example: Fibonacci Sequence Summations.
Investigational Work Following through and seeing the steps and paths that MAY be taken.
FACTORING REVIEW Math 0099 Chapter 6 Created and Presented by Laura Ralston.
Counters. In class excercise How to implement a “counter”, which will count as 0,3,1,4,5,7,0,3,1,…… Q2Q1Q0D2D1D
Graphs.  Definition A simple graph G= (V, E) consists of vertices, V, a nonempty set of vertices, and E, a set of unordered pairs of distinct elements.
Activity 1-19: The Propositional Calculus
Sequences and Summations Section 2.4. Section Summary Sequences. – Examples: Geometric Progression, Arithmetic Progression Recurrence Relations – Example:
Absolute vs. Conditional Convergence Alternating Series and the Alternating Series Test.
Activity 2-5: What are you implying?
Conjectures Patterns Counter- examples LinesPlanes
Math 409/409G History of Mathematics Perfect Numbers.
Counting Principles Multiplication rule Permutations Combinations.
CLICK THE NUMBERS IN SEQUENCE
Chapter 11 - Graph CSNB 143 Discrete Mathematical Structures.
Discrete Mathematics Lecture # 22 Recursion.  First of all instead of giving the definition of Recursion we give you an example, you already know the.
Special Topics. Calculating Outcomes for Equally Likely Events If a random phenomenon has equally likely outcomes, then the probability of event A is:
Activity 1-12 : Multiple-free sets
Continue the sequence 1. ½, 1, 2, 4, 8, __, __, __ 2. __, 5, 9, 13, __, __, , 55, __, 15, __, __ 4. 8, 27, 103, __ 5 Minutes Remain.
Activity 2-9: The Logistic Map and Chaos
4.3 Multiplying Matrices Dimensions matching Rows times Columns.
Inductive Reasoning Section 1.2. Objectives: Use inductive reasoning to make conjectures.
Copyright © 2013, 2009, 2006 Pearson Education, Inc.
CSNB 143 Discrete Mathematical Structures
Appendix A Basic Algebra Review
Activity 2-18: Cyclotomic polynomials
Basic Counting.
Absolute vs. Conditional Convergence
Finite State Machines.
Magic Fractions nRich – cannot find url.
Zeroes of a Recurrence Relation
MODULE – 1 The Number System
Counters.
What is the number whose area is 16 unit square?
CLICK THE NUMBERS IN SEQUENCE
Patterns & Inductive Reasoning
Foundations of Discrete Mathematics
Absolute vs. Conditional Convergence
Activity 2-18: Cyclotomic polynomials
s(n) An Arithmetic Function of Some Interest, and Related Arithmetic
9 x 14 9 x 12 Calculate the value of the following: 1 9 × 5 =
CLICK THE NUMBERS IN SEQUENCE
Written methods Which four consecutive odd numbers sum to 120?
1.1 Patterns and Inductive Reasoning
Presentation transcript:

Periodic Recurrence Relations and Reflection Groups JG, October 2009

A periodic recurrence relation with period 5. A Lyness sequence: a ‘cycle’. (R. C. Lyness, once mathematics teacher at Bristol Grammar School.)

Period Three: Period Two: x Period Six: Period Four:

Period Seven and over: nothing Why should this be? If we insist on integer coefficients…

Fomin and Reading

Note: T 1 is an involution, as is T 2. What happens if we apply these involutions alternately?

So T 1 2 = I, T 2 2 = I, and (T 2 T 1 ) 5 = I But T 1 T 2 ≠ T 2 T 1 Suggests we view T 1 and T 2 as reflections. Note: (T 1 T 2 ) 5 = I

Conjecture: any involution treated this way as a pair creates a cycle. Counter-example:

Conjecture: every cycle comes about by treating an involution this way. Possible counter-example:

(T 6 T 5 ) 4 = I, but T 5 2 ≠ I A cycle is generated, but not obviously from an involution. Note: is it possible to break T 5 and T 6 down into involutions? Conjecture: if the period of a cycle is odd, then it can be written as a product of involutions.

Fomin and Reading also suggest alternating significantly different involutions: So s 1 2 = I, s 2 2 = I, and (s 2 s 1 ) 3 = I All rank 2 (= dihedral) so far – can we move to rank 3?

Note: Alternating y-x (involution and period 6 cycle) and y/x (involution and period 6 cycle) creates a cycle (period 8).

The functions y/x and y-x fulfil several criteria: 3) When applied alternately, as in x, y, y-x, (y-x)/y… they give periodicity here too (period 8) 1)they can each be regarded as involutions in the F&R sense (period 2) 2) x, y, y/x… and x, y, y-x… both define periodic recurrence relations (period 6)

Can f and g combine even more fully? Could we ask for:

If we regard f and g as involutions in the F&R sense, then if we alternate f and g, is the sequence periodic? No joy! What happens with y – x and y/x?

Let x, y, f(x, y)… is periodic, period 3. h 1 (x) = f(x, y) is an involution, h 2 (x) = g(x, y) is an involution. x, y, g(x, y)… is periodic, period 3 also.

Alternating f and g gives period 6.

What happens if we alternate h 1 and h 2 ? Periodic, period 4.

Another such pair is : Conjecture: If f(x, y) and g(x, y) both define periodic recurrence relations and if f(x, y)g(x, y) = 1 for all x and y, then f and g will combine in this way.

A non-abelian group of 24 elements. Appears to be rank 4, but… Which group have we got?

Not all reflection groups can be generated by PRRs of these types. (We cannot seem to find a PRR of period greater than six, to start with.) Which Coxeter groups can be generated by PRRs? Coxeter groups can be defined by their Coxeter matrices.

The Crystallographic Restriction

This limits things! In two dimensions, only four systems are possible.