scholarly journals The location of the first maximum in the first sojourn of a Dyck path

2008 ◽  
Vol Vol. 10 no. 3 (Analysis of Algorithms) ◽  
Author(s):  
Helmut Prodinger

Analysis of Algorithms International audience For Dyck paths (nonnegative symmetric) random walks, the location of the first maximum within the first sojourn is studied. Generating functions and explicit resp. asymptotic expressions for the average are derived. Related parameters are also discussed.

2003 ◽  
Vol DMTCS Proceedings vol. AC,... (Proceedings) ◽  
Author(s):  
Michel Nguyên Thê

International audience This paper gives a survey of the limit distributions of the areas of different types of random walks, namely Dyck paths, bilateral Dyck paths, meanders, and Bernoulli random walks, using the technology of generating functions only.


10.37236/1637 ◽  
2002 ◽  
Vol 9 (1) ◽  
Author(s):  
E. J. Janse van Rensburg ◽  
A. Rechnitzer

In a previous work [26], by considering paths that are partially weighted, the generating function of Dyck paths was shown to possess a type of symmetry, called an exchange relation, derived from the exchange of a portion of the path between weighted and unweighted halves. This relation is particularly useful in solving for the generating functions of certain models of vertex-coloured Dyck paths; this is a directed model of copolymer adsorption, and in a particular case it is possible to find an asymptotic expression for the adsorption critical point of the model as a function of the colouring. In this paper we examine Motzkin path and partially directed walk models of the same adsorbing directed copolymer problem. These problems are an interesting generalisation of previous results since the colouring can be of either the edges, or the vertices, of the paths. We are able to find asymptotic expressions for the adsorption critical point in the Motzkin path model for both edge and vertex colourings, and for the partially directed walk only for edge colourings. The vertex colouring problem in partially directed walks seems to be beyond the scope of the methods of this paper, and remains an open question. In both these cases we first find exchange relations for the generating functions, and use those to find the asymptotic expression for the adsorption critical point.


2014 ◽  
Vol Vol. 16 no. 1 (Combinatorics) ◽  
Author(s):  
Aubrey Blecher ◽  
Charlotte Brennan ◽  
Arnold Knopfmacher

Combinatorics International audience We consider compositions of n, i.e., sequences of positive integers (or parts) (σi)i=1k where σ1+σ2+...+σk=n. We define a maximum to be any part which is not less than any other part. The variable of interest is the size of the descent immediately following the first and the last maximum. Using generating functions and Mellin transforms, we obtain asymptotic expressions for the average size of these descents. Finally, we show with the use of a simple bijection between the compositions of n for n>1, that on average the descent after the last maximum is greater than the descent after the first.


2007 ◽  
Vol DMTCS Proceedings vol. AH,... (Proceedings) ◽  
Author(s):  
Helmut Prodinger ◽  
Stephan Wagner

International audience The minimal length of a plateau (a sequence of horizontal steps, preceded by an up- and followed by a down-step) in a Motzkin path is known to be of interest in the study of secondary structures which in turn appear in mathematical biology. We will treat this and the related parameters <i> maximal plateau length, horizontal segment </i>and <i>maximal horizontal segment </i>as well as some similar parameters in unary-binary trees by a pure generating functions approach―-Motzkin paths are derived from Dyck paths by a substitution process. Furthermore, we provide a pretty general analytic method to obtain means and limiting distributions for these parameters. It turns out that the maximal plateau and the maximal horizontal segment follow a Gumbel distribution.


2007 ◽  
Vol DMTCS Proceedings vol. AH,... (Proceedings) ◽  
Author(s):  
Andrew Bressler ◽  
Robin Pemantle

International audience We analyze nearest neighbor one-dimensional quantum random walks with arbitrary unitary coin-flip matrices. Using a multivariate generating function analysis we give a simplified proof of a known phenomenon, namely that the walk has linear speed rather than the diffusive behavior observed in classical random walks. We also obtain exact formulae for the leading asymptotic term of the wave function and the location probabilities.


