{"docId":438,"paperId":438,"url":"https:\/\/dmtcs.episciences.org\/438","doi":"10.46298\/dmtcs.438","journalName":"Discrete Mathematics & Theoretical Computer Science","issn":"","eissn":"1365-8050","volume":[{"vid":84,"name":"Vol. 10 no. 2"}],"section":[],"repositoryName":"Hal","repositoryIdentifier":"hal-00151979","repositoryVersion":1,"repositoryLink":"https:\/\/hal.science\/hal-00151979v1","dateSubmitted":"2015-03-26 16:20:07","dateAccepted":"2015-06-09 14:46:59","datePublished":"2007-06-05 08:00:00","titles":{"tl":"Culminating paths"},"authors":["Bousquet-M\u00e9lou, Mireille","Ponty, Yann"],"abstracts":{"en":"Let a and b be two positive integers. A culminating path is a path of Z^2 that starts from (0,0), consists of steps (1,a) and (1,-b), stays above the x-axis and ends at the highest ordinate it ever reaches. These paths were first encountered in bioinformatics, in the analysis of similarity search algorithms. They are also related to certain models of Lorentzian gravity in theoretical physics. We first show that the language on a two letter alphabet that naturally encodes culminating paths is not context-free. Then, we focus on the enumeration of culminating paths. A step by step approach, combined with the kernel method, provides a closed form expression for the generating fucntion of culminating paths ending at a (generic) height k. In the case a=b, we derive from this expression the asymptotic behaviour of the number of culminating paths of length n. When a>b, we obtain the asymptotic behaviour by a simpler argument. When a= b, with no precomputation stage nor non-linear storage required. The choice of the best algorithm is not as clear when a"},"keywords":[["Lattice paths"],["enumeration"],["random generation"],"05A15, 05A16 , 60C05","[MATH.MATH-CO] Mathematics [math]\/Combinatorics [math.CO]"]}