Factorization of permutation
|
|
- Sharon Riley
- 5 years ago
- Views:
Transcription
1 Department of Mathematics College of William and Mary Based on the paper: Zejun Huang,, Sharon H. Li, Nung-Sing Sze,
2 Amidakuji/Ghost Leg Drawing
3 Amidakuji/Ghost Leg Drawing It is a scheme for assigning n people P 1,..., P n to n jobs J 1,..., J n randomly.
4 Amidakuji/Ghost Leg Drawing It is a scheme for assigning n people P 1,..., P n to n jobs J 1,..., J n randomly. Draw vertical lines from P i to J i from i = 1,..., n.
5 Amidakuji/Ghost Leg Drawing It is a scheme for assigning n people P 1,..., P n to n jobs J 1,..., J n randomly. Draw vertical lines from P i to J i from i = 1,..., n. Draw some horizontal line segments randomly between any two vertical lines that are next to each other so that no horizontal lines meet.
6 Amidakuji/Ghost Leg Drawing It is a scheme for assigning n people P 1,..., P n to n jobs J 1,..., J n randomly. Draw vertical lines from P i to J i from i = 1,..., n. Draw some horizontal line segments randomly between any two vertical lines that are next to each other so that no horizontal lines meet. To assign a job for P i, start from the top of the i-th line to the bottom, and make a turn whenever a horizontal segment is encountered.
7 Amidakuji/Ghost Leg Drawing It is a scheme for assigning n people P 1,..., P n to n jobs J 1,..., J n randomly. Draw vertical lines from P i to J i from i = 1,..., n. Draw some horizontal line segments randomly between any two vertical lines that are next to each other so that no horizontal lines meet. To assign a job for P i, start from the top of the i-th line to the bottom, and make a turn whenever a horizontal segment is encountered. Questions Why do we always get an one-one correspondence (bijection)?
8 Amidakuji/Ghost Leg Drawing It is a scheme for assigning n people P 1,..., P n to n jobs J 1,..., J n randomly. Draw vertical lines from P i to J i from i = 1,..., n. Draw some horizontal line segments randomly between any two vertical lines that are next to each other so that no horizontal lines meet. To assign a job for P i, start from the top of the i-th line to the bottom, and make a turn whenever a horizontal segment is encountered. Questions Why do we always get an one-one correspondence (bijection)? Can we get all possible job assignments?
9 Amidakuji/Ghost Leg Drawing It is a scheme for assigning n people P 1,..., P n to n jobs J 1,..., J n randomly. Draw vertical lines from P i to J i from i = 1,..., n. Draw some horizontal line segments randomly between any two vertical lines that are next to each other so that no horizontal lines meet. To assign a job for P i, start from the top of the i-th line to the bottom, and make a turn whenever a horizontal segment is encountered. Questions Why do we always get an one-one correspondence (bijection)? Can we get all possible job assignments? What is the minimum number of horizontal segments needed for a given job assignment?
10 Answer of Question 1 George Polya ( ) If one cannot solve a problem, one can try to solve an easier problem first.
11 Answer of Question 1 George Polya ( ) If one cannot solve a problem, one can try to solve an easier problem first. What if there is no horizontal line segment?
12 Answer of Question 1 George Polya ( ) If one cannot solve a problem, one can try to solve an easier problem first. What if there is no horizontal line segment? What if there is one horizontal line segment?
13 Answer of Question 1 George Polya ( ) If one cannot solve a problem, one can try to solve an easier problem first. What if there is no horizontal line segment? What if there is one horizontal line segment? An easy induction argument!
14 Bubble sort Regard the job assignment as a permutation (a seat assignment) ( ) 1 2 n σ = [i 1,..., i n] =. i 1 i 2 i n
15 Bubble sort Regard the job assignment as a permutation (a seat assignment) ( ) 1 2 n σ = [i 1,..., i n] =. i 1 i 2 i n Use Coxeter transpositions (i, i + 1) for i = 1,..., n 1.
16 Bubble sort Regard the job assignment as a permutation (a seat assignment) ( ) 1 2 n σ = [i 1,..., i n] =. i 1 i 2 i n Use Coxeter transpositions (i, i + 1) for i = 1,..., n 1. For any σ, we can determine the total number ι(σ) of inversions of σ.
17 Bubble sort Regard the job assignment as a permutation (a seat assignment) ( ) 1 2 n σ = [i 1,..., i n] =. i 1 i 2 i n Use Coxeter transpositions (i, i + 1) for i = 1,..., n 1. For any σ, we can determine the total number ι(σ) of inversions of σ. It is the minimum number of Coxeter transpositions needed to generate σ.
18 Bubble sort Regard the job assignment as a permutation (a seat assignment) ( ) 1 2 n σ = [i 1,..., i n] =. i 1 i 2 i n Use Coxeter transpositions (i, i + 1) for i = 1,..., n 1. For any σ, we can determine the total number ι(σ) of inversions of σ. It is the minimum number of Coxeter transpositions needed to generate σ. Example For σ = [5, 3, 1, 2, 4], total number of inversions is: = 6, and σ [3, 5, 1, 2, 4] [3, 1, 5, 2, 4] [3, 1, 2, 5, 4] [3, 1, 2, 4, 5] [1, 3, 2, 4, 5] [1, 2, 3, 4, 5],
19 Bubble sort Regard the job assignment as a permutation (a seat assignment) ( ) 1 2 n σ = [i 1,..., i n] =. i 1 i 2 i n Use Coxeter transpositions (i, i + 1) for i = 1,..., n 1. For any σ, we can determine the total number ι(σ) of inversions of σ. It is the minimum number of Coxeter transpositions needed to generate σ. Example For σ = [5, 3, 1, 2, 4], total number of inversions is: = 6, and σ [3, 5, 1, 2, 4] [3, 1, 5, 2, 4] [3, 1, 2, 5, 4] [3, 1, 2, 4, 5] [1, 3, 2, 4, 5] [1, 2, 3, 4, 5], So σ = (1, 2)(2, 3)(3, 4)(4, 5)(1, 2)(2, 3).
20 Bubble sort Regard the job assignment as a permutation (a seat assignment) ( ) 1 2 n σ = [i 1,..., i n] =. i 1 i 2 i n Use Coxeter transpositions (i, i + 1) for i = 1,..., n 1. For any σ, we can determine the total number ι(σ) of inversions of σ. It is the minimum number of Coxeter transpositions needed to generate σ. Example For σ = [5, 3, 1, 2, 4], total number of inversions is: = 6, and σ [3, 5, 1, 2, 4] [3, 1, 5, 2, 4] [3, 1, 2, 5, 4] [3, 1, 2, 4, 5] [1, 3, 2, 4, 5] [1, 2, 3, 4, 5], So σ = (1, 2)(2, 3)(3, 4)(4, 5)(1, 2)(2, 3). Answers of Questions 2 and 3 We can always convert a permutation σ to [1,..., n] using ι(σ) steps, where ι(σ) is the number of inversions of σ.
21 Bubble sort Regard the job assignment as a permutation (a seat assignment) ( ) 1 2 n σ = [i 1,..., i n] =. i 1 i 2 i n Use Coxeter transpositions (i, i + 1) for i = 1,..., n 1. For any σ, we can determine the total number ι(σ) of inversions of σ. It is the minimum number of Coxeter transpositions needed to generate σ. Example For σ = [5, 3, 1, 2, 4], total number of inversions is: = 6, and σ [3, 5, 1, 2, 4] [3, 1, 5, 2, 4] [3, 1, 2, 5, 4] [3, 1, 2, 4, 5] [1, 3, 2, 4, 5] [1, 2, 3, 4, 5], So σ = (1, 2)(2, 3)(3, 4)(4, 5)(1, 2)(2, 3). Answers of Questions 2 and 3 We can always convert a permutation σ to [1,..., n] using ι(σ) steps, where ι(σ) is the number of inversions of σ. Worst case occurs at [n, n 1,..., 1]; which requires
22 Bubble sort Regard the job assignment as a permutation (a seat assignment) ( ) 1 2 n σ = [i 1,..., i n] =. i 1 i 2 i n Use Coxeter transpositions (i, i + 1) for i = 1,..., n 1. For any σ, we can determine the total number ι(σ) of inversions of σ. It is the minimum number of Coxeter transpositions needed to generate σ. Example For σ = [5, 3, 1, 2, 4], total number of inversions is: = 6, and σ [3, 5, 1, 2, 4] [3, 1, 5, 2, 4] [3, 1, 2, 5, 4] [3, 1, 2, 4, 5] [1, 3, 2, 4, 5] [1, 2, 3, 4, 5], So σ = (1, 2)(2, 3)(3, 4)(4, 5)(1, 2)(2, 3). Answers of Questions 2 and 3 We can always convert a permutation σ to [1,..., n] using ι(σ) steps, where ι(σ) is the number of inversions of σ. Worst case occurs at [n, n 1,..., 1]; which requires (n 1) = n(n 1)/2 steps.
23 A variation of Amidakuji What if we consider transpositions of the forms (i, i + 1) and (i, i + 2)?
24 A variation of Amidakuji What if we consider transpositions of the forms (i, i + 1) and (i, i + 2)? How about using transpositions (i, i + 1), (i, i + 2), (i, i + 3), etc.?
25 A variation of Amidakuji What if we consider transpositions of the forms (i, i + 1) and (i, i + 2)? How about using transpositions (i, i + 1), (i, i + 2), (i, i + 3), etc.? An extreme case: Using all (i, j) with 1 j < n Decompose σ as product of k disjoint cycles (including fixed points).
26 A variation of Amidakuji What if we consider transpositions of the forms (i, i + 1) and (i, i + 2)? How about using transpositions (i, i + 1), (i, i + 2), (i, i + 3), etc.? An extreme case: Using all (i, j) with 1 j < n Decompose σ as product of k disjoint cycles (including fixed points). Then σ is a product of n k transpositions.
27 A variation of Amidakuji What if we consider transpositions of the forms (i, i + 1) and (i, i + 2)? How about using transpositions (i, i + 1), (i, i + 2), (i, i + 3), etc.? An extreme case: Using all (i, j) with 1 j < n Decompose σ as product of k disjoint cycles (including fixed points). Then σ is a product of n k transpositions. So, the worst case requires n 1 steps.
28 A variation of Amidakuji What if we consider transpositions of the forms (i, i + 1) and (i, i + 2)? How about using transpositions (i, i + 1), (i, i + 2), (i, i + 3), etc.? An extreme case: Using all (i, j) with 1 j < n Decompose σ as product of k disjoint cycles (including fixed points). Then σ is a product of n k transpositions. So, the worst case requires n 1 steps. Example. σ = ( ) = (1, 3, 5, 6, 7)(2, 4, 9)(8)
29 A variation of Amidakuji What if we consider transpositions of the forms (i, i + 1) and (i, i + 2)? How about using transpositions (i, i + 1), (i, i + 2), (i, i + 3), etc.? An extreme case: Using all (i, j) with 1 j < n Decompose σ as product of k disjoint cycles (including fixed points). Then σ is a product of n k transpositions. So, the worst case requires n 1 steps. Example. σ = ( ) = (1, 3, 5, 6, 7)(2, 4, 9)(8) Then σ = (1, 7)(1, 6)(1, 5)(1, 3)(2, 9)(2, 4).
30 Some open problems Let 1 m < n, and let G m be the set of transpositions of the form (i, i + l) with 1 l m.
31 Some open problems Let 1 m < n, and let G m be the set of transpositions of the form (i, i + l) with 1 l m. For a given σ S n, find the smallest r such that σ is the product of r transpositions in G m.
32 Some open problems Let 1 m < n, and let G m be the set of transpositions of the form (i, i + l) with 1 l m. For a given σ S n, find the smallest r such that σ is the product of r transpositions in G m. Determine the optimal (smallest) r = r (n, m) so that every σ S n is a product at most r transpositions in G m.
33 Some open problems Let 1 m < n, and let G m be the set of transpositions of the form (i, i + l) with 1 l m. For a given σ S n, find the smallest r such that σ is the product of r transpositions in G m. Determine the optimal (smallest) r = r (n, m) so that every σ S n is a product at most r transpositions in G m. To find r and the permutation which is most difficult to get restore, we use the breadth first search.
34 Partial results of the general problem We have the following list for r (n, m) for S n and (i, i + l) with l m, n\m [7] [10] [14] [10] [16] [11] [19] [14] [12] [23] [16] [14] where the entries marked by brackets are obtained by computer programming.
35 Another variation (The round table version) Theorem [Jerrum, 1985], [van Zuylen et. al, 2014] Only use transpositions: (n, 1) and (i, i + 1) : i = 1,..., n 1.
36 Another variation (The round table version) Theorem [Jerrum, 1985], [van Zuylen et. al, 2014] Only use transpositions: (n, 1) and (i, i + 1) : i = 1,..., n 1. Given a permutation [p 1,..., p n].
37 Another variation (The round table version) Theorem [Jerrum, 1985], [van Zuylen et. al, 2014] Only use transpositions: (n, 1) and (i, i + 1) : i = 1,..., n 1. Given a permutation [p 1,..., p n]. let d = [d 1,..., d n] = [p 1,, p n] [1,..., n] so that d i = 0;
38 Another variation (The round table version) Theorem [Jerrum, 1985], [van Zuylen et. al, 2014] Only use transpositions: (n, 1) and (i, i + 1) : i = 1,..., n 1. Given a permutation [p 1,..., p n]. let d = [d 1,..., d n] = [p 1,, p n] [1,..., n] so that d i = 0; modify d to d by replacing (d i, d j) by (d i n, n + d j) if d i d j > n until p r p s n for all r, s.
39 Another variation (The round table version) Theorem [Jerrum, 1985], [van Zuylen et. al, 2014] Only use transpositions: (n, 1) and (i, i + 1) : i = 1,..., n 1. Given a permutation [p 1,..., p n]. let d = [d 1,..., d n] = [p 1,, p n] [1,..., n] so that d i = 0; modify d to d by replacing (d i, d j) by (d i n, n + d j) if d i d j > n until p r p s n for all r, s. Restore the permutation using this displacement vector d will use the minimum number of steps ι( d),
40 Another variation (The round table version) Theorem [Jerrum, 1985], [van Zuylen et. al, 2014] Only use transpositions: (n, 1) and (i, i + 1) : i = 1,..., n 1. Given a permutation [p 1,..., p n]. let d = [d 1,..., d n] = [p 1,, p n] [1,..., n] so that d i = 0; modify d to d by replacing (d i, d j) by (d i n, n + d j) if d i d j > n until p r p s n for all r, s. Restore the permutation using this displacement vector d will use the minimum number of steps ι( d), which is the generalized inversion number of p = d + [1,..., n].
41 Another variation (The round table version) Theorem [Jerrum, 1985], [van Zuylen et. al, 2014] Only use transpositions: (n, 1) and (i, i + 1) : i = 1,..., n 1. Given a permutation [p 1,..., p n]. let d = [d 1,..., d n] = [p 1,, p n] [1,..., n] so that d i = 0; modify d to d by replacing (d i, d j) by (d i n, n + d j) if d i d j > n until p r p s n for all r, s. Restore the permutation using this displacement vector d will use the minimum number of steps ι( d), which is the generalized inversion number of p = d + [1,..., n]. The number of steps is at most [n 2 /4] attained at the following permutation: (1) [k + 1,..., n, 1,..., k] if n = 2k or n = 2k + 1, (2) [k + 2,..., n, 1,..., k + 1] or [k + 1,..., n, 1,..., k] if n = 2k + 1.
42 Another variation (The round table version) Theorem [Jerrum, 1985], [van Zuylen et. al, 2014] Only use transpositions: (n, 1) and (i, i + 1) : i = 1,..., n 1. Given a permutation [p 1,..., p n]. let d = [d 1,..., d n] = [p 1,, p n] [1,..., n] so that d i = 0; modify d to d by replacing (d i, d j) by (d i n, n + d j) if d i d j > n until p r p s n for all r, s. Restore the permutation using this displacement vector d will use the minimum number of steps ι( d), which is the generalized inversion number of p = d + [1,..., n]. The number of steps is at most [n 2 /4] attained at the following permutation: (1) [k + 1,..., n, 1,..., k] if n = 2k or n = 2k + 1, (2) [k + 2,..., n, 1,..., k + 1] or [k + 1,..., n, 1,..., k] if n = 2k + 1. Example p = [6, 5, 1, 2, 4, 3], d = [5, 3, 2, 2, 1, 3], d = [ 1, 3, 2, 2, 1, 3], p = [0, 5, 1, 2, 4, 9], ι( d) = 6, Note For [4, 5, 6, 1, 2, 3], d = [3, 3, 3, 3, 3, 3] and ι(d) = 9 = [6 2 /4].
43 Some open problems What if we can use the the circular permutations (i, j) with j i k with k = 1, 2,... in the round table problem?
44 Some open problems What if we can use the the circular permutations (i, j) with j i k with k = 1, 2,... in the round table problem? One can use L = (1, 2,..., n) and S = (1, 2) to generate all permutations. Then the maximum steps needed are: S 2 S 3 S 4 S 5 S 6 S 7 S 8 S 9 S 10 S 11 S ???
45 Some open problems What if we can use the the circular permutations (i, j) with j i k with k = 1, 2,... in the round table problem? One can use L = (1, 2,..., n) and S = (1, 2) to generate all permutations. Then the maximum steps needed are: S 2 S 3 S 4 S 5 S 6 S 7 S 8 S 9 S 10 S 11 S ??? If we use L, S, L 1, then the maximum steps needed are: S 2 S 3 S 4 S 5 S 6 S 7 S 8 S 9 S 10 S ??? Conjecture We need at most ( n 2) steps, and the worst case is [2, 1, n, n 1,..., 3].
46 Related research Theoretical computer science?
47 Related research Theoretical computer science? Determine the optimal sorting algorithm with the given operations, and determine the worst scenario.
48 Related research Theoretical computer science? Determine the optimal sorting algorithm with the given operations, and determine the worst scenario. The study of genomics and mutations,
49 Related research Theoretical computer science? Determine the optimal sorting algorithm with the given operations, and determine the worst scenario. The study of genomics and mutations, i.e., the change of genetic sequences x 1x 2x 3, with x i {A, U, G, C}.
50 Related research Theoretical computer science? Determine the optimal sorting algorithm with the given operations, and determine the worst scenario. The study of genomics and mutations, i.e., the change of genetic sequences x 1x 2x 3, with x i {A, U, G, C}. Quantum computing. It is of interest to decompose certain quantum gates into simpler quantum gates (CNOT gates).
51 Let me know if you have any thought!
52 Let me know if you have any thought! Thank you for your attention!
X = {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 informationExploiting the disjoint cycle decomposition in genome rearrangements
Exploiting the disjoint cycle decomposition in genome rearrangements Jean-Paul Doignon Anthony Labarre 1 doignon@ulb.ac.be alabarre@ulb.ac.be Université Libre de Bruxelles June 7th, 2007 Ordinal and Symbolic
More informationPERMUTATIONS AS PRODUCT OF PARALLEL TRANSPOSITIONS *
SIAM J. DISCRETE MATH. Vol. 25, No. 3, pp. 1412 1417 2011 Society for Industrial and Applied Mathematics PERMUTATIONS AS PRODUCT OF PARALLEL TRANSPOSITIONS * CHASE ALBERT, CHI-KWONG LI, GILBERT STRANG,
More informationA group-theoretic approach to inversion distance
A group-theoretic approach to inversion distance Andrew R Francis Centre for Research in Mathematics University of Western Sydney Australia Algebraic Statistics 2014 at IIT. Andrew R Francis (CRM @ UWS)
More informationSolitaire Games. MATH 171 Freshman Seminar for Mathematics Majors. J. Robert Buchanan. Department of Mathematics. Fall 2010
Solitaire Games MATH 171 Freshman Seminar for Mathematics Majors J. Robert Buchanan Department of Mathematics Fall 2010 Standard Checkerboard Challenge 1 Suppose two diagonally opposite corners of the
More information((( ))) CS 19: Discrete Mathematics. Please feel free to ask questions! Getting into the mood. Pancakes With A Problem!
CS : Discrete Mathematics Professor Amit Chakrabarti Please feel free to ask questions! ((( ))) Teaching Assistants Chien-Chung Huang David Blinn http://www.cs cs.dartmouth.edu/~cs Getting into the mood
More informationNovember 8, Chapter 8: Probability: The Mathematics of Chance
Chapter 8: Probability: The Mathematics of Chance November 8, 2013 Last Time Probability Models and Rules Discrete Probability Models Equally Likely Outcomes Crystallographic notation The first symbol
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 informationWeighted Polya Theorem. Solitaire
Weighted Polya Theorem. Solitaire Sasha Patotski Cornell University ap744@cornell.edu December 15, 2015 Sasha Patotski (Cornell University) Weighted Polya Theorem. Solitaire December 15, 2015 1 / 15 Cosets
More informationREU 2006 Discrete Math Lecture 3
REU 006 Discrete Math Lecture 3 Instructor: László Babai Scribe: Elizabeth Beazley Editors: Eliana Zoque and Elizabeth Beazley NOT PROOFREAD - CONTAINS ERRORS June 6, 006. Last updated June 7, 006 at :4
More informationFifteen puzzle. Sasha Patotski. Cornell University November 16, 2015
Fifteen puzzle. Sasha Patotski Cornell University ap744@cornell.edu November 16, 2015 Sasha Patotski (Cornell University) Fifteen puzzle. November 16, 2015 1 / 7 Last time The permutation group S n is
More informationFaculty Forum You Cannot Conceive The Many Without The One -Plato-
Faculty Forum You Cannot Conceive The Many Without The One -Plato- Issue No. 17, Fall 2012 December 5, 2012 Japanese Ladder Game WEI-KAI LAI Assistant Professor of Mathematics (Joint work with Christopher
More informationMATH 433 Applied Algebra Lecture 12: Sign of a permutation (continued). Abstract groups.
MATH 433 Applied Algebra Lecture 12: Sign of a permutation (continued). Abstract groups. Permutations Let X be a finite set. A permutation of X is a bijection from X to itself. The set of all permutations
More informationCounting Permutations by Putting Balls into Boxes
Counting Permutations by Putting Balls into Boxes Ira M. Gessel Brandeis University C&O@40 Conference June 19, 2007 I will tell you shamelessly what my bottom line is: It is placing balls into boxes. Gian-Carlo
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 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 informationLossy Compression of Permutations
204 IEEE International Symposium on Information Theory Lossy Compression of Permutations Da Wang EECS Dept., MIT Cambridge, MA, USA Email: dawang@mit.edu Arya Mazumdar ECE Dept., Univ. of Minnesota Twin
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 informationA stack and a pop stack in series
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 8(1) (2014), Pages 17 171 A stack and a pop stack in series Rebecca Smith Department of Mathematics SUNY Brockport, New York U.S.A. Vincent Vatter Department
More informationEnumeration of Two Particular Sets of Minimal Permutations
3 47 6 3 Journal of Integer Sequences, Vol. 8 (05), Article 5.0. Enumeration of Two Particular Sets of Minimal Permutations Stefano Bilotta, Elisabetta Grazzini, and Elisa Pergola Dipartimento di Matematica
More informationA Genetic Approach with a Simple Fitness Function for Sorting Unsigned Permutations by Reversals
A Genetic Approach with a Simple Fitness Function for Sorting Unsigned Permutations by Reversals José Luis Soncco Álvarez Department of Computer Science University of Brasilia Brasilia, D.F., Brazil Email:
More informationAlgorithms for Bioinformatics
Adapted from slides by Alexandru Tomescu, Leena Salmela, Veli Mäkinen, Esa Pitkänen 582670 Algorithms for Bioinformatics Lecture 3: Greedy Algorithms and Genomic Rearrangements 11.9.2014 Background We
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 informationOn Hultman Numbers. 1 Introduction
47 6 Journal of Integer Sequences, Vol 0 (007, Article 076 On Hultman Numbers Jean-Paul Doignon and Anthony Labarre Université Libre de Bruxelles Département de Mathématique, cp 6 Bd du Triomphe B-050
More information132-avoiding Two-stack Sortable Permutations, Fibonacci Numbers, and Pell Numbers
132-avoiding Two-stack Sortable Permutations, Fibonacci Numbers, and Pell Numbers arxiv:math/0205206v1 [math.co] 19 May 2002 Eric S. Egge Department of Mathematics Gettysburg College Gettysburg, PA 17325
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 informationHow good is simple reversal sort? Cycle decompositions. Cycle decompositions. Estimating reversal distance by cycle decomposition
How good is simple reversal sort? p Not so good actually p It has to do at most n-1 reversals with permutation of length n p The algorithm can return a distance that is as large as (n 1)/2 times the correct
More informationCS100: DISCRETE STRUCTURES. Lecture 8 Counting - CH6
CS100: DISCRETE STRUCTURES Lecture 8 Counting - CH6 Lecture Overview 2 6.1 The Basics of Counting: THE PRODUCT RULE THE SUM RULE THE SUBTRACTION RULE THE DIVISION RULE 6.2 The Pigeonhole Principle. 6.3
More informationA Approximation Algorithm for Sorting by Transpositions
A 1.375-Approximation Algorithm for Sorting by Transpositions Isaac Elias 1 and Tzvika Hartman 2 1 Dept. of Numerical Analysis and Computer Science, Royal Institute of Technology, Stockholm, Sweden. isaac@nada.kth.se.
More informationA 2-Approximation Algorithm for Sorting by Prefix Reversals
A 2-Approximation Algorithm for Sorting by Prefix Reversals c Springer-Verlag Johannes Fischer and Simon W. Ginzinger LFE Bioinformatik und Praktische Informatik Ludwig-Maximilians-Universität München
More informationKnow how to represent permutations in the two rowed notation, and how to multiply permutations using this notation.
The third exam will be on Monday, November 21, 2011. It will cover Sections 5.1-5.5. Of course, the material is cumulative, and the listed sections depend on earlier sections, which it is assumed that
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 informationDesign and Analysis of Algorithms Prof. Madhavan Mukund Chennai Mathematical Institute. Module 6 Lecture - 37 Divide and Conquer: Counting Inversions
Design and Analysis of Algorithms Prof. Madhavan Mukund Chennai Mathematical Institute Module 6 Lecture - 37 Divide and Conquer: Counting Inversions Let us go back and look at Divide and Conquer again.
More informationPermutation Tableaux and the Dashed Permutation Pattern 32 1
Permutation Tableaux and the Dashed Permutation Pattern William Y.C. Chen, Lewis H. Liu, Center for Combinatorics, LPMC-TJKLC Nankai University, Tianjin 7, P.R. China chen@nankai.edu.cn, lewis@cfc.nankai.edu.cn
More informationDomino Tilings of Aztec Diamonds, Baxter Permutations, and Snow Leopard Permutations
Domino Tilings of Aztec Diamonds, Baxter Permutations, and Snow Leopard Permutations Benjamin Caffrey 212 N. Blount St. Madison, WI 53703 bjc.caffrey@gmail.com Eric S. Egge Department of Mathematics and
More informationISudoku. Jonathon Makepeace Matthew Harris Jamie Sparrow Julian Hillebrand
Jonathon Makepeace Matthew Harris Jamie Sparrow Julian Hillebrand ISudoku Abstract In this paper, we will analyze and discuss the Sudoku puzzle and implement different algorithms to solve the puzzle. After
More informationEdit Distances and Factorisations of Even Permutations
Edit Distances and Factorisations of Even Permutations Anthony Labarre Université libre de Bruxelles (ULB), Département de Mathématique, CP 16 Service de Géométrie, Combinatoire et Théorie des Groupes
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 informationThird Grade: Mathematics. Unit 1: Math Strategies
Third Grade: Mathematics Unit 1: Math Strategies Math Strategies for Addition Open Number Line (Adding Up) The example below shows 543 + 387 using the open number line. First, you need to draw a blank
More informationCounting. Chapter 6. With Question/Answer Animations
. All rights reserved. Authorized only for instructor use in the classroom. No reproduction or further distribution permitted without the prior written consent of McGraw-Hill Education. Counting Chapter
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 informationON SOME PROPERTIES OF PERMUTATION TABLEAUX
ON SOME PROPERTIES OF PERMUTATION TABLEAUX ALEXANDER BURSTEIN Abstract. We consider the relation between various permutation statistics and properties of permutation tableaux. We answer some of the questions
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 informationNovember 11, Chapter 8: Probability: The Mathematics of Chance
Chapter 8: Probability: The Mathematics of Chance November 11, 2013 Last Time Probability Models and Rules Discrete Probability Models Equally Likely Outcomes Probability Rules Probability Rules Rule 1.
More informationSection II.9. Orbits, Cycles, and the Alternating Groups
II.9 Orbits, Cycles, Alternating Groups 1 Section II.9. Orbits, Cycles, and the Alternating Groups Note. In this section, we explore permutations more deeply and introduce an important subgroup of S n.
More informationNovember 6, Chapter 8: Probability: The Mathematics of Chance
Chapter 8: Probability: The Mathematics of Chance November 6, 2013 Last Time Crystallographic notation Groups Crystallographic notation The first symbol is always a p, which indicates that the pattern
More informationThe Art of Counting. Bijections, Double Counting. Peng Shi. September 16, Department of Mathematics Duke University
The Art of Counting Bijections, Double Counting Peng Shi Department of Mathematics Duke University September 16, 2009 What we focus on in this talk? Enumerative combinatorics is a huge branch of mathematics,
More informationCS3334 Data Structures Lecture 4: Bubble Sort & Insertion Sort. Chee Wei Tan
CS3334 Data Structures Lecture 4: Bubble Sort & Insertion Sort Chee Wei Tan Sorting Since Time Immemorial Plimpton 322 Tablet: Sorted Pythagorean Triples https://www.maa.org/sites/default/files/pdf/news/monthly105-120.pdf
More informationBounds for Cut-and-Paste Sorting of Permutations
Bounds for Cut-and-Paste Sorting of Permutations Daniel Cranston Hal Sudborough Douglas B. West March 3, 2005 Abstract We consider the problem of determining the maximum number of moves required to sort
More informationGreedy Algorithms and Genome Rearrangements
Greedy Algorithms and Genome Rearrangements 1. Transforming Cabbage into Turnip 2. Genome Rearrangements 3. Sorting By Reversals 4. Pancake Flipping Problem 5. Greedy Algorithm for Sorting by Reversals
More informationPermutation classes and infinite antichains
Permutation classes and infinite antichains Robert Brignall Based on joint work with David Bevan and Nik Ruškuc Dartmouth College, 12th July 2018 Typical questions in PP For a permutation class C: What
More informationPermutations with short monotone subsequences
Permutations with short monotone subsequences Dan Romik Abstract We consider permutations of 1, 2,..., n 2 whose longest monotone subsequence is of length n and are therefore extremal for the Erdős-Szekeres
More informationChained Permutations. Dylan Heuer. North Dakota State University. July 26, 2018
Chained Permutations Dylan Heuer North Dakota State University July 26, 2018 Three person chessboard Three person chessboard Three person chessboard Three person chessboard - Rearranged Two new families
More informationTHE SIGN OF A PERMUTATION
THE SIGN OF A PERMUTATION KEITH CONRAD 1. Introduction Throughout this discussion, n 2. Any cycle in S n is a product of transpositions: the identity (1) is (12)(12), and a k-cycle with k 2 can be written
More informationLecture 3 Presentations and more Great Groups
Lecture Presentations and more Great Groups From last time: A subset of elements S G with the property that every element of G can be written as a finite product of elements of S and their inverses is
More informationWith Question/Answer Animations. Chapter 6
With Question/Answer Animations Chapter 6 Chapter Summary The Basics of Counting The Pigeonhole Principle Permutations and Combinations Binomial Coefficients and Identities Generalized Permutations and
More informationGeorgia Department of Education Common Core Georgia Performance Standards Framework Student Edition Accelerated CCGPS Pre-Calculus Unit 6
Walking and Flying Around Hogsmeade Harry Potter needs to make a few stops around Hogsmeade. Harry s broom is broken, so he must walk between the buildings. The town is laid out in square blocks, which
More informationarxiv: v2 [math.co] 16 Dec 2014
SORTING PERMUTATIONS: GAMES, GENOMES, AND CYCLES K.L.M. ADAMYK, E. HOLMES, G.R. MAYFIELD, D.J. MORITZ, M. SCHEEPERS, B.E. TENNER, AND H.C. WAUCK arxiv:1410.2353v2 [math.co] 16 Dec 2014 Abstract. It has
More informationlecture notes September 2, Batcher s Algorithm
18.310 lecture notes September 2, 2013 Batcher s Algorithm Lecturer: Michel Goemans Perhaps the most restrictive version of the sorting problem requires not only no motion of the keys beyond compare-and-switches,
More informationAn evolution of a permutation
An evolution of a permutation Huseyin Acan April 28, 204 Joint work with Boris Pittel Notation and Definitions S n is the set of permutations of {,..., n} Notation and Definitions S n is the set of permutations
More informationThe number of mates of latin squares of sizes 7 and 8
The number of mates of latin squares of sizes 7 and 8 Megan Bryant James Figler Roger Garcia Carl Mummert Yudishthisir Singh Working draft not for distribution December 17, 2012 Abstract We study the number
More informationLecture 18 - Counting
Lecture 18 - Counting 6.0 - April, 003 One of the most common mathematical problems in computer science is counting the number of elements in a set. This is often the core difficulty in determining a program
More informationPattern Avoidance in Poset Permutations
Pattern Avoidance in Poset Permutations Sam Hopkins and Morgan Weiler Massachusetts Institute of Technology and University of California, Berkeley Permutation Patterns, Paris; July 5th, 2013 1 Definitions
More informationFINDING VALUES FROM KNOWN AREAS 1. Don t confuse and. Remember, are. along the scale, but are
h. Find the IQ score separating the top 37% from the others. FINDING VALUES FROM KNOWN AREAS 1. Don t confuse and. Remember, are along the scale, but are under the. 2. Choose the correct of the. A value
More informationGenerating indecomposable permutations
Discrete Mathematics 306 (2006) 508 518 www.elsevier.com/locate/disc Generating indecomposable permutations Andrew King Department of Computer Science, McGill University, Montreal, Que., Canada Received
More informationCombinatorics in the group of parity alternating permutations
Combinatorics in the group of parity alternating permutations Shinji Tanimoto (tanimoto@cc.kochi-wu.ac.jp) arxiv:081.1839v1 [math.co] 10 Dec 008 Department of Mathematics, Kochi Joshi University, Kochi
More informationEdge-disjoint tree representation of three tree degree sequences
Edge-disjoint tree representation of three tree degree sequences Ian Min Gyu Seong Carleton College seongi@carleton.edu October 2, 208 Ian Min Gyu Seong (Carleton College) Trees October 2, 208 / 65 Trees
More informationbaobabluna: the solution space of sorting by reversals Documentation Marília D. V. Braga
baobabluna: the solution space of sorting by reversals Documentation Marília D. V. Braga March 15, 2009 II Acknowledgments This work was funded by the European Union Programme Alβan (scholarship no. E05D053131BR),
More informationThe Symmetric Traveling Salesman Problem by Howard Kleiman
I. INTRODUCTION The Symmetric Traveling Salesman Problem by Howard Kleiman Let M be an nxn symmetric cost matrix where n is even. We present an algorithm that extends the concept of admissible permutation
More informationSee-Saw Swap Solitaire and Other Games on Permutations
See-Saw Swap Solitaire and Other Games on Permutations Tom ( sven ) Roby (UConn) Joint research with Steve Linton, James Propp, & Julian West Canada/USA Mathcamp Lewis & Clark College Portland, OR USA
More informationDiscrete Mathematics and Probability Theory Spring 2018 Ayazifar and Rao Midterm 2 Solutions
CS 70 Discrete Mathematics and Probability Theory Spring 2018 Ayazifar and Rao Midterm 2 Solutions PRINT Your Name: Oski Bear SIGN Your Name: OS K I PRINT Your Student ID: CIRCLE your exam room: Pimentel
More informationPattern Avoidance in Unimodal and V-unimodal Permutations
Pattern Avoidance in Unimodal and V-unimodal Permutations Dido Salazar-Torres May 16, 2009 Abstract A characterization of unimodal, [321]-avoiding permutations and an enumeration shall be given.there is
More informationA STUDY OF EULERIAN NUMBERS FOR PERMUTATIONS IN THE ALTERNATING GROUP
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 (2006), #A31 A STUDY OF EULERIAN NUMBERS FOR PERMUTATIONS IN THE ALTERNATING GROUP Shinji Tanimoto Department of Mathematics, Kochi Joshi University
More information17. 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 informationON SOME PROPERTIES OF PERMUTATION TABLEAUX
ON SOME PROPERTIES OF PERMUTATION TABLEAUX ALEXANDER BURSTEIN Abstract. We consider the relation between various permutation statistics and properties of permutation tableaux. We answer some of the open
More informationWeek 1. 1 What Is Combinatorics?
1 What Is Combinatorics? Week 1 The question that what is combinatorics is similar to the question that what is mathematics. If we say that mathematics is about the study of numbers and figures, then combinatorics
More informationCounting Sudoku Variants
Counting Sudoku Variants Wayne Zhao mentor: Dr. Tanya Khovanova Bridgewater-Raritan Regional High School May 20, 2018 MIT PRIMES Conference Wayne Zhao Counting Sudoku Variants 1 / 21 Sudoku Number of fill-ins
More informationCounting in Algorithms
Counting Counting in Algorithms How many comparisons are needed to sort n numbers? How many steps to compute the GCD of two numbers? How many steps to factor an integer? Counting in Games How many different
More informationGray code for permutations with a fixed number of cycles
Discrete Mathematics ( ) www.elsevier.com/locate/disc Gray code for permutations with a fixed number of cycles Jean-Luc Baril LE2I UMR-CNRS 5158, Université de Bourgogne, B.P. 47 870, 21078 DIJON-Cedex,
More informationMAS336 Computational Problem Solving. Problem 3: Eight Queens
MAS336 Computational Problem Solving Problem 3: Eight Queens Introduction Francis J. Wright, 2007 Topics: arrays, recursion, plotting, symmetry The problem is to find all the distinct ways of choosing
More informationHow Many Mates Can a Latin Square Have?
How Many Mates Can a Latin Square Have? Megan Bryant mrlebla@g.clemson.edu Roger Garcia garcroge@kean.edu James Figler figler@live.marshall.edu Yudhishthir Singh ysingh@crimson.ua.edu Marshall University
More informationMore Great Ideas in Theoretical Computer Science. Lecture 1: Sorting Pancakes
15-252 More Great Ideas in Theoretical Computer Science Lecture 1: Sorting Pancakes January 19th, 2018 Question If there are n pancakes in total (all in different sizes), what is the max number of flips
More informationHarmonic numbers, Catalan s triangle and mesh patterns
Harmonic numbers, Catalan s triangle and mesh patterns arxiv:1209.6423v1 [math.co] 28 Sep 2012 Sergey Kitaev Department of Computer and Information Sciences University of Strathclyde Glasgow G1 1XH, United
More informationc. Find the probability that a randomly selected adult has an IQ between 90 and 110 (referred to as the normal range).
c. Find the probability that a randomly selected adult has an IQ between 90 and 110 (referred to as the normal range). d. Find the probability that a randomly selected adult has an IQ between 110 and 120
More informationGreedy Algorithms and Genome Rearrangements
Greedy Algorithms and Genome Rearrangements Outline 1. Transforming Cabbage into Turnip 2. Genome Rearrangements 3. Sorting By Reversals 4. Pancake Flipping Problem 5. Greedy Algorithm for Sorting by Reversals
More informationAlgorithmique appliquée Projet UNO
Algorithmique appliquée Projet UNO Paul Dorbec, Cyril Gavoille The aim of this project is to encode a program as efficient as possible to find the best sequence of cards that can be played by a single
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 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 information5. (1-25 M) How many ways can 4 women and 4 men be seated around a circular table so that no two women are seated next to each other.
A.Miller M475 Fall 2010 Homewor problems are due in class one wee from the day assigned (which is in parentheses. Please do not hand in the problems early. 1. (1-20 W A boo shelf holds 5 different English
More information* Order Matters For Permutations * Section 4.6 Permutations MDM4U Jensen. Part 1: Factorial Investigation
Section 4.6 Permutations MDM4U Jensen Part 1: Factorial Investigation You are trying to put three children, represented by A, B, and C, in a line for a game. How many different orders are possible? a)
More informationPermutation Tableaux and the Dashed Permutation Pattern 32 1
Permutation Tableaux and the Dashed Permutation Pattern William Y.C. Chen and Lewis H. Liu Center for Combinatorics, LPMC-TJKLC Nankai University, Tianjin, P.R. China chen@nankai.edu.cn, lewis@cfc.nankai.edu.cn
More informationSTAT 430/510 Probability Lecture 1: Counting-1
STAT 430/510 Probability Lecture 1: Counting-1 Pengyuan (Penelope) Wang May 22, 2011 Introduction In the early days, probability was associated with games of chance, such as gambling. Probability is describing
More informationECE 242 Data Structures and Algorithms. Simple Sorting II. Lecture 5. Prof.
ECE 242 Data Structures and Algorithms http://www.ecs.umass.edu/~polizzi/teaching/ece242/ Simple Sorting II Lecture 5 Prof. Eric Polizzi Summary previous lecture 1 Bubble Sort 2 Selection Sort 3 Insertion
More informationcode V(n,k) := words module
Basic Theory Distance Suppose that you knew that an English word was transmitted and you had received the word SHIP. If you suspected that some errors had occurred in transmission, it would be impossible
More informationPATTERN AVOIDANCE IN PERMUTATIONS ON THE BOOLEAN LATTICE
PATTERN AVOIDANCE IN PERMUTATIONS ON THE BOOLEAN LATTICE SAM HOPKINS AND MORGAN WEILER Abstract. We extend the concept of pattern avoidance in permutations on a totally ordered set to pattern avoidance
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 informationJong C. Park Computer Science Division, KAIST
Jong C. Park Computer Science Division, KAIST Today s Topics Basic Principles Permutations and Combinations Algorithms for Generating Permutations Generalized Permutations and Combinations Binomial Coefficients
More informationQuarter Turn Baxter Permutations
Quarter Turn Baxter Permutations Kevin Dilks May 29, 2017 Abstract Baxter permutations are known to be in bijection with a wide number of combinatorial objects. Previously, it was shown that each of these
More informationStackable and queueable permutations
Stackable and queueable permutations Peter G. Doyle Version 1.0 dated 30 January 2012 No Copyright Abstract There is a natural bijection between permutations obtainable using a stack (those avoiding the
More informationOn Drawn K-In-A-Row Games
On Drawn K-In-A-Row Games Sheng-Hao Chiang, I-Chen Wu 2 and Ping-Hung Lin 2 National Experimental High School at Hsinchu Science Park, Hsinchu, Taiwan jiang555@ms37.hinet.net 2 Department of Computer Science,
More information