Remember that represents the set of all permutations of {1, 2,... n}
|
|
- Stella Garrett
- 5 years ago
- Views:
Transcription
1 Remember that represents the set of all permutations of {1, 2,... n} There are some basic facts about that we need to have in hand: 1. Closure: If and then 2. Associativity: If and and then 3. Identity Element: There is a permutation such that 4. Inverse: If then and Property 1 says that the composition of two permutations is another permutation. This sounds trivial but it is our frst look at a very important concept: closure. When we apply an operation to two elements of a set and always get another element of the same set, we say that set is closed under that operation. Not all sets are closed under all operations. For example, is not closed under the operation of subtraction (for instance, and, but, which is not in ). However is closed under addition and multiplication. This concept is vital to us as computer scientists because we frequently work with strongly typed programming languages, where each variable has a specifc type that cannot change. If we are dealing with integer variables, we need to be sure the operations we perform will only produce integer values. Property 2 is called the associative property. It says that if we are composing a sequence of permutations we can group them with parentheses in diferent ways without changing the result. We will see an application of this later in these notes. Property 3 asserts that the identity permutation can be composed with any permutation without changing it. Once again, we can draw a parallel to other sets and operations. For example, in the set and the operation of multiplication, we know that Property 4 asserts that every permutation has an inverse. This property is also true for some sets and operations but not all. For example, in the set and the operation of addition, the
2 identity element is 0 and every element has an inverse (for instance, the inverse of 7 is -7). However in the set and the operation of addition, the identity element is still 0 but the nonzero values do not have inverses (for instance there is no integer such that ). Property 4 is particularly important when we use permutations in cryptography there s not much point encoding information with a permutation if there is not some other permutation that will do the decoding. Each of these properties follows from the defnition of permutations and the properties of functions. I recommend that you do some examples and convince yourself that these are true. (Side note: A set and an operation that satisfy these four properties are called a group. Group theory is one of the most important branches of mathematics, with applications in communications, theoretical physics, applied physics, biology, chemistry, robotics and many other felds. We don t have time in CISC-203 to explore this topic but I encourage you to spend some time looking into it.) Note that there is property possessed by many operations that is not true of the composition of permutations: commutativity. Commutativity holds when we can switch the left-to-right order of the operands without changing the result. For example, when we are multiplying integers, we know that... and the same is true for addition. Not all operations are commutative. For example, subtraction is not commutative: except when Composition of permutations is not commutative. In general, we will see some special cases where they are equal.... although In class I posed a challenge: given permutations and in, can you always fnd a permutation such that?
3 The answer is yes. Here s how: we can solve this equation for in much the same way as we would solve an equation involving numbers... we just try to get by itself on one side. (What I mean is, if we are asked to solve we isolate the by adding to both sides getting, which simplifes to, and fnally. But here the only operation we have is composition. So what can we do with composition to get rid of the on the left side? Well, remember that... and So we can start with (in which and are known, and is the unknown) and apply the following operations that maintain equality and we are done! It s exactly the same process as solving for in It s easy to check that this is correct. If we take and replace by we get which equals which equals which equals Cycle Notation for Permutations Now we introduce another representation for permutations... one that makes it possible to work with permutations very easily. Consider this permutation: What happens if we imagine composing with itself? Let s trace what happens to the element 1. We are going to apply twice: the frst application maps 1 to 4, and the second
4 application maps that 4 to 2. If we compose with again, that 2 is mapped back to 1. Treating as a function, we see,, and (It is traditional to write as and as etc.) Composing with even more times will cycle through 4 then 2 then 1 then 4 then 2 then 1 etc. We can write this behaviour as etc. If we trace what happens to 2 when we repeatedly compose with itself and apply the resulting function to 2, we see exactly the same pattern : etc. The same thing happens if we start with 4 and trace what happens to it when we repeatedly compose with itself and apply the resulting function to 4: we get the pattern 4 etc So in this sense, 1, 4 and 2 form a cycle: 1 goes to 4, 4 goes to 2, and 2 goes to 1. We write this cycle as (1, 4, 2) - it is a notational device that describes the three ordered pairs (1,4),(4,2), (2,1) which belong to What about the rest of? Since we have dealt with 1, 2 and 4, let s see what happens to 3. Following the same analysis as we did for 1, 2 and 4 (but skipping over some of the details) we see this pattern: etc. which we write as (3, 5, 7, 6). Again we can see that this is a non-ambiguous shorthand way to represent the four ordered pairs (3,5), (5,7), (7,6), (6,3) that make up the rest of Thus we can express the entire defnition of with the two cycles (1,4,2)(3,5,7,6) - we call this the cycle notation for All of the information that defnes is there, expressed in a diferent way (in other words, we can reconstruct the standard representation from the cycle notation). Notice that from each permutation, we can only get one cycle notation version. (We saw this for above: no matter which elements we start with, we always get the same repeating patterns for 1, 4 and 2, and for 3, 5, 7, and 6.) Similarly, from any cycle notation representation, we can only reconstruct one permutation in standard notation. This means that the cycle notation for each permutation is unique (up to changing the order of the cycles, because (1,4,2)(3,5,7,6) gives the same information as (3,5,7,6)(1,4,2) and up to rotating the elements within each cycle, since (1,4,2) and (4,2,1) and (2,1,4) all represent the same information). We can also extract the cycle notation for a permutation without going through the efort of composing with itself over and over. We can just build the cycles directly from by observing 1 goes to 4, 4 goes to 2, and 2 goes to 1 to get the cycle (1, 4, 2). Then we can say What happens to 3? and observe 3 goes to 5, 5 goes to 7, 7 goes to 6, and 6 goes to 3 to get
5 the cycle (3, 5, 7, 6). We can also represent the permutation by a diagram with each ordered pair represented by an arrow. This is what we did in class. The diagram for looks like this: This is as far as we got on Tuesday, but there were a couple of other things to say about permutations in cycle notation. I m including them here, and I will present them in class on Thursday. So what can we do with a permutation expressed in cycle notation? Computing the Inverse of a Permutation in Cycle Notation Suppose we have a permutation and we need to compute. We could do it from standard representation... For example, consider To compute, we could see that
6 4 is in the frst position, so the ordered pair (1,4) must be in... which means the ordered pair (4,1) must be in. Similarly, 2 is in the fourth position, so the ordered pair (4,2) is in, so (2,4) must be in, and so on... it s not that hard but it s a bit tedious. But with the permutation expressed in cycle notation, computing is trivially easy: we just reverse each cycle. So the inverse of (1,4,2)(3,5,7,6) is simply (2,4,1)(6,7,5,3). You can check the details of this example to confrm that it works, but the logic of it is pretty straightforward: contains the ordered pair (1,4) this is encoded in the frst cycle, so must contain the ordered pair (4,1) and this is encoded in the reverse of the frst cycle. Note that reversing a cycle is very diferent from rotating a cycle: the cycles (a, b, c, d) and (c, d, a, b) represent exactly the same information, but (d, c, b, a) represents the inverse. Composition of Two Permutations in Cycle Notation Now suppose we have two permutations and and we want to compute. (Remember, this means the permutation that results when we apply, then apply ) Once again cycle notation makes this very easy, and an example will show how this is done. Let s use and. In cycle notation, = (1,4,2)(3,5,6,7) and = (1,4)(2,7)(3,6)(5) - you should check this. (Why is 5 all by itself in? Because maps 5 to itself... 5 forms a cycle of length 1.) We can build the cycle notation for as follows: Start with 1. Apply to it, giving 4 (that is to say ). Then apply to that 4, giving 2 (that is, ). So in, we see that 1 2 (that is, ). So our frst cycle in starts (1, 2...) Now let s see what does to 2. takes 2 to 7, and takes 7 to 6. So. So our cycle in now looks like (1, 2, 6...) Now let s see what does with 6. takes 6 to 3 and takes 3 to 5, so. The cycle in we are building now looks like (1, 2, 6, 5...)
7 Following the same steps we see that. Then we discover that So we have discovered that in, is a cycle, and in cycle notation this is (1,2,6,5,7) We still haven t dealt with 3 and 4. It doesn t matter which we start with, so let s start with 4. and, so. In cycle notation this is just (4) You can verify for yourself that, giving (3) as the last cycle in Putting all the cycles together, we get = (1,2,6,5,7)(4)(3) You should check this too! Shorthand Notation for Cycles When using cycle notation, sometimes we leave out the cycles of length 1. This can be ambiguous unless we know we are dealing with permutations from a particular In the previous example, if we specify that and are in then we can write and just leave out the (4) and (3). The reader will know they are cycles of length 1 because if they weren t we would have included them.
8 ****** Bonus Material For Those Who Just Can t Say No to Permutations ****** This material will not be on any of our tests, but I hope some members of the class will fnd it interesting. Consider these permutations of {1,2,3,4,5,6,7,8}: and When we put these into cycle notation, we get and They look very diferent... and yet in a certain sense they are identical! Each has two cycles of length 3 and a single cycle of length 2. Their essential structure is the same we have just re-labelled the elements. Compare this to the permutation It s clear that has a fundamentally diferent structure from and. And what can we do with this? We can defne an equivalence relation on permutations! For permutations and, both in, we can say if and have the same cycle structure. It should be clear that is reflexive, symmetric and transitive. Now we can ask questions about this equivalence relation. For example, how many equivalence classes are there for? We can answer this by looking at the number of diferent cycle structures. Let s consider permutations of [1 2 3]. The cycle structure of a permutation of this set must be either (...) - a single cycle containing all three values, or (.)(..) - a cycle of length 1 and a cycle of length 2, or (.)(.)(.) - three cycles of length 1 (there is only one permutation with this structure : ) and this means that in a very real sense, there are only 3 ways to permute a set with 3 elements.
9 Now consider permutations of [ ]. The possible cycle structures are (....) (.)(...) (.)(.)(..) (..)(..) (.)(.)(.)(.) so there are 5 ways to permute a set with 4 elements. Unfortunately there is no simple formula to compute the number of equivalence classes of for arbitrary values of n (there is a formula but it s not simple). It turns out that these are known as partition numbers. Wikipedia has a good article about them : We can also use the cycle representation to prove this claim: Let be a permutation. Then there exists a positive integer such that Proof: Suppose contains a cycle c of length t. where x is any positive multiple of t will restore the elements of c to their natural positions. Thus if contains cycles with lengths in the set then
17. Symmetries. Thus, the example above corresponds to the matrix: We shall now look at how permutations relate to trees.
7 Symmetries 7 Permutations A permutation of a set is a reordering of its elements Another way to look at it is as a function Φ that takes as its argument a set of natural numbers of the form {, 2,, n}
More informationMa/CS 6a Class 16: Permutations
Ma/CS 6a Class 6: Permutations By Adam Sheffer The 5 Puzzle Problem. Start with the configuration on the left and move the tiles to obtain the configuration on the right. The 5 Puzzle (cont.) The game
More informationMath 127: Equivalence Relations
Math 127: Equivalence Relations Mary Radcliffe 1 Equivalence Relations Relations can take many forms in mathematics. In these notes, we focus especially on equivalence relations, but there are many other
More informationThe Problem. Tom Davis December 19, 2016
The 1 2 3 4 Problem Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles December 19, 2016 Abstract The first paragraph in the main part of this article poses a problem that can be approached
More informationPermutations. Example : let be defned by and let be defned by
Permutations We reviewed the idea of function composition. Let f : A B g : B C be functions (ie. f is a function from set A to set B, g is a function from set B to set C) then we write the composition
More informationChapter 6.1. Cycles in Permutations
Chapter 6.1. Cycles in Permutations Prof. Tesler Math 184A Fall 2017 Prof. Tesler Ch. 6.1. Cycles in Permutations Math 184A / Fall 2017 1 / 27 Notations for permutations Consider a permutation in 1-line
More informationPermutation Groups. Definition and Notation
5 Permutation Groups Wigner s discovery about the electron permutation group was just the beginning. He and others found many similar applications and nowadays group theoretical methods especially those
More informationMODULAR ARITHMETIC II: CONGRUENCES AND DIVISION
MODULAR ARITHMETIC II: CONGRUENCES AND DIVISION MATH CIRCLE (BEGINNERS) 02/05/2012 Modular arithmetic. Two whole numbers a and b are said to be congruent modulo n, often written a b (mod n), if they give
More informationAn Intuitive Approach to Groups
Chapter An Intuitive Approach to Groups One of the major topics of this course is groups. The area of mathematics that is concerned with groups is called group theory. Loosely speaking, group theory is
More informationEXPLAINING THE SHAPE OF RSK
EXPLAINING THE SHAPE OF RSK SIMON RUBINSTEIN-SALZEDO 1. Introduction There is an algorithm, due to Robinson, Schensted, and Knuth (henceforth RSK), that gives a bijection between permutations σ S n and
More informationLesson 16: The Computation of the Slope of a Non Vertical Line
++ Lesson 16: The Computation of the Slope of a Non Vertical Line Student Outcomes Students use similar triangles to explain why the slope is the same between any two distinct points on a non vertical
More informationPermutations. = f 1 f = I A
Permutations. 1. Definition (Permutation). A permutation of a set A is a bijective function f : A A. The set of all permutations of A is denoted by Perm(A). 2. If A has cardinality n, then Perm(A) has
More informationMA 524 Midterm Solutions October 16, 2018
MA 524 Midterm Solutions October 16, 2018 1. (a) Let a n be the number of ordered tuples (a, b, c, d) of integers satisfying 0 a < b c < d n. Find a closed formula for a n, as well as its ordinary generating
More informationDeterminants, Part 1
Determinants, Part We shall start with some redundant definitions. Definition. Given a matrix A [ a] we say that determinant of A is det A a. Definition 2. Given a matrix a a a 2 A we say that determinant
More informationPractice Midterm 2 Solutions
Practice Midterm 2 Solutions May 30, 2013 (1) We want to show that for any odd integer a coprime to 7, a 3 is congruent to 1 or 1 mod 7. In fact, we don t need the assumption that a is odd. By Fermat s
More informationLaunchpad Maths. Arithmetic II
Launchpad Maths. Arithmetic II LAW OF DISTRIBUTION The Law of Distribution exploits the symmetries 1 of addition and multiplication to tell of how those operations behave when working together. Consider
More informationCOUNTING AND PROBABILITY
CHAPTER 9 COUNTING AND PROBABILITY Copyright Cengage Learning. All rights reserved. SECTION 9.2 Possibility Trees and the Multiplication Rule Copyright Cengage Learning. All rights reserved. Possibility
More informationSolving Equations and Graphing
Solving Equations and Graphing Question 1: How do you solve a linear equation? Answer 1: 1. Remove any parentheses or other grouping symbols (if necessary). 2. If the equation contains a fraction, multiply
More informationChapter 1 out of 37 from Discrete Mathematics for Neophytes: Number Theory, Probability, Algorithms, and Other Stuff by J. M. Cargal.
1 Relations This book starts with one of its most abstract topics, so don't let the abstract nature deter you. Relations are quite simple but like virtually all simple mathematical concepts they have their
More informationGrade 7/8 Math Circles. Visual Group Theory
Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Grade 7/8 Math Circles October 25 th /26 th Visual Group Theory Grouping Concepts Together We will start
More information1.6 Congruence Modulo m
1.6 Congruence Modulo m 47 5. Let a, b 2 N and p be a prime. Prove for all natural numbers n 1, if p n (ab) and p - a, then p n b. 6. In the proof of Theorem 1.5.6 it was stated that if n is a prime number
More informationCIS 2033 Lecture 6, Spring 2017
CIS 2033 Lecture 6, Spring 2017 Instructor: David Dobor February 2, 2017 In this lecture, we introduce the basic principle of counting, use it to count subsets, permutations, combinations, and partitions,
More informationPermutation Groups. Every permutation can be written as a product of disjoint cycles. This factorization is unique up to the order of the factors.
Permutation Groups 5-9-2013 A permutation of a set X is a bijective function σ : X X The set of permutations S X of a set X forms a group under function composition The group of permutations of {1,2,,n}
More informationIt is important that you show your work. The total value of this test is 220 points.
June 27, 2001 Your name It is important that you show your work. The total value of this test is 220 points. 1. (10 points) Use the Euclidean algorithm to solve the decanting problem for decanters of sizes
More informationCombinations and Permutations
Combinations and Permutations What's the Difference? In English we use the word "combination" loosely, without thinking if the order of things is important. In other words: "My fruit salad is a combination
More informationECS 20 (Spring 2013) Phillip Rogaway Lecture 1
ECS 20 (Spring 2013) Phillip Rogaway Lecture 1 Today: Introductory comments Some example problems Announcements course information sheet online (from my personal homepage: Rogaway ) first HW due Wednesday
More informationGrade 7/8 Math Circles. Visual Group Theory
Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Grade 7/8 Math Circles October 25 th /26 th Visual Group Theory Grouping Concepts Together We will start
More informationSolution: This is sampling without repetition and order matters. Therefore
June 27, 2001 Your name It is important that you show your work. The total value of this test is 220 points. 1. (10 points) Use the Euclidean algorithm to solve the decanting problem for decanters of sizes
More informationSection 2.1 Factors and Multiples
Section 2.1 Factors and Multiples When you want to prepare a salad, you select certain ingredients (lettuce, tomatoes, broccoli, celery, olives, etc.) to give the salad a specific taste. You can think
More informationCS 202, section 2 Final Exam 13 December Pledge: Signature:
CS 22, section 2 Final Exam 3 December 24 Name: KEY E-mail ID: @virginia.edu Pledge: Signature: There are 8 minutes (3 hours) for this exam and 8 points on the test; don t spend too long on any one question!
More informationSolutions to Problem Set 6 - Fall 2008 Due Tuesday, Oct. 21 at 1:00
18.781 Solutions to Problem Set 6 - Fall 008 Due Tuesday, Oct. 1 at 1:00 1. (Niven.8.7) If p 3 is prime, how many solutions are there to x p 1 1 (mod p)? How many solutions are there to x p 1 (mod p)?
More informationX = {1, 2,...,n} n 1f 2f 3f... nf
Section 11 Permutations Definition 11.1 Let X be a non-empty set. A bijective function f : X X will be called a permutation of X. Consider the case when X is the finite set with n elements: X {1, 2,...,n}.
More information2 Logic Gates THE INVERTER. A logic gate is an electronic circuit which makes logic decisions. It has one output and one or more inputs.
2 Logic Gates A logic gate is an electronic circuit which makes logic decisions. It has one output and one or more inputs. THE INVERTER The inverter (NOT circuit) performs the operation called inversion
More informationMAT Modular arithmetic and number theory. Modular arithmetic
Modular arithmetic 1 Modular arithmetic may seem like a new and strange concept at first The aim of these notes is to describe it in several different ways, in the hope that you will find at least one
More informationDistribution of Primes
Distribution of Primes Definition. For positive real numbers x, let π(x) be the number of prime numbers less than or equal to x. For example, π(1) = 0, π(10) = 4 and π(100) = 25. To use some ciphers, we
More informationCLASS NOTES. A mathematical proof is an argument which convinces other people that something is true.
Propositional Statements A mathematical proof is an argument which convinces other people that something is true. The implication If p then q written as p q means that if p is true, then q must also be
More informationQuotients of the Malvenuto-Reutenauer algebra and permutation enumeration
Quotients of the Malvenuto-Reutenauer algebra and permutation enumeration Ira M. Gessel Department of Mathematics Brandeis University Sapienza Università di Roma July 10, 2013 Exponential generating functions
More informationLECTURE 8: DETERMINANTS AND PERMUTATIONS
LECTURE 8: DETERMINANTS AND PERMUTATIONS MA1111: LINEAR ALGEBRA I, MICHAELMAS 2016 1 Determinants In the last lecture, we saw some applications of invertible matrices We would now like to describe how
More informationSolutions to Exercises Chapter 6: Latin squares and SDRs
Solutions to Exercises Chapter 6: Latin squares and SDRs 1 Show that the number of n n Latin squares is 1, 2, 12, 576 for n = 1, 2, 3, 4 respectively. (b) Prove that, up to permutations of the rows, columns,
More informationCombinatorics and Intuitive Probability
Chapter Combinatorics and Intuitive Probability The simplest probabilistic scenario is perhaps one where the set of possible outcomes is finite and these outcomes are all equally likely. A subset of the
More information5 Symmetric and alternating groups
MTHM024/MTH714U Group Theory Notes 5 Autumn 2011 5 Symmetric and alternating groups In this section we examine the alternating groups A n (which are simple for n 5), prove that A 5 is the unique simple
More informationIntroduction to Combinatorial Mathematics
Introduction to Combinatorial Mathematics George Voutsadakis 1 1 Mathematics and Computer Science Lake Superior State University LSSU Math 300 George Voutsadakis (LSSU) Combinatorics April 2016 1 / 97
More informationThree of these grids share a property that the other three do not. Can you find such a property? + mod
PPMTC 22 Session 6: Mad Vet Puzzles Session 6: Mad Veterinarian Puzzles There is a collection of problems that have come to be known as "Mad Veterinarian Puzzles", for reasons which will soon become obvious.
More informationMA10103: Foundation Mathematics I. Lecture Notes Week 3
MA10103: Foundation Mathematics I Lecture Notes Week 3 Indices/Powers In an expression a n, a is called the base and n is called the index or power or exponent. Multiplication/Division of Powers a 3 a
More informationCompound Probability. Set Theory. Basic Definitions
Compound Probability Set Theory A probability measure P is a function that maps subsets of the state space Ω to numbers in the interval [0, 1]. In order to study these functions, we need to know some basic
More informationMA/CSSE 473 Day 9. The algorithm (modified) N 1
MA/CSSE 473 Day 9 Primality Testing Encryption Intro The algorithm (modified) To test N for primality Pick positive integers a 1, a 2,, a k < N at random For each a i, check for a N 1 i 1 (mod N) Use the
More informationCS103 Handout 22 Fall 2017 October 16, 2017 Practice Midterm Exam 2
CS103 Handout 22 Fall 2017 October 16, 2017 Practice Midterm Exam 2 This exam is closed-book and closed-computer. You may have a double-sided, 8.5 11 sheet of notes with you when you take this exam. You
More information1 = 3 2 = 3 ( ) = = = 33( ) 98 = = =
Math 115 Discrete Math Final Exam December 13, 2000 Your name It is important that you show your work. 1. Use the Euclidean algorithm to solve the decanting problem for decanters of sizes 199 and 98. In
More informationThe Math Behind Futurama: The Prisoner of Benda
of Benda May 7, 2013 The problem (informally) Professor Farnsworth has created a mind-switching machine that switches two bodies, but the switching can t be reversed using just those two bodies. Using
More informationModular Arithmetic. Kieran Cooney - February 18, 2016
Modular Arithmetic Kieran Cooney - kieran.cooney@hotmail.com February 18, 2016 Sums and products in modular arithmetic Almost all of elementary number theory follows from one very basic theorem: Theorem.
More informationEcon 172A - Slides from Lecture 18
1 Econ 172A - Slides from Lecture 18 Joel Sobel December 4, 2012 2 Announcements 8-10 this evening (December 4) in York Hall 2262 I ll run a review session here (Solis 107) from 12:30-2 on Saturday. Quiz
More informationAn interesting class of problems of a computational nature ask for the standard residue of a power of a number, e.g.,
Binary exponentiation An interesting class of problems of a computational nature ask for the standard residue of a power of a number, e.g., What are the last two digits of the number 2 284? In the absence
More informationSMT 2014 Advanced Topics Test Solutions February 15, 2014
1. David flips a fair coin five times. Compute the probability that the fourth coin flip is the first coin flip that lands heads. 1 Answer: 16 ( ) 1 4 Solution: David must flip three tails, then heads.
More informationPublic Key Cryptography
Public Key Cryptography How mathematics allows us to send our most secret messages quite openly without revealing their contents - except only to those who are supposed to read them The mathematical ideas
More informationMathematics Explorers Club Fall 2012 Number Theory and Cryptography
Mathematics Explorers Club Fall 2012 Number Theory and Cryptography Chapter 0: Introduction Number Theory enjoys a very long history in short, number theory is a study of integers. Mathematicians over
More informationCard-Based Protocols for Securely Computing the Conjunction of Multiple Variables
Card-Based Protocols for Securely Computing the Conjunction of Multiple Variables Takaaki Mizuki Tohoku University tm-paper+cardconjweb[atmark]g-mailtohoku-universityjp Abstract Consider a deck of real
More informationLaboratory 1: Uncertainty Analysis
University of Alabama Department of Physics and Astronomy PH101 / LeClair May 26, 2014 Laboratory 1: Uncertainty Analysis Hypothesis: A statistical analysis including both mean and standard deviation can
More informationLecture 2.3: Symmetric and alternating groups
Lecture 2.3: Symmetric and alternating groups Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4120, Modern Algebra M. Macauley (Clemson)
More informationCPM EDUCATIONAL PROGRAM
CPM EDUCATIONAL PROGRAM SAMPLE LESSON: ALGEBRA TILES FOR FACTORING AND MORE HIGH SCHOOL CONTENT ALGEBRA TILES (MODELS) Algebra Tiles are models that can be used to represent abstract concepts. Th packet
More informationDyck paths, standard Young tableaux, and pattern avoiding permutations
PU. M. A. Vol. 21 (2010), No.2, pp. 265 284 Dyck paths, standard Young tableaux, and pattern avoiding permutations Hilmar Haukur Gudmundsson The Mathematics Institute Reykjavik University Iceland e-mail:
More informationMassachusetts Institute of Technology 6.042J/18.062J, Spring 04: Mathematics for Computer Science April 16 Prof. Albert R. Meyer and Dr.
Massachusetts Institute of Technology 6.042J/18.062J, Spring 04: Mathematics for Computer Science April 16 Prof. Albert R. Meyer and Dr. Eric Lehman revised April 16, 2004, 202 minutes Solutions to Quiz
More informationThe Discrete Fourier Transform. Claudia Feregrino-Uribe, Alicia Morales-Reyes Original material: Dr. René Cumplido
The Discrete Fourier Transform Claudia Feregrino-Uribe, Alicia Morales-Reyes Original material: Dr. René Cumplido CCC-INAOE Autumn 2015 The Discrete Fourier Transform Fourier analysis is a family of mathematical
More informationCounting Cube Colorings with the Cauchy-Frobenius Formula and Further Friday Fun
Counting Cube Colorings with the Cauchy-Frobenius Formula and Further Friday Fun Daniel Frohardt Wayne State University December 3, 2010 We have a large supply of squares of in 3 different colors and an
More informationThe mathematics of the flip and horseshoe shuffles
The mathematics of the flip and horseshoe shuffles Steve Butler Persi Diaconis Ron Graham Abstract We consider new types of perfect shuffles wherein a deck is split in half, one half of the deck is reversed,
More informationLatin Squares for Elementary and Middle Grades
Latin Squares for Elementary and Middle Grades Yul Inn Fun Math Club email: Yul.Inn@FunMathClub.com web: www.funmathclub.com Abstract: A Latin square is a simple combinatorial object that arises in many
More informationarxiv: v1 [cs.cc] 21 Jun 2017
Solving the Rubik s Cube Optimally is NP-complete Erik D. Demaine Sarah Eisenstat Mikhail Rudoy arxiv:1706.06708v1 [cs.cc] 21 Jun 2017 Abstract In this paper, we prove that optimally solving an n n n Rubik
More informationA NEW COMPUTATION OF THE CODIMENSION SEQUENCE OF THE GRASSMANN ALGEBRA
A NEW COMPUTATION OF THE CODIMENSION SEQUENCE OF THE GRASSMANN ALGEBRA JOEL LOUWSMA, ADILSON EDUARDO PRESOTO, AND ALAN TARR Abstract. Krakowski and Regev found a basis of polynomial identities satisfied
More informationLINEAR EQUATIONS IN TWO VARIABLES
LINEAR EQUATIONS IN TWO VARIABLES What You Should Learn Use slope to graph linear equations in two " variables. Find the slope of a line given two points on the line. Write linear equations in two variables.
More informationThe Sign of a Permutation Matt Baker
The Sign of a Permutation Matt Baker Let σ be a permutation of {1, 2,, n}, ie, a one-to-one and onto function from {1, 2,, n} to itself We will define what it means for σ to be even or odd, and then discuss
More informationDeveloping Algebraic Thinking
Developing Algebraic Thinking DEVELOPING ALGEBRAIC THINKING Algebra is an important branch of mathematics, both historically and presently. algebra has been too often misunderstood and misrepresented as
More informationTHE 15-PUZZLE (AND RUBIK S CUBE)
THE 15-PUZZLE (AND RUBIK S CUBE) KEITH CONRAD 1. Introduction A permutation puzzle is a toy where the pieces can be moved around and the object is to reassemble the pieces into their beginning state We
More informationCrossing Game Strategies
Crossing Game Strategies Chloe Avery, Xiaoyu Qiao, Talon Stark, Jerry Luo March 5, 2015 1 Strategies for Specific Knots The following are a couple of crossing game boards for which we have found which
More informationGreedy Flipping of Pancakes and Burnt Pancakes
Greedy Flipping of Pancakes and Burnt Pancakes Joe Sawada a, Aaron Williams b a School of Computer Science, University of Guelph, Canada. Research supported by NSERC. b Department of Mathematics and Statistics,
More informationSMT 2013 Advanced Topics Test Solutions February 2, 2013
1. How many positive three-digit integers a c can represent a valid date in 2013, where either a corresponds to a month and c corresponds to the day in that month, or a corresponds to a month and c corresponds
More informationSingle Error Correcting Codes (SECC) 6.02 Spring 2011 Lecture #9. Checking the parity. Using the Syndrome to Correct Errors
Single Error Correcting Codes (SECC) Basic idea: Use multiple parity bits, each covering a subset of the data bits. No two message bits belong to exactly the same subsets, so a single error will generate
More informationAL-JABAR. Concepts. A Mathematical Game of Strategy. Robert P. Schneider and Cyrus Hettle University of Kentucky
AL-JABAR A Mathematical Game of Strategy Robert P. Schneider and Cyrus Hettle University of Kentucky Concepts The game of Al-Jabar is based on concepts of color-mixing familiar to most of us from childhood,
More informationAdventures with Rubik s UFO. Bill Higgins Wittenberg University
Adventures with Rubik s UFO Bill Higgins Wittenberg University Introduction Enro Rubik invented the puzzle which is now known as Rubik s Cube in the 1970's. More than 100 million cubes have been sold worldwide.
More informationGenerating trees and pattern avoidance in alternating permutations
Generating trees and pattern avoidance in alternating permutations Joel Brewster Lewis Massachusetts Institute of Technology jblewis@math.mit.edu Submitted: Aug 6, 2011; Accepted: Jan 10, 2012; Published:
More informationPrinciple of Inclusion-Exclusion Notes
Principle of Inclusion-Exclusion Notes The Principle of Inclusion-Exclusion (often abbreviated PIE is the following general formula used for finding the cardinality of a union of finite sets. Theorem 0.1.
More informationMAT points Impact on Course Grade: approximately 10%
MAT 409 Test #3 60 points Impact on Course Grade: approximately 10% Name Score Solve each problem based on the information provided. It is not necessary to complete every calculation. That is, your responses
More informationBlock 1 - Sets and Basic Combinatorics. Main Topics in Block 1:
Block 1 - Sets and Basic Combinatorics Main Topics in Block 1: A short revision of some set theory Sets and subsets. Venn diagrams to represent sets. Describing sets using rules of inclusion. Set operations.
More informationGLOSSARY. a * (b * c) = (a * b) * c. A property of operations. An operation * is called associative if:
Associativity A property of operations. An operation * is called associative if: a * (b * c) = (a * b) * c for every possible a, b, and c. Axiom For Greek geometry, an axiom was a 'self-evident truth'.
More informationAnalysis on the Properties of a Permutation Group
International Journal of Theoretical and Applied Mathematics 2017; 3(1): 19-24 http://www.sciencepublishinggroup.com/j/ijtam doi: 10.11648/j.ijtam.20170301.13 Analysis on the Properties of a Permutation
More informationOn uniquely k-determined permutations
On uniquely k-determined permutations Sergey Avgustinovich and Sergey Kitaev 16th March 2007 Abstract Motivated by a new point of view to study occurrences of consecutive patterns in permutations, we introduce
More informationMATH 351 Fall 2009 Homework 1 Due: Wednesday, September 30
MATH 51 Fall 2009 Homework 1 Due: Wednesday, September 0 Problem 1. How many different letter arrangements can be made from the letters BOOKKEEPER. This is analogous to one of the problems presented in
More informationGRADE 3 TEKS ALIGNMENT CHART
GRADE 3 TEKS ALIGNMENT CHART TEKS 3.2.A compose and decompose numbers up to,000 as the sum of so many ten thousands, so many thousands, so many hundreds, so many tens, and so many ones using objects, pictorial
More information28,800 Extremely Magic 5 5 Squares Arthur Holshouser. Harold Reiter.
28,800 Extremely Magic 5 5 Squares Arthur Holshouser 3600 Bullard St. Charlotte, NC, USA Harold Reiter Department of Mathematics, University of North Carolina Charlotte, Charlotte, NC 28223, USA hbreiter@uncc.edu
More informationUpdated December Year. Small Steps Guidance and Examples. Block 4: Multiplication & Division
Updated December 2017 Year 5 Small Steps Guidance and Examples Block 4: Multiplication & Division Year 5 Autumn Term Teaching Guidance Multiples Notes and Guidance Building on their times tables knowledge,
More informationTopspin: Oval-Track Puzzle, Taking Apart The Topspin One Tile At A Time
Salem State University Digital Commons at Salem State University Honors Theses Student Scholarship Fall 2015-01-01 Topspin: Oval-Track Puzzle, Taking Apart The Topspin One Tile At A Time Elizabeth Fitzgerald
More informationRotational Puzzles on Graphs
Rotational Puzzles on Graphs On this page I will discuss various graph puzzles, or rather, permutation puzzles consisting of partially overlapping cycles. This was first investigated by R.M. Wilson in
More informationPermutations and Combinations
Permutations and Combinations Introduction Permutations and combinations refer to number of ways of selecting a number of distinct objects from a set of distinct objects. Permutations are ordered selections;
More informationError Detection and Correction
. Error Detection and Companies, 27 CHAPTER Error Detection and Networks must be able to transfer data from one device to another with acceptable accuracy. For most applications, a system must guarantee
More informationContent Area: Mathematics- 3 rd Grade
Unit: Operations and Algebraic Thinking Topic: Multiplication and Division Strategies Multiplication is grouping objects into sets which is a repeated form of addition. What are the different meanings
More informationACTIVITY 6.7 Selecting and Rearranging Things
ACTIVITY 6.7 SELECTING AND REARRANGING THINGS 757 OBJECTIVES ACTIVITY 6.7 Selecting and Rearranging Things 1. Determine the number of permutations. 2. Determine the number of combinations. 3. Recognize
More informationCoding for Efficiency
Let s suppose that, over some channel, we want to transmit text containing only 4 symbols, a, b, c, and d. Further, let s suppose they have a probability of occurrence in any block of text we send as follows
More informationThe congruence relation has many similarities to equality. The following theorem says that congruence, like equality, is an equivalence relation.
Congruences A congruence is a statement about divisibility. It is a notation that simplifies reasoning about divisibility. It suggests proofs by its analogy to equations. Congruences are familiar to us
More informationPERMUTATIONS - II JUNIOR CIRCLE 11/17/2013
PERMUTATIONS - II JUNIOR CIRCLE 11/17/2013 Operations on Permutations. Among all the permutations of n objects one stands out as the simplest: all the objects stay in their places. This permutationiscalledthe
More informationThe mathematics of the flip and horseshoe shuffles
The mathematics of the flip and horseshoe shuffles Steve Butler Persi Diaconis Ron Graham Abstract We consider new types of perfect shuffles wherein a deck is split in half, one half of the deck is reversed,
More informationYou ve seen them played in coffee shops, on planes, and
Every Sudoku variation you can think of comes with its own set of interesting open questions There is math to be had here. So get working! Taking Sudoku Seriously Laura Taalman James Madison University
More information6.2 Modular Arithmetic
6.2 Modular Arithmetic Every reader is familiar with arithmetic from the time they are three or four years old. It is the study of numbers and various ways in which we can combine them, such as through
More information