2003 ◽  
Vol DMTCS Proceedings vol. AC,... (Proceedings) ◽  
Author(s):  
Michael Drmota

International audience In this paper we consider discrete random walks on infinite graphs that are generated by copying and shifting one finite (strongly connected) graph into one direction and connecting successive copies always in the same way. With help of generating functions it is shown that there are only three types for the asymptotic behaviour of the random walk. It either converges to the stationary distribution or it can be approximated in terms of a reflected Brownian motion or by a Brownian motion. In terms of Markov chains these cases correspond to positive recurrence, to null recurrence, and to non recurrence.


2015 ◽  
Vol DMTCS Proceedings, 27th... (Proceedings) ◽  
Author(s):  
Cesar Ceballos ◽  
Arnau Padrol ◽  
Camilo Sarmiento

International audience We introduce the Dyck path triangulation of the cartesian product of two simplices $\Delta_{n-1}\times\Delta_{n-1}$. The maximal simplices of this triangulation are given by Dyck paths, and its construction naturally generalizes to produce triangulations of $\Delta_{r\ n-1}\times\Delta_{n-1}$ using rational Dyck paths. Our study of the Dyck path triangulation is motivated by extendability problems of partial triangulations of products of two simplices. We show that whenever$m\geq k>n$, any triangulations of $\Delta_{m-1}^{(k-1)}\times\Delta_{n-1}$ extends to a unique triangulation of $\Delta_{m-1}\times\Delta_{n-1}$. Moreover, with an explicit construction, we prove that the bound $k>n$ is optimal. We also exhibit interpretations of our results in the language of tropical oriented matroids, which are analogous to classical results in oriented matroid theory. Nous introduisons la triangulation par chemins de Dyck du produit cartésien de deux simplexes $\Delta_{n-1}\times\Delta_{n-1}$. Les simplexes maximaux de cette triangulation sont donnés par des chemins de Dyck, et cette construction se généralise de façon naturelle pour produire des triangulations $\Delta_{r\ n-1}\times\Delta_{n-1}$ qui utilisent des chemins de Dyck rationnels. Notre étude de la triangulation par chemins de Dyck est motivée par des problèmes de prolongement de triangulations partielles de produits de deux simplexes. On montre que $m\geq k>n$ alors toute triangulation de $\Delta_{m-1}^{(k-1)}\times\Delta_{n-1}$ se prolonge en une unique triangulation de $\Delta_{m-1}\times\Delta_{n-1}$. De plus, avec une construction explicite, nous montrons que la borne $k>n$ est optimale. Nous présentons aussi des interprétations de nos résultats dans le langage des matroïdes orientés tropicaux, qui sont analogues aux résultats classiques de la théorie des matroïdes orientés.


2013 ◽  
Vol DMTCS Proceedings vol. AS,... (Proceedings) ◽  
Author(s):  
Antonio Bernini ◽  
Luca Ferrari ◽  
Renzo Pinzani ◽  
Julian West

International audience We introduce the notion of $\textit{pattern}$ in the context of lattice paths, and investigate it in the specific case of Dyck paths. Similarly to the case of permutations, the pattern-containment relation defines a poset structure on the set of all Dyck paths, which we call the $\textit{Dyck pattern poset}$. Given a Dyck path $P$, we determine a formula for the number of Dyck paths covered by $P$, as well as for the number of Dyck paths covering $P$. We then address some typical pattern-avoidance issues, enumerating some classes of pattern-avoiding Dyck paths. Finally, we offer a conjecture concerning the asymptotic behavior of the sequence counting Dyck paths avoiding a generic pattern and we pose a series of open problems regarding the structure of the Dyck pattern poset.


2012 ◽  
Vol DMTCS Proceedings vol. AR,... (Proceedings) ◽  
Author(s):  
Mark Dukes ◽  
Yvan Le Borgne

