Equivalence classes of length-changing replacements of size-3 patterns
|
|
- Marjorie Fleming
- 5 years ago
- Views:
Transcription
1 Equivalence classes of length-changing replacements of size-3 patterns Vahid Fazel-Rezai Mentor: Tanya Khovanova 2013 MIT-PRIMES Conference May 18, 2013 Vahid Fazel-Rezai Length-Changing Pattern Replacements PRIMES / 18
2 Outline 1 Definitions Vahid Fazel-Rezai Length-Changing Pattern Replacements PRIMES / 18
3 Outline 1 Definitions 2 Results β Decreasing Shift Right, Shift Left Drop Only Drop One, Swap with Neighbor Vahid Fazel-Rezai Length-Changing Pattern Replacements PRIMES / 18
4 Outline 1 Definitions 2 Results β Decreasing Shift Right, Shift Left Drop Only Drop One, Swap with Neighbor 3 Future Plans Vahid Fazel-Rezai Length-Changing Pattern Replacements PRIMES / 18
5 Definitions Permutations and Patterns Definition A permutation is a string consisting of 1, 2, 3,..., n. Vahid Fazel-Rezai Length-Changing Pattern Replacements PRIMES / 18
6 Definitions Permutations and Patterns Definition A permutation is a string consisting of 1, 2, 3,..., n. Special permutations: n (identity permutation) (empty permutation) Vahid Fazel-Rezai Length-Changing Pattern Replacements PRIMES / 18
7 Definitions Permutations and Patterns Definition A permutation is a string consisting of 1, 2, 3,..., n. Special permutations: n (identity permutation) (empty permutation) Definition Let p be a string of distinct positive integers. A substring of a permutation π order-isomorphic to p is a copy of the pattern p in π. If no such substrings exist, π avoids p. Vahid Fazel-Rezai Length-Changing Pattern Replacements PRIMES / 18
8 Definitions Replacements Definition Let α and β be strings, of equal length, of distinct integers and. Then, σ is the result of a replacement α β on π if σ is obtained by: 1 adding instances of in π as necessary, 2 replacing a copy of the pattern α with β, 3 dropping all instances of, and then 4 relabeling as necessary. Vahid Fazel-Rezai Length-Changing Pattern Replacements PRIMES / 18
9 Definitions Replacements Definition Let α and β be strings, of equal length, of distinct integers and. Then, σ is the result of a replacement α β on π if σ is obtained by: 1 adding instances of in π as necessary, 2 replacing a copy of the pattern α with β, 3 dropping all instances of, and then 4 relabeling as necessary. Example: Under , behold! Vahid Fazel-Rezai Length-Changing Pattern Replacements PRIMES / 18
10 Definitions Replacements Definition Let α and β be strings, of equal length, of distinct integers and. Then, σ is the result of a replacement α β on π if σ is obtained by: 1 adding instances of in π as necessary, 2 replacing a copy of the pattern α with β, 3 dropping all instances of, and then 4 relabeling as necessary. Example: Under , behold! Vahid Fazel-Rezai Length-Changing Pattern Replacements PRIMES / 18
11 Definitions Replacements Definition Let α and β be strings, of equal length, of distinct integers and. Then, σ is the result of a replacement α β on π if σ is obtained by: 1 adding instances of in π as necessary, 2 replacing a copy of the pattern α with β, 3 dropping all instances of, and then 4 relabeling as necessary. Example: Under , behold! Vahid Fazel-Rezai Length-Changing Pattern Replacements PRIMES / 18
12 Definitions Replacements Definition Let α and β be strings, of equal length, of distinct integers and. Then, σ is the result of a replacement α β on π if σ is obtained by: 1 adding instances of in π as necessary, 2 replacing a copy of the pattern α with β, 3 dropping all instances of, and then 4 relabeling as necessary. Example: Under , behold! Vahid Fazel-Rezai Length-Changing Pattern Replacements PRIMES / 18
13 Definitions Replacements Definition Let α and β be strings, of equal length, of distinct integers and. Then, σ is the result of a replacement α β on π if σ is obtained by: 1 adding instances of in π as necessary, 2 replacing a copy of the pattern α with β, 3 dropping all instances of, and then 4 relabeling as necessary. Example: Under , behold! Vahid Fazel-Rezai Length-Changing Pattern Replacements PRIMES / 18
14 Definitions Replacements Definition Let α and β be strings, of equal length, of distinct integers and. Then, σ is the result of a replacement α β on π if σ is obtained by: 1 adding instances of in π as necessary, 2 replacing a copy of the pattern α with β, 3 dropping all instances of, and then 4 relabeling as necessary. Example: Under , behold! Vahid Fazel-Rezai Length-Changing Pattern Replacements PRIMES / 18
15 Definitions Replacements Definition Let α and β be strings, of equal length, of distinct integers and. Then, σ is the result of a replacement α β on π if σ is obtained by: 1 adding instances of in π as necessary, 2 replacing a copy of the pattern α with β, 3 dropping all instances of, and then 4 relabeling as necessary. Example: Under , behold! Vahid Fazel-Rezai Length-Changing Pattern Replacements PRIMES / 18
16 Definitions Replacements Definition Let α and β be strings, of equal length, of distinct integers and. Then, σ is the result of a replacement α β on π if σ is obtained by: 1 adding instances of in π as necessary, 2 replacing a copy of the pattern α with β, 3 dropping all instances of, and then 4 relabeling as necessary. Example: Under , behold! Vahid Fazel-Rezai Length-Changing Pattern Replacements PRIMES / 18
17 Definitions Replacements Definition Let α and β be strings, of equal length, of distinct integers and. Then, σ is the result of a replacement α β on π if σ is obtained by: 1 adding instances of in π as necessary, 2 replacing a copy of the pattern α with β, 3 dropping all instances of, and then 4 relabeling as necessary. Example: Under , behold! Vahid Fazel-Rezai Length-Changing Pattern Replacements PRIMES / 18
18 Definitions Replacements Definition Let α and β be strings, of equal length, of distinct integers and. Then, σ is the result of a replacement α β on π if σ is obtained by: 1 adding instances of in π as necessary, 2 replacing a copy of the pattern α with β, 3 dropping all instances of, and then 4 relabeling as necessary. Example: Under , behold! Vahid Fazel-Rezai Length-Changing Pattern Replacements PRIMES / 18
19 Definitions Replacements Definition Let α and β be strings, of equal length, of distinct integers and. Then, σ is the result of a replacement α β on π if σ is obtained by: 1 adding instances of in π as necessary, 2 replacing a copy of the pattern α with β, 3 dropping all instances of, and then 4 relabeling as necessary. Example: Under , behold! Vahid Fazel-Rezai Length-Changing Pattern Replacements PRIMES / 18
20 Definitions Replacements Definition Let α and β be strings, of equal length, of distinct integers and. Then, σ is the result of a replacement α β on π if σ is obtained by: 1 adding instances of in π as necessary, 2 replacing a copy of the pattern α with β, 3 dropping all instances of, and then 4 relabeling as necessary. Example: Under , behold! Vahid Fazel-Rezai Length-Changing Pattern Replacements PRIMES / 18
21 Definitions Replacements Definition Let α and β be strings, of equal length, of distinct integers and. Then, σ is the result of a replacement α β on π if σ is obtained by: 1 adding instances of in π as necessary, 2 replacing a copy of the pattern α with β, 3 dropping all instances of, and then 4 relabeling as necessary. Example: Under , behold! Vahid Fazel-Rezai Length-Changing Pattern Replacements PRIMES / 18
22 Definitions Equivalence Definition Two permutations π and σ are equivalent (π σ) under α β if σ can be attained through a sequence of α β or β α replacements on π. Vahid Fazel-Rezai Length-Changing Pattern Replacements PRIMES / 18
23 Definitions Equivalence Definition Two permutations π and σ are equivalent (π σ) under α β if σ can be attained through a sequence of α β or β α replacements on π. Example: Under , we have Vahid Fazel-Rezai Length-Changing Pattern Replacements PRIMES / 18
24 Our Focus Definitions We are interested in equivalence classes. Vahid Fazel-Rezai Length-Changing Pattern Replacements PRIMES / 18
25 Definitions Our Focus We are interested in equivalence classes. We look at replacements of the type 123 β where β has one (total of 18 cases). Vahid Fazel-Rezai Length-Changing Pattern Replacements PRIMES / 18
26 Definitions Our Focus We are interested in equivalence classes. We look at replacements of the type 123 β where β has one (total of 18 cases). We organize these replacements into four categories: Vahid Fazel-Rezai Length-Changing Pattern Replacements PRIMES / 18
27 Definitions Our Focus We are interested in equivalence classes. We look at replacements of the type 123 β where β has one (total of 18 cases). We organize these replacements into four categories: β Decreasing (9 cases) e.g Vahid Fazel-Rezai Length-Changing Pattern Replacements PRIMES / 18
28 Definitions Our Focus We are interested in equivalence classes. We look at replacements of the type 123 β where β has one (total of 18 cases). We organize these replacements into four categories: β Decreasing (9 cases) e.g Shift Right, Shift Left (2 cases) and Vahid Fazel-Rezai Length-Changing Pattern Replacements PRIMES / 18
29 Definitions Our Focus We are interested in equivalence classes. We look at replacements of the type 123 β where β has one (total of 18 cases). We organize these replacements into four categories: β Decreasing (9 cases) e.g Shift Right, Shift Left (2 cases) and Drop Only (3 cases) e.g Vahid Fazel-Rezai Length-Changing Pattern Replacements PRIMES / 18
30 Definitions Our Focus We are interested in equivalence classes. We look at replacements of the type 123 β where β has one (total of 18 cases). We organize these replacements into four categories: β Decreasing (9 cases) e.g Shift Right, Shift Left (2 cases) and Drop Only (3 cases) e.g Drop, Swap with Neighbor (4 cases) e.g Vahid Fazel-Rezai Length-Changing Pattern Replacements PRIMES / 18
31 Outline Results β Decreasing 1 Definitions 2 Results β Decreasing Shift Right, Shift Left Drop Only Drop One, Swap with Neighbor 3 Future Plans Vahid Fazel-Rezai Length-Changing Pattern Replacements PRIMES / 18
32 Results β Decreasing Two Lemmas Lemma If β is decreasing, then any permutation is equivalent under 123 β to some identity permutation. Vahid Fazel-Rezai Length-Changing Pattern Replacements PRIMES / 18
33 Results β Decreasing Two Lemmas Lemma If β is decreasing, then any permutation is equivalent under 123 β to some identity permutation. The above is because a descent can be replaced with an increasing substring. Vahid Fazel-Rezai Length-Changing Pattern Replacements PRIMES / 18
34 Results β Decreasing Two Lemmas Lemma If β is decreasing, then any permutation is equivalent under 123 β to some identity permutation. The above is because a descent can be replaced with an increasing substring. Lemma If β is decreasing, all identity permutations of length 4 or greater are equivalent. Vahid Fazel-Rezai Length-Changing Pattern Replacements PRIMES / 18
35 Results β Decreasing Finitely Many Classes Theorem If β is decreasing, there are five equivalence classes: { }, {1}, {12}, {123, 21}, {everything else} Vahid Fazel-Rezai Length-Changing Pattern Replacements PRIMES / 18
36 Outline Results Shift Right, Shift Left 1 Definitions 2 Results β Decreasing Shift Right, Shift Left Drop Only Drop One, Swap with Neighbor 3 Future Plans Vahid Fazel-Rezai Length-Changing Pattern Replacements PRIMES / 18
37 Results Shift Right, Shift Left Reverse Identities Isolated We observe the following: All identities of length 2 or greater are equivalent. All permutations of length 3, except 321, are equivalent. Vahid Fazel-Rezai Length-Changing Pattern Replacements PRIMES / 18
38 Results Shift Right, Shift Left Reverse Identities Isolated We observe the following: All identities of length 2 or greater are equivalent. All permutations of length 3, except 321, are equivalent. Theorem Under and , each reverse identity is in a distinct class while all other permutations are equivalent. Vahid Fazel-Rezai Length-Changing Pattern Replacements PRIMES / 18
39 Outline Results Drop Only 1 Definitions 2 Results β Decreasing Shift Right, Shift Left Drop Only Drop One, Swap with Neighbor 3 Future Plans Vahid Fazel-Rezai Length-Changing Pattern Replacements PRIMES / 18
40 Results Drop Only Shortest Equivalent Permutation Lemma Apply the replacement 123 β as many times as possible (in any order) to some π, and call the result p(π). p(π) is the unique shortest permutation equivalent to π. p(π) avoids 123. Vahid Fazel-Rezai Length-Changing Pattern Replacements PRIMES / 18
41 Results Drop Only Shortest Equivalent Permutation Lemma Apply the replacement 123 β as many times as possible (in any order) to some π, and call the result p(π). p(π) is the unique shortest permutation equivalent to π. p(π) avoids 123. Thus, there is a bijection between equivalence classes and permutations avoiding 123: Vahid Fazel-Rezai Length-Changing Pattern Replacements PRIMES / 18
42 Results Drop Only Shortest Equivalent Permutation Lemma Apply the replacement 123 β as many times as possible (in any order) to some π, and call the result p(π). p(π) is the unique shortest permutation equivalent to π. p(π) avoids 123. Thus, there is a bijection between equivalence classes and permutations avoiding 123: Theorem Under drop only replacements, for each σ avoiding 123, there exists a distinct class containing all π with p(π) = σ. Vahid Fazel-Rezai Length-Changing Pattern Replacements PRIMES / 18
43 Outline Results Drop One, Swap with Neighbor 1 Definitions 2 Results β Decreasing Shift Right, Shift Left Drop Only Drop One, Swap with Neighbor 3 Future Plans Vahid Fazel-Rezai Length-Changing Pattern Replacements PRIMES / 18
44 Alternative Equivalence Results Drop One, Swap with Neighbor The following lemma allows previous work to be applied here. Lemma There exists some length-preserving replacement under which equivalence implies equivalence under 123 β for each 123 β in this category. For example, equivalence under implies equivalence under Vahid Fazel-Rezai Length-Changing Pattern Replacements PRIMES / 18
45 Results Drop One, Swap with Neighbor Characterizing Classes by Invariants Definition An element of a permutation is called a left-to-right minimum if it has a value smaller than every element to its left. Vahid Fazel-Rezai Length-Changing Pattern Replacements PRIMES / 18
46 Results Drop One, Swap with Neighbor Characterizing Classes by Invariants Definition An element of a permutation is called a left-to-right minimum if it has a value smaller than every element to its left. Theorem Two permutations are equivalent under if and only if they have the following in common: number of left-to-right minima, and out of the elements that are not left-to-right minima, leftmost position, and largest value (relative to left-right minima). The other three replacements have similar invariants. Vahid Fazel-Rezai Length-Changing Pattern Replacements PRIMES / 18
47 Future Plans Future Work I plan to continue this research by: characterizing equivalence classes of 132 β replacements considering the case when β contains two generalizing to longer patterns exploring the shortest distance between two permutations examining why some replacements have the same classes Vahid Fazel-Rezai Length-Changing Pattern Replacements PRIMES / 18
48 Acknowledgments Thank You! I would like to thank: my mentor Tanya Khovanova for extremely valuable guidance Prof. James Propp for suggesting the project and continually providing direction PRIMES for allowing this research to happen Vahid Fazel-Rezai Length-Changing Pattern Replacements PRIMES / 18
49 Acknowledgments Thank You! I would like to thank: my mentor Tanya Khovanova for extremely valuable guidance Prof. James Propp for suggesting the project and continually providing direction PRIMES for allowing this research to happen Thank you for listening! Vahid Fazel-Rezai Length-Changing Pattern Replacements PRIMES / 18
50 Acknowledgments Thank You! I would like to thank: my mentor Tanya Khovanova for extremely valuable guidance Prof. James Propp for suggesting the project and continually providing direction PRIMES for allowing this research to happen Thank you for listening! Questions? Vahid Fazel-Rezai Length-Changing Pattern Replacements PRIMES / 18
Equivalence Classes of Permutations Modulo Replacements Between 123 and Two-Integer Patterns
Equivalence Classes of Permutations Modulo Replacements Between 123 and Two-Integer Patterns Vahid Fazel-Rezai Phillips Exeter Academy Exeter, New Hampshire, U.S.A. vahid fazel@yahoo.com Submitted: Sep
More informationarxiv: v2 [math.ho] 23 Aug 2018
Mathematics of a Sudo-Kurve arxiv:1808.06713v2 [math.ho] 23 Aug 2018 Tanya Khovanova Abstract Wayne Zhao We investigate a type of a Sudoku variant called Sudo-Kurve, which allows bent rows and columns,
More informationOn Quasirandom Permutations
On Quasirandom Permutations Eric K. Zhang Mentor: Tanya Khovanova Plano West Senior High School PRIMES Conference, May 20, 2018 Eric K. Zhang (PWSH) On Quasirandom Permutations PRIMES 2018 1 / 20 Permutations
More informationOn Modular Extensions to Nim
On Modular Extensions to Nim Karan Sarkar Mentor: Dr. Tanya Khovanova Fifth Annual Primes Conference 16 May 2015 An Instructive Example: Nim The Rules Take at least one token from some chosen pile. Player
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 informationPRIMES 2017 final paper. NEW RESULTS ON PATTERN-REPLACEMENT EQUIVALENCES: GENERALIZING A CLASSICAL THEOREM AND REVISING A RECENT CONJECTURE Michael Ma
PRIMES 2017 final paper NEW RESULTS ON PATTERN-REPLACEMENT EQUIVALENCES: GENERALIZING A CLASSICAL THEOREM AND REVISING A RECENT CONJECTURE Michael Ma ABSTRACT. In this paper we study pattern-replacement
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 informationPin-Permutations and Structure in Permutation Classes
and Structure in Permutation Classes Frédérique Bassino Dominique Rossin Journées de Combinatoire de Bordeaux, feb. 2009 liafa Main result of the talk Conjecture[Brignall, Ruškuc, Vatter]: The pin-permutation
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 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 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 informationGoldbach Conjecture (7 th june 1742)
Goldbach Conjecture (7 th june 1742) We note P the odd prime numbers set. P = {p 1 = 3, p 2 = 5, p 3 = 7, p 4 = 11,...} n 2N\{0, 2, 4}, p P, p n/2, q P, q n/2, n = p + q We call n s Goldbach decomposition
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 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 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 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 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 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 informationSets. Gazihan Alankuş (Based on original slides by Brahim Hnich et al.) August 6, Outline Sets Equality Subset Empty Set Cardinality Power Set
Gazihan Alankuş (Based on original slides by Brahim Hnich et al.) August 6, 2012 Gazihan Alankuş (Based on original slides by Brahim Hnich et al.) Gazihan Alankuş (Based on original slides by Brahim Hnich
More informationFermat s little theorem. RSA.
.. Computing large numbers modulo n (a) In modulo arithmetic, you can always reduce a large number to its remainder a a rem n (mod n). (b) Addition, subtraction, and multiplication preserve congruence:
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 informationWhat is a Sorting Function?
Department of Computer Science University of Copenhagen Email: henglein@diku.dk WG 2.8 2008, Park City, June 15-22, 2008 Outline 1 Sorting algorithms Literature definitions What is a sorting criterion?
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 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 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 informationSome algorithmic and combinatorial problems on permutation classes
Some algorithmic and combinatorial problems on permutation classes The point of view of decomposition trees PhD Defense, 2009 December the 4th Outline 1 Objects studied : Permutations, Patterns and Classes
More informationAn old pastime.
Ringing the Changes An old pastime http://www.youtube.com/watch?v=dk8umrt01wa The mechanics of change ringing http://www.cathedral.org/wrs/animation/rounds_on_five.htm Some Terminology Since you can not
More informationarxiv: v1 [math.co] 11 Jul 2016
OCCURRENCE GRAPHS OF PATTERNS IN PERMUTATIONS arxiv:160703018v1 [mathco] 11 Jul 2016 BJARNI JENS KRISTINSSON AND HENNING ULFARSSON Abstract We define the occurrence graph G p (π) of a pattern p in a permutation
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 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 informationA FAMILY OF t-regular SELF-COMPLEMENTARY k-hypergraphs. Communicated by Behruz Tayfeh Rezaie. 1. Introduction
Transactions on Combinatorics ISSN (print): 2251-8657, ISSN (on-line): 2251-8665 Vol. 6 No. 1 (2017), pp. 39-46. c 2017 University of Isfahan www.combinatorics.ir www.ui.ac.ir A FAMILY OF t-regular SELF-COMPLEMENTARY
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 informationON SPLITTING UP PILES OF STONES
ON SPLITTING UP PILES OF STONES GREGORY IGUSA Abstract. In this paper, I describe the rules of a game, and give a complete description of when the game can be won, and when it cannot be won. The first
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 informationSymmetric Permutations Avoiding Two Patterns
Symmetric Permutations Avoiding Two Patterns David Lonoff and Jonah Ostroff Carleton College Northfield, MN 55057 USA November 30, 2008 Abstract Symmetric pattern-avoiding permutations are restricted permutations
More informationMA/CSSE 473 Day 13. Student Questions. Permutation Generation. HW 6 due Monday, HW 7 next Thursday, Tuesday s exam. Permutation generation
MA/CSSE 473 Day 13 Permutation Generation MA/CSSE 473 Day 13 HW 6 due Monday, HW 7 next Thursday, Student Questions Tuesday s exam Permutation generation 1 Exam 1 If you want additional practice problems
More informationChapter 1. The alternating groups. 1.1 Introduction. 1.2 Permutations
Chapter 1 The alternating groups 1.1 Introduction The most familiar of the finite (non-abelian) simple groups are the alternating groups A n, which are subgroups of index 2 in the symmetric groups S n.
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 informationAlternator Coins. Mentor: Dr. Tanya Khovanova. PRIMES CONFERENCE, May 21, PRIMES CONFERENCE, May 21,
Alternator Coins Benjamin Chen, Ezra Erives, Leon Fan, Michael Gerovitch, Jonathan Hsu, Neil Malur, Ashwin Padaki, Nastia Polina, Will Sun, Jacob Tan, Andrew The Mentor: Dr. Tanya Khovanova PRIMES CONFERENCE,
More informationA Graph Theory of Rook Placements
A Graph Theory of Rook Placements Kenneth Barrese December 4, 2018 arxiv:1812.00533v1 [math.co] 3 Dec 2018 Abstract Two boards are rook equivalent if they have the same number of non-attacking rook placements
More informationarxiv: v3 [math.co] 4 Dec 2018 MICHAEL CORY
CYCLIC PERMUTATIONS AVOIDING PAIRS OF PATTERNS OF LENGTH THREE arxiv:1805.05196v3 [math.co] 4 Dec 2018 MIKLÓS BÓNA MICHAEL CORY Abstract. We enumerate cyclic permutations avoiding two patterns of length
More informationEQUIPOPULARITY CLASSES IN THE SEPARABLE PERMUTATIONS
EQUIPOPULARITY CLASSES IN THE SEPARABLE PERMUTATIONS Michael Albert, Cheyne Homberger, and Jay Pantone Abstract When two patterns occur equally often in a set of permutations, we say that these patterns
More informationAn elementary study of Goldbach Conjecture
An elementary study of Goldbach Conjecture Denise Chemla 26/5/2012 Goldbach Conjecture (7 th, june 1742) states that every even natural integer greater than 4 is the sum of two odd prime numbers. If we
More informationUniversal Cycles for Permutations Theory and Applications
Universal Cycles for Permutations Theory and Applications Alexander Holroyd Microsoft Research Brett Stevens Carleton University Aaron Williams Carleton University Frank Ruskey University of Victoria Combinatorial
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 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 informationA Coloring Problem. Ira M. Gessel 1 Department of Mathematics Brandeis University Waltham, MA Revised May 4, 1989
A Coloring Problem Ira M. Gessel Department of Mathematics Brandeis University Waltham, MA 02254 Revised May 4, 989 Introduction. Awell-known algorithm for coloring the vertices of a graph is the greedy
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 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 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 informationCSE 20 DISCRETE MATH. Fall
CSE 20 DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Today's learning goals Define and compute the cardinality of a set. Use functions to compare the sizes of sets. Classify sets
More informationLECTURE 3: CONGRUENCES. 1. Basic properties of congruences We begin by introducing some definitions and elementary properties.
LECTURE 3: CONGRUENCES 1. Basic properties of congruences We begin by introducing some definitions and elementary properties. Definition 1.1. Suppose that a, b Z and m N. We say that a is congruent to
More informationClasses of permutations avoiding 231 or 321
Classes of permutations avoiding 231 or 321 Nik Ruškuc nik.ruskuc@st-andrews.ac.uk School of Mathematics and Statistics, University of St Andrews Dresden, 25 November 2015 Aim Introduce the area of pattern
More informationSorting with Pop Stacks
faculty.valpo.edu/lpudwell joint work with Rebecca Smith (SUNY - Brockport) Special Session on Algebraic and Enumerative Combinatorics with Applications AMS Spring Central Sectional Meeting Indiana University
More informationPermutations of a Multiset Avoiding Permutations of Length 3
Europ. J. Combinatorics (2001 22, 1021 1031 doi:10.1006/eujc.2001.0538 Available online at http://www.idealibrary.com on Permutations of a Multiset Avoiding Permutations of Length 3 M. H. ALBERT, R. E.
More informationRESTRICTED PERMUTATIONS AND POLYGONS. Ghassan Firro and Toufik Mansour Department of Mathematics, University of Haifa, Haifa, Israel
RESTRICTED PERMUTATIONS AND POLYGONS Ghassan Firro and Toufik Mansour Department of Mathematics, University of Haifa, 905 Haifa, Israel {gferro,toufik}@mathhaifaacil abstract Several authors have examined
More informationA Combinatorial Proof of the Log-Concavity of the Numbers of Permutations with k Runs
Journal of Combinatorial Theory, Series A 90, 293303 (2000) doi:10.1006jcta.1999.3040, available online at http:www.idealibrary.com on A Combinatorial Proof of the Log-Concavity of the Numbers of Permutations
More informationAlternating Permutations
Alternating Permutations p. Alternating Permutations Richard P. Stanley M.I.T. Alternating Permutations p. Basic definitions A sequence a 1, a 2,..., a k of distinct integers is alternating if a 1 > a
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 informationIn the game of Chess a queen can move any number of spaces in any linear direction: horizontally, vertically, or along a diagonal.
CMPS 12A Introduction to Programming Winter 2013 Programming Assignment 5 In this assignment you will write a java program finds all solutions to the n-queens problem, for 1 n 13. Begin by reading the
More informationFirst order logic of permutations
First order logic of permutations Michael Albert, Mathilde Bouvel and Valentin Féray June 28, 2016 PP2017 (Reykjavik University) What is a permutation? I An element of some group G acting on a finite set
More informationConvexity Invariants of the Hoop Closure on Permutations
Convexity Invariants of the Hoop Closure on Permutations Robert E. Jamison Retired from Discrete Mathematics Clemson University now in Asheville, NC Permutation Patterns 12 7 11 July, 2014 Eliakim Hastings
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 informationSection Summary. Permutations Combinations Combinatorial Proofs
Section 6.3 Section Summary Permutations Combinations Combinatorial Proofs Permutations Definition: A permutation of a set of distinct objects is an ordered arrangement of these objects. An ordered arrangement
More informationPRIMES STEP Plays Games
PRIMES STEP Plays Games arxiv:1707.07201v1 [math.co] 22 Jul 2017 Pratik Alladi Neel Bhalla Tanya Khovanova Nathan Sheffield Eddie Song William Sun Andrew The Alan Wang Naor Wiesel Kevin Zhang Kevin Zhao
More informationAsymptotic behaviour of permutations avoiding generalized patterns
Asymptotic behaviour of permutations avoiding generalized patterns Ashok Rajaraman 311176 arajaram@sfu.ca February 19, 1 Abstract Visualizing permutations as labelled trees allows us to to specify restricted
More informationAvoiding consecutive patterns in permutations
Avoiding consecutive patterns in permutations R. E. L. Aldred M. D. Atkinson D. J. McCaughan January 3, 2009 Abstract The number of permutations that do not contain, as a factor (subword), a given set
More informationStaircases, dominoes, and the growth rate of Av(1324)
Staircases, dominoes, and the growth rate of Av(1324) Robert Brignall Joint work with David Bevan, Andrew Elvey Price and Jay Pantone TU Wien, 28th August 2017 Permutation containment 101 1 3 5 2 4 4 1
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 informationSensors, Signals and Noise
Sensors, Signals and Noise COURSE OUTLINE Introduction Signals and Noise Filtering Noise Sensors and associated electronics Sergio Cova SENSORS SIGNALS AND NOISE SSN04b FILTERING NOISE rv 2017/01/25 1
More informationQuarter Turn Baxter Permutations
North Dakota State University June 26, 2017 Outline 1 2 Outline 1 2 What is a Baxter Permutation? Definition A Baxter permutation is a permutation that, when written in one-line notation, avoids the generalized
More informationCCO Commun. Comb. Optim.
Communications in Combinatorics and Optimization Vol. 2 No. 2, 2017 pp.149-159 DOI: 10.22049/CCO.2017.25918.1055 CCO Commun. Comb. Optim. Graceful labelings of the generalized Petersen graphs Zehui Shao
More informationCITS2211 Discrete Structures Turing Machines
CITS2211 Discrete Structures Turing Machines October 23, 2017 Highlights We have seen that FSMs and PDAs are surprisingly powerful But there are some languages they can not recognise We will study a new
More informationThrottling numbers for cop vs gambler
Throttling numbers for cop vs gambler James Lin Carl Joshua Quines Espen Slettnes Mentor: Dr. Jesse Geneson May 19 20, 2018 MIT PRIMES Conference J. Lin, C. J. Quines, E. Slettnes Throttling numbers for
More informationCMPS 12A Introduction to Programming Programming Assignment 5 In this assignment you will write a Java program that finds all solutions to the n-queens problem, for. Begin by reading the Wikipedia article
More informationConnected Permutations, Hypermaps and Weighted Dyck Words. Robert Cori Mini course, Maps Hypermaps february 2008
1 Connected Permutations, Hypermaps and Weighted Dyck Words 2 Why? Graph embeddings Nice bijection by Patrice Ossona de Mendez and Pierre Rosenstiehl. Deduce enumerative results. Extensions? 3 Cycles (or
More informationA Note on Downup Permutations and Increasing Trees DAVID CALLAN. Department of Statistics. Medical Science Center University Ave
A Note on Downup Permutations and Increasing 0-1- Trees DAVID CALLAN Department of Statistics University of Wisconsin-Madison Medical Science Center 1300 University Ave Madison, WI 53706-153 callan@stat.wisc.edu
More informationPublic Key Cryptography Great Ideas in Theoretical Computer Science Saarland University, Summer 2014
7 Public Key Cryptography Great Ideas in Theoretical Computer Science Saarland University, Summer 2014 Cryptography studies techniques for secure communication in the presence of third parties. A typical
More informationInternational Journal of Combinatorial Optimization Problems and Informatics. E-ISSN:
International Journal of Combinatorial Optimization Problems and Informatics E-ISSN: 2007-1558 editor@ijcopi.org International Journal of Combinatorial Optimization Problems and Informatics México Karim,
More informationEE 418 Network Security and Cryptography Lecture #3
EE 418 Network Security and Cryptography Lecture #3 October 6, 2016 Classical cryptosystems. Lecture notes prepared by Professor Radha Poovendran. Tamara Bonaci Department of Electrical Engineering University
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 informationSimple permutations and pattern restricted permutations
Simple permutations and pattern restricted permutations M.H. Albert and M.D. Atkinson Department of Computer Science University of Otago, Dunedin, New Zealand. Abstract A simple permutation is one that
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 informationStrings. A string is a list of symbols in a particular order.
Ihor Stasyuk Strings A string is a list of symbols in a particular order. Strings A string is a list of symbols in a particular order. Examples: 1 3 0 4 1-12 is a string of integers. X Q R A X P T is a
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 informationRestricted Permutations Related to Fibonacci Numbers and k-generalized Fibonacci Numbers
Restricted Permutations Related to Fibonacci Numbers and k-generalized Fibonacci Numbers arxiv:math/0109219v1 [math.co] 27 Sep 2001 Eric S. Egge Department of Mathematics Gettysburg College 300 North Washington
More informationFinite homomorphism-homogeneous permutations via edge colourings of chains
Finite homomorphism-homogeneous permutations via edge colourings of chains Igor Dolinka dockie@dmi.uns.ac.rs Department of Mathematics and Informatics, University of Novi Sad First of all there is Blue.
More informationUniversal permuton limits of substitution-closed permutation classes
Universal permuton limits of substitution-closed permutation classes Adeline Pierrot LRI, Univ. Paris-Sud, Univ. Paris-Saclay Permutation Patterns 2017 ArXiv: 1706.08333 Joint work with Frédérique Bassino,
More informationPUZZLES ON GRAPHS: THE TOWERS OF HANOI, THE SPIN-OUT PUZZLE, AND THE COMBINATION PUZZLE
PUZZLES ON GRAPHS: THE TOWERS OF HANOI, THE SPIN-OUT PUZZLE, AND THE COMBINATION PUZZLE LINDSAY BAUN AND SONIA CHAUHAN ADVISOR: PAUL CULL OREGON STATE UNIVERSITY ABSTRACT. The Towers of Hanoi is a well
More informationOn shortening u-cycles and u-words for permutations
On shortening u-cycles and u-words for permutations Sergey Kitaev, Vladimir N. Potapov, and Vincent Vajnovszki October 22, 2018 Abstract This paper initiates the study of shortening universal cycles (ucycles)
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 informationMAT 115: Finite Math for Computer Science Problem Set 5
MAT 115: Finite Math for Computer Science Problem Set 5 Out: 04/10/2017 Due: 04/17/2017 Instructions: I leave plenty of space on each page for your computation. If you need more sheet, please attach your
More informationAn Erdős-Lovász-Spencer Theorem for permutations and its. testing
An Erdős-Lovász-Spencer Theorem for permutations and its consequences for parameter testing Carlos Hoppen (UFRGS, Porto Alegre, Brazil) This is joint work with Roman Glebov (ETH Zürich, Switzerland) Tereza
More informationSymmetry Groups of Platonic Solids
Symmetry Groups of Platonic Solids Rich Schwartz September 17, 2007 The purpose of this handout is to discuss the symmetry groups of Platonic solids. 1 Basic Definitions Let R 3 denote 3-dimensional space.
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 informationThe Futurama Theorem.
The Futurama Theorem. A friendly introduction to permutations. Rhian Davies 1 st March 2014 Permutations In this class we are going to consider the theory of permutations, and use them to solve a problem
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 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 informationClassical Cryptography
Classical Cryptography CS 6750 Lecture 1 September 10, 2009 Riccardo Pucella Goals of Classical Cryptography Alice wants to send message X to Bob Oscar is on the wire, listening to all communications Alice
More informationPUTNAM PROBLEMS FINITE MATHEMATICS, COMBINATORICS
PUTNAM PROBLEMS FINITE MATHEMATICS, COMBINATORICS 2014-B-5. In the 75th Annual Putnam Games, participants compete at mathematical games. Patniss and Keeta play a game in which they take turns choosing
More information