Bessenrodt-Stanley Polynomials and the Octahedron Recurrence
نویسنده
چکیده
We show that a family of multivariate polynomials recently introduced by Bessenrodt and Stanley can be expressed as solution of the octahedron recurrence with suitable initial data. This leads to generalizations and explicit expressions as path or dimer partition functions.
منابع مشابه
Orthogonal Polynomials and Smith Normal Form
Smith normal form evaluations found by Bessenrodt and Stanley for some Hankel matrices of q-Catalan numbers are proven in two ways. One argument generalizes the Bessenrodt–Stanley results for the Smith normal form of a certain multivariate matrix that refines one studied by Berlekamp, Carlitz, Roselle, and Scoville. The second argument, which uses orthogonal polynomials, generalizes to a number...
متن کاملPerfect matchings and the octahedron recurrence
We study a recurrence defined on a three dimensional lattice and prove that its values are Laurent polynomials in the initial conditions with all coefficients equal to one. This recurrence was studied by Propp and by Fomin and Zelivinsky. Fomin and Zelivinsky were able to prove Laurentness and conjectured that the coefficients were 1. Our proof establishes a bijection between the terms of the L...
متن کاملSmith Normal Form of a Multivariate Matrix Associated with Partitions
Abstract. Considering a question of E. R. Berlekamp, Carlitz, Roselle, and Scoville gave a combinatorial interpretation of the entries of certain matrices of determinant 1 in terms of lattice paths. Here we generalize this result by refining the matrix entries to be multivariate polynomials, and by determining not only the determinant but also the Smith normal form of these matrices. A priori t...
متن کاملFe b 20 04 Perfect Matchings and The Octahedron Recurrence
We study a recurrence defined on a three dimensional lattice and prove that its values are Laurent polynomials in the initial conditions with all coefficients equal to one. This recurrence was studied by Propp and by Fomin and Zelivinsky. Fomin and Zelivinsky were able to prove Laurentness and conjectured that the coefficients were 1. Our proof establishes a bijection between the terms of the L...
متن کامل4 Perfect Matchings and The Octahedron Recurrence
We study a recurrence defined on a three dimensional lattice and prove that its values are Laurent polynomials in the initial conditions with all coefficients equal to one. This recurrence was studied by Propp and by Fomin and Zelivinsky. Fomin and Zelivinsky were able to prove Laurentness and conjectured that the coefficients were 1. Our proof establishes a bijection between the terms of the L...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 22 شماره
صفحات -
تاریخ انتشار 2015