International audience We give a polyomino characterisation of recurrent configurations of the sandpile model on the complete bipartite graph $K_{m,n}$ in which one designated vertex is the sink. We present a bijection from these recurrent configurations to decorated parallelogram polyominoes whose bounding box is a $m×n$ rectangle. Other combinatorial structures appear in special cases of this correspondence: for example bicomposition matrices (a matrix analogue of set partitions), and (2+2)-free posets. A canonical toppling process for recurrent configurations gives rise to a path within the associated parallelogram polyominoes. We define a collection of polynomials that we call $q,t$-Narayana polynomials, the generating functions of the bistatistic $(\mathsf{area ,parabounce} )$ on the set of parallelogram polyominoes, akin to Haglund's $(\mathsf{area ,hagbounce} )$ bistatistic on Dyck paths. In doing so, we have extended a bistatistic of Egge et al. to the set of parallelogram polyominoes. This is one answer to their question concerning extensions to other combinatorial objects. We conjecture the $q,t$-Narayana polynomials to be symmetric and discuss the proofs for numerous special cases. We also show a relationship between the $q,t$-Catalan polynomials and our bistatistic $(\mathsf{area ,parabounce}) $on a subset of parallelogram polyominoes. Pour le modèle du tas de sable sur un graphe $K_m,n$ biparti complet, on donne une description des configurations rècurrentes à l'aide d'une bijection avec des polyominos parallèlogrammes dècorès de rectangle englobant $m×n$. D'autres classes combinatoires apparaissent comme des cas particuliers de cette construction: par exemple les matrices de bicomposition et les ordres partiels évitant le motif (2+2). Un processus d'éboulement canonique des configurations récurrentes se traduit par un chemin bondissant dans le polyomino parallèlogramme associè. Nous définissons une famille de polynômes, baptisée de $q,t$-Narayana, à travers la distribution d'une paire de statistique $(\mathsf{aire, poidscheminbondissant})$ sur les polyominos parallélogrammes similaire à celle de Haglund définissant les polynômes de $q,t$-Catalan sur les chemins de Dyck. Ainsi nous étendons une paire de statistique de Egge et d'autres à l'ensemble des polynominos parallélogrammes. Cela répond à l'une de leur question sur des généralistations à d'autres objets combinatoires. Nous conjecturons que les polynômes de $q,t$-Narayana sont symétriques et discutons des preuves de plusieurs cas particuliers. Nous montrons ègalement une relation avec les polynômes de $q,t$-Catalan en restreignant notre paire de statistique à un sous-ensemble des polyominos parallélogrammes.


2011 ◽  
Vol DMTCS Proceedings vol. AO,... (Proceedings) ◽  
Author(s):  
Gilbert Labelle ◽  
Annie Lacasse

International audience We give explicit formulas for the number $U_n(N)$ of closed polygonal paths of length $N$ (starting from the origin) whose steps are $n^{\textrm{th}}$ roots of unity, as well as asymptotic expressions for these numbers when $N \rightarrow \infty$. We also prove that the sequences $(U_n(N))_{N \geq 0}$ are $P$-recursive for each fixed $n \geq 1$ and leave open the problem of determining the values of $N$ for which the $\textit{dual}$ sequences $(U_n(N))_{n \geq 1}$ are $P$-recursive. Nous donnons des formules explicites pour le nombre $U_n(N)$ de chemins polygonaux fermés de longueur $N$ (débutant à l'origine) dont les pas sont des racines $n$-ièmes de l'unité, ainsi que des expressions asymptotiques pour ces nombres lorsque $N \rightarrow \infty$. Nous démontrons aussi que les suites $(U_n(N))_{N \geq 0}$ sont $P$-récursives pour chaque $n \geq 1$ fixé et laissons ouvert le problème de déterminer les valeurs de $N$ pour lesquelles les suites $\textit{duales}$ $(U_n(N))_{n \geq 1}$ sont $P$-récursives.


Sign in / Sign up

Export Citation Format

Share Document