A poset structure on quasifibonacci partitions

Hansheng Diao

doi:10.1016/j.jcta.2009.03.014

A poset structure on quasifibonacci partitions

Hansheng Diao

Mathematics

Research output: Contribution to journal › Article › peer-review

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.

Original language	English (US)
Pages (from-to)	1361-1373
Number of pages	13
Journal	Journal of Combinatorial Theory. Series A
Volume	116
Issue number	8
DOIs	https://doi.org/10.1016/j.jcta.2009.03.014
State	Published - Nov 2009

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Discrete Mathematics and Combinatorics
Computational Theory and Mathematics

Keywords

Quasifibonacci partitions

Access to Document

10.1016/j.jcta.2009.03.014

Cite this

@article{82fe8ebb9f774dc79cc0a3666d3d6ce2,

title = "A poset structure on quasifibonacci partitions",

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

keywords = "Quasifibonacci partitions",

author = "Hansheng Diao",

year = "2009",

month = nov,

doi = "10.1016/j.jcta.2009.03.014",

language = "English (US)",

volume = "116",

pages = "1361--1373",

journal = "Journal of Combinatorial Theory. Series A",

issn = "0097-3165",

publisher = "Academic Press Inc.",

number = "8",

}

TY - JOUR

T1 - A poset structure on quasifibonacci partitions

AU - Diao, Hansheng

PY - 2009/11

Y1 - 2009/11

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

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

KW - Quasifibonacci partitions

UR - http://www.scopus.com/inward/record.url?scp=70349338628&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=70349338628&partnerID=8YFLogxK

U2 - 10.1016/j.jcta.2009.03.014

DO - 10.1016/j.jcta.2009.03.014

M3 - Article

AN - SCOPUS:70349338628

SN - 0097-3165

VL - 116

SP - 1361

EP - 1373

JO - Journal of Combinatorial Theory. Series A

JF - Journal of Combinatorial Theory. Series A

IS - 8

ER -

A poset structure on quasifibonacci partitions

Abstract

All Science Journal Classification (ASJC) codes

Keywords

Access to Document

Other files and links

Fingerprint

Cite this