Colored compositions, invert operator and elegant compositions with the ``black tie

DOI10.1016/J.DISC.2014.06.026zbMATH Open1298.05030arXiv1409.6454OpenAlexW2058820286MaRDI QIDQ400429FDOQ400429

Authors: Marco Abrate, Stefano Barbero, Umberto Cerruti, Nadir Murru 

Publication date: 21 August 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: This paper shows how the study of colored compositions of integers reveals some unexpected and original connection with the Invert operator. The Invert operator becomes an important tool to solve the problem of directly counting the number of colored compositions for any coloration. The interesting consequences arising from this relationship also give an immediate and simple criterion to determine whether a sequence of integers counts the number of some colored compositions. Applications to Catalan and Fibonacci numbers naturally emerge, allowing to clearly answer to some open questions. Moreover, the definition of colored compositions with the "black tie" provides straightforward combinatorial proofs to a new identity involving multinomial coefficients and to a new closed formula for the Invert operator. Finally, colored compositions with the "black tie" give rise to a new combinatorial interpretation for the convolution operator, and to a new and easy method to count the number of parts of colored compositions.

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

Recommendations

• \(n\)-colour self-inverse compositions
• Some identities related to the self-inverse \(n\)-color compositions
• Fibonacci colored compositions and applications
• \(n\)-colour even self-inverse compositions
• \(n\)-color odd self-inverse compositions

zbMATH Keywords

partitions of integerscalculation of integer sequencescolored compositions

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Elementary theory of partitions (11P81)

Cites Work

• Title not available (Why is that?)
• Rogers-Ramanujan identities for partitions with n copies of n
• Combinatorics of Compositions and Words
• Some \(n\)-color compositions
• Some canonical sequences of integers
• Title not available (Why is that?)
• An analogue of Euler's identity and new combinatorial properties of \(n\)-colour compositions
• Lattice paths and \(n\)-colour compositions
• Some sequences of integers
• Transforming recurrent sequences by using the binomial and invert operators
• Title not available (Why is that?)
• Title not available (Why is that?)
• \(n\)-colour compositions
• The \(m\)-colored composition poset

Cited In (2)

• Fibonacci colored compositions and applications
• Generalized colored circular palindromic compositions

Uses Software

• OEIS

This page was built for publication: Colored compositions, invert operator and elegant compositions with the ``black tie

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q400429)