Orientations bipolaires et chemins tandem. Éric Fusy (CNRS/LIX) Travaux avec Mireille Bousquet-Mélou et Kilian Raschel

Size: px
Start display at page:

Download "Orientations bipolaires et chemins tandem. Éric Fusy (CNRS/LIX) Travaux avec Mireille Bousquet-Mélou et Kilian Raschel"

Transcription

1 Orientations bipolaires et chemins tandem Éric Fusy (CR/LIX) Travaux avec Mireille Bousquet-Mélou et Kilian Raschel Journées lea, 2017

2 Tandem walks tandem-walk is a walk in Z 2 with step-set {, W, E} in the plane Z 2 in the half-plane {y 0} in the quarter plane 2 cf 2 queues in series E W y x

3 Link to Young tableaux of height 3 There is a bijection between: tandem walks of length n staying in the quadrant 2, ending at (i, j) Young tableaux of size n and height 3, of shape j i start walk 11 end E W tableau (after k steps, current y = # #E, current x = #E #W )

4 Link to Young tableaux of height 3 There is a bijection between: tandem walks of length n staying in the quadrant 2, ending at (i, j) Young tableaux of size n and height 3, of shape j m i start walk 11 end E W tableau (after k steps, current y = # #E, current x = #E #W ) Let q[n; i, j] := # tandem walks of length n in 2, ending at (i, j) Hook-length formula: for n of the form n = 3m + 2i + j we have (i + 1)(j + 1)(i + j + 2)n q[n; i, j] = m!(m + i + 1)!(m + i + j + 2)!

5 lgebraicity when the endpoint is free Let Q(t; x, y) = n,i,j q[n; i, j]t n x i y j Theorem: [Gouyou-Beauchamps 89], [Bousquet-Mélou,Mishna 10] Then Q(t, 1, 1) is the series counting Motzkin walks, i.e., Y t Q(t, 1, 1) satisfies Y = t (1 + Y + Y 2 ) Y = t + t Y + t Y 2

6 ijection with Motzkin walks [Gouyou-Beauchamps 89] tandem walk in Young tableau of height 3

7 ijection with Motzkin walks [Gouyou-Beauchamps 89] tandem walk in Young tableau of height 3 Robinson chensted involution with no

8 ijection with Motzkin walks [Gouyou-Beauchamps 89] matching with no nesting tandem walk in Young tableau of height 3 Robinson chensted involution with no

9 ijection with Motzkin walks [Gouyou-Beauchamps 89] matching with no nesting tandem walk in Young tableau of height 3 Robinson chensted involution with no no nesting FIFO Motzkin walk

10 ijection with Motzkin walks [Gouyou-Beauchamps 89] tandem walk in Young tableau of height 3 Robinson chensted involution with no no nesting FIFO Motzkin walk LIFO no crossing matching with no nesting

11 Reformulation with half-plane tandem-walks There is a bijection between: tandem walks of length n staying in the quarter plane 2 end tandem walks of length n staying in the half-plane {y 0} and ending at y = 0 y start start end t Rk: The bijection preserves the number of E steps

12 n extension of the walk model General model: level 3 step-set: the E step every step ( i, j) (with i, j 0) level 2 level:= i + j level 1 Example: end start y E x

13 n extension of the walk model General model: level 3 step-set: the E step every step ( i, j) (with i, j 0) level 2 level:= i + j level 1 Example: end start y E x There is still a bijection between: general tandem walks of length n in the quarter plane 2 general tandem walks of length n in {y 0} ending at y = 0 The bijection preserves the number of E-steps and the number of steps in each level p 1

14 Bipolar and marked bipolar orientations bipolar orientation: (on planar maps) = acyclic orientation with a unique source and a unique sink with, incident to the outer face inner vertex inner face

15 Bipolar and marked bipolar orientations bipolar orientation: (on planar maps) = acyclic orientation with a unique source and a unique sink with, incident to the outer face marked bipolar orientation: a marked vertex on left boundary a marked vertex on right boundary outdegree=1 inner vertex inner face indegree=1

16 The Kenyon et al. bijection general tandem-walk (in Z 2 ) E step step ( i, j) bijection [Kenyon, Miller, heffield, Wilson 16] marked bipolar orientation black vertex inner face of degree i+j+2 = = = = = =

17 The Kenyon et al. bijection E steps create a new black vertex [Kenyon, Miller, heffield, Wilson 16] = = + E-step +E-step steps ( i, j) create a new inner face (of degree i + j + 2)

18 Parameter-correspondence in the bijection # face-steps of level p # inner faces of degree p + 2 # E-steps # black vertices 1 + # steps # plain edges (not dashed) minimal abscissa start L L +1 L end minimal ordinate L+1

19 n involution on marked bipolar orientations L +1 L+1 L +1 L+1

20 n involution on marked bipolar orientations L +1 L +1 L+1 mirror L+1 L +1 L +1 L+1 L+1

21 Effect of the involution on walks L +1 L +1 involution minimal abscissa L+1 L+1 start L minimal abscissa L start L end minimal ordinate L end minimal ordinate

22 Quarter plane walks half-plane walks ending at y = 0 minimal abscissa start L minimal abscissa L start L end minimal ordinate L end minimal ordinate pecialize the involution at {L = 0, = 0} L L

23 Quarter plane walks half-plane walks ending at y = 0 minimal abscissa start L minimal abscissa L start L end minimal ordinate L end minimal ordinate pecialize the involution at {L = 0, = 0} L L pecialize at { a, L b} quarter plane walks starting at (a, b)

24 Generating function expressions level 3 level 2 level 1 level 0 E Let Q(t) be the generating function of general tandem-walks in 2 counted w.r.t. the length (variable t) with a weight z i for each face-step of level i Then Y t Q(t) is given by Y = t (1 + w 0 Y + w 1 Y 2 + w 2 Y 3 + ) where w i = z i + z i+1 + z i+2 +

25 Generating function expressions Y 4 Y 3 Y 2 Y level 3 level 2 level 1 level 0 E Let Q(t) be the generating function of general tandem-walks in 2 counted w.r.t. the length (variable t) with a weight z i for each face-step of level i Then Y t Q(t) is given by Y = t (1 + w 0 Y + w 1 Y 2 + w 2 Y 3 + ) where w i = z i + z i+1 + z i+2 +

26 Generating function expressions Y 4 Y 3 Y 2 Y level 3 level 2 level 1 level 0 E Let Q(t) be the generating function of general tandem-walks in 2 counted w.r.t. the length (variable t) with a weight z i for each face-step of level i Then Y t Q(t) is given by Y = t (1 + w 0 Y + w 1 Y 2 + w 2 Y 3 + ) where w i = z i + z i+1 + z i+2 + Rk: alternative proof (earlier!) with obstinate kernel method

27 Generating function expressions Y 4 Y 3 Y 2 Y level 3 level 2 level 1 level 0 E Let Q(t) be the generating function of general tandem-walks in 2 counted w.r.t. the length (variable t) with a weight z i for each face-step of level i Then Y t Q(t) is given by Y = t (1 + w 0 Y + w 1 Y 2 + w 2 Y 3 + ) where w i = z i + z i+1 + z i+2 + Rk: alternative proof (earlier!) with obstinate kernel method Rk: Let Q (a,b) (t) := GF of general tandem walks in 2 starting at (a, b) Then t Q (a,b) (t) = explicit polynomial in Y (with positive coefficients)

28 Quarter plane walks ending at (i, 0) The series F i (t) := n q[n; i, 0]tn counts bipolar orientation of the form root root-face degree i+2 i with t for # edges, and weight z r for each inner face of degree 0 r p

29 Quarter plane walks ending at (i, 0) The series F i (t) := n q[n; i, 0]tn counts bipolar orientation of the form root root-face degree i+2 i with t for # edges, and weight z r for each inner face of degree 0 r p symptotic enumeration q[n; i, 0] n C i γ n n 4 where C i = c α i (i + 1)(i + 2) from [Denisov-Wachtel 11] Rk: For undirected rooted maps M[n; i] n C i γ n n 5/2 where C i = c α i 4 i i ( ) 2i (with applications to peeling) i

30 Quarter plane walks ending at (i, 0) The series F i (t) := n q[n; i, 0]tn counts bipolar orientation of the form root root-face degree i+2 i with t for # edges, and weight z r for each inner face of degree 0 r p symptotic enumeration q[n; i, 0] n C i γ n n 4 where C i = c α i (i + 1)(i + 2) from [Denisov-Wachtel 11] Rk: For undirected rooted maps M[n; i] n C i γ n n 5/2 where C i = c α i 4 i i ( ) 2i (with applications to peeling) i Exact enumeration Let H i (t) = GF of Then F i (t) = H i (t) 1 t H i+2(t) + p r=0 (r + 1)z ih i+r+2 (t) Proof using obstinate kernel method or from Kenyon et al. + local operations i

Tableau sequences, open diagrams, and Baxter families

Tableau 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 information

Crossings and Nestings in Tangled Diagrams

Crossings 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 information

On a connection between planar map combinatorics and lattice walks Timothy Budd

On a connection between planar map combinatorics and lattice walks Timothy Budd Workshop on Large Random Structures in Two Dimensions, IHP, January 19th, 2017 On a connection between planar map combinatorics and lattice walks Timothy Budd IPhT, CEA-Saclay timothy.budd@cea.fr, http://www.nbi.dk/~budd/

More information

More about partitions

More 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 information

Combinatorial properties of the numbers of tableaux of bounded height

Combinatorial properties of the numbers of tableaux of bounded height Combinatorial properties of the numbers of tableaux of bounded height Marilena Barnabei, Flavio Bonetti, and Matteo Sibani Abstract We introduce an infinite family of lower triangular matrices Γ (s), where

More information

ON PARTITIONS AVOIDING 3-CROSSINGS

ON 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 information

On partitions avoiding 3-crossings

On partitions avoiding 3-crossings On partitions avoiding 3-crossings Mireille Bousquet-Mélou, Guoce Xin To cite this version: Mireille Bousquet-Mélou, Guoce Xin. On partitions avoiding 3-crossings. Seminaire Lotharingien de Combinatoire,

More information

Animals and 2-Motzkin Paths

Animals 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 information

Two EC tidbits. Sergi Elizalde. In honor of Richard Stanley s 70th birthday. Dartmouth College

Two EC tidbits. Sergi Elizalde. In honor of Richard Stanley s 70th birthday. Dartmouth College Dartmouth College In honor of Richard Stanley s 70th birthday Tidbit 1 A bijection for pairs of non-crossing lattice paths Tidbit 1 A bijection for pairs of non-crossing lattice paths Stanley #70 We consider

More information

On the nature of the generating series of walks in the quarter plane

On the nature of the generating series of walks in the quarter plane 1/27 On the nature of the generating series of walks in the quarter plane Thomas Dreyfus 1 Joint work with Charlotte Hardouin 2 and Julien Roques 3 and Michael Singer 4 1 University Lyon 1, France 2 University

More information

Involutions by Descents/Ascents and Symmetric Integral Matrices. Alan Hoffman Fest - my hero Rutgers University September 2014

Involutions 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 information

Standard paths in another composition poset

Standard paths in another composition poset Standard paths in another composition poset Jan Snellman Department of Mathematics, Stockholm University SE-10691 Stockholm, Sweden Jan.Snellmanmath.su.se Submitted: Oct 8, 2003; Accepted: Oct 17, 2004;

More information

Position since 2017: Associate Professor of Mathematics at Brandeis University (tenured).

Position since 2017: Associate Professor of Mathematics at Brandeis University (tenured). Olivier Bernardi Address: Brandeis University, Department of Mathematics, 415 South Street, Waltham, MA 02453. Phone: 617-253-3214. e-mail: bernardi@brandeis.edu Webpage: http://people.brandeis.edu/ bernardi/

More information

Fighting Fish: enumerative properties. Enrica Duchi. Veronica Guerrini & Simone Rinaldi DIISM, Università di Siena.

Fighting Fish: enumerative properties. Enrica Duchi. Veronica Guerrini & Simone Rinaldi DIISM, Università di Siena. Fighting Fish: enumerative properties Enrica Duchi IRIF, Université Paris Diderot Veronica Guerrini & Simone Rinaldi DIISM, Università di Siena Gilles Schaeffer LIX, CNRS and École Polytechnique Séminaire

More information

Efficient Experimental Mathematics for Lattice Path Combinatorics

Efficient Experimental Mathematics for Lattice Path Combinatorics 1/45 Efficient Experimental Mathematics for Lattice Path Combinatorics Alin Bostan based on joint works with M. Bousquet-Mélou, F. Chyzak, M. van Hoeij, M. Kauers, S. Melczer, L. Pech, K. Raschel, B. Salvy

More information

THE THEORY OF HEAPS AND THE CARTIER FOATA MONOID. C. Krattenthaler

THE THEORY OF HEAPS AND THE CARTIER FOATA MONOID. C. Krattenthaler THE THEORY OF HEAPS AND THE CARTIER FOATA MONOID C Krattenthaler Fakultät für Mathematik, Universität Wien, Nordbergstraße 15, A-1090 Vienna, Austria WWW: http://wwwmatunivieacat/~kratt Abstract We present

More information

NOTES ABOUT SATURATED CHAINS IN THE DYCK PATH POSET. 1. Basic Definitions

NOTES 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 information

Combinatorial Interpretation of the Scalar Products of State Vectors of Integrable Models

Combinatorial Interpretation of the Scalar Products of State Vectors of Integrable Models Combinatorial Interpretation of the Scalar Products of State Vectors of Integrable Models arxiv:40.0449v [math-ph] 3 Feb 04 N. M. Bogoliubov, C. Malyshev St.-Petersburg Department of V. A. Steklov Mathematical

More information

arxiv: v1 [math.co] 22 Oct 2007

arxiv: 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 information

A note on the Green s function for the transient random walk without killing on the half lattice, orthant and strip

A note on the Green s function for the transient random walk without killing on the half lattice, orthant and strip arxiv:1608.04578v1 [math.pr] 16 Aug 2016 A note on the Green s function for the transient random walk without killing on the half lattice, orthant and strip Alberto Chiarini Alessandra Cipriani Abstract

More information

A solution to the tennis ball problem

A solution to the tennis ball problem A solution to the tennis ball problem Anna de Mier Marc Noy Universitat Politècnica de Catalunya Abstract We present a complete solution to the so-called tennis ball problem, which is equivalent to counting

More information

PLANE PARTITIONS AMY BECKER, LILLY BETKE-BRUNSWICK, ANNA ZINK

PLANE 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 information

Cylindric Young Tableaux and their Properties

Cylindric Young Tableaux and their Properties Cylindric Young Tableaux and their Properties Eric Neyman (Montgomery Blair High School) Mentor: Darij Grinberg (MIT) Fourth Annual MIT PRIMES Conference May 17, 2014 1 / 17 Introduction Young tableaux

More information

The dimer model: universality and conformal invariance. Nathanaël Berestycki University of Cambridge. Colloque des sciences mathématiques du Québec

The dimer model: universality and conformal invariance. Nathanaël Berestycki University of Cambridge. Colloque des sciences mathématiques du Québec The dimer model: universality and conformal invariance Nathanaël Berestycki University of Cambridge Colloque des sciences mathématiques du Québec The dimer model Definition G = bipartite finite graph,

More information

Enumerative Combinatorics with Fillings of Polyominoes

Enumerative Combinatorics with Fillings of Polyominoes Enumerative Combinatorics with Fillings of Polyominoes Catherine Yan Texas A&M Univesrity GSU, October, 204 2 Outline. Symmetry of the longest chains Subsequences in permutations and words Crossings and

More information

Reduced words and a formula of Macdonald

Reduced 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 information

Enumeration of Set Partitions Refined by. Crossing and Nesting Numbers

Enumeration 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 information

Enumerating rc-invariant Permutations with No Long Decreasing Subsequences

Enumerating 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 information

Quarter-plane lattice paths with interacting boundaries: Kreweras and friends

Quarter-plane lattice paths with interacting boundaries: Kreweras and friends Séminaire Lotharingien de Combinatoire XX 2019 Article #YY, 12 pp. Proceedings of the 31 st Conference on Formal Power Series and Algebraic Combinatorics Ljubljana Quarter-plane lattice paths with interacting

More information

On Descents in Standard Young Tableaux arxiv:math/ v1 [math.co] 3 Jul 2000

On Descents in Standard Young Tableaux arxiv:math/ v1 [math.co] 3 Jul 2000 On Descents in Standard Young Tableaux arxiv:math/0007016v1 [math.co] 3 Jul 000 Peter A. Hästö Department of Mathematics, University of Helsinki, P.O. Box 4, 00014, Helsinki, Finland, E-mail: peter.hasto@helsinki.fi.

More information

Enumerative Combinatorics with Fillings of Polyominoes

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 information

Lattice walks at the Interface of Algebra, Analysis and Combinatorics

Lattice walks at the Interface of Algebra, Analysis and Combinatorics Lattice walks at the Interface of Algebra, Analysis and Combinatorics Marni Mishna (Simon Fraser University) Mireille Bousquet-Mélou (Université de Bordeaux/ Centre National de la Recherche Scientifique)

More information

MOMENTS OF INERTIA ASSOCIATED WITH THE LOZENGE TILINGS OF A HEXAGON

MOMENTS OF INERTIA ASSOCIATED WITH THE LOZENGE TILINGS OF A HEXAGON Séminaire Lotharingien de Combinatoire 45 001, Article B45f MOMENTS OF INERTIA ASSOCIATED WITH THE LOZENGE TILINGS OF A HEXAGON ILSE FISCHER Abstract. Consider the probability that an arbitrary chosen

More information

A quasisymmetric function generalization of the chromatic symmetric function

A quasisymmetric function generalization of the chromatic symmetric function A quasisymmetric function generalization of the chromatic symmetric function Brandon Humpert University of Kansas Lawrence, KS bhumpert@math.ku.edu Submitted: May 5, 2010; Accepted: Feb 3, 2011; Published:

More information

arxiv: v1 [math.co] 28 Feb 2012

arxiv: v1 [math.co] 28 Feb 2012 Computational and Theoretical Challenges On Counting Solid Standard Young Tableaux Shalosh B. EKHAD and Doron ZEILBERGER 1 Very Important: This article is accompanied by the Maple package http://www.math.rutgers.edu/~zeilberg/tokhniot/solidsyt.

More information

Computer Algebra for Lattice path Combinatorics

Computer Algebra for Lattice path Combinatorics Computer Algebra for Lattice path Combinatorics Alin Bostan To cite this version: Alin Bostan. Computer Algebra for Lattice path Combinatorics. Symbolic Computation [cs.sc]. Université Paris 13, 2017.

More information

Representing Planar Graphs with Rectangles and Triangles

Representing Planar Graphs with Rectangles and Triangles Representing Planar Graphs with Rectangles and Triangles Bernoulli Center Lausanne Oktober 14. 2010 Stefan Felsner Technische Universität Berlin felsner@math.tu-berlin.de A Rectangular Dissection Rectangular

More information

Postorder Preimages. arxiv: v3 [math.co] 2 Feb Colin Defant 1. 1 Introduction

Postorder Preimages. arxiv: v3 [math.co] 2 Feb Colin Defant 1. 1 Introduction Discrete Mathematics and Theoretical Computer Science DMTCS vol. 19:1, 2017, #3 Postorder Preimages arxiv:1604.01723v3 [math.co] 2 Feb 2017 1 University of Florida Colin Defant 1 received 7 th Apr. 2016,

More information

Singularity analysis via the iterated kernel method

Singularity analysis via the iterated kernel method FPSAC 2013 Paris, France DMTCS proc. AS, 2013, 481 492 Singularity analysis via the iterated kernel method Stephen Melczer and Marni Mishna Department of Mathematics, Simon Fraser University, Burnaby,

More information

Centrosymmetric words avoiding 3-letter permutation patterns

Centrosymmetric words avoiding 3-letter permutation patterns Centrosymmetric words avoiding 3-letter permutation patterns Luca S. Ferrari Dipartimento di Matematica, Università di Bologna Piazza di Porta San Donato, 5-406 Bologna, Italy luca.ferrari0@unibo.it Mathematics

More information

A COMBINATORIAL UNDERSTANDING OF LATTICE PATH ASYMPTOTICS

A COMBINATORIAL UNDERSTANDING OF LATTICE PATH ASYMPTOTICS A COMBINATORIAL UNDERSTANDING OF LATTICE PATH ASYMPTOTICS SAMUEL JOHNSON, MARNI MISHNA, AND KAREN YEATS Abstract. We provide a combinatorial derivation of the exponential growth constant for counting sequences

More information

Standard Diraphs the (unique) digraph with no vertices or edges. (modulo n) for every 1 i n A digraph whose underlying graph is a complete graph.

Standard Diraphs the (unique) digraph with no vertices or edges. (modulo n) for every 1 i n A digraph whose underlying graph is a complete graph. 5 Directed Graphs What is a directed graph? Directed Graph: A directed graph, or digraph, D, consists of a set of vertices V (D), a set of edges E(D), and a function which assigns each edge e an ordered

More information

Lecture J. 10 Counting subgraphs Kirchhoff s Matrix-Tree Theorem.

Lecture J. 10 Counting subgraphs Kirchhoff s Matrix-Tree Theorem. Lecture J jacques@ucsd.edu Notation: Let [n] [n] := [n] 2. A weighted digraph is a function W : [n] 2 R. An arborescence is, loosely speaking, a digraph which consists in orienting eery edge of a rooted

More information

THE MAJOR COUNTING OF NONINTERSECTING LATTICE PATHS AND GENERATING FUNCTIONS FOR TABLEAUX Summary

THE MAJOR COUNTING OF NONINTERSECTING LATTICE PATHS AND GENERATING FUNCTIONS FOR TABLEAUX Summary THE MAJOR COUNTING OF NONINTERSECTING LATTICE PATHS AND GENERATING FUNCTIONS FOR TABLEAUX Summary (The full-length article will appear in Mem. Amer. Math. Soc.) C. Krattenthaler Institut für Mathematik

More information

Standard Young Tableaux Old and New

Standard 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 information

Inhomogeneous Restricted Lattice Walks

Inhomogeneous Restricted Lattice Walks Inhomogeneous Restricted Lattice Walks Manfred Buchacher 1 and Manuel Kauers 1 arxiv:1811.06725v1 [math.co] 16 Nov 2018 1 Institute for Algebra, Johannes Kepler University, Linz, Austria Abstract. We consider

More information

A Questionable Distance-Regular Graph

A Questionable Distance-Regular Graph A Questionable Distance-Regular Graph Rebecca Ross Abstract In this paper, we introduce distance-regular graphs and develop the intersection algebra for these graphs which is based upon its intersection

More information

Graphic sequences, adjacency matrix

Graphic sequences, adjacency matrix Chapter 2 Graphic sequences, adjacency matrix Definition 2.1. A sequence of integers (d 1,..., d n ) is called graphic if it is the degree sequence of a graph. Example 2.2. 1. (1, 2, 2, 3) is graphic:

More information

GENERALIZATION OF THE SIGN REVERSING INVOLUTION ON THE SPECIAL RIM HOOK TABLEAUX. Jaejin Lee

GENERALIZATION 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 information

Philippe Flajolet and Symbolic Computation

Philippe Flajolet and Symbolic Computation Philippe Flajolet and Symbolic Computation Bruno Salvy 1. Combinatorics and Analysis of Algorithms 4 2. Complex Analysis 5 3. Symbolic Computation 7 While Philippe Flajolet did not publish many articles

More information

NOTES ON THE TOTALLY NONNEGATIVE GRASSMANNIAN

NOTES ON THE TOTALLY NONNEGATIVE GRASSMANNIAN NOTES ON THE TOTALLY NONNEGATIVE GRASSMANNIAN THOMAS LAM 1. Introductory comments The theory of the totally nonnegative part of the Grassmannian was introduced by Postnikov around a decade ago. The subject

More information

It is well-known (cf. [2,4,5,9]) that the generating function P w() summed over all tableaux of shape = where the parts in row i are at most a i and a

It is well-known (cf. [2,4,5,9]) that the generating function P w() summed over all tableaux of shape = where the parts in row i are at most a i and a Counting tableaux with row and column bounds C. Krattenthalery S. G. Mohantyz Abstract. It is well-known that the generating function for tableaux of a given skew shape with r rows where the parts in the

More information

Combinatorics of non-associative binary operations

Combinatorics 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 information

Orthogonal polynomials, lattice paths, and skew Young tableaux

Orthogonal polynomials, lattice paths, and skew Young tableaux Orthogonal polynomials, lattice paths, and skew Young tableaux A Dissertation Presented to The Faculty of the Graduate School of Arts and Sciences Brandeis University Mathematics Ira Gessel, Dept. of Mathematics,

More information

arxiv: v3 [math.co] 25 Aug 2016

arxiv: v3 [math.co] 25 Aug 2016 AN ELEMENTARY SOLUTION OF GESSEL S WALKS IN THE QUADRANT MIREILLE BOUSQUET-MÉLOU arxiv:503.08573v3 [math.co] 25 Aug 206 Abstract. Around 2000, Ira Gessel conjectured that the number of lattice walks in

More information

CHAINS OF MAXIMUM LENGTH IN THE TAMARI LATTICE

CHAINS 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 information

Combinatorial Structures

Combinatorial Structures Combinatorial Structures Contents 1 Permutations 1 Partitions.1 Ferrers diagrams....................................... Skew diagrams........................................ Dominance order......................................

More information

The Combinatorics of Symmetric Functions: (3 + 1)-free Posets and the Poset Chain Conjecture

The Combinatorics of Symmetric Functions: (3 + 1)-free Posets and the Poset Chain Conjecture The Combinatorics of Symmetric Functions: ( + 1)-free Posets and the Poset Chain Conjecture Mary Bushman, Alex Evangelides, Nathan King, Sam Tucker Department of Mathematics Carleton College Northfield,

More information

Skew quantum Murnaghan-Nakayama rule

Skew quantum Murnaghan-Nakayama rule FPSAC 0, Reykjavik, Iceland DMTCS proc. (subm.), by the authors, Skew quantum Murnaghan-Nakayama rule Matjaž Konvalinka University of Ljubljana, Faculty of Mathematics and Physics, Slovenia Abstract. In

More information

Counting walks in a quadrant: a unified approach via boundary value problems

Counting walks in a quadrant: a unified approach via boundary value problems J. Eur. Math. Soc. 14, 749 777 c European Mathematical Society 2012 DOI 10.4171/JEMS/317 Kilian Raschel Counting walks in a quadrant: a unified approach via boundary value problems Received March 10, 2010

More information

arxiv: v3 [math.co] 7 Oct 2012

arxiv: v3 [math.co] 7 Oct 2012 ON THE FUNCTIONS COUNTING WALKS WITH SMALL STEPS IN THE QUARTER PLANE IRINA KURKOVA AND KILIAN RASCHEL arxiv:1107.2340v3 [math.co] 7 Oct 2012 Abstract. Models of spatially homogeneous walks in the quarter

More information

Counting Pattern-free Set Partitions II: Noncrossing and Other Hypergraphs

Counting Pattern-free Set Partitions II: Noncrossing and Other Hypergraphs Counting Pattern-free Set Partitions II: Noncrossing and Other Hypergraphs Martin Klazar Department of Applied Mathematics Charles University Malostranské náměstí 25, 118 00 Praha Czech Republic klazar@kam.ms.mff.cuni.cz

More information

ANALYTIC COMBINATORICS OF PLANAR LATTICE PATHS

ANALYTIC COMBINATORICS OF PLANAR LATTICE PATHS ANALYTIC COMBINATORICS OF PLANAR LATTICE PATHS by Samuel Johnson B. Math. Hon., University of Newcastle, 2010 Thesis submitted in partial fulfillment of the requirements for the degree of Master of Science

More information

ENUMERATION 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 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 information

Parameterized Domination in Circle Graphs

Parameterized Domination in Circle Graphs Parameterized Domination in Circle Graphs Nicolas Bousquet 1, Daniel Gonçalves 1, George B. Mertzios 2, Christophe Paul 1, Ignasi Sau 1, and Stéphan Thomassé 3 1 AlGCo project-team, CNRS, LIRMM, Montpellier,

More information

Enumeration on row-increasing tableaux of shape 2 n

Enumeration 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 information

Euler s partition theorem and the combinatorics of l-sequences

Euler s partition theorem and the combinatorics of l-sequences Euler s partition theorem and the combinatorics of l-sequences Carla D. Savage North Carolina State University June 26, 2008 Inspiration BME1 Mireille Bousquet-Mélou, and Kimmo Eriksson, Lecture hall partitions,

More information

Bigraphical arrangements

Bigraphical arrangements Bigraphical arrangements FPSAC 14, Chicago Sam Hopkins and David Perkinson MIT and Reed College July 2nd, 2014 Sam Hopkins and David Perkinson (2014) Bigraphical arrangements July 2nd, 2014 1 / 26 History

More information

LARGE SCHRÖDER PATHS BY TYPES AND SYMMETRIC FUNCTIONS

LARGE 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 information

Two-dimensional self-avoiding walks. Mireille Bousquet-Mélou CNRS, LaBRI, Bordeaux, France

Two-dimensional self-avoiding walks. Mireille Bousquet-Mélou CNRS, LaBRI, Bordeaux, France Two-dimensional self-avoiding walks Mireille Bousquet-Mélou CNRS, LaBRI, Bordeaux, France A walk with n = 47 steps Self-avoiding walks (SAWs) Self-avoiding walks (SAWs) A walk with n = 47 steps A self-avoiding

More information

PARTITIONS WITH FIXED DIFFERENCES BETWEEN LARGEST AND SMALLEST PARTS

PARTITIONS WITH FIXED DIFFERENCES BETWEEN LARGEST AND SMALLEST PARTS PARTITIONS WITH FIXED DIFFERENCES BETWEEN LARGEST AND SMALLEST PARTS GEORGE E. ANDREWS, MATTHIAS BECK, AND NEVILLE ROBBINS Abstract. We study the number p(n, t) of partitions of n with difference t between

More information

CATALAN ADDENDUM. Richard P. Stanley. version of 30 December 2009

CATALAN ADDENDUM. Richard P. Stanley. version of 30 December 2009 CATALAN ADDENDUM Richard P. Stanley version of 30 December 009 The problems below are a continuation of those appearing in Chapter 6 of Enumerative Combinatorics, volume. Combinatorial interpretations

More information

Combinatorial Optimization

Combinatorial Optimization Combinatorial Optimization Problem set 8: solutions 1. Fix constants a R and b > 1. For n N, let f(n) = n a and g(n) = b n. Prove that f(n) = o ( g(n) ). Solution. First we observe that g(n) 0 for all

More information

Analytic approach for reflected Brownian motion in the quadrant

Analytic approach for reflected Brownian motion in the quadrant Proceedings of the 27th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms Kraków, Poland, 4-8 July 2016 Analytic approach for reflected Brownian

More information

Maximum Integer Flows in Directed Planar Graphs with Multiple Sources and Sinks and Vertex Capacities

Maximum Integer Flows in Directed Planar Graphs with Multiple Sources and Sinks and Vertex Capacities Maximum Integer Flows in Directed Planar Graphs with Multiple Sources and Sinks and Vertex Capacities Yipu Wang University of Illinois at Urbana-Champaign ywang298@illinois.edu July 12, 2018 Abstract We

More information

CATALAN DETERMINANTS A COMBINATORIAL APPROACH

CATALAN DETERMINANTS A COMBINATORIAL APPROACH CATALAN DETERMINANTS A COMBINATORIAL APPROACH ARTHUR T BENJAMIN, NAIOMI T CAMERON, JENNIFER J QUINN, AND CARL R YERGER Abstract Determinants of matrices involving the Catalan sequence have appeared throughout

More information

2 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

2 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 information

Towards the Distribution of the Size of a Largest Planar Matching and Largest Planar Subgraph in Random Bipartite Graphs

Towards the Distribution of the Size of a Largest Planar Matching and Largest Planar Subgraph in Random Bipartite Graphs Towards the Distribution of the Size of a Largest Planar Matching and Largest Planar Subgraph in Random Bipartite Graphs MARCOS KIWI Depto. Ing. Matemática and Ctr. Modelamiento Matemático (UMI 2807, CNRS)

More information

ACO Comprehensive Exam March 20 and 21, Computability, Complexity and Algorithms

ACO Comprehensive Exam March 20 and 21, Computability, Complexity and Algorithms 1. Computability, Complexity and Algorithms Part a: You are given a graph G = (V,E) with edge weights w(e) > 0 for e E. You are also given a minimum cost spanning tree (MST) T. For one particular edge

More information

Percolation on random triangulations

Percolation on random triangulations Percolation on random triangulations Olivier Bernardi (MIT) Joint work with Grégory Miermont (Université Paris-Sud) Nicolas Curien (École Normale Supérieure) MSRI, January 2012 Model and motivations Planar

More information

CROSSINGS AND NESTINGS OF MATCHINGS AND PARTITIONS

CROSSINGS 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 information

arxiv: v1 [cs.ds] 26 Feb 2016

arxiv: v1 [cs.ds] 26 Feb 2016 On the computational complexity of minimum-concave-cost flow in a two-dimensional grid Shabbir Ahmed, Qie He, Shi Li, George L. Nemhauser arxiv:1602.08515v1 [cs.ds] 26 Feb 2016 Abstract We study the minimum-concave-cost

More information

In terms of measures: Exercise 1. Existence of a Gaussian process: Theorem 2. Remark 3.

In terms of measures: Exercise 1. Existence of a Gaussian process: Theorem 2. Remark 3. 1. GAUSSIAN PROCESSES A Gaussian process on a set T is a collection of random variables X =(X t ) t T on a common probability space such that for any n 1 and any t 1,...,t n T, the vector (X(t 1 ),...,X(t

More information

Coxeter-Knuth Classes and a Signed Little Bijection

Coxeter-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 information

Algebra I. abscissa the distance along the horizontal axis in a coordinate graph; graphs the domain.

Algebra I. abscissa the distance along the horizontal axis in a coordinate graph; graphs the domain. Algebra I abscissa the distance along the horizontal axis in a coordinate graph; graphs the domain. absolute value the numerical [value] when direction or sign is not considered. (two words) additive inverse

More information

Crystal structures on shifted tableaux

Crystal structures on shifted tableaux Crystal structures on shifted tableaux Jake Levinson (UW) joint with Maria Gillespie (UC Davis), Kevin Purbhoo (Waterloo) Séminaire du LaCIM 5 Janvier 2018 Goal Crystal-like structure on (skew) semistandard

More information

A weighted interpretation for the super Catalan numbers

A 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 information

Wieland drift for triangular fully packed loop configurations

Wieland drift for triangular fully packed loop configurations Wieland drift for triangular fully packed loop configurations Sabine Beil Ilse Fischer Fakultät für Mathematik Universität Wien Wien, Austria {sabine.beil,ilse.fischer}@univie.ac.at Philippe Nadeau Institut

More information

Problem 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.

Problem 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 information

18.312: Algebraic Combinatorics Lionel Levine. Lecture 19

18.312: Algebraic Combinatorics Lionel Levine. Lecture 19 832: Algebraic Combinatorics Lionel Levine Lecture date: April 2, 20 Lecture 9 Notes by: David Witmer Matrix-Tree Theorem Undirected Graphs Let G = (V, E) be a connected, undirected graph with n vertices,

More information

DIFFERENTIAL POSETS SIMON RUBINSTEIN-SALZEDO

DIFFERENTIAL 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 information

(Permutations Arising from) Hook Coefficients of Chromatic Symmetric Functions

(Permutations Arising from) Hook Coefficients of Chromatic Symmetric Functions (Permutations Arising from) Hook Coefficients of Chromatic Symmetric Functions Ryan Kaliszewski Drexel University rlk72@drexel.edu July 17, 2014 Ryan Kaliszewski (Drexel University) Hook Coefficients July

More information

Knot invariants, A-polynomials, BPS states

Knot invariants, A-polynomials, BPS states Knot invariants, A-polynomials, BPS states Satoshi Nawata Fudan University collaboration with Rama, Zodin, Gukov, Saberi, Stosic, Sulkowski Chern-Simons theory Witten M A compact 3-manifold gauge field

More information

La fonction à deux points et à trois points des quadrangulations et cartes. Éric Fusy (CNRS/LIX) Travaux avec Jérémie Bouttier et Emmanuel Guitter

La fonction à deux points et à trois points des quadrangulations et cartes. Éric Fusy (CNRS/LIX) Travaux avec Jérémie Bouttier et Emmanuel Guitter La foncton à deux ponts et à tros ponts des quadrangulatons et cartes Érc Fusy (CNRS/LIX) Travaux avec Jéréme Boutter et Emmanuel Gutter Sémnare Caln, LIPN, Ma 4 Maps Def. Planar map = connected graph

More information

Algorithmic Game Theory

Algorithmic Game Theory Nash Equilibria in Zero-Sum Games Algorithmic Game Theory Algorithmic game theory is not satisfied with merely an existence result for an important solution concept such as Nash equilibrium in mixed strategies.

More information

Abacus-tournament Models of Hall-Littlewood Polynomials

Abacus-tournament Models of Hall-Littlewood Polynomials Abacus-tournament Models of Hall-Littlewood Polynomials Andrew J. Wills Dissertation submitted to the Faculty of the Virginia Polytechnic Institute and State University in partial fulfillment of the requirements

More information

The Maximum Flow Problem with Disjunctive Constraints

The Maximum Flow Problem with Disjunctive Constraints The Maximum Flow Problem with Disjunctive Constraints Ulrich Pferschy Joachim Schauer Abstract We study the maximum flow problem subject to binary disjunctive constraints in a directed graph: A negative

More information

Linear Arrangement of Halin Graphs

Linear Arrangement of Halin Graphs Linear Arrangement of Halin Graphs Saber Mirzaei Boston University Assaf Kfoury Boston University Abstract We study the Optimal Linear Arrangement (OLA) problem of Halin graphs, one of the simplest classes

More information

Prudent Self-Avoiding Walks

Prudent Self-Avoiding Walks Entropy 2008, 10, 309-318; DOI: 10.3390/e10030309 Article Prudent Self-Avoiding Walks OPEN ACCESS entropy ISSN 1099-4300 www.mdpi.org/entropy John C. Dethridge and Anthony J. Guttmann ARC Centre of Excellence

More information

The Number of Spanning Trees in a Graph

The Number of Spanning Trees in a Graph Course Trees The Ubiquitous Structure in Computer Science and Mathematics, JASS 08 The Number of Spanning Trees in a Graph Konstantin Pieper Fakultät für Mathematik TU München April 28, 2008 Konstantin

More information