Even and Odd Permutations (10/2) Theorem. Every cycle, and hence every permutation, can be written as product of (usually non-disjoint) 2-cycles. Example.

Slides:



Advertisements
Similar presentations
An Aside from Number Theory: The Euler Phi-function (9/20/13) Definition. The Euler Phi-function of a positive integer n, denoted  (n) is the number of.
Advertisements

Cayley’s Theorem & Automorphisms (10/16) Cayley’s Theorem. Every group is isomorphic to some permutation group. This says that in some sense permutation.
More Set Definitions and Proofs 1.6, 1.7. Ordered n-tuple The ordered n-tuple (a1,a2,…an) is the ordered collection that has a1 as its first element,
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.
Discrete Mathematics Lecture 5 Alexander Bukharovich New York University.
The Fundamental Theorem of Arithmetic (2/12) Definition (which we all already know). A number greater than 1 is called prime if its only divisors are 1.
Chapter 4 Congruent Triangles.
Algebraic Structures DEFINITIONS: PROPERTIES OF BINARY OPERATIONS Let S be a set and let  denote a binary operation on S. (Here  does not necessarily.
The Inverse of a Matrix (10/14/05) If A is a square (say n by n) matrix and if there is an n by n matrix C such that C A = A C = I n, then C is called.
Vectors and Vector Equations (9/14/05) A vector (for us, for now) is a list of real numbers, usually written vertically as a column. Geometrically, it’s.
Chapter 5 Section 1 Sets Basics Set –Definition: Collection of objects –Specified by listing the elements of the set inside a pair of braces. –Denoted.
Basis of a Vector Space (11/2/05)
Tables of Integrals and Computer Software for Integrals (9/19/08) Because finding antiderivatives is often a tricky and time-consuming job, – Tables of.
Coordinate Systems (11/4/05) It turns out that every vector space V which has a finite basis can be “realized” as one of the spaces R n as soon as we pick.
Solution Sets of Linear Systems (9/21/05)
Row Reduction and Echelon Forms (9/9/05) A matrix is in echelon form if: All nonzero rows are above any all-zero rows. Each leading entry of a row is in.
More Probability and Counting Friday, April 9, 2004.
Section 4.1 Finite Permutation Groups Permutation of a Set Let A be the set { 1, 2, …, n }. A permutation on A is a function f : A  A that is both one-to-one.
Write Equations of Lines Chapter 2.4. From Lines to Equations.
Section 3.1 Chapter 3 Objectives: Identify Ordered Pair Identify a Relation Identify the Domain and Range of a Relation.
Set theory Sets: Powerful tool in computer science to solve real world problems. A set is a collection of distinct objects called elements. Traditionally,
9.2 Graph Terminology and Special Types Graphs
Chapter 6.7 Determinants. In this chapter all matrices are square; for example: 1x1 (what is a 1x1 matrix, in fact?), 2x2, 3x3 Our goal is to introduce.
Upcoming MA 214 Schedule (2/21) The mid-term exam will be entirely take-home (with very specific “ground rules”). It will be handed out on Wednesday March.
External Direct Products (11/4) Definition. If G 1, G 2,..., G n are groups, then their external direct product G 1  G 2 ...  G n is simply the set.
Chapter 3 Elementary Number Theory and Methods of Proof.
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.
Cyclic Groups (9/25) Definition. A group G is called cyclic if there exists an element a in G such that G =  a . That is, every element of G can be written.
2.4 Use Postulates & Diagrams
Proving angles congruent. To prove a theorem, a “Given” list shows you what you know from the hypothesis of the theorem. You will prove the conclusion.
Great Theoretical Ideas in Computer Science for Some.
Ch. 6: Permutations!.
Chapter 5: Permutation Groups  Definitions and Notations  Cycle Notation  Properties of Permutations.
1 String v is a prefix of w if w= v y for some string y. String v is a suffix of w if w= x v for some string x. String v is a substring of w if there are.
1-7 Functions Objectives: Determine whether a relation is a function.
Word : Let F be a field then the expression of the form a 1, a 2, …, a n where a i  F  i is called a word of length n over the field F. We denote the.
Clicker Question 1 What is ? A. -2/x 3 + tan(x ) + C B. -1/x – 1/(x + 1) + C C. -1/x + tan(x ) + C D. -1/x + arctan(x ) + C E. -2/x 3 + arctan(x ) + C.
Chapter 3 Lesson 2 Objective: Objective: To use a transversal in proving lines parallel.
Cosets and Lagrange’s Theorem (10/28)
1.Is it More, Less, or Exactly Half? 2. Is it More, Less, or Exactly Half?
Math 3121 Abstract Algebra I Lecture 7: Finish Section 7 Sections 8.
11.4 Pythagorean Theorem Definitions Pythagorean Theorem
Questions on Direct Products (11/6) How many elements does D 4  Z 4 have? A. 4B. 8C. 16D. 32E. 64 What is the largest order of an element in D 4  Z 4.
Proving Angles Congruent Chapter 2 Section 6. Theorem A conjecture or statement that you can prove true. You can use given information, definitions, properties,
Normal Subgroups and Factor Groups (11/11) Definition. A subgroup H of a group G is called normal if for every a  G, the left coset aH is the same set.
CSNB 143 Discrete Mathematical Structures
SECTION 9 Orbits, Cycles, and the Alternating Groups Given a set A, a relation in A is defined by : For a, b  A, let a  b if and only if b =  n (a)
Chapter 11 - Graph CSNB 143 Discrete Mathematical Structures.
Chapter 5. Section 5.1 Climbing an Infinite Ladder Suppose we have an infinite ladder: 1.We can reach the first rung of the ladder. 2.If we can reach.
3/4/2016Review of 8-4 & 8-53/4/2016 Problems of the Day Simplify the expression. 3/4/2016 a.b.c.
Sequences (11/14/12) A sequence is an infinite list of real numbers: {a1, a2, a3, a4, a5 ….} = {an}. (Order counts!) A sequence can be described by listing.
Remarks on Fast Exp (4/2) How do we measure how fast any algorithm is? Definition. The complexity of an algorithm is a measure of the approximate number.
Chromatic Coloring with a Maximum Color Class Bor-Liang Chen Kuo-Ching Huang Chih-Hung Yen* 30 July, 2009.
The Matrix Equation A x = b (9/16/05) Definition. If A is an m  n matrix with columns a 1, a 2,…, a n and x is a vector in R n, then the product of A.
Lesson 1-5 Postulates and Theorems Relating
1 GRAPH Learning Outcomes Students should be able to: Explain basic terminology of a graph Identify Euler and Hamiltonian cycle Represent graphs using.
Module 2 part 2 Properties of Angles. M2L12: Angles Associated with Parallel Lines.
5.3 Inverse Functions (Part I). Objectives Verify that one function is the inverse function of another function. Determine whether a function has an inverse.
Mrs. Shahmoradian (Ms. Tanskley) Monday 2nd.  Answer the following questions about the Polynomial equation: 6x^3 + 8x^2 – 7x – 3 = 0 1) How many roots.
Perfect Numbers (3/26) Definition. A number is called perfect if it is equal to the sum of its proper divisors. Examples: 6 and 28 are the first two (check!).
Lesson 1-5 Postulates and Theorems Relating Points, Lines, and Planes (page 22) Essential Question How are the relationships of geometric figures used.
Direct Proof and Counterexample IV: Division into Cases and the Quotient-Remainder Theorem For each of the following values of n and d, find integers q.
CSNB 143 Discrete Mathematical Structures
Parallel Lines and Planes
Chapter 6 Inequalities in Geometry page 202
Lesson 2-6 Planning a Proof (page 60)
MAT 117 Functions & Equations 1.3. To solve an equation: Locate the variable that you want to isolate. Use inverse operations (opposite operation) to.
Clicker Question 1 What is 1 - 5/4 + 25/ /64 + …  5n/4n + … ?
Homomorphisms (11/20) Definition. If G and G’ are groups, a function  from G to G’ is called a homomorphism if it is operation preserving, i.e., for all.
Exercise Give the domain and range of the following relation.
Presentation transcript:

