Staircases, dominoes, and the growth rate of Av(1324)
|
|
- Carmel Lester
- 5 years ago
- Views:
Transcription
1 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
2 Permutation containment Permutations in one-line notation: π = π(1) π(n) Pattern containment: σ π if there exists a subsequence of π(1) π(n) with the same relative ordering as σ. Containment is a partial order. Conversely, π avoids σ if σ π.
3 Permutation containment < Permutations in one-line notation: π = π(1) π(n) Pattern containment: σ π if there exists a subsequence of π(1) π(n) with the same relative ordering as σ. Containment is a partial order. Conversely, π avoids σ if σ π.
4 Permutation containment 102 Permutation class: a hereditary collection C, i.e. π C and σ π implies σ C. Principal classes characterised by avoiding one permutation: C = Av(β) = {permutations π : β π}.
5 Permutation containment 102 Permutation class: a hereditary collection C, i.e. π C and σ π implies σ C. Principal classes characterised by avoiding one permutation: C = Av(β) = {permutations π : β π}. Av(12) = {1, 21, 321,... } has 1 permutation of each length. has 1, 2, 5, 14, 42,... of lengths n = 1, 2, 3, 4, 5,....
6 Counting......precisely Generating function for a class C is the formal power series where C n = {π C : π = n}. f C (z) = z π = C n z n, π C n=1
7 Counting......precisely Generating function for a class C is the formal power series where C n = {π C : π = n}. f C (z) = z π = C n z n, π C n=1...vaguely For principal classes Av(β), the growth rate is n gr(av(β)) = lim Av(β) n. n Must exist due to Arratia (1999) and Marcus & Tardos (2004).
8 Counting Principal Classes State of knowledge, since 1997: β Av(β) n gr(av(β)) ( ) n n + 1 n 1342 (7n 2 3n 2) ( 1) 2413 n ( ) k+1 (2k 4)! n k + 2 ( 1) n k k!(k 2)! 2 k= n ( )( ) 2k n 2 3k k + 1 n 2kn k k (k + 1) k=0 (k + 2)(n k + 1) ?? Up to symmetries, this covers all Av(β) with β 4.
9 Exact enumeration of Av(1324) Not even God knows Av(1324) Doron Zeilberger, 2004
10 Exact enumeration of Av(1324) Not even God knows Av(1324) Doron Zeilberger, 2004 More recently, Conway & Guttman (2015) computed Av(1324) 36 =
11 Growth rate of Av(1324) Lower Upper 2004: Bóna : Bóna : Albert et al : Claesson, Jelínek & Steingrímsson : Bóna : Bóna : Bevan : Conway & Guttmann estimate gr(av(1324)) ± 0.01 An upper bound of follows from an unproven conjecture.
12 Growth rate of Av(1324) Lower Upper 2004: Bóna : Bóna : Albert et al : Claesson, Jelínek & Steingrímsson : Bóna : Bóna : Bevan 9.81 This work : Conway & Guttmann estimate gr(av(1324)) ± 0.01 An upper bound of follows from an unproven conjecture.
13 The staircase The infinite decreasing (, ) staircase: S = Proposition Av(1324) S
14 Gridding a 1324-avoider
15 Gridding a 1324-avoider p 1 p 1 uppermost 1 in a 213
16 Gridding a 1324-avoider p 1 p 2 p 1 uppermost 1 in a 213 p 2 leftmost 2 in a 132 consisting of points below p 1 divider
17 Gridding a 1324-avoider p 1 p 2 p 2 leftmost 2 in a 132 consisting of points below p 1 divider No points above p 1 and to the right of p 2
18 Gridding a 1324-avoider p 1 p 2 p 3 p 2 leftmost 2 in a 132 consisting of points below p 1 divider p 3 uppermost 1 in a 213 consisting of points to right of p 2 divider
19 Gridding a 1324-avoider p 1 p 2 p 3 p 3 uppermost 1 in a 213 consisting of points to right of p 2 divider No points to the left of p 2 and below p 3
20 Gridding a 1324-avoider p 1 p 2 p 3 p 4 p 3 uppermost 1 in a 213 consisting of points to right of p 2 divider p 4 leftmost 2 in a 132 consisting of points below p 3 divider
21 Gridding a 1324-avoider p 1 p 2 p 3 p 4 p 4 leftmost 2 in a 132 consisting of points below p 3 divider No points above p 3 and to the right of p 4
22 Gridding a 1324-avoider Terminates after no more than n/2 steps.
23 The greedy gridding of a large 1324-avoider Data provided by Einar Steingrímsson.
24 Where do I find 1324 in a staircase? Only in two adjacent cells, and only with two points in each cell.
25 Dominoes A domino is a gridded permutation in that avoids = =
26 Dominoes A domino is a gridded permutation in that avoids = = Important: / D (D = the set of dominoes)
27 Dominoes Theorem The number of n-point dominoes is A familiar sequence 2(3n + 3)!. gr(d) = 27/4. (n + 2)!(2n + 3)! Among other things, dominoes are equinumerous to West-2-stack-sortable permutations Rooted nonseparable planar maps Problem Find a bijection between dominoes and another combinatorial structure.
28 New upper bound for Av(1324) Ψ : Av n (1324) (, ) n D n
29 New upper bound for Av(1324) Ψ : Av n (1324) (, ) n D n
30 New upper bound for Av(1324) Ψ : Av n (1324) (, ) n D n Ψ is an injection. gr(av(1324)) 2 27/4 = 13.5
31 New lower bound for Av(1324) p elts q elts q elts p elts p elts q elts Begin with some dominoes and their symmetries.
32 New lower bound for Av(1324) p elts q elts q elts p elts p elts q elts Interleave with skew indecomposable components.
33 New lower bound for Av(1324) p elts q elts q 2 cpts q elts p elts p elts q elts q 2 cpts Interleave with skew indecomposable components.
34 New lower bound for Av(1324) p elts q elts q 2 cpts q elts p elts p 2 cpts p elts q elts q 2 cpts Interleave with skew indecomposable components.
35 New lower bound for Av(1324) p elts q elts q 2 cpts q elts p elts p 2 cpts p elts q elts q 2 cpts Analysis gives gr(av(1324))
36 New lower bound (2) Exploit finer structure of dominoes: gr(av(1324)) This is the root of a polynomial of degree 104, whose smallest coefficient has 86 digits.
37 Questions for the future Bijection between dominoes and something else Improvement on the (crude) upper bound Count trominoes?
38 Thanks!
Asymptotic and exact enumeration of permutation classes
Asymptotic and exact enumeration of permutation classes Michael Albert Department of Computer Science, University of Otago Nov-Dec 2011 Example 21 Question How many permutations of length n contain no
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 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 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 informationUNIVERSALITY IN SUBSTITUTION-CLOSED PERMUTATION CLASSES. with Frédérique Bassino, Mathilde Bouvel, Valentin Féray, Lucas Gerin and Mickaël Maazoun
UNIVERSALITY IN SUBSTITUTION-CLOSED PERMUTATION CLASSES ADELINE PIERROT with Frédérique Bassino, Mathilde Bouvel, Valentin Féray, Lucas Gerin and Mickaël Maazoun The aim of this work is to study the asymptotic
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 informationNON-OVERLAPPING PERMUTATION PATTERNS. To Doron Zeilberger, for his Sixtieth Birthday
NON-OVERLAPPING PERMUTATION PATTERNS MIKLÓS BÓNA Abstract. We show a way to compute, to a high level of precision, the probability that a randomly selected permutation of length n is nonoverlapping. As
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 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 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 informationFrom permutations to graphs
From permutations to graphs well-quasi-ordering and infinite antichains Robert Brignall Joint work with Atminas, Korpelainen, Lozin and Vatter 28th November 2014 Orderings on Structures Pick your favourite
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 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 information#A2 INTEGERS 18 (2018) ON PATTERN AVOIDING INDECOMPOSABLE PERMUTATIONS
#A INTEGERS 8 (08) ON PATTERN AVOIDING INDECOMPOSABLE PERMUTATIONS Alice L.L. Gao Department of Applied Mathematics, Northwestern Polytechnical University, Xi an, Shaani, P.R. China llgao@nwpu.edu.cn Sergey
More informationGrid classes and the Fibonacci dichotomy for restricted permutations
Grid classes and the Fibonacci dichotomy for restricted permutations Sophie Huczynska and Vincent Vatter School of Mathematics and Statistics University of St Andrews St Andrews, Fife, Scotland {sophieh,
More informationarxiv: v3 [math.co] 4 Jan 2015
Permutation Classes To appear in The Handbook of Enumerative Combinatorics, published by CRC Press. arxiv:409.559v3 [math.co] 4 Jan 205 Vincent Vatter Department of Mathematics University of Florida Gainesville,
More informationarxiv: v2 [math.co] 4 Dec 2017
arxiv:1602.00672v2 [math.co] 4 Dec 2017 Rationality For Subclasses of 321-Avoiding Permutations Michael H. Albert Department of Computer Science University of Otago Dunedin, New Zealand Robert Brignall
More informationNon-overlapping permutation patterns
PU. M. A. Vol. 22 (2011), No.2, pp. 99 105 Non-overlapping permutation patterns Miklós Bóna Department of Mathematics University of Florida 358 Little Hall, PO Box 118105 Gainesville, FL 326118105 (USA)
More informationCharacterising inflations of monotone grid classes of permutations
Characterising inflations of monotone grid classes of permutations Robert Brignall Nicolasson Joint work wið Michæl Albert and Aistis Atminas Reykjavik, 29þ June 2017 Two concepts of structure Enumeration
More informationWhat Does the Future Hold for Restricted Patterns? 1
What Does the Future Hold for Restricted Patterns? 1 by Zvezdelina Stankova Berkeley Math Circle Advanced Group November 26, 2013 1. Basics on Restricted Patterns 1.1. The primary object of study. We agree
More informationStruct: Finding Structure in Permutation Sets
Michael Albert, Christian Bean, Anders Claesson, Bjarki Ágúst Guðmundsson, Tómas Ken Magnússon and Henning Ulfarsson April 26th, 2016 Classical Patterns What is a permutation? π = 431265 = Classical Patterns
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 informationarxiv: v4 [math.co] 29 Jan 2018
arxiv:1510.00269v4 [math.co] 29 Jan 2018 Generating Permutations With Restricted Containers Michael Albert Department of Computer Science University of Otago Dunedin, New Zealand Jay Pantone Department
More informationON THE INVERSE IMAGE OF PATTERN CLASSES UNDER BUBBLE SORT. 1. Introduction
ON THE INVERSE IMAGE OF PATTERN CLASSES UNDER BUBBLE SORT MICHAEL H. ALBERT, M. D. ATKINSON, MATHILDE BOUVEL, ANDERS CLAESSON, AND MARK DUKES Abstract. Let B be the operation of re-ordering a sequence
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 informationRandom permutations avoiding some patterns
Random permutations avoiding some patterns Svante Janson Knuth80 Piteå, 8 January, 2018 Patterns in a permutation Let S n be the set of permutations of [n] := {1,..., n}. If σ = σ 1 σ k S k and π = π 1
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 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 informationDecomposing simple permutations, with enumerative consequences
Decomposing simple permutations, with enumerative consequences arxiv:math/0606186v1 [math.co] 8 Jun 2006 Robert Brignall, Sophie Huczynska, and Vincent Vatter School of Mathematics and Statistics University
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 informationEnumeration of simple permutations in Av(52341,53241,52431,35142
Enumeration of simple permutations in Av(52341, 53241, 52431, 35142, 42513, 351624) University of Idaho Permutation Patterns 2014 July 10, 2014 Relation to Algebraic Geometry Enumeration of Each Class
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 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 informationThe Möbius function of separable permutations (extended abstract)
FPSAC 2010, San Francisco, USA DMTCS proc. AN, 2010, 641 652 The Möbius function of separable permutations (extended abstract) Vít Jelínek 1 and Eva Jelínková 2 and Einar Steingrímsson 1 1 The Mathematics
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 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 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 informationPROOFS OF SOME BINOMIAL IDENTITIES USING THE METHOD OF LAST SQUARES
PROOFS OF SOME BINOMIAL IDENTITIES USING THE METHOD OF LAST SQUARES MARK SHATTUCK AND TAMÁS WALDHAUSER Abstract. We give combinatorial proofs for some identities involving binomial sums that have no closed
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 informationAutomatic Enumeration and Random Generation for pattern-avoiding Permutation Classes
Automatic Enumeration and Random Generation for pattern-avoiding Permutation Classes Adeline Pierrot Institute of Discrete Mathematics and Geometry, TU Wien (Vienna) Permutation Patterns 2014 Joint work
More informationSimple permutations: decidability and unavoidable substructures
Simple permutations: decidability and unavoidable substructures Robert Brignall a Nik Ruškuc a Vincent Vatter a,,1 a University of St Andrews, School of Mathematics and Statistics, St Andrews, Fife, KY16
More informationEquivalence classes of length-changing replacements of size-3 patterns
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
More informationSquare Involutions. Filippo Disanto Dipartimento di Scienze Matematiche e Informatiche Università di Siena Pian dei Mantellini Siena, Italy
3 47 6 3 Journal of Integer Sequences, Vol. 4 (0), Article.3.5 Square Involutions Filippo Disanto Dipartimento di Scienze Matematiche e Informatiche Università di Siena Pian dei Mantellini 44 5300 Siena,
More informationFast Sorting and Pattern-Avoiding Permutations
Fast Sorting and Pattern-Avoiding Permutations David Arthur Stanford University darthur@cs.stanford.edu Abstract We say a permutation π avoids a pattern σ if no length σ subsequence of π is ordered in
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 informationEnumeration of permutations sorted with two passes through a stack and D 8 symmetries
FPSAC 2012, Nagoya, Japan DMTCS proc. AR, 2012, 765 778 Enumeration of permutations sorted with two passes through a stack and D 8 symmetries Mathilde Bouvel 1,2 and Olivier Guibert 1 1 LaBRI UMR 5800,
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 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 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 informationA survey of stack-sorting disciplines
A survey of stack-sorting disciplines Miklós Bóna Department of Mathematics, University of Florida Gainesville FL 32611-8105 bona@math.ufl.edu Submitted: May 19, 2003; Accepted: Jun 18, 2003; Published:
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 informationAutomedians sets of permutation: extended abstract
Automedians sets of permutation: extended abstract Charles Desharnais and Sylvie Hamel DIRO - Université de Montréal, C. P. 6128 Succursale Centre-Ville, Montréal, Québec, Canada, H3C 3J7, {charles.desharnais,
More informationarxiv: v1 [math.co] 13 May 2016
arxiv:1605.04289v1 [math.co] 13 May 2016 Growth Rates of Permutation Classes: Categorization up to the Uncountability Threshold 1. Introduction Jay Pantone Department of Mathematics Dartmouth College Hanover,
More informationEnumeration of Pin-Permutations
Enumeration of Pin-Permutations Frédérique Bassino, athilde Bouvel, Dominique Rossin To cite this version: Frédérique Bassino, athilde Bouvel, Dominique Rossin. Enumeration of Pin-Permutations. 2008.
More informationLara Pudwell faculty.valpo.edu/lpudwell
Length 4 faculty.valpo.edu/lpudwell joint work with Charles Cratty (Westminster College) Samuel Erickson (Minnesota State Moorhead) Frehiwet Negassi (St. Joseph s College) Permutation 2015 London, UK June
More informationA combinatorial proof for the enumeration of alternating permutations with given peak set
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 57 (2013), Pages 293 300 A combinatorial proof for the enumeration of alternating permutations with given peak set Alina F.Y. Zhao School of Mathematical Sciences
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 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 informationTHE ENUMERATION OF PERMUTATIONS SORTABLE BY POP STACKS IN PARALLEL
THE ENUMERATION OF PERMUTATIONS SORTABLE BY POP STACKS IN PARALLEL REBECCA SMITH Department of Mathematics SUNY Brockport Brockport, NY 14420 VINCENT VATTER Department of Mathematics Dartmouth College
More informationInversions on Permutations Avoiding Consecutive Patterns
Inversions on Permutations Avoiding Consecutive Patterns Naiomi Cameron* 1 Kendra Killpatrick 2 12th International Permutation Patterns Conference 1 Lewis & Clark College 2 Pepperdine University July 11,
More information132-avoiding two-stack sortable permutations, Fibonacci numbers, and Pell numbers
Discrete Applied Mathematics 143 (004) 7 83 www.elsevier.com/locate/dam 13-avoiding two-stack sortable permutations, Fibonacci numbers, Pell numbers Eric S. Egge a, Touk Mansour b a Department of Mathematics,
More informationThe Brownian limit of separable permutations
The Brownian limit of separable permutations Mathilde Bouvel (Institut für Mathematik, Universität Zürich) talk based on a joint work with Frédérique Bassino, Valentin Féray, Lucas Gerin and Adeline Pierrot
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 informationGenerating trees for permutations avoiding generalized patterns
Generating trees for permutations avoiding generalized patterns Sergi Elizalde Dartmouth College Permutation Patterns 2006, Reykjavik Permutation Patterns 2006, Reykjavik p.1 Generating trees for permutations
More informationWhat Does the Future Hold for Restricted Patterns? 1
What Does the Future Hold for Restricted Patterns? by Zvezdelina Stankova Berkeley Math Circle Advanced Group November 26, 203. An Exhaustive Survey versus Paths for Further Research Restricted patterns
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 informationStacking Blocks and Counting Permutations
Stacking Blocks and Counting Permutations Lara K. Pudwell Valparaiso University Valparaiso, Indiana 46383 Lara.Pudwell@valpo.edu In this paper we will explore two seemingly unrelated counting questions,
More informationCorners in Tree Like Tableaux
Corners in Tree Like Tableaux Pawe l Hitczenko Department of Mathematics Drexel University Philadelphia, PA, U.S.A. phitczenko@math.drexel.edu Amanda Lohss Department of Mathematics Drexel University Philadelphia,
More informationarxiv: v1 [math.co] 7 Aug 2012
arxiv:1208.1532v1 [math.co] 7 Aug 2012 Methods of computing deque sortable permutations given complete and incomplete information Dan Denton Version 1.04 dated 3 June 2012 (with additional figures dated
More informationEquivalence classes of mesh patterns with a dominating pattern
Equivalence classes of mesh patterns with a dominating pattern Murray Tannock Thesis of 60 ECTS credits Master of Science (M.Sc.) in Computer Science May 2016 ii Equivalence classes of mesh patterns with
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 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 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 informationCompletion of the Wilf-Classification of 3-5 Pairs Using Generating Trees
Completion of the Wilf-Classification of 3-5 Pairs Using Generating Trees Mark Lipson Harvard University Department of Mathematics Cambridge, MA 02138 mark.lipson@gmail.com Submitted: Jan 31, 2006; Accepted:
More information1 Introduction and preliminaries
Generalized permutation patterns and a classification of the Mahonian statistics Eric Babson and Einar Steingrímsson Abstract We introduce generalized permutation patterns, where we allow the requirement
More informationComputing Permutations with Stacks and Deques
Michael Albert 1 Mike Atkinson 1 Steve Linton 2 1 Department of Computer Science, University of Otago 2 School of Computer Science, University of St Andrews 7th Australia New Zealand Mathematics Convention
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 informationPermutations avoiding an increasing number of length-increasing forbidden subsequences
Permutations avoiding an increasing number of length-increasing forbidden subsequences Elena Barcucci, Alberto Del Lungo, Elisa Pergola, Renzo Pinzani To cite this version: Elena Barcucci, Alberto Del
More informationarxiv: v1 [math.co] 16 Aug 2018
Two first-order logics of permutations arxiv:1808.05459v1 [math.co] 16 Aug 2018 Michael Albert, Mathilde Bouvel, Valentin Féray August 17, 2018 Abstract We consider two orthogonal points of view on finite
More informationarxiv: v1 [math.co] 31 Dec 2018
arxiv:1901.00026v1 [math.co] 31 Dec 2018 PATTERN AVOIDANCE IN PERMUTATIONS AND THEIR 1. INTRODUCTION SQUARES Miklós Bóna Department of Mathematics University of Florida Gainesville, Florida Rebecca Smith
More informationarxiv: v2 [math.co] 29 Sep 2017
arxiv:1709.10042v2 [math.co] 29 Sep 2017 A Counterexample Regarding Labelled Well-Quasi-Ordering Robert Brignall Michael Engen and Vincent Vatter School of Mathematics and Statistics The Open University
More informationENUMERATION SCHEMES FOR PATTERN-AVOIDING WORDS AND PERMUTATIONS
ENUMERATION SCHEMES FOR PATTERN-AVOIDING WORDS AND PERMUTATIONS BY LARA KRISTIN PUDWELL A dissertation submitted to the Graduate School New Brunswick Rutgers, The State University of New Jersey in partial
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 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 informationReading 14 : Counting
CS/Math 240: Introduction to Discrete Mathematics Fall 2015 Instructors: Beck Hasti, Gautam Prakriya Reading 14 : Counting In this reading we discuss counting. Often, we are interested in the cardinality
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 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 informationOn joint distribution of adjacencies, descents and some Mahonian statistics
FPSAC 2010, San Francisco, USA DMTCS proc. AN, 2010, 469 480 On joint distriution of adjacencies, descents and some Mahonian statistics Alexander Burstein 1 1 Department of Mathematics, Howard 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 informationarxiv: v2 [math.co] 27 Apr 2015
Well-Quasi-Order for Permutation Graphs Omitting a Path and a Clique arxiv:1312.5907v2 [math.co] 27 Apr 2015 Aistis Atminas 1 DIMAP and Mathematics Institute University of Warwick, Coventry, UK a.atminas@warwick.ac.uk
More informationGEOMETRIC GRID CLASSES OF PERMUTATIONS
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 365, Number 11, November 2013, Pages 5859 5881 S 0002-9947(2013)05804-7 Article electronically published on April 25, 2013 GEOMETRIC GRID CLASSES
More informationEquivalence 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 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 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 informationarxiv: v1 [math.co] 14 Oct 2014
Intervals of permutation class growth rates David Bevan arxiv:1410.3679v1 [math.co] 14 Oct 2014 Abstract We prove that the set of growth rates of permutation classes includes an infinite sequence of intervals
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 informationPostprint.
http://www.diva-portal.org Postprint This is the accepted version of a paper presented at 2th International Conference on Formal Power Series and Algebraic Combinatorics, FPSAC', Valparaiso, Chile, 23-2
More informationTHE TAYLOR EXPANSIONS OF tan x AND sec x
THE TAYLOR EXPANSIONS OF tan x AND sec x TAM PHAM AND RYAN CROMPTON Abstract. The report clarifies the relationships among the completely ordered leveled binary trees, the coefficients of the Taylor expansion
More information#A13 INTEGERS 15 (2015) THE LOCATION OF THE FIRST ASCENT IN A 123-AVOIDING PERMUTATION
#A13 INTEGERS 15 (2015) THE LOCATION OF THE FIRST ASCENT IN A 123-AVOIDING PERMUTATION Samuel Connolly Department of Mathematics, Brown University, Providence, Rhode Island Zachary Gabor Department of
More informationLatin squares and related combinatorial designs. Leonard Soicher Queen Mary, University of London July 2013
Latin squares and related combinatorial designs Leonard Soicher Queen Mary, University of London July 2013 Many of you are familiar with Sudoku puzzles. Here is Sudoku #043 (Medium) from Livewire Puzzles
More information