Compositions with restricted parts
From MaRDI portal
Publication:2182193
DOI10.1016/J.DISC.2020.111875zbMATH Open1440.05031arXiv1812.11010OpenAlexW3007249440MaRDI QIDQ2182193FDOQ2182193
Authors: Jia Huang
Publication date: 21 May 2020
Published in: Discrete Mathematics (Search for Journal in Brave)
Abstract: Euler showed that the number of partitions of into distinct parts equals the number of partitions of into odd parts. This theorem was generalized by Glaisher and further by Franklin. Recently, Beck made three conjectures on partitions with restricted parts, which were confirmed analytically by Andrews and Chern and combinatorially by Yang. Analogous to Euler's partition theorem, it is known that the number of compositions of with odd parts equals the number of compositions of with parts greater than one, as both numbers equal the Fibonacci number . Recently, Sills provided a bijective proof for this result using binary sequences, and Munagi proved a generalization similar to Glaisher's result using the zigzag graphs of compositions. Extending Sills' bijection, we obtain a further generalizaiton which is analogous to Franklin's result. We establish, both analytically and combinatorially, two closed formulas for the number of compositions with restricted parts appearing in our generalization. We also prove some composition analogues for the conjectures of Beck.
Full work available at URL: https://arxiv.org/abs/1812.11010
Recommendations
- Composition analogues of Beck's conjectures on partitions
- Compositions, partitions, and Fibonacci numbers
- Combinatorial proofs and generalizations of conjectures related to Euler's partition theorem
- Combinatorial proofs of two Euler-type identities due to Andrews
- A bijection between two classes of restricted compositions
Combinatorial aspects of partitions of integers (05A17) Partition identities; identities of Rogers-Ramanujan type (11P84)
Cites Work
- The on-line encyclopedia of integer sequences
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Relation Between Partitions and the Number of Divisors
- Lattice animals on a staircase and Fibonacci numbers
- Compositions, partitions, and Fibonacci numbers
- Euler-type identities for integer compositions via zig-zag graphs
- Title not available (Why is that?)
- Combinatorial proofs and generalizations of conjectures related to Euler's partition theorem
- On a conjecture of George Beck
- Compositions with odd summands.
- Some Inplace Identities for Integer Compositions
Cited In (5)
Uses Software
This page was built for publication: Compositions with restricted parts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2182193)