Skip to main content
Top
Published in: Mathematics in Computer Science 1/2020

13-11-2019

The Depth of Compositions

Authors: Aubrey Blecher, Charlotte Brennan, Arnold Knopfmacher, Toufik Mansour

Published in: Mathematics in Computer Science | Issue 1/2020

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

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.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference Aho, A.V., Sethi, R., Ullman, J.D.: Compilers: Principles, Techniques and Tools. Addison-Wesley, Reading (1986)MATH Aho, A.V., Sethi, R., Ullman, J.D.: Compilers: Principles, Techniques and Tools. Addison-Wesley, Reading (1986)MATH
2.
go back to reference Archibald, M., Blecher, A., Brennan, C., Knopfmacher, A., Mansour, T.: Durfee squares in compositions. Discrete Math. Appl. 28(6), 359–367 (2018)MathSciNetCrossRef Archibald, M., Blecher, A., Brennan, C., Knopfmacher, A., Mansour, T.: Durfee squares in compositions. Discrete Math. Appl. 28(6), 359–367 (2018)MathSciNetCrossRef
4.
go back to reference Heubach, S., Mansour, T.: Combinatorics of Compositions and Words (Discrete Mathematics and its Applications). Chapman & Hall/CRC, Boca Raton (2010)MATH Heubach, S., Mansour, T.: Combinatorics of Compositions and Words (Discrete Mathematics and its Applications). Chapman & Hall/CRC, Boca Raton (2010)MATH
5.
go back to reference Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 3rd edn. Addison-Wesley, New York (2007)MATH Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 3rd edn. Addison-Wesley, New York (2007)MATH
6.
go back to reference Janse van Rensburg, E.J., Rechnitzer, P.: Exchange symmetries in Motzkin path and bargraph models of copolymer adsorption. Electron. J. Comb. 9, R20 (2002)MathSciNetCrossRef Janse van Rensburg, E.J., Rechnitzer, P.: Exchange symmetries in Motzkin path and bargraph models of copolymer adsorption. Electron. J. Comb. 9, R20 (2002)MathSciNetCrossRef
7.
go back to reference Mansour, T.: Border and tangent cells in bargraphs. Preprint Mansour, T.: Border and tangent cells in bargraphs. Preprint
8.
9.
go back to reference Mansour, T., Munagi, A.O.: Enumeration of gap-bounded set partitions. J. Automata Lang. Comb. 14(3–4), 237–245 (2009)MathSciNetMATH Mansour, T., Munagi, A.O.: Enumeration of gap-bounded set partitions. J. Automata Lang. Comb. 14(3–4), 237–245 (2009)MathSciNetMATH
10.
go back to reference Osborn, J., Prellberg, T.: Forcing adsorption of a tethered polymer by pulling. J. Stat. Mech. Theory Experiment 2010, P09018 (2010)CrossRef Osborn, J., Prellberg, T.: Forcing adsorption of a tethered polymer by pulling. J. Stat. Mech. Theory Experiment 2010, P09018 (2010)CrossRef
11.
go back to reference Prellberg, T., Brak, R.: Critical exponents from nonlinear functional equations for partially directed cluster models. J. Stat. Phys. 78, 701–730 (1995)CrossRef Prellberg, T., Brak, R.: Critical exponents from nonlinear functional equations for partially directed cluster models. J. Stat. Phys. 78, 701–730 (1995)CrossRef
Metadata
Title
The Depth of Compositions
Authors
Aubrey Blecher
Charlotte Brennan
Arnold Knopfmacher
Toufik Mansour
Publication date
13-11-2019
Publisher
Springer International Publishing
Published in
Mathematics in Computer Science / Issue 1/2020
Print ISSN: 1661-8270
Electronic ISSN: 1661-8289
DOI
https://doi.org/10.1007/s11786-019-00421-8

Other articles of this Issue 1/2020

Mathematics in Computer Science 1/2020 Go to the issue

Premium Partner