scholarly journals A Uniformly Distributed Statistic on a Class of Lattice Paths

10.37236/1835 ◽  
2004 ◽  
Vol 11 (1) ◽  
Author(s):  
David Callan

Let ${\cal G}_n$ denote the set of lattice paths from $(0,0)$ to $(n,n)$ with steps of the form $(i,j)$ where $i$ and $j$ are nonnegative integers, not both zero. Let ${\cal D}_n$ denote the set of paths in ${\cal G}_n$ with steps restricted to $(1,0),(0,1),(1,1)$, the so-called Delannoy paths. Stanley has shown that $| {\cal G}_n | =2^{n-1}|{\cal D}_n|$ and Sulanke has given a bijective proof. Here we give a simple statistic on ${\cal G}_n$ that is uniformly distributed over the $2^{n-1}$ subsets of $[n-1]=\{1,2,\ldots,n\}$ and takes the value $[n-1]$ precisely on the Delannoy paths.

10.37236/1518 ◽  
2000 ◽  
Vol 7 (1) ◽  
Author(s):  
Robert A. Sulanke

Let $d(n)$ count the lattice paths from $(0,0)$ to $(n,n)$ using the steps (0,1), (1,0), and (1,1). Let $e(n)$ count the lattice paths from $(0,0)$ to $(n,n)$ with permitted steps from the step set ${\bf N} \times {\bf N} - \{(0,0)\}$, where ${\bf N}$ denotes the nonnegative integers. We give a bijective proof of the identity $e(n) = 2^{n-1} d(n)$ for $n \ge 1$. In giving perspective for our proof, we consider bijections between sets of lattice paths defined on various sets of permitted steps which yield path counts related to the Narayana polynomials.


10.37236/2809 ◽  
2013 ◽  
Vol 20 (4) ◽  
Author(s):  
Frédéric Bosio ◽  
Marc A. A. Van Leeuwen

We give a bijective proof of the Aztec diamond theorem, stating that there are $2^{n(n+1)/2}$ domino tilings of the Aztec diamond of order $n$. The proof in fact establishes a similar result for non-intersecting families of $n+1$ Schröder paths, with horizontal, diagonal or vertical steps, linking the grid points of two adjacent sides of an $n\times n$ square grid; these families are well known to be in bijection with tilings of the Aztec diamond. Our bijection is produced by an invertible "combing'' algorithm, operating on families of paths without non-intersection condition, but instead with the requirement that any vertical steps come at the end of a path, and which are clearly $2^{n(n+1)/2}$ in number; it transforms them into non-intersecting families.


2001 ◽  
Vol DMTCS Proceedings vol. AA,... (Proceedings) ◽  
Author(s):  
Alberto Del Lungo ◽  
Massimo Mirolli ◽  
Renzo Pinzani ◽  
Simone Rinaldi

International audience In this paper we consider two classes of lattice paths on the plane which use \textitnorth, \textiteast, \textitsouth,and \textitwest unitary steps, beginningand ending at (0,0).We enumerate them according to the number ofsteps by means of bijective arguments; in particular, we apply the cycle lemma.Then, using these results, we provide a bijective proof for the number of directed-convex polyominoes having a fixed number of rows and columns.


2021 ◽  
Vol 94 ◽  
pp. 103310
Author(s):  
Nancy S.S. Gu ◽  
Helmut Prodinger
Keyword(s):  

Production ◽  
2011 ◽  
Vol 21 (2) ◽  
pp. 217-222 ◽  
Author(s):  
Yang Su-Fen ◽  
Tsai Wen-Chi ◽  
Huang Tzee-Ming ◽  
Yang Chi-Chin ◽  
Cheng Smiley

In practice, sometimes the process data did not come from a known population distribution. So the commonly used Shewhart variables control charts are not suitable since their performance could not be properly evaluated. In this paper, we propose a new EWMA Control Chart based on a simple statistic to monitor the small mean shifts in the process with non-normal or unknown distributions. The sampling properties of the new monitoring statistic are explored and the average run lengths of the proposed chart are examined. Furthermore, an Arcsine EWMA Chart is proposed since the average run lengths of the Arcsine EWMA Chart are more reasonable than those of the new EWMA Chart. The Arcsine EWMA Chart is recommended if we are concerned with the proper values of the average run length.


2017 ◽  
Vol 10 (3) ◽  
pp. 523-530
Author(s):  
Jacob Forster ◽  
Kristina Garrett ◽  
Luke Jacobsen ◽  
Adam Wood
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document