scholarly journals Rhombic alternative tableaux, assemblees of permutations, and the ASEP

2020 ◽  
Vol DMTCS Proceedings, 28th... ◽  
Author(s):  
Olya Mandelshtam ◽  
Xavier Viennot

International audience In this paper, we introduce therhombic alternative tableaux, whose weight generating functions providecombinatorial formulae to compute the steady state probabilities of the two-species ASEP. In the ASEP, there aretwo species of particles, oneheavyand onelight, on a one-dimensional finite lattice with open boundaries, and theparametersα,β, andqdescribe the hopping probabilities. The rhombic alternative tableaux are enumerated by theLah numbers, which also enumerate certainassembl ́ees of permutations. We describe a bijection between the rhombicalternative tableaux and these assembl ́ees. We also provide an insertion algorithm that gives a weight generatingfunction for the assemb ́ees. Combined, these results give a bijective proof for the weight generating function for therhombic alternative tableaux.

2015 ◽  
Vol DMTCS Proceedings, 27th... (Proceedings) ◽  
Author(s):  
Olya Mandelshtam

International audience The goal of this paper is to provide a combinatorial expression for the steady state probabilities of the twospecies PASEP. In this model, there are two species of particles, one “heavy” and one “light”, on a one-dimensional finite lattice with open boundaries. Both particles can hop into adjacent holes to the right and left at rates 1 and $q$. Moreover, when the heavy and light particles are adjacent to each other, they can switch places as if the light particle were a hole. Additionally, the heavy particle can hop in and out at the boundary of the lattice. Our first result is a combinatorial interpretation for the stationary distribution at $q=0$ in terms of certain multi-Catalan tableaux. We provide an explicit determinantal formula for the steady state probabilities, as well as some general enumerative results for this case. We also describe a Markov process on these tableaux that projects to the two-species PASEP, and hence directly explains the connection between the two. Finally, we extend our formula for the stationary distribution to the $q=1$ case, using certain two-species alternative tableaux. Le but de ce document est de fournir une expression combinatoire décrivant les probabilités de l’état d’équilibre de PASEP à deux espèces. Dans ce modèle, il existe deux espèces de particules, une “lourde” et une “légère”, disposées sur un réseau fini unidimensionnel. Les deux particules peuvent sauter dans les trous adjacents à droite et à gauche, avec des probabilités proportionnelles à 1 et $q$. Par ailleurs, lorsque les particules lourdes et légères sont à côté l’une de l’autre, elles peuvent changer de place, comme si la particule légère était un trou. En outre, la particule lourde peut sauter dans et hors de la frontière du réseau. Notre premier résultat est une interprétation combinatoire de la distribution stationnaire dans le cas $q=0$, en termes de certains tableaux “multi-Catalan”. Nous proposons une formule explicite déterminantale pour les probabilités stationnaires, ainsi que plusieurs résultats énumératifs généraux pour ce cas. Nous décrivons aussi un processus de Markov sur ces tableaux, qui se projette sur le PASEP à deux espèces, et qui fournit donc directement une connexion entre les deux. Enfin, nous exprimons notre formule pour la distribution stationnaire dans le cas $q=1$, en utilisant certains tableaux alternatifs de deux espèces.


1987 ◽  
Vol 24 (2) ◽  
pp. 486-494 ◽  
Author(s):  
Thomas Hanschke

In this paper we study the M/M/2/2 queue with repeated attempts. It is shown that the part generating functions of the steady state probabilities can be expressed in of generalized hypergeometric unctions.


2011 ◽  
Vol DMTCS Proceedings vol. AO,... (Proceedings) ◽  
Author(s):  
Christopher R. H. Hanusa ◽  
Brant C. Jones

