The Depth of Compositions

Aubrey Blecher; Charlotte Brennan; Arnold Knopfmacher; Toufik Mansour

doi:https://doi.org/10.1007/s11786-019-00421-8

The Depth of Compositions

Aubrey Blecher, Charlotte Brennan, Arnold Knopfmacher, Toufik Mansour

Department of Mathematics

University of Haifa

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

Abstract

In this paper we consider compositions of n as bargraphs. The depth of a cell inside this graphical representation is the minimum number of horizontal and/or vertical unit steps that are needed to exit to the outside. The depth of the composition is the maximum depth over all cells of the composition. We use finite automata to study the generating function for the number of compositions having a depth of at least r.

Original language	American English
Pages (from-to)	69-76
Number of pages	8
Journal	Mathematics in Computer Science
Volume	14
Issue number	1
DOIs	https://doi.org/10.1007/s11786-019-00421-8
State	Published - 1 Mar 2020

Keywords

Automaton
Composition
Generating function

All Science Journal Classification (ASJC) codes

Computational Mathematics
Computational Theory and Mathematics
Applied Mathematics

Access to Document

https://doi.org/10.1007/s11786-019-00421-8

Cite this

@article{d705723775f042949762b3c2f992d166,

title = "The Depth of Compositions",

abstract = "In this paper we consider compositions of n as bargraphs. The depth of a cell inside this graphical representation is the minimum number of horizontal and/or vertical unit steps that are needed to exit to the outside. The depth of the composition is the maximum depth over all cells of the composition. We use finite automata to study the generating function for the number of compositions having a depth of at least r.",

keywords = "Automaton, Composition, Generating function",

author = "Aubrey Blecher and Charlotte Brennan and Arnold Knopfmacher and Toufik Mansour",

note = "Publisher Copyright: {\textcopyright} 2019, Springer Nature Switzerland AG.",

year = "2020",

month = mar,

day = "1",

doi = "https://doi.org/10.1007/s11786-019-00421-8",

language = "American English",

volume = "14",

pages = "69--76",

journal = "Mathematics in Computer Science",

issn = "1661-8270",

publisher = "Birkhauser Verlag Basel",

number = "1",

}

TY - JOUR

T1 - The Depth of Compositions

AU - Blecher, Aubrey

AU - Brennan, Charlotte

AU - Knopfmacher, Arnold

AU - Mansour, Toufik

PY - 2020/3/1

Y1 - 2020/3/1

N2 - In this paper we consider compositions of n as bargraphs. The depth of a cell inside this graphical representation is the minimum number of horizontal and/or vertical unit steps that are needed to exit to the outside. The depth of the composition is the maximum depth over all cells of the composition. We use finite automata to study the generating function for the number of compositions having a depth of at least r.

AB - In this paper we consider compositions of n as bargraphs. The depth of a cell inside this graphical representation is the minimum number of horizontal and/or vertical unit steps that are needed to exit to the outside. The depth of the composition is the maximum depth over all cells of the composition. We use finite automata to study the generating function for the number of compositions having a depth of at least r.

KW - Automaton

KW - Composition

KW - Generating function

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

U2 - https://doi.org/10.1007/s11786-019-00421-8

DO - https://doi.org/10.1007/s11786-019-00421-8

M3 - Article

SN - 1661-8270

VL - 14

SP - 69

EP - 76

JO - Mathematics in Computer Science

JF - Mathematics in Computer Science

IS - 1

ER -

The Depth of Compositions

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this