Delannoy Numbers and Preferential Arrangements
Department of Mathematics, University of Taipei, Taipei 10048, Taiwan
Current address: No. 1, Ai-GuoWest Road, Taipei 10048, Taiwan.
Received: 25 January 2019 / Revised: 1 March 2019 / Accepted: 2 March 2019 / Published: 6 March 2019
A preferential arrangement on
is a ranking of the elements of
where ties are allowed. The number of preferential arrangements on
is denoted by
. The Delannoy number
is the number of lattice paths from
in which only east
, and northeast
steps are allowed. We establish a symmetric identity among the numbers
by means of algebraic and combinatorial methods.
This is an open access article distributed under the Creative Commons Attribution License
which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
Share & Cite This Article
MDPI and ACS Style
Chen, K.-W. Delannoy Numbers and Preferential Arrangements. Mathematics 2019, 7, 238.
Chen K-W. Delannoy Numbers and Preferential Arrangements. Mathematics. 2019; 7(3):238.
Chen, Kwang-Wu. 2019. "Delannoy Numbers and Preferential Arrangements." Mathematics 7, no. 3: 238.
Show more citation formats
Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.
[Return to top]
For more information on the journal statistics, click here
Multiple requests from the same IP address are counted as one view.