Pages that link to "Item:Q1883677"
From MaRDI portal
The following pages link to A fast algorithm for MacMahon's partition analysis (Q1883677):
Displayed 18 items.
- Symmetrically constrained compositions (Q618862) (← links)
- A residue theorem for Malcev-Neumann series. (Q817240) (← links)
- Using Rota's Umbral calculus to enumerate Stanley's \(P\)-partitions (Q931837) (← links)
- Constructing all magic squares of order three (Q932615) (← links)
- Determinant formulas relating to tableaux of bounded height (Q984023) (← links)
- On the enumeration of certain weighted graphs (Q997075) (← links)
- A family of \(q\)-Dyson style constant term identities (Q1003617) (← links)
- Invariants, Kronecker products, and combinatorics of some remarkable Diophantine systems (Q1012160) (← links)
- On \(P\)-partitions related to ordinal sums of posets (Q1024335) (← links)
- Enumeration of bilaterally symmetric 3-noncrossing partitions (Q1025510) (← links)
- Hilbert series of invariants, constant terms and Kostka-Foulkes polynomials (Q1044998) (← links)
- Weitzenböck derivations of free metabelian Lie algebras (Q2435534) (← links)
- Generalization of Stanley's monster reciprocity theorem (Q2459504) (← links)
- On the probability that finite spaces with random distances are metric spaces (Q2570110) (← links)
- Towards the geometry of double Hurwitz numbers (Q2577481) (← links)
- MacMahon’s Dream (Q2897225) (← links)
- The combinatorics of $k$-marked Durfee symbols (Q3082383) (← links)
- Mahonian Partition Identities via Polyhedral Geometry (Q4912512) (← links)