International audience We give a generating function for the fully commutative affine permutations enumerated by rank and Coxeter length, extending formulas due to Stembridge and Barcucci–Del Lungo–Pergola–Pinzani. For fixed rank, the length generating functions have coefficients that are periodic with period dividing the rank. In the course of proving these formulas, we obtain results that elucidate the structure of the fully commutative affine permutations. This is a summary of the results; the full version appears elsewhere. Nous présentons une fonction génératrice qui énumère les permutations affines totalement commutatives par leur rang et par leur longueur de Coxeter, généralisant les formules dues à Stembridge et à Barcucci–Del Lungo–Pergola–Pinzani. Pour un rang précis, les fonctions génératrices ont des coefficients qui sont périodiques de période divisant leur rang. Nous obtenons des résultats qui expliquent la structure des permutations affines totalement commutatives. L'article dessous est un aperçu des résultats; la version complète appara\^ıt ailleurs.


Author(s):  
Bong Dae Choi ◽  
Gang Uk Hwang ◽  
Dong Hwan Han

AbstractIn this paper we consider the MAP/G/1 queueing system with infinite capacity. In analysis, we use the supplementary variable method to derive the double transform of the queue length and the remaining service time of the customer in service (if any) in the steady state. As will be shown in this paper, our method is very simple and elegant. As a one-dimensional marginal transform of the double transform, we obtain the generating function of the queue length in the system for the MAP/G/1 queue, which is consistent with the known result.


1973 ◽  
Vol 5 (03) ◽  
pp. 614-631 ◽  
Author(s):  
N. B. Slater ◽  
T. C. T. Kotiah

In a multi-server queueing system in which the customers are of several different types, it is useful to define states which specify the types of customers being served as well as the total number present. Analogies with some problems in statistical mechanics are found fruitful. Certain generating functions are defined in such a way that they satisfy a system of linear equations. Solution of the associated eigenvector problem shows that the steady-state probabilities for states in which all the servers are busy can be represented by a weighted sum of geometric probabilities.


1987 ◽  
Vol 24 (02) ◽  
pp. 486-494 ◽  
Author(s):  
Thomas Hanschke

In this paper we study the M/M/2/2 queue with repeated attempts. It is shown that the part generating functions of the steady state probabilities can be expressed in of generalized hypergeometric unctions.


1990 ◽  
Vol 3 (2) ◽  
pp. 141-152
Author(s):  
A. M. Dukhovny

Application problems are investigated for the Markov chains with quasitoeplitz transition matrix. Generating functions of transient and steady state probabilities, first zero hitting probabilities and mean times are found for various particular cases, corresponding to some known patterns of feedback ( “warm-up,” “switch at threshold” etc.), Level depending dams and queue-depending queueing systems of both M/G/1 and MI/G/1 types with arbitrary random sizes of arriving and departing groups are studied.


2013 ◽  
Vol DMTCS Proceedings vol. AS,... (Proceedings) ◽  
Author(s):  
Jair Taylor

International audience We develop a method for counting words subject to various restrictions by finding a combinatorial interpretation for a product of formal sums of Laguerre polynomials. We use this method to find the generating function for $k$-ary words avoiding any vincular pattern that has only ones. We also give generating functions for $k$-ary words cyclically avoiding vincular patterns with only ones whose runs of ones between dashes are all of equal length, as well as the analogous results for compositions. Nous développons une méthode pour compter des mots satisfaisants certaines restrictions en établissant une interprétation combinatoire utile d’un produit de sommes formelles de polynômes de Laguerre. Nous utilisons cette méthode pour trouver la série génératrice pour les mots $k$-aires évitant les motifs vinculars consistant uniquement de uns. Nous présentons en suite les séries génératrices pour les mots $k$-aires évitant de façon cyclique les motifs vinculars consistant uniquement de uns et dont chaque série de uns entre deux tirets est de la même longueur. Nous présentons aussi les résultats analogues pour les compositions.


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.


1989 ◽  
Vol 2 (1) ◽  
pp. 71-82 ◽  
Author(s):  
Alexander M. Dukhovny

This paper investigates a class of Markov chains which are frequently encountered in various applications (e.g. queueing systems, dams and inventories) with feedback. Generating functions of transient and steady state probabilities are found by solving a special Riemann boundary value problem on the unit circle. A criterion of ergodicity is established.


Sign in / Sign up

Export Citation Format

Share Document