Enumeration of skew Ferrers diagrams and basic Bessel functions
DOI10.1016/0378-3758(93)90037-7zbMATH Open0771.05008OpenAlexW1996930411MaRDI QIDQ1209643FDOQ1209643
Publication date: 16 May 1993
Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0378-3758(93)90037-7
Recommendations
generating functionenumeration\(q\)-calculusBessel functionsEhrhart theoryDyck wordsskew Ferrers diagrams
Exact enumeration problems, generating functions (05A15) (q)-calculus and related topics (05A30) Bessel and Airy functions, cylinder functions, ({}_0F_1) (33C10)
Cites Work
- Title not available (Why is that?)
- Decompositions of Rational Convex Polytopes
- Planar Maps are Well Labeled Trees
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algebraic languages and polyominoes enumeration
- Title not available (Why is that?)
- Some basic hypergeometric orthogonal polynomials that generalize Jacobi polynomials
- The combinatorics of q-Hermite polynomials and the Askey-Wilson integral
- Title not available (Why is that?)
- Tiling with polyominoes
- Polynômes arithmétiques et méthode des polyedres en combinatoire
- Semantics of context-free languages
- The zeros of basic Bessel functions, the functions J(nu+ax)(x), and associated orthogonal polynomials
- A Noncommutative Generalization and q-Analog of the Lagrange Inversion Formula
- Ordered structures and partitions
- Title not available (Why is that?)
- On the number of certain lattice polygons
- A Sequence of Integers Related to the Bessel Functions
- Title not available (Why is that?)
- On congruences and continued fractions for some classical combinatorial quantities
- A proof of Andrews' \(q\)-Dyson conjecture
- Attribute grammars are useful for combinatorics
- On context-free languages and push-down automata
- Combinatoire et représentation du groupe symétrique. Actes de la Table Ronde du C.N.R.S. tenue à l'Université Louis-Pasteur de Strasbourg, 26 au 30 avril 1976
- On the Geometry of Numbers in Elementary Number Theory
- Contributions to the Cell Growth Problem
- Title not available (Why is that?)
- Formal languages and enumeration
- Title not available (Why is that?)
- Title not available (Why is that?)
- Introduction aux polyèdres en combinatoire d'après E. Ehrhart et R. Stanley
- On the number of lattice animals embeddable in the square lattice
Cited In (9)
- Kontsevich-Witten model from \(2+1\) gravity: new exact combinatorial solution
- Coding the convex polyominoes and equations for the enumeration according to the area
- Empilements de segments et \(q\)-énumération de polyominos convexes dirigés. (Heaps of segments and \(q\)-enumeration of directed convex polyominoes)
- On an involution on the Dyck paths
- Enumeration of skew Ferrers diagrams
- Enumeration of skew Ferrers diagrams
- Enumeration of the directed convex polyominoes
- On the Bessel functions
- Two combinatorial statistics on Dyck paths
This page was built for publication: Enumeration of skew Ferrers diagrams and basic Bessel functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1209643)