Proofs & Confirmations The story of the alternating sign matrix conjecture
|
|
- Darrell Johnson
- 5 years ago
- Views:
Transcription
1 Proofs & Confirmations The story of the alternating sign matrix conjecture David M. Bressoud Macalester College University of Nebraska Omaha, NE These slides are available at March 18, 2015 MAA
2 IDA-CCR Bill Mills Howard Rumsey David Robbins ( ) MAA Robbins Prize in algebra, combinatorics, or discrete math
3 Charles L. Dodgson aka Lewis Carroll Condensation of Determinants, Proceedings of the Royal Society, London 1866
4 Square matrix: Entries are 0, 1, 1 Row and column sums are +1 Artwork by Greg Kuperberg UC Davis Non-zero entries alternate in sign in each row
5 n A n
6 n A n How many n n alternating sign matrices? = = = = = =
7 There is exactly one 1 in the first row n 1 A n
8 There is exactly one 1 in the first row n 1 A n
9
10
11 ???? 0???? 0???? 0????
12 1 1 2/ /3 3 3/ / / / / / /2 429
13 1 1 2/ /3 3 3/ /4 14 5/5 14 4/ / / / / / / / / /2 429
14 2/2 2/3 3/2 2/4 5/5 4/2 2/5 7/9 9/7 5/2 2/6 9/14 16/16 14/9 6/2
15 Numerators:
16 Numerators: Conjecture 1: A n,k A n,k +1 = n 2 k 1 + n 1 k 1 n 2 n k 1 + n 1 n k 1
17 Conjecture 1: A n,k A n,k +1 = n 2 k 1 + n 1 k 1 n 2 n k 1 + n 1 n k 1 Conjecture 2 (corollary of Conjecture 1): A n = n 1 ( 3j + 1)! = ( n + j)! j =0 1! 4! 7! ( 3n 2 )! n! ( n + 1)! ( 2n 1)!
18 Richard Stanley
19 Richard Stanley George Andrews A n = Andrews Theorem: the number of descending plane partitions of size n is n 1 ( 3j + 1)! 1! 4! 7! = ( 3n 2 )! ( n + j)! n! ( n + 1)! ( 2n 1)! j =0
20 What is a descending plane partition?
21 Percy A. MacMahon Plane Partition Work begun in 1897
22 Plane partition of # of pp s of 75 = pp(75)
23 Plane partition of MacMahon finds a simple recursive algorithm for computing these numbers (based on generating function). # of pp s of 75 = pp(75) = 37,745,732,428,153
24 Symmetric Plane Partition MacMahon conjectures a simple recursive algorithm for computing these numbers (based on generating function).
25 1971 Basil Gordon proves case for n = infinity 1977 George Andrews and Ian Macdonald independently prove general case
26 Cyclically Symmetric Plane Partition
27 1979: Ian Macdonald conjectures the generating function for cyclically symmetric plane partitions, producing an efficient recursive algorithm for computing these numbers. If I had to single out the most interesting open problem in all of enumerative combinatorics, this would be it. Richard Stanley, review of Symmetric Functions and Hall Polynomials, Bulletin of the AMS, March, 1981.
28 1979, Andrews counts the number of cyclically symmetric plane partitions in an n n n box.
29 1979, Andrews counts the number of cyclically symmetric plane partitions in an n n n box.
30 1979, Andrews counts the number of cyclically symmetric plane partitions in an n n n box.
31 1979, Andrews counts the number of cyclically symmetric plane partitions in an n n n box.
32 1979, Andrews counts the number of cyclically symmetric plane partitions in an n n n box. L 1 = W 1 > L 2 = W 2 > L 3 = W 3 > width length
33 1979, Andrews counts descending plane partitions L 1 > W 1 L 2 > W 2 L 3 > W 3 width length
34 Mills, Robbins, Rumsey Conjecture: # of n n ASM s with 1 at top of column j equals # of DPP s n with exactly j 1 parts of size n. width length
35 Discovered an easier proof of Andrews formula, using induction on j and n. Used this inductive argument to prove Macdonald s conjecture Proof of the Macdonald Conjecture, Inv. Math., 1982 But they still didn t have a proof of their conjecture!
36 Totally Symmetric Self-Complementary Plane Partitions 1983 David Robbins Vertical flip of ASM = complement of DPP?
37 Totally Symmetric Self-Complementary Plane Partitions
38
39 Robbins Conjecture: The number of TSSCPP s in a 2n X 2n X 2n box is n 1 ( 3j + 1)! = ( n + j)! j =0 1! 4! 7! ( 3n 2 )! n! ( n + 1)! ( 2n 1)!
40 Robbins Conjecture: The number of TSSCPP s in a 2n X 2n X 2n box is n 1 ( 3j + 1)! = ( n + j)! j =0 1! 4! 7! ( 3n 2 )! n! ( n + 1)! ( 2n 1)! 1989: William Doran shows equivalent to counting lattice paths 1990: John Stembridge represents the counting function as a Pfaffian (built on insights of Gordon and Okada) 1992: George Andrews evaluates the Pfaffian, proves Robbins Conjecture
41 December, 1992 Doron Zeilberger announces a proof that # of ASM s of size n equals of TSSCPP s in box of size 2n.
42 December, 1992 Doron Zeilberger announces a proof that # of ASM s of size n equals of TSSCPP s in box of size 2n all gaps removed, published as Proof of the Alternating Sign Matrix Conjecture, Elect. J. of Combinatorics, 1996.
43 Zeilberger s proof is an 84-page tour de force, but it still left open the original conjecture: A n,k A n,k +1 = n 2 k 1 + n 1 k 1 n 2 n k 1 + n 1 n k 1
44 1996 Kuperberg announces a simple proof Another proof of the alternating sign matrix conjecture, International Mathematics Research Notices Greg Kuperberg UC Davis
45 1996 Kuperberg announces a simple proof Another proof of the alternating sign matrix conjecture, International Mathematics Research Notices Greg Kuperberg UC Davis Physicists had been studying ASM s for decades, only they called them the six-vertex model.
46 Horizontal = 1 Vertical = 1
47 1960 s Rodney Baxter s Triangle-totriangle relation 1980 s Anatoli Izergin Vladimir Korepin
48 1996 Doron Zeilberger uses this determinant to prove the original conjecture Proof of the refined alternating sign matrix conjecture, New York Journal of Mathematics
49 The End (which is really just the beginning) These slides can be downloaded from
David Bressoud Macalester College, St. Paul, MN
MAA David Bressoud Macalester College, St. Paul, MN PowerPoint available at www.macalester.edu/~bressoud/talks Pacific Northwest Section Juneau, AK June 24, 2011 Imre Lakatos, 1922 1974 Hungarian. Born
More informationDavid M. Bressoud Macalester College, St. Paul, MN Talk given MAA KY section March 28, 2008
David M. Bressoud Macalester College, St. Paul, MN Talk given MAA KY section March 28, 2008 We mathematicians often delude ourselves into thinking that we create proofs in order to establish truth. In
More informationRefined Cauchy/Littlewood identities and partition functions of the six-vertex model
Refined Cauchy/Littlewood identities and partition functions of the six-vertex model LPTHE (UPMC Paris 6), CNRS (Collaboration with Dan Betea and Paul Zinn-Justin) 6 June, 4 Disclaimer: the word Baxterize
More informationExtreme diagonally and antidiagonally symmetric alternating sign matrices of odd order
Extreme diagonally and antidiagonally symmetric alternating sign matrices of odd order Arvind Ayyer (Bangalore) Roger E. Behrend (Cardiff) Ilse Fischer (Vienna) 1 Outline Introduction: ASMs and DASASMs
More informationIzergin-Korepin determinant reloaded
Izergin-Korepin determinant reloaded arxiv:math-ph/0409072v1 27 Sep 2004 Yu. G. Stroganov Institute for High Energy Physics 142284 Protvino, Moscow region, Russia Abstract We consider the Izergin-Korepin
More informationA SIMPLE EXPLICIT BIJECTION BETWEEN (n, 2)-GOG AND MAGOG TRAPEZOIDS
Séminaire Lotharingien de Combinatoire 75 (2016), Article B75e A SIMPLE EXPLICIT BIJECTION BETWEEN (n, 2)-GOG AND MAGOG TRAPEZOIDS JÉRÉMIE BETTINELLI ABSTRACT. A sub-problem of the open problem of finding
More informationSeveral refined conjectures on TSSCPP and ASM
0-0 Several refined conjectures on TSSCPP and ASM Masao Ishikawa Tottori University, ishikawa@fed.tottori-u.ac.jp 1 Contents of this talk 1. Preliminaries (a) Partitions (b) Symmetric functions (c) Alternating
More informationTrivial Meet and Join within the Lattice of Monotone Triangles
Trivial Meet and Join within the Lattice of Monotone Triangles John Engbers Adam Hammett July 17, 2014 Abstract The lattice of monotone triangles (M n, ) ordered by entry-wise comparisons is studied. Let
More informationThe many faces of alternating-sign matrices
The many faces of alternating-sign matrices James Propp Department of Mathematics University of Wisconsin Madison, Wisconsin, USA propp@math.wisc.edu August 15, 2002 Abstract I give a survey of different
More informationA simple explicit bijection between(n,2)-gog and Magog trapezoids
A simple explicit bijection between(n,)-gog and Magog trapezoids Jérémie BETTINELLI April 0, 0 arxiv:.00v [math.co] Apr 0 Abstract A sub-problem of the open problem of finding an explicit bijection between
More informationarxiv: v1 [math.ho] 18 Jul 2016
AN ELEMENTARY PROOF OF DODGSON S CONDENSATION METHOD FOR CALCULATING DETERMINANTS MITCH MAIN, MICAH DONOR, AND R. CORBAN HARWOOD 1 arxiv:1607.05352v1 [math.ho] 18 Jul 2016 Abstract. In 1866, Charles Ludwidge
More informationarxiv:math/ v1 [math.co] 13 Jul 2005
A NEW PROOF OF THE REFINED ALTERNATING SIGN MATRIX THEOREM arxiv:math/0507270v1 [math.co] 13 Jul 2005 Ilse Fischer Fakultät für Mathematik, Universität Wien Nordbergstrasse 15, A-1090 Wien, Austria E-mail:
More informationarxiv: v1 [math.co] 25 May 2011
arxiv:1105.4986v1 [math.co] 25 May 2011 Gog and Magog triangles, and the Schützenberger involution Hayat Cheballah and Philippe Biane Abstract. We describe an approach to finding a bijection between Alternating
More informationAn alternative evaluation. of the Andrews{Burge determinant. C. Krattenthaler y. Dedicated to Gian-Carlo Rota
An alternative evaluation of the Andrews{Burge determinant C. Krattenthaler y Dedicated to Gian-Carlo Rota Abstract. We give a short, self-contained evaluation of the Andrews{Burge determinant (Pacic J.
More informationarxiv: v1 [math.co] 18 Oct 2018
A NEW DETERMINANT FOR THE Q-ENUMERATION OF ALTERNATING SIGN MATRICES FLORIAN AIGNER arxiv:80.080v [math.co] 8 Oct 08 Abstract. Fischer provided a new type of binomial erminant for the number of alternating
More informationTowards Enumerations of C-alt and D Matrices
Wellesley College Wellesley College Digital Scholarship and Archive Honors Thesis Collection 2013 Towards Enumerations of C-alt and D Matrices Ran Ji rji@wellesleyedu Follow this and additional works at:
More informationGog and Magog Triangles
Gog and Magog Triangles Philippe Biane To cite this version: Philippe Biane. Gog and Magog Triangles. Computation and Combinatorics in Dynamics, Stochastics and Control- The Abel Symposium, Rosendal, Norway,
More informationFrom alternating sign matrices to Painlevé VI
From alternating sign matrices to Painlevé VI Hjalmar Rosengren Chalmers University of Technology and University of Gothenburg Nagoya, July 31, 2012 Hjalmar Rosengren (Chalmers University) Nagoya, July
More informationENUMERATION OF DOMINO TILINGS OF AN AZTEC RECTANGLE WITH BOUNDARY DEFECTS
ENUMERATION OF DOMINO TILINGS OF AN AZTEC RECTANGLE WITH BOUNDARY DEFECTS MANJIL P. SAIKIA Abstract. In this paper we enumerate domino tilings of an Aztec rectangle with arbitrary defects of size one on
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 informationNew enumeration formulas for alternating sign matrices and square ice partition functions
New enumeration formulas for alternating sign matrices and square ice partition functions Arvind Ayyer Dan Romik October 8, 01 Abstract The refined enumeration of alternating sign matrices (ASMs of given
More informationPoset and Polytope Perspectives On Alternating Sign Matrices
Poset and Polytope Perspectives On Alternating Sign Matrices A DISSERTATION SUBMITTED TO THE FACULTY OF THE GRADUATE SCHOOL OF THE UNIVERSITY OF MINNESOTA BY Jessica Palencia Striker IN PARTIAL FULFILLMENT
More informationarxiv: v1 [math.co] 11 Nov 2016
EXTREME DIAGONALLY AND ANTIDIAGONALLY SYMMETRIC ALTERNATING SIGN MATRICES OF ODD ORDER ARVIND AYYER, ROGER E. BEHREND, AND ILSE FISCHER arxiv:6.03823v [math.co] Nov 206 Abstract. For each α {0,, }, we
More informationEVALUATION OF A FAMILY OF BINOMIAL DETERMINANTS
EVALUATION OF A FAMILY OF BINOMIAL DETERMINANTS CHARLES HELOU AND JAMES A SELLERS Abstract Motivated by a recent work about finite sequences where the n-th term is bounded by n, we evaluate some classes
More informationDomino tilings with barriers. In memory of Gian-Carlo Rota
Domino tilings with barriers In memory of Gian-Carlo Rota James Propp Richard Stanley University of Wisconsin, Madison, WI 53706 Massachusetts Institute of Technology, Cambridge, MA 02139 In this paper,
More informationA Connection between Alternating Sign Matrices and Totally Symmetric Self-Complementary Plane Partitions
JOURNAL OF COMBINATORIAL THEORY, Series A 64, 289-310 (1993) A Connection between Alternating Sign Matrices and Totally Symmetric Self-Complementary Plane Partitions WILLIAM F. DORAN IV* Department of
More informationEnumerating some symmetry classes of rhombus tilings of holey hexagons
FPSAC 2015, Daejeon, South Korea DMTCS proc. FPSAC 15, 2015, 487 498 Enumerating some symmetry classes of rhombus tilings of holey hexagons Tomack Gilmore Fakultät für Mathematik, Universität Wien, Oskar-Morgenstern-Platz
More informationA polynomial method for the enumeration of plane partitions and alternating sign matrices
A polynomial method for the enumeration of plane partitions and alternating sign matrices Habilitationsschrift zur Erlangung der Lehrbefugnis venia docendi für Mathematik an der Fakultät für Mathematik
More informationarxiv:math.co/ v2 3 Oct 2003
Loops, matchings and alternating-sign matrices arxiv:math.co/0211285 v2 3 Oct 2003 Jan de Gier Department of Mathematics and Statistics, The University of Melbourne, Parkville, Victoria 3010, Australia
More informationA Variation of the nil-temperley-lieb algebras of type A
A Variation of the nil-temperley-lieb algebras of type A Niket Gowravaram Abstract We investigate a variation on the nil-temperley-lieb algebras of type A. This variation is formed by removing one of the
More informationDiagonally and antidiagonally symmetric alternating sign matrices of odd order
FPSAC 2016 Vancoer, Canada DMTCS proc BC, 2016, 131 142 Diagonally and antidiagonally symmetric alternating sign matrices of odd order Roger E Behrend 1, Ilse Fischer 2, and Matjaž Konvalinka 3 1 School
More informationSome Restricted Plane partitions and Associated Lattice Paths S. Bedi Department of Mathematics, D.A.V College, Sector 10 Chandigarh , India
Some Restricted Plane partitions and Associated Lattice Paths S. Bedi Department of Mathematics, D.A.V College, Sector 10 Chandigarh - 160010, India Abstract. Anand and Agarwal, (Proc. Indian Acad. Sci.
More informationSrinivasa Ramanujan Life and Mathematics
Life and Mathematics Universität Wien (1887 1920) (1887 1920) (1887 1920) (1887 1920) (1887 1920) (1887 1920) (1887 1920) born 22 December 1887 in Erode (Madras Presidency = Tamil Nadu) named Iyengar (1887
More informationMonotone Hamiltonian paths in the Boolean lattice of subsets
Monotone Hamiltonian paths in the Boolean lattice of subsets Csaba Biró and David Howard December 10, 2007 Abstract Consider the lattice whose elements are the subsets of the set of positive integers not
More informationAdvanced Computer Algebra for Determinants
Advanced Computer Algebra for Determinants Christoph Koutschan Research Institute for Symbolic Computation RISC Johannes Kepler University, A-4040 Linz, Austria Thotsaporn Aek Thanatipanonda Research Institute
More information#A69 INTEGERS 13 (2013) OPTIMAL PRIMITIVE SETS WITH RESTRICTED PRIMES
#A69 INTEGERS 3 (203) OPTIMAL PRIMITIVE SETS WITH RESTRICTED PRIMES William D. Banks Department of Mathematics, University of Missouri, Columbia, Missouri bankswd@missouri.edu Greg Martin Department of
More informationRHOMBUS TILINGS OF A HEXAGON WITH TWO TRIANGLES MISSING ON THE SYMMETRY AXIS
RHOMBUS TILINGS OF A HEXAGON WITH TWO TRIANGLES MISSING ON THE SYMMETRY AXIS THERESIA EISENKÖLBL Institut für Mathematik der Universität Wien, Strudlhofgasse 4, A-1090 Wien, Austria. E-mail: Theresia.Eisenkoelbl@univie.ac.at
More informationAround the Razumov Stroganov conjecture: proof of a multi-parameter sum rule
SPhT-T04/33 Around the Razumov Stroganov conjecture: proof of a multi-parameter sum rule P. Di Francesco # and P. Zinn-Justin We prove that the sum of entries of the suitably normalized groundstate vector
More informationAround the Razumov Stroganov conjecture: proof of a multi-parameter sum rule
SPhT-T04/33 Around the Razumov Stroganov conjecture: proof of a multi-parameter sum rule arxiv:math-ph/04006v4 7 Mar 2006 P. Di Francesco Service de Physique Théorique de Saclay, CEA/DSM/SPhT, URA 2306
More informationPARTITIONS 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 informationSELF-AVOIDING WALKS AND FIBONACCI NUMBERS. Arthur T. Benjamin Dept. of Mathematics, Harvey Mudd College, Claremont, CA
SELF-AVOIDING WALKS AND FIBONACCI NUMBERS Arthur T. Benjamin Dept. of Mathematics, Harvey Mudd College, Claremont, CA 91711 benjamin@hmc.edu Abstract. By combinatorial arguments, we prove that the number
More informationAround the Razumov Stroganov conjecture: proof of a multi-parameter sum rule
Around the Razumov Stroganov conjecture: proof of a multi-parameter sum rule P. Di Francesco Service de Physique Théorique de Saclay, CEA/DSM/SPhT, URA 2306 du CNRS C.E.A.-Saclay, F-91191 Gif sur Yvette
More informationA Combinatorial Proof for the Rank-Unimodality of Poset Order Ideals
A Combinatorial Proof for the Rank-Unimodality of Poset Order Ideals By: Kevin Rao Clements High School, Sugar Land, Texas Mentored by Dr. Edward Early of St. Edwards University Special thanks to Hans
More informationA combinatorial determinant
A combinatorial erminant Herbert S Wilf Department of Mathematics, University of Pennsylvania Philadelphia, PA 19104-6395 Abstract A theorem of Mina evaluates the erminant of a matrix with entries D (f(x)
More informationSix-vertex model partition functions and symmetric polynomials of type BC
Six-vertex model partition functions and symmetric polynomials of type BC Dan Betea LPMA (UPMC Paris 6), CNRS (Collaboration with Michael Wheeler, Paul Zinn-Justin) Iunius XXVI, MMXIV This message is proudly
More informationHook lengths and shifted parts of partitions
Hook lengths and shifted parts of partitions Guo-Niu Han To cite this version: Guo-Niu Han Hook lengths and shifted parts of partitions The Ramanujan Journal, 009, 9 p HAL Id: hal-00395690
More informationSmith Normal Form and Combinatorics
Smith Normal Form and Combinatorics p. 1 Smith Normal Form and Combinatorics Richard P. Stanley Smith Normal Form and Combinatorics p. 2 Smith normal form A: n n matrix over commutative ring R (with 1)
More informationHigher Spin Alternating Sign Matrices
Higher Spin Alternating Sign Matrices Roger E. Behrend and Vincent A. Knight School of Mathematics, Cardiff University, Cardiff, CF24 4AG, UK behrendr@cardiff.ac.uk, knightva@cardiff.ac.uk Submitted: Aug
More informationSpanning Trees in Grid Graphs
Spanning Trees in Grid Graphs Paul Raff arxiv:0809.2551v1 [math.co] 15 Sep 2008 July 25, 2008 Abstract A general method is obtained for finding recurrences involving the number of spanning trees of grid
More informationTHE 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 informationCounting Matrices Over a Finite Field With All Eigenvalues in the Field
Counting Matrices Over a Finite Field With All Eigenvalues in the Field Lisa Kaylor David Offner Department of Mathematics and Computer Science Westminster College, Pennsylvania, USA kaylorlm@wclive.westminster.edu
More informationON PARTITION FUNCTIONS OF ANDREWS AND STANLEY
ON PARTITION FUNCTIONS OF ANDREWS AND STANLEY AE JA YEE Abstract. G. E. Andrews has established a refinement of the generating function for partitions π according to the numbers O(π) and O(π ) of odd parts
More informationProbabilistic construction of t-designs over finite fields
Probabilistic construction of t-designs over finite fields Shachar Lovett (UCSD) Based on joint works with Arman Fazeli (UCSD), Greg Kuperberg (UC Davis), Ron Peled (Tel Aviv) and Alex Vardy (UCSD) Gent
More informationNOTE. Composite Fermions and Integer Partitions
Journal of Combinatorial Theory, Series A 95, 390397 (2001) doi:10.1006jcta.2001.3182, available online at http:www.idealibrary.com on NOTE Composite Fermions and Integer Partitions Arthur T. Benjamin
More informationTiling expression of minors
Institute for Mathematics and its Applications Minneapolis, MN Colloquium University of British Columbia, Vancourver February, 0 Outline Introduction to the Enumeration of Tilings. Electrical networks
More informationCharacter Polynomials
Character Polynomials Problem From Stanley s Positivity Problems in Algebraic Combinatorics Problem : Give a combinatorial interpretation of the row sums of the character table for S n (combinatorial proof
More informationMaximizing the descent statistic
Maximizing the descent statistic Richard EHRENBORG and Swapneel MAHAJAN Abstract For a subset S, let the descent statistic β(s) be the number of permutations that have descent set S. We study inequalities
More informationEnumeration of domino tilings of a double Aztec rectangle
Enumeration of domino tilings of a double Aztec rectangle University of Nebraska Lincoln Lincoln, NE 68505 AMS Fall Central Sectional Meeting University of St. Thomas Minneapolis, MN, October 30, 2015
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 informationSmith Normal Form and Combinatorics
Smith Normal Form and Combinatorics Richard P. Stanley June 8, 2017 Smith normal form A: n n matrix over commutative ring R (with 1) Suppose there exist P,Q GL(n,R) such that PAQ := B = diag(d 1,d 1 d
More informationThe combinatorics of some exclusion model in physics
The combinatorics of some exclusion model in physics Orsay 5 April 2012 Xavier G. Viennot CNRS, Bordeaux, France The PASEP Partialy asymmetric exclusion process The Matrix Ansatz Derrida, Evans, Hakim,
More informationChromatic bases for symmetric functions
Chromatic bases for symmetric functions Soojin Cho Department of Mathematics Ajou University Suwon 443-749, Korea chosj@ajou.ac.kr Stephanie van Willigenburg Department of Mathematics University of British
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 informationThe Ehrhart polynomial of the Birkhoff polytope 1
The Ehrhart polynomial of the Birkhoff polytope Matthias Beck and Dennis Pixton All means (even continuous sanctify the discrete end. Doron Zeilberger 2 Abstract: The n th Birkhoff polytope is the set
More informationA Constant Term Identity Featuring the Ubiquitous (and Mysterious) Andrews-M ills-robbins-rumsey Numbers 1,2, 7, 42,
JOURNAL OF COMBINATORIAL THEORY, Series A 66, 17-27 (1994) A Constant Term Identity Featuring the Ubiquitous (and Mysterious) Andrews-M ills-robbins-rumsey Numbers 1,2, 7, 42, 429.... DORON ZEILBERGER
More informationPARTITIONS 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 informationTRIVARIATE MONOMIAL COMPLETE INTERSECTIONS AND PLANE PARTITIONS
TRIVARIATE MONOMIAL COMPLETE INTERSECTIONS AND PLANE PARTITIONS CHARLES CHEN, ALAN GUO, XIN JIN, AND GAKU LIU Abstract. We consider the homogeneous components U r of the map on R = k[x, y, z]/(x A, y B,
More informationCATALAN 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 informationSchur Polynomials and The Yang-Baxter Equation
Schur Polynomials and The Yang-Baxter Equation The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Citation As Published Publisher Brubaker,
More informationJessica Striker. November 10, 2015
Resonance in dynamical algebraic combinatorics Jessica Striker joint work with Kevin Dilks (NDSU) and Oliver Pechenik (UIUC) North Dakota State University November 10, 2015 J. Striker (NDSU) Resonance
More informationThe chromatic symmetric function of almost complete graphs
The chromatic symmetric function of almost complete graphs Gus Wiseman Department of Mathematics, University of California, One Shields Ave., Davis, CA 95616 Email: gus@nafindix.com Faculty Sponsor: Anne
More informationUnimodality via alternating gamma vectors
Unimodality via alternating gamma vectors Charles Brittenham Andrew T. Carroll T. Kyle Petersen Connor Thomas Department of Mathematics DePaul University Chicago, IL, U.S.A. {charles.brittenham, conthomas95}@gmail.com
More informationA TRIANGULAR GAP OF SIZE TWO IN A SEA OF DIMERS ON A 60 ANGLE. Bloomington, IN 47401, USA Nordbergstraße 15 A-1090 Wien, Austria. 1.
A TRIANGULAR GAP OF SIZE TWO IN A SEA OF DIMERS ON A 60 ANGLE Mihai Ciucu 1 Ilse Fischer 2 Indiana University Universität Wien Department of Mathematics Fakultät für Mathematik Bloomington, IN 47401, USA
More informationEvaluating a Determinant
Evaluating a Determinant Thotsaporn Thanatipanonda Joint Work with Christoph Koutschan Research Institute for Symbolic Computation, Johannes Kepler University of Linz, Austria June 15th, 2011 Outline of
More informationCentral Groupoids, Central Digraphs, and Zero-One Matrices A Satisfying A 2 = J
Central Groupoids, Central Digraphs, and Zero-One Matrices A Satisfying A 2 = J Frank Curtis, John Drew, Chi-Kwong Li, and Daniel Pragel September 25, 2003 Abstract We study central groupoids, central
More informationA note on quantum products of Schubert classes in a Grassmannian
J Algebr Comb (2007) 25:349 356 DOI 10.1007/s10801-006-0040-5 A note on quantum products of Schubert classes in a Grassmannian Dave Anderson Received: 22 August 2006 / Accepted: 14 September 2006 / Published
More informationThe Combinatorialization of Linear Recurrences
The Combinatorialization of Linear Recurrences Arthur T Benjamin Harvey Mudd College Claremont, CA, USA benjamin@hmcedu Jennifer J Quinn University of Washington Tacoma Tacoma, WA USA jjquinn@uwedu Halcyon
More informationMACMAHON S PARTITION ANALYSIS IX: k-gon PARTITIONS
MACMAHON S PARTITION ANALYSIS IX: -GON PARTITIONS GEORGE E. ANDREWS, PETER PAULE, AND AXEL RIESE Dedicated to George Szeeres on the occasion of his 90th birthday Abstract. MacMahon devoted a significant
More informationTHE Q-SPECTRUM AND SPANNING TREES OF TENSOR PRODUCTS OF BIPARTITE GRAPHS
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 125, Number 11, November 1997, Pages 3155 3161 S 0002-9939(9704049-5 THE Q-SPECTRUM AND SPANNING TREES OF TENSOR PRODUCTS OF BIPARTITE GRAPHS TIMOTHY
More informationarxiv:math/ v2 [math.co] 1 Sep 2005
arxiv:math/0501132v2 [math.co] 1 Sep 2005 A DETERMINANT-LIKE FORMULA FOR THE KOSTKA NUMBERS MATHIAS LEDERER Abstract. Young tableaux are ubiquitous in various branches of mathematics. There are two counting
More informationResonance in orbits of plane partitions and increasing tableaux. Jessica Striker North Dakota State University
Resonance in orbits of plane partitions and increasing tableaux Jessica Striker North Dakota State University joint work with Kevin Dilks (NDSU) and Oliver Pechenik (UIUC) February 19, 2016 J. Striker
More informationAn Involution for the Gauss Identity
An Involution for the Gauss Identity William Y. C. Chen Center for Combinatorics Nankai University, Tianjin 300071, P. R. China Email: chenstation@yahoo.com Qing-Hu Hou Center for Combinatorics Nankai
More informationOptimal primitive sets with restricted primes
Optimal primitive sets with restricted primes arxiv:30.0948v [math.nt] 5 Jan 203 William D. Banks Department of Mathematics University of Missouri Columbia, MO 652 USA bankswd@missouri.edu Greg Martin
More informationResearch Article New Partition Theoretic Interpretations of Rogers-Ramanujan Identities
International Combinatorics Volume 2012, Article ID 409505, 6 pages doi:10.1155/2012/409505 Research Article New Partition Theoretic Interpretations of Rogers-Ramanujan Identities A. K. Agarwal and M.
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 informationA Formula for the Specialization of Skew Schur Functions
A Formula for the Specialization of Skew Schur Functions The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Citation As Published Publisher
More informationMotzkin Paths with Vertical Edges
Motzkin Paths with Vertical Edges Veronika Irvine and Frank Ruskey University of Victoria, Canada March 13, 2014 Abstract This paper considers finite lattice paths formed from the set of step vectors {,,,,
More informationA New and Simple Method of Solving Large Linear Systems: Based on Cramer s Rule but Employing Dodgson s Condensation
, 2-25 October, 201, San Francisco, USA A New and Simple Method of Solving Large Linear Systems: Based on Cramer s Rule but Employing Dodgson s Condensation Okoh Ufuoma Abstract The object of this paper
More informationMAXIMAL PERIODS OF (EHRHART) QUASI-POLYNOMIALS
MAXIMAL PERIODS OF (EHRHART QUASI-POLYNOMIALS MATTHIAS BECK, STEVEN V. SAM, AND KEVIN M. WOODS Abstract. A quasi-polynomial is a function defined of the form q(k = c d (k k d + c d 1 (k k d 1 + + c 0(k,
More informationThe Matrix-Tree Theorem
The Matrix-Tree Theorem Christopher Eur March 22, 2015 Abstract: We give a brief introduction to graph theory in light of linear algebra. Our results culminates in the proof of Matrix-Tree Theorem. 1 Preliminaries
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 informationA Bijective Proof of Borchardt s Identity
A Bijective Proof of Borchardt s Identity Dan Singer Minnesota State University, Mankato dan.singer@mnsu.edu Submitted: Jul 28, 2003; Accepted: Jul 5, 2004; Published: Jul 26, 2004 Abstract We prove Borchardt
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 informationDave Robbins art of guessing
Advances in Applied Mathematics 34 (2005) 939 954 www.elsevier.com/locate/yaama Dave Robbins art of guessing Doron Zeilberger Department of Mathematics, Rutgers University (New Brunswick), Hill Center-Busch
More informationTutte Polynomials of Bracelets. Norman Biggs
Tutte Polynomials of Bracelets Norman Biggs Department of Mathematics London School of Economics Houghton Street London WC2A 2AE U.K. n.l.biggs@lse.ac.uk January 2009 CDAM Research Reports Series LSE-CDAM
More informationGeneralized Foulkes Conjecture and Tableaux Construction
Generalized Foulkes Conjecture and Tableaux Construction Thesis by Rebecca Vessenes In Partial Fulfillment of the Requirements for the egree of octor of Philosophy California Institute of Technology Pasadena,
More informationChapter 7. Inclusion-Exclusion a.k.a. The Sieve Formula
Chapter 7. Inclusion-Exclusion a.k.a. The Sieve Formula Prof. Tesler Math 184A Fall 2019 Prof. Tesler Ch. 7. Inclusion-Exclusion Math 184A / Fall 2019 1 / 25 Venn diagram and set sizes A = {1, 2, 3, 4,
More informationResearch Statement. Janine E. Janoski
Research Statement Janine E. Janoski 1 Introduction My research is in discrete mathematics and combinatorics. I have worked on a wide variety of research topics including, enumeration problems, eigenvalue
More informationarxiv: 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 informationarxiv:math/ v1 [math.co] 5 Oct 1998
RHOMBUS TILINGS OF A HEXAGON WITH TWO TRIANGLES MISSING ON THE SYMMETRY AXIS THERESIA EISENKÖLBL arxiv:math/98009v [math.co] 5 Oct 998 Abstract. We compute the number of rhombus tilings of a hexagon with
More information