A family of Bell transformations

Daniel Birmajer, Juan B. Gil, Michael D. Weiner

Research output: Contribution to journalArticle

Abstract

We introduce a family of sequence transformations, defined via partial Bell polynomials, that may be used for a systematic study of a wide variety of problems in enumerative combinatorics. This family includes some of the transformations listed in the paper by Bernstein & Sloane, now seen as transformations under the umbrella of partial Bell polynomials. Our goal is to describe these transformations from the algebraic and combinatorial points of view. We provide functional equations satisfied by the generating functions, derive inverse relations, and give a convolution formula. While the full range of applications remains unexplored, in this paper we show a glimpse of the versatility of Bell transformations by discussing the enumeration of several combinatorial configurations, including rational Dyck paths, rooted planar maps, and certain classes of permutations.

LanguageEnglish (US)
Pages38-54
Number of pages17
JournalDiscrete Mathematics
Volume342
Issue number1
DOIs
StatePublished - Jan 1 2019

Fingerprint

Bell Polynomials
Polynomials
Convolution
Enumerative Combinatorics
Dyck Paths
Planar Maps
Partial
Enumeration
Functional equation
Generating Function
Permutation
Family
Configuration
Range of data
Class

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Cite this

Birmajer, Daniel ; Gil, Juan B. ; Weiner, Michael D. / A family of Bell transformations. In: Discrete Mathematics. 2019 ; Vol. 342, No. 1. pp. 38-54.
@article{76abd3b3242a49319bfa8eacf1e88347,
title = "A family of Bell transformations",
abstract = "We introduce a family of sequence transformations, defined via partial Bell polynomials, that may be used for a systematic study of a wide variety of problems in enumerative combinatorics. This family includes some of the transformations listed in the paper by Bernstein & Sloane, now seen as transformations under the umbrella of partial Bell polynomials. Our goal is to describe these transformations from the algebraic and combinatorial points of view. We provide functional equations satisfied by the generating functions, derive inverse relations, and give a convolution formula. While the full range of applications remains unexplored, in this paper we show a glimpse of the versatility of Bell transformations by discussing the enumeration of several combinatorial configurations, including rational Dyck paths, rooted planar maps, and certain classes of permutations.",
author = "Daniel Birmajer and Gil, {Juan B.} and Weiner, {Michael D.}",
year = "2019",
month = "1",
day = "1",
doi = "10.1016/j.disc.2018.09.011",
language = "English (US)",
volume = "342",
pages = "38--54",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "1",

}

A family of Bell transformations. / Birmajer, Daniel; Gil, Juan B.; Weiner, Michael D.

In: Discrete Mathematics, Vol. 342, No. 1, 01.01.2019, p. 38-54.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A family of Bell transformations

AU - Birmajer, Daniel

AU - Gil, Juan B.

AU - Weiner, Michael D.

PY - 2019/1/1

Y1 - 2019/1/1

N2 - We introduce a family of sequence transformations, defined via partial Bell polynomials, that may be used for a systematic study of a wide variety of problems in enumerative combinatorics. This family includes some of the transformations listed in the paper by Bernstein & Sloane, now seen as transformations under the umbrella of partial Bell polynomials. Our goal is to describe these transformations from the algebraic and combinatorial points of view. We provide functional equations satisfied by the generating functions, derive inverse relations, and give a convolution formula. While the full range of applications remains unexplored, in this paper we show a glimpse of the versatility of Bell transformations by discussing the enumeration of several combinatorial configurations, including rational Dyck paths, rooted planar maps, and certain classes of permutations.

AB - We introduce a family of sequence transformations, defined via partial Bell polynomials, that may be used for a systematic study of a wide variety of problems in enumerative combinatorics. This family includes some of the transformations listed in the paper by Bernstein & Sloane, now seen as transformations under the umbrella of partial Bell polynomials. Our goal is to describe these transformations from the algebraic and combinatorial points of view. We provide functional equations satisfied by the generating functions, derive inverse relations, and give a convolution formula. While the full range of applications remains unexplored, in this paper we show a glimpse of the versatility of Bell transformations by discussing the enumeration of several combinatorial configurations, including rational Dyck paths, rooted planar maps, and certain classes of permutations.

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

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

U2 - 10.1016/j.disc.2018.09.011

DO - 10.1016/j.disc.2018.09.011

M3 - Article

VL - 342

SP - 38

EP - 54

JO - Discrete Mathematics

T2 - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 1

ER -