The register function for lattice paths - Archive ouverte HAL
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2008

The register function for lattice paths

Abstract

The register function for binary trees is the minimal number of extra registers required to evaluate the tree. This concept is also known as Horton-Strahler numbers. We extend this definition to lattice paths, built from steps $\pm 1$, without positivity restriction. Exact expressions are derived for appropriate generating functions. A procedure is presented how to get asymptotics of all moments, in an almost automatic way; this is based on an earlier paper of the authors.
Fichier principal
Vignette du fichier
dmAI0107.pdf (130.48 Ko) Télécharger le fichier
Origin Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01194675 , version 1 (07-09-2015)

Identifiers

Cite

Guy Louchard, Helmut Prodinger. The register function for lattice paths. Fifth Colloquium on Mathematics and Computer Science, 2008, Kiel, Germany. pp.135-148, ⟨10.46298/dmtcs.3560⟩. ⟨hal-01194675⟩

Collections

TDS-MACS
98 View
582 Download

Altmetric

Share

More