Compositions with restricted parts

DOI10.1016/J.DISC.2020.111875MaRDI QIDQ2182193zbMATH OpenOpenAlexFDO

Publication date 21 May 2020

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1812.11010

composition Euler's partition theorem restricted parts

Combinatorial aspects of partitions of integers (05A17) Partition identities; identities of Rogers-Ramanujan type (11P84)

Abstract: Euler showed that the number of partitions of

n

into distinct parts equals the number of partitions of

n

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

n

with odd parts equals the number of compositions of

n + 1

with parts greater than one, as both numbers equal the Fibonacci number

F_{n}

. 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.

Recommendations

Cites work

Cited in

(5)

Describes a project that uses

Uses Software

OEIS

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)