A poset structure on quasifibonacci partitions
Hansheng Diao

TL;DR
This paper introduces a poset structure on partitions of integers into quasifibonacci numbers, explores their relations, and generalizes Robbins' result on quasifibonacci power series coefficients.
Contribution
It constructs a novel poset framework for quasifibonacci partitions and extends Robbins' theorem to a broader context.
Findings
Poset structure on quasifibonacci partitions
Symmetric and recursive relations between posets
Generalization of Robbins' result
Abstract
In this paper, we study partitions of positive integers into distinct quasifibonacci numbers. A digraph and poset structure is constructed on the set of such partitions. Furthermore, we discuss the symmetric and recursive relations between these posets. Finally, we prove a strong generalization of Robbins' result on the coefficients of a quasifibonacci power series.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Mathematical Theories and Applications · Advanced Mathematical Identities · Advanced Combinatorial Mathematics