Even and Odd Permutations (10/2) Theorem. Every cycle, and hence every permutation, can be written as product of (usually non-disjoint) 2-cycles. Example. ( ) = (1 5)(1 4)(1 3)(1 2). Note that this representation is not unique. For example, ( ) = (2 1)(2 5)(2 4)(2 3)(1 4)(1 4) also. What is unique? Answer: Whether there are an odd number or an even number of 2-cycles. Theorem. If a permutation  can be written as an even number of 2-cycles, then every such representation of  will have an even number of 2-cycles. Likewise for odd. “Always Even or Always Odd”

More on Even and Odd Because of the preceding theorem, we can make the following definition: Definition. A permutation  is called even if it can be written as an even number of 2-cycles. Likewise for odd. We’ll call this the “type” of the permutation. Be sure to contrast this with the order of the permutation. They are different things!! Example: What type is ( )? What is its order? Give an example of an odd permutation of even order. Give an example of an even permutation of even order. Prove that there do not exist odd permutations of odd order!

Another Cool Result Theorem. Every group of permutations either consists entirely of even permutations, or it consists of exactly half even and half odd permutations. Examples: Check this with S 3 and S 4. Example. Thinking of D 4 as a subgroup of S 4 (with the vertices labeled 1 through 4), test out this theorem. Example. What about D 5 (as a subgroup of S 5 )? Theorem. The set of even permutations of any group of permutations G form a subgroup of G of order |G| or |G| / 2. Definition.The set of even permutations of S n is denoted A n and is called the alternating group on n elements.

Assignment for Friday Hand-in #2 is due on Monday. Read Chapter 5 from page 108 up to Example 8 (middle of page 111). Please do Exercises 8, 9, 10, 11, 15, 17, 22, 23, 24, 25 on pages