Enumerative Combinatorics with Fillings of Polyominoes
|
|
- Blaise Goodwin
- 5 years ago
- Views:
Transcription
1 Enumerative Combinatorics with Fillings of Polyominoes Catherine Yan Texas A&M Univesrity GSU, October, 204
2 2
3 Outline. Symmetry of the longest chains Subsequences in permutations and words Crossings and nestings in matchings and graphs A new model: fillings of moon polyominoes 2. Combinatorics of Fillings of Moon polyominoes Northeast and southeast chains Forbidden patterns Transformations Connections to other objects 3
4 Part I: Symmetry of the longest chains Permutations: (increasing subsequence) (decreasing subsequence) is(w) = longest i. s. = 3 ds(w)= longest d. s. = 4 [Deift, Baik & Johansson 99] Asymptotic distribution of is(w) and ds(w). is(w) and ds(w) are symmetric. 4
5 Crossings and nestings in matchings of [2n] (cr 2, ne 2 ) are symmetric! e.g. cr 2 ne # noncrossing matchings of [2n] = # nonnesting matchings of [2n] = nth Catalan number 5
6 k-crossings/nestings Theorem [Chen, Deng, Du] # matchings of [2n] with no 3-crossings = # matching of [2n] with no 3-nestings = # pairs of noncrossing Dyck paths Conjecture: #Matchings of [2n] with no k-crossings = # Matchings of [2n] with no k-nestings 6
7 Crossing and nesting number # k-crossing and # k-nesting: not symmetric How about maximal crossing and maximal nesting? For a matching M, cr(m)=max{ k: M has a k-crossing} ne(m)=max{k: M has a k-nesting } Goal: symmetry between cr and ne 7
8 Main result on Matchings Theorem [Chen, Deng, Du, Stanley & Y, 07] The pair (cr(m), ne(m)) has a symmetric joint distribution over all matchings on [2n]. Corollary. # matchings with no k-crossing = # matchings with no k-nesting 8
9 Idea: Oscillating tableau: a sequence of Ferrers diagrams ;=λ 0, λ,, λ 2n =; s.t. λ i = λ i- +/ - ; ; 9
10 Theorem [Stanley & Sundaram 90] There is a bijection between matchings of [2n] and oscillating tableaux of length 2n. It is realized by using standard Young tableaux and applying the RSK algorithm. Theorem [CDDSY] Taking conjugation in the tableaux exchanges cr(m) and ne(m). 0
11 Set Partitions of [n] A graphical representation π= {,4, 5, 7} {2,6} {3} Theorem. [CDDSY] (cr(¼), ne(¼)) has a symmetric distribution over all partitions of [n].
12 Filling of the triangular board Crossing: anti-identity submatrix (NE-chain) Nesting: identity submatrix (SE-chain) 2
13 An extension to Ferrers diagram 0-filling of any Ferrers diagram F Every row/column has at most one. NE-chain J k SE-chain I k 3
14 Ferrers diagram NE(F) = longest NE chain SE (F) = longest SE chain [Krattenthaler 06] Given a Ferrers diagram F and an integer n, then (NE(F), SE(F)) has a symmetric distribution over 0-fillings of F with n s.. 4
15 Generalized triangulation of n-gon k-triangulation: no k+ diagonals that are mutually intersecting 5
16 Results about k-triangulation [Capoyleas & Pach 92] k-triangulations of an n-gon has at most k(2n-2k-) lines. [Dress, Koolen & Moulton 02] maximal k-triangulation always has k(2n-2k-) lines [Jonsson 05] #maximal k-triangulations =a determinant of Catalan numbers. 6
17 Catalan number implies symmetry! try to avoid 7
18 Stack polyominoes [Jonsson 05, Jonsson & Welker 07]: F 0 (L, n, ne < k ) = F 0 (L, n, se < k) where n is the number of ones in the filling. 8
19 Moon polyominoes [Rubey ]: F(M, n, ne<k ) = F(M, n, se <k ) And F 0 (M, n, ne< k) = F 0 (M, n, se <k) 9
20 The General Model: fillings of moon polyominoes Polyomino: a finite set of square cells Moon polyomino: Convex intersection-free (no skew shape) 20
21 Fillings of moon polyominoes Assign an integer to each square Permuta -tions Words Matchings Set partitions Graphs Ferrers diagram Stack polyomino Moon polyomino 2
22 Part II: Combinatorics of fillings of moon polyominoes Northeast and southeast chains Forbidden patterns Transformations Connections to other objects 22
23 The model is general: Example. Chains of length 2 Permutation: inversion and coinversion ¼=62453 inversion: {(i - j): i > j } coinversion: {(i - j): i < j } inv(¼)= 9 : { 62, 64, 6, 65, 63, 2, 4, 43, 53} coinv(¼)=6: { 24, 25, 23, 45, 5, 3 } where [k] p.q is the (p,q)-integer p k- +p k-2 q + + pq k-2 + q k-. 23
24 On words over { n, 2 n 2,, k n k } A word is an arrangement of n, 2 n 2,, k n k Similar results for Matchings [de Sainte-Catherine 83] Set partitions [Kasraoui & Zeng 06] Linked partitions [Chen, Wu & Y 08] Crossing and alignment for permutations [Corteel 07] 24
25 inv(¼) coinv(¼) Theorem [Kasraoui 0] The pair (ne2, se2) has a symmetric joint distribution over the set of 0-fillings of a moon polyomino with any given column sum. 25
26 various mixed statistics Bicolor the rows of M and mixed by the position of the top cell/ bottom cell top-mixed statistic (S,M): and bottom-mixed statistic (S,M): and 26
27 Mix by the charge of a corner cell Positive chains and Negative chains and 27
28 Symmetry on mixed statistics Theorem. [Chen, Wang, Y, Zhao 0; Wang &Y 3 ] Let (A) be the number of any of the mixed statistics. (Hence (M-A) is the number of remaining 2-chains. ) Then the joint distribution of the pair ( (A), (M-A)) is always symmetric and independent of the subset A. Note: ( (;), (M)) = (se2(m), ne2(m)) ( (M), (;)) = (ne2(m), se2(m)) Special case for permutations: Chebikin
29 The model is special enough! Many things happen inside rectangles! 29
30 Example 2: k-noncrossing vs k- nonnesting Problem: # fillings with no k-crossing = # fillings with no k-nesting Method: Start with a filling with no k- crossing, then replace every appearance of k-nesting by other patterns. [Backelin, West, Xin 07] for 0-fillings of Ferrers diagrams [de Mier 07] for multi-graphs with fixed degree sequences 30
31 It applies to other patterns. Both papers compared patterns J k and One can get more Wilf-equivalent pairs. 3
32 Applies to symmetric fillings [Bousquet-Melou, Steingrimsson 05] symmetric 0-fillings of symmetric Ferrers diagrams involution 32
33 Example 3. The major index For a word a a 2 a n, a descent is a position i such that a i > a i+. maj(w) = { i : i 2 DES(w) }. [MacMahon 96] The major index is equadistributed to inv(w) over words. 33
34 Example 3. The major index For a word a a 2 a n, a descent is a position i such that a i > a i+. maj(w) = { i : i 2 DES(w) }. [MacMahon 96] The major index is equadistributed to inv(w) over words. [Chen, Poznanovik, Y & Yang 0] The major index can be extended to 0-fillings of moon polyominoes, which has the same distribution as ne 2. 34
35 Foata s map Φ with inv(φ(w))=maj(w) Recursive Definition: If w has length, Φ(w)=w. Otherwise, w= w a, then Φ(w) = γ a (Φ (w )) a w =w w n- a v v n- a Φ γ a w w n- u u n- v v n- 35
36 Many transformations! [CPYY] Foata-type transformations can be defined on fillings of left-aligned stack polyominoes which carry maj to ne 2 36
37 From polyomino to polyomino Bijection f from fillings of M to fillings of N s.t. maj(f) =maj(f(f)) Bejection g from fillings of M to fillings of N s.t. ne 2 (F) = ne 2 (g(f)) 37
38 And more Lattice path counting and descents in Ferrers diagrams Rook placement with restrictions Pattern avoidance and appearances Poset, P-partitions Simplicial complexes/schubert polynomials 38
39 Relation to other areas Free probability- noncrossing diagrams 39
40 Crossings appear in the combinatorial interpretations of Mixed moments of random variables Moments of orthogonal polynomials Linearization coefficients 40
41 Graph optimization and layout: A partition of the edges into k-sets of noncrossing (non-nesting) edges 4
42 Stacks and Queues Stack-number: minimum k such that there is a total order of the vertices with which G has a k-stack layout Queue-number: minimum k such that there is a total order of the vertices with which G has a k-queue layout 42
43 43
44 Combinatorial computational biology: RNA pseudo knot structures 44
45 T H A N K Y O U V E R Y M U C H! 45
Enumerative Combinatorics with Fillings of Polyominoes
Enumerative Combinatorics with Fillings of Polyominoes Catherine Yan Texas A&M University Tulane, March 205 Tulane, March 205 2 Outline. Symmetry of the longest chains Subsequences in permutations and
More informationChains of Length 2 in Fillings of Layer Polyominoes
Chains of Length 2 in Fillings of Layer Polyominoes Mitch Phillipson, Catherine H. Yan and Jean Yeh Department of Mathematics Texas A&M University College Station, Texas, U.S.A. {phillipson,cyan,jeanyeh}@math.tamu.edu
More informationMajor Index for 01-Fillings of Moon Polyominoes
Major Index for 0-Fillings of Moon Polyominoes William Y.C. Chen a,, Svetlana Poznanović b, Catherine H. Yan a,b,2 and Arthur L.B. Yang a, a Center for Combinatorics, LPMC-TJKLC Nankai University, Tianjin
More informationMixed Statistics on 01-Fillings of Moon Polyominoes
FPSAC 200, San Francisco, USA DMTCS proc. AN, 200, 48 492 Mixed Statistics on 0-Fillings of Moon Polyominoes William Y. C. Chen and Andrew Y. Z. Wang and Catherine H. Yan 2 and Alina F. Y. Zhao Center
More informationd-regular SET PARTITIONS AND ROOK PLACEMENTS
Séminaire Lotharingien de Combinatoire 62 (2009), Article B62a d-egula SET PATITIONS AND OOK PLACEMENTS ANISSE KASAOUI Université de Lyon; Université Claude Bernard Lyon 1 Institut Camille Jordan CNS UM
More informationOn the symmetry of the distribution of k-crossings and k-nestings in graphs
On the symmetry of the distribution of k-crossings and k-nestings in graphs Anna de Mier Submitted: Oct 11, 2006; Accepted: Nov 7, 2006; Published: Nov 23, 2006 Mathematics Subject Classification: 05A19
More informationPatterns in Standard Young Tableaux
Patterns in Standard Young Tableaux Sara Billey University of Washington Slides: math.washington.edu/ billey/talks Based on joint work with: Matjaž Konvalinka and Joshua Swanson 6th Encuentro Colombiano
More informationCrossings and Nestings in Tangled Diagrams
Crossings and Nestings in Tangled Diagrams William Y. C. Chen 1, Jing Qin 2 and Christian M. Reidys 3 Center for Combinatorics, LPMC-TJKLC Nankai University, Tianjin 300071, P. R. China 1 chen@nankai.edu.cn,
More informationIncreasing and Decreasing Subsequences
Increasing and Decreasing Subsequences Richard P. Stanley M.I.T. Permutations Permutations First lecture: increasing and decreasing subsequences Permutations First lecture: increasing and decreasing
More informationStandard Young Tableaux Old and New
Standard Young Tableaux Old and New Ron Adin and Yuval Roichman Department of Mathematics Bar-Ilan University Workshop on Group Theory in Memory of David Chillag Technion, Haifa, Oct. 14 1 2 4 3 5 7 6
More informationHomomesy of Alignments in Perfect Matchings
Homomesy of Alignments in Perfect Matchings Ingrid Zhang under the direction of Sam Hopkins Department of Mathematics Massachusetts Institute of Technology Research Science Institute July 0, 2014 Abstract
More informationSome Catalan Musings p. 1. Some Catalan Musings. Richard P. Stanley
Some Catalan Musings p. 1 Some Catalan Musings Richard P. Stanley Some Catalan Musings p. 2 An OEIS entry A000108: 1,1,2,5,14,42,132,429,... Some Catalan Musings p. 2 An OEIS entry A000108: 1,1,2,5,14,42,132,429,...
More informationEnumeration of Set Partitions Refined by. Crossing and Nesting Numbers
Enumeration of Set Partitions Refined by Crossing and Nesting Numbers by Wei Chen B.Sc., Rutgers University, 2010 Thesis Submitted in Partial Fulfillment of the Requirements for the Degree of Master of
More informationA Major Index for Matchings and Set Partitions
A Major Index for Matchings and Set Partitions William Y.C. Chen,5, Ira Gessel, Catherine H. Yan,6 and Arthur L.B. Yang,5,, Center for Combinatorics, LPMC Nankai University, Tianjin 0007, P. R. China Department
More informationCycles and sorting index for matchings and restricted permutations
FPSAC 2013 Paris, France DMTCS proc. AS, 2013, 731 742 Cycles and sorting index for matchings and restricted permutations Svetlana Poznanović Department of Mathematical Sciences, Clemson University, Clemson,
More informationInvolutions by Descents/Ascents and Symmetric Integral Matrices. Alan Hoffman Fest - my hero Rutgers University September 2014
by Descents/Ascents and Symmetric Integral Matrices Richard A. Brualdi University of Wisconsin-Madison Joint work with Shi-Mei Ma: European J. Combins. (to appear) Alan Hoffman Fest - my hero Rutgers University
More informationEQUIDISTRIBUTIONS OF MAHONIAN STATISTICS OVER PATTERN AVOIDING PERMUTATIONS (EXTENDED ABSTRACT)
EQUIDISTRIBUTIONS OF MAHONIAN STATISTICS OVER PATTERN AVOIDING PERMUTATIONS (EXTENDED ABSTRACT) NIMA AMINI 1. Introduction A Mahonian d-function is a Mahonian statistic that can be expressed as a linear
More informationTableau sequences, open diagrams, and Baxter families
Tableau sequences, open diagrams, and Baxter families Sophie Burrill a, Julien Courtiel a, Eric Fusy b, Stephen Melczer c, Marni Mishna a, a Department of Mathematics, Simon Fraser University, Burnaby,
More informationThe Gaussian coefficient revisited
The Gaussian coefficient revisited Richard EHRENBORG and Margaret A. READDY Abstract We give new -(1+)-analogue of the Gaussian coefficient, also now as the -binomial which, lie the original -binomial
More informationarxiv:math/ v1 [math.co] 27 Nov 2006
arxiv:math/0611822v1 [math.co] 27 Nov 2006 AN EXTENSION OF THE FOATA MAP TO STANDARD YOUNG TABLEAUX J. HAGLUND,1 AND L. STEVENS Department of Mathematics, University of Pennsylvania, Philadelphia, PA 19104-6395,
More informationRCC. Drew Armstrong. FPSAC 2017, Queen Mary, London. University of Miami armstrong
RCC Drew Armstrong University of Miami www.math.miami.edu/ armstrong FPSAC 2017, Queen Mary, London Outline of the Talk 1. The Frobenius Coin Problem 2. Rational Dyck Paths 3. Core Partitions 4. The Double
More informationDecreasing Subsequences in Permutations and Wilf Equivalence for Involutions
Journal of Algebraic Combinatorics, 22, 383 409, 2005 c 2005 Springer Science + Business Media, Inc. Manufactured in The Netherlands. Decreasing Subsequences in Permutations and Wilf Equivalence for Involutions
More informationCROSSINGS AND NESTINGS OF MATCHINGS AND PARTITIONS
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 00, Number 0, Pages 000 000 S 0002-9947(XX)0000-0 CROSSINGS AND NESTINGS OF MATCHINGS AND PARTITIONS WILLIAM Y.C. CHEN, EVA Y.P. DENG, ROSENA R.X.
More informationEnumeration on row-increasing tableaux of shape 2 n
Enumeration on row-increasing tableaux of shape 2 n Rosena R. X. Du East China Normal University, Shanghai, China Joint work with Xiaojie Fan and Yue Zhao Shanghai Jiaotong University June 25, 2018 2/38
More informationAsymptotics for minimal overlapping patterns for generalized Euler permutations, standard tableaux of rectangular shapes, and column strict arrays
Discrete Mathematics and Theoretical Computer Science DMTCS vol. 8:, 06, #6 arxiv:50.0890v4 [math.co] 6 May 06 Asymptotics for minimal overlapping patterns for generalized Euler permutations, standard
More informationCombinatorial Structures
Combinatorial Structures Contents 1 Permutations 1 Partitions.1 Ferrers diagrams....................................... Skew diagrams........................................ Dominance order......................................
More informationarxiv: v1 [math.co] 5 Oct 2007
SOME BIJECTIONS ON SET PARTITIONS ROBERT PARVIAINEN Abstract We study three similar bijections on set partitions The first is an involution defined by Kasraoui and Zeng which proves the symmetry of the
More informationAn injection from standard fillings to parking functions
FPSAC 202, Nagoya, Japan DMTCS proc. AR, 202, 703 74 An injection from standard fillings to parking functions Elizabeth Niese Department of Mathematics, Marshall University, Huntington, WV 25755 Abstract.
More informationBijective Proofs with Spotted Tilings
Brian Hopkins, Saint Peter s University, New Jersey, USA Visiting Scholar, Mahidol University International College Editor, The College Mathematics Journal MUIC Mathematics Seminar 2 November 2016 outline
More informationMULTI-ORDERED POSETS. Lisa Bishop Department of Mathematics, Occidental College, Los Angeles, CA 90041, United States.
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7 (2007), #A06 MULTI-ORDERED POSETS Lisa Bishop Department of Mathematics, Occidental College, Los Angeles, CA 90041, United States lbishop@oxy.edu
More informationDIFFERENTIAL POSETS SIMON RUBINSTEIN-SALZEDO
DIFFERENTIAL POSETS SIMON RUBINSTEIN-SALZEDO Abstract. In this paper, we give a sampling of the theory of differential posets, including various topics that excited me. Most of the material is taken from
More informationThe Catalan matroid.
The Catalan matroid. arxiv:math.co/0209354v1 25 Sep 2002 Federico Ardila fardila@math.mit.edu September 4, 2002 Abstract We show how the set of Dyck paths of length 2n naturally gives rise to a matroid,
More informationSome Catalan Musings p. 1. Some Catalan Musings. Richard P. Stanley
Some Catalan Musings p. 1 Some Catalan Musings Richard P. Stanley Some Catalan Musings p. 2 An OEIS entry A000108: 1,1,2,5,14,42,132,429,... Some Catalan Musings p. 2 An OEIS entry A000108: 1,1,2,5,14,42,132,429,...
More informationRational Catalan Combinatorics
Rational Catalan Combinatorics Eugene Gorsky UC Davis Bay Area Discrete Math Day October 17, 2015 Counting Dyck paths Catalan numbers The Catalan number is the number of Dyck paths, that is, lattice paths
More informationPattern Avoidance in Set Partitions
Pattern Avoidance in Set Partitions Bruce E. Sagan Department of Mathematics Michigan State University East Lansing, MI 48824-1027 USA sagan@math.msu.edu May 19, 2006 Key Words: D-finite, enumeration,
More informationRESEARCH STATEMENT. Sergi Elizalde
RESEARCH STATEMENT Sergi Elizalde My research interests are in the field of enumerative and algebraic combinatorics. Much of my work during the past years has been on enumeration problems, bijective combinatorics
More informationPLANE PARTITIONS AMY BECKER, LILLY BETKE-BRUNSWICK, ANNA ZINK
PLANE PARTITIONS AMY BECKER, LILLY BETKE-BRUNSWICK, ANNA ZINK Abstract. Throughout our study of the enumeration of plane partitions we make use of bijective proofs to find generating functions. In particular,
More informationarxiv:math/ v1 [math.co] 6 Oct 2006
A BIJECTION BETWEEN -TRIANGULATIONS AND PAIRS OF NON-CROSSING DYCK PATHS arxiv:math/00v math.co Oct 00 SERGI ELIZALDE Abstract A k-triangulation of a convex polygon is a maximal set of diagonals so that
More informationSelf-dual interval orders and row-fishburn matrices
Self-dual interval orders and row-fishburn matrices Sherry H. F. Yan Department of Mathematics Zhejiang Normal University Jinhua 321004, P.R. China huifangyan@hotmail.com Yuexiao Xu Department of Mathematics
More informationLinked partitions and linked cycles
European Journal of Combinatorics 29 (2008) 1408 1426 www.elsevier.com/locate/ejc Linked partitions and linked cycles William Y.C. Chen a, Susan Y.J. Wu a, Catherine H. Yan a,b a Center for Combinatorics,
More informationpatterns Lara Pudwell faculty.valpo.edu/lpudwell
faculty.valpo.edu/lpudwell joint work with Andrew Baxter Permutation 2014 East Tennessee State University July 7, 2014 Ascents Definition An ascent in the string x 1 x n is a position i such that x i
More informationFinding parking when not commuting. Jon McCammond U.C. Santa Barbara
Finding parking when not commuting 7 6 8 1 2 3 5 4 {{1,4,5}, {2,3}, {6,8}, {7}} Jon McCammond U.C. Santa Barbara 1 A common structure The main goal of this talk will be to introduce you to a mathematical
More informationNOTES ABOUT SATURATED CHAINS IN THE DYCK PATH POSET. 1. Basic Definitions
NOTES ABOUT SATURATED CHAINS IN THE DYCK PATH POSET JENNIFER WOODCOCK 1. Basic Definitions Dyck paths are one of the many combinatorial objects enumerated by the Catalan numbers, sequence A000108 in [2]:
More informationLARGE SCHRÖDER PATHS BY TYPES AND SYMMETRIC FUNCTIONS
Bull. Korean Math. Soc. 51 (2014), No. 4, pp. 1229 1240 http://dx.doi.org/10.4134/bkms.2014.51.4.1229 LARGE SCHRÖDER PATHS BY TYPES AND SYMMETRIC FUNCTIONS Su Hyung An, Sen-Peng Eu, and Sangwook Kim Abstract.
More informationFinding parking when not commuting. Jon McCammond U.C. Santa Barbara
Finding parking when not commuting PSfrag replacements 7 8 1 2 6 3 5 {{1, 4, 5}, {2, 3}, {6, 8}, {7}} 4 Jon McCammond U.C. Santa Barbara 1 A common structure The goal of this talk will be to introduce
More informationCharacters, Derangements and Descents for the Hyperoctahedral Group
Characters, Derangements and Descents for the Hyperoctahedral Group Christos Athanasiadis joint with Ron Adin, Sergi Elizalde and Yuval Roichman University of Athens July 9, 2015 1 / 42 Outline 1 Motivation
More informationENUMERATION OF TREES AND ONE AMAZING REPRESENTATION OF THE SYMMETRIC GROUP. Igor Pak Harvard University
ENUMERATION OF TREES AND ONE AMAZING REPRESENTATION OF THE SYMMETRIC GROUP Igor Pak Harvard University E-mail: pak@math.harvard.edu Alexander Postnikov Massachusetts Institute of Technology E-mail: apost@math.mit.edu
More informationMoments of Matching Statistics
Moments of Matching Statistics Catherine Yan Department of Mathematics Texas A&M University College Station, TX 77843, USA joint with Niraj Khare and Rudolph Lorentz CombinaTexas 2016 1 / 17 Background
More informationm-level rook placements
m-level rook placements Kenneth Barrese Department of Mathematics, Michigan State University, East Lansing, MI 48824-1027 baressek@math.msu.edu Nicholas Loehr Department of Mathematics, Virginia Tech Blacksburg,
More informationA combinatorial approach to the q, t-symmetry relation in Macdonald polynomials
A combinatorial approach to the q, t-symmetry relation in Macdonald polynomials Maria Monks Gillespie Department of Mathematics University of California, Berkeley Berkeley, CA, U.S.A. monks@math.berkeley.edu
More informationarxiv: v1 [math.co] 30 Aug 2017
Parking Cars of Different Sizes arxiv:1708.09077v1 [math.co] 30 Aug 2017 Richard Ehrenborg and Alex Happ Abstract We extend the notion of parking functions to parking sequences, which include cars of different
More informationMore about partitions
Partitions 2.4, 3.4, 4.4 02 More about partitions 3 + +, + 3 +, and + + 3 are all the same partition, so we will write the numbers in non-increasing order. We use greek letters to denote partitions, often
More informationGeneralizations of Permutation Statistics to Words and Labeled Forests
Clemson University TigerPrints All Dissertations Dissertations 8-2018 Generalizations of Permutation Statistics to Words and Labeled Forests Amy Christine Grady Clemson University, acgrady430@gmail.com
More informationEnumerating rc-invariant Permutations with No Long Decreasing Subsequences
Enumerating rc-invariant Permutations with No Long Decreasing Subsequences Eric S. Egge Department of Mathematics Carleton College Northfield, MN 55057 USA eegge@carleton.edu Abstract We use the Robinson-Schensted-Knuth
More informationarxiv:math/ v1 [math.co] 10 Nov 1998
A self-dual poset on objects counted by the Catalan numbers arxiv:math/9811067v1 [math.co] 10 Nov 1998 Miklós Bóna School of Mathematics Institute for Advanced Study Princeton, NJ 08540 April 11, 2017
More informationWhat you learned in Math 28. Rosa C. Orellana
What you learned in Math 28 Rosa C. Orellana Chapter 1 - Basic Counting Techniques Sum Principle If we have a partition of a finite set S, then the size of S is the sum of the sizes of the blocks of the
More informationarxiv: v1 [math.co] 22 Oct 2007
CROSSINGS AND NESTINGS IN TANGLED-DIAGRAMS arxiv:0710.4053v1 [math.co] 22 Oct 2007 WILLIAM Y. C. CHEN, JING QIN AND CHRISTIAN M. REIDYS Abstract. A tangled-diagram is graph of degree less than two whose
More informationENUMERATION OF CONNECTED CATALAN OBJECTS BY TYPE. 1. Introduction
ENUMERATION OF CONNECTED CATALAN OBJECTS BY TYPE BRENDON RHOADES Abstract. Noncrossing set partitions, nonnesting set partitions, Dyck paths, and rooted plane trees are four classes of Catalan objects
More informationDescents in Parking Functions
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 21 (2018), Article 18.2.3 Descents in Parking Functions Paul R. F. Schumacher 1512 Oakview Street Bryan, TX 77802 USA Paul.R.F.Schumacher@gmail.com Abstract
More informationEnumerative and Algebraic Combinatorics of OEIS A071356
Enumerative and Algebraic Combinatorics of OEIS A071356 Chetak Hossain Department of Matematics North Carolina State University July 9, 2018 Chetak Hossain (NCSU) Combinatorics of OEIS A071356 July 9,
More informationRational Catalan Combinatorics: Intro
Rational Catalan Combinatorics: Intro Vic Reiner Univ. of Minnesota reiner@math.umn.edu AIM workshop Dec. 17-21, 2012 Goals of the workshop 1 Reinforce existing connections and forge new connections between
More informationq xk y n k. , provided k < n. (This does not hold for k n.) Give a combinatorial proof of this recurrence by means of a bijective transformation.
Math 880 Alternative Challenge Problems Fall 2016 A1. Given, n 1, show that: m1 m 2 m = ( ) n+ 1 2 1, where the sum ranges over all positive integer solutions (m 1,..., m ) of m 1 + + m = n. Give both
More informationContainment restrictions
Containment restrictions Tibor Szabó Extremal Combinatorics, FU Berlin, WiSe 207 8 In this chapter we switch from studying constraints on the set operation intersection, to constraints on the set relation
More informationPATTERNS IN SET PARTITIONS AND RESTRICTED GROWTH FUNCTIONS. Samantha Dahlberg
PATTERNS IN SET PARTITIONS AND RESTRICTED GROWTH FUNCTIONS By Samantha Dahlberg A THESIS Submitted to Michigan State University in partial fulfillment of the requirements for the degree of Mathematics
More informationCombinatorics of Tableau Inversions
Combinatorics of Tableau Inversions Jonathan E. Beagley Paul Drube Department of Mathematics and Statistics Valparaiso University Valparaiso, IN 46383-6493, U.S.A. {jon.beagley, paul.drube}@valpo.edu Submitted:
More informationEQUIDISTRIBUTION AND SIGN-BALANCE ON 321-AVOIDING PERMUTATIONS
Séminaire Lotharingien de Combinatoire 51 (2004), Article B51d EQUIDISTRIBUTION AND SIGN-BALANCE ON 321-AVOIDING PERMUTATIONS RON M. ADIN AND YUVAL ROICHMAN Abstract. Let T n be the set of 321-avoiding
More informationReduced words and a formula of Macdonald
Reduced words and a formula of Macdonald Sara Billey University of Washington Based on joint work with: Alexander Holroyd and Benjamin Young preprint arxiv:70.096 Graduate Student Combinatorics Conference
More informationGENERALIZATION OF THE SIGN REVERSING INVOLUTION ON THE SPECIAL RIM HOOK TABLEAUX. Jaejin Lee
Korean J. Math. 8 (00), No., pp. 89 98 GENERALIZATION OF THE SIGN REVERSING INVOLUTION ON THE SPECIAL RIM HOOK TABLEAUX Jaejin Lee Abstract. Eğecioğlu and Remmel [] gave a combinatorial interpretation
More informationON MULTI-AVOIDANCE OF RIGHT ANGLED NUMBERED POLYOMINO PATTERNS
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 4 (2004), #A21 ON MULTI-AVOIDANCE OF RIGHT ANGLED NUMBERED POLYOMINO PATTERNS Sergey Kitaev Department of Mathematics, University of Kentucky,
More informationOn the H-triangle of generalised nonnesting partitions
FPSAC 204, Chicago, USA DMTCS proc. AT, 204, 83 90 On the H-triangle of generalised nonnesting partitions Marko Thiel Department of Mathematics, University of Vienna, Austria Abstract. With a crystallographic
More informationEnumeration of polyominoes defined in terms of pattern avoidance or convexity constraints
arxiv:45.346v [math.co] 3 May 24 Enumeration of polyominoes defined in terms of pattern avoidance or convexity constraints Thesis of the University of Siena and the University of Nice Sophia Antipolis
More informationThe symmetric group action on rank-selected posets of injective words
The symmetric group action on rank-selected posets of injective words Christos A. Athanasiadis Department of Mathematics University of Athens Athens 15784, Hellas (Greece) caath@math.uoa.gr October 28,
More informationA weighted interpretation for the super Catalan numbers
A weighted interpretation for the super Catalan numbers ariv:1403.5246v2 [math.co] 26 Aug 24 Emily Allen Irina Gheorghiciuc Abstract The super Catalan numbers T (m, n) = (2m)!(2n)!/2m!n!(m+n)! are integers
More informationCatalan numbers Wonders of Science CESCI, Madurai, August
Catalan numbers Wonders of Science CESCI, Madurai, August 25 2009 V.S. Sunder Institute of Mathematical Sciences Chennai, India sunder@imsc.res.in August 25, 2009 Enumerative combinatorics Enumerative
More informationExcluded permutation matrices and the Stanley Wilf conjecture
Excluded permutation matrices and the Stanley Wilf conjecture Adam Marcus Gábor Tardos November 2003 Abstract This paper examines the extremal problem of how many 1-entries an n n 0 1 matrix can have that
More informationPartitions, permutations and posets Péter Csikvári
Partitions, permutations and posets Péter Csivári In this note I only collect those things which are not discussed in R Stanley s Algebraic Combinatorics boo Partitions For the definition of (number) partition,
More informationProblem 1. Let f n (x, y), n Z, be the sequence of rational functions in two variables x and y given by the initial conditions.
18.217 Problem Set (due Monday, December 03, 2018) Solve as many problems as you want. Turn in your favorite solutions. You can also solve and turn any other claims that were given in class without proofs,
More informationPattern avoidance in partial permutations
Pattern avoidance in partial permutations Anders Claesson Department of Computer and Information Sciences, University of Strathclyde, Glasgow, G1 1XH, UK anders.claesson@cis.strath.ac.uk Vít Jelínek Fakultät
More informationPattern Avoidance of Generalized Permutations
Pattern Avoidance of Generalized Permutations arxiv:1804.06265v1 [math.co] 17 Apr 2018 Zhousheng Mei, Suijie Wang College of Mathematics and Econometrics Hunan University, Changsha, China. zhousheng@hnu.edu.cn,
More informationA Survey of Parking Functions
A Survey of Parking Functions Richard P. Stanley M.I.T. Parking functions... n 2 1... a a a 1 2 n Car C i prefers space a i. If a i is occupied, then C i takes the next available space. We call (a 1,...,a
More informationAnimals and 2-Motzkin Paths
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol 8 (2005), Article 0556 Animals and 2-Motzkin Paths Wen-jin Woan 1 Department of Mathematics Howard University Washington, DC 20059 USA wwoan@howardedu
More informationLinked Partitions and Linked Cycles
Linked Partitions and Linked Cycles William Y. C. Chen 1,4, Susan Y. J. Wu 2 and Catherine H. Yan 3,5 1,2,3 Center for Combinatorics, LPMC Nankai University, Tianjin 300071, P. R. China 3 Department of
More informationCounting chains in noncrossing partition lattices
Counting chains in noncrossing partition lattices Nathan Reading NC State University NCSU Algebra Seminar, November 16, 2007 1 Counting chains in noncrossing partition lattices Classical noncrossing partitions
More informationCHAINS OF MAXIMUM LENGTH IN THE TAMARI LATTICE
CHAINS OF MAXIMUM LENGTH IN THE TAMARI LATTICE SUSANNA FISHEL AND LUKE NELSON Abstract. The Tamari lattice T n was originally defined on bracketings of a set of n+1 objects, with a cover relation based
More informationCoxeter-Knuth Classes and a Signed Little Bijection
Coxeter-Knuth Classes and a Signed Little Bijection Sara Billey University of Washington Based on joint work with: Zachary Hamaker, Austin Roberts, and Benjamin Young. UC Berkeley, February, 04 Outline
More informationRook theory and simplicial complexes
Rook theory and simplicial complexes Ira M. Gessel Department of Mathematics Brandeis University A Conference to Celebrate The Mathematics of Michelle Wachs University of Miami, Coral Gables, Florida January
More informationOn divisibility of Narayana numbers by primes
On divisibility of Narayana numbers by primes Miklós Bóna Department of Mathematics, University of Florida Gainesville, FL 32611, USA, bona@math.ufl.edu and Bruce E. Sagan Department of Mathematics, Michigan
More informationA Survey of Alternating Permutations
A Survey of Alternating Permutations Richard P. Stanley Abstract. A permutation a 1 a 2 a n of 1, 2,..., n is alternating if a 1 > a 2 < a 3 > a 4
More informationCombinatorics of non-associative binary operations
Combinatorics of non-associative binary operations Jia Huang University of Nebraska at Kearney E-mail address: huangj2@unk.edu December 26, 2017 This is joint work with Nickolas Hein (Benedictine College),
More informationA proof of the Square Paths Conjecture
A proof of the Square Paths Conjecture Emily Sergel Leven October 7, 08 arxiv:60.069v [math.co] Jan 06 Abstract The modified Macdonald polynomials, introduced by Garsia and Haiman (996), have many astounding
More informationA Bijection between Maximal Chains in Fibonacci Posets
journal of combinatorial theory, Series A 78, 268279 (1997) article no. TA972764 A Bijection between Maximal Chains in Fibonacci Posets Darla Kremer Murray State University, Murray, Kentucky 42071 and
More informationON PARTITIONS AVOIDING 3-CROSSINGS
Séminaire Lotharingien de Combinatoire 54 (2006, Article B54e ON PARTITIONS AVOIDING 3-CROSSINGS MIREILLE BOUSQUET-MÉLOU AND GUOCE XIN To Xavier Viennot, on the occasion of his 60th birthday Abstract.
More informationDESCENT SETS FOR SYMPLECTIC GROUPS
DESCENT SETS FOR SYMPLECTIC GROUPS MARTIN RUBEY, BRUCE E. SAGAN, AND BRUCE W. WESTBURY Abstract. The descent set of an oscillating (or up-down) tableau is introduced. This descent set plays the same role
More informationFactorial Schur functions via the six vertex model
Factorial Schur functions via the six vertex model Peter J. McNamara Department of Mathematics Massachusetts Institute of Technology, MA 02139, USA petermc@math.mit.edu October 31, 2009 Abstract For a
More informationRecent developments on log-concavity and q-log-concavity of combinatorial polynomials
Recent developments on log-concavity and q-log-concavity of combinatorial polynomials William Y.C. Chen joint work with Cindy C.Y. Gu, Sabrina X.M. Pang, Ellen X.Y. Qu, Robert L. Tang, Carol J. Wang, Larry
More informationENUMERATING PERMUTATIONS AVOIDING A PAIR OF BABSON-STEINGRíMSSON PATTERNS
ENUMERATING PERMUTATIONS AVOIDING A PAIR OF BABSON-STEINGRíMSSON PATTERNS ANDERS CLAESSON AND TOUFIK MANSOUR Abstract. Babson and Steingrímsson introduced generalized permutation patterns that allow the
More informationThe (q, t)-catalan Numbers and the Space of Diagonal Harmonics. James Haglund. University of Pennsylvania
The (q, t)-catalan Numbers and the Space of Diagonal Harmonics James Haglund University of Pennsylvania Outline Intro to q-analogues inv and maj q-catalan Numbers MacMahon s q-analogue The Carlitz-Riordan
More informationA Characterization of (3+1)-Free Posets
Journal of Combinatorial Theory, Series A 93, 231241 (2001) doi:10.1006jcta.2000.3075, available online at http:www.idealibrary.com on A Characterization of (3+1)-Free Posets Mark Skandera Department of
More information2 IGOR PAK so we loose some information about the structure of the tilings since there could be many tilings of with the same multiset of tiles (see e
RIBBON TILE INVARIANTS Igor Pak MIT E-mail: pak@math.mit.edu September 30, 1997 Abstract. Let T be a nite set of tiles, B be a set of regions tileable by T. We introduce a tile counting group G (T; B)
More informationCoxeter-Knuth Graphs and a signed Little Bijection
Coxeter-Knuth Graphs and a signed Little Bijection Sara Billey University of Washington http://www.math.washington.edu/ billey AMS-MAA Joint Meetings January 17, 2014 0-0 Outline Based on joint work with
More information