Self-conjugate (s,s+d,s+2d)-core partitions and free Motzkin paths

2021 ◽  
Vol 344 (4) ◽  
pp. 112304
Author(s):  
Sherry H.F. Yan ◽  
Danna Yan ◽  
Hao Zhou
Keyword(s):  
Motzkin Paths

Standard Young tableaux in a (2,1)-hook and Motzkin paths

2021 ◽  
Vol 344 (7) ◽  
pp. 112395
Author(s):  
Rosena R.X. Du ◽  
Jingni Yu
Keyword(s):  
Young Tableaux ◽  
Standard Young Tableaux ◽  
Motzkin Paths

scholarly journals Parity reversing involutions on plane trees and 2-Motzkin paths

2006 ◽  
Vol 27 (2) ◽  
pp. 283-289 ◽  
Author(s):  
William Y.C. Chen ◽  
Louis W. Shapiro ◽  
Laura L.M. Yang
Keyword(s):  
Plane Trees ◽  
Motzkin Paths

scholarly journals Area-width scaling in generalised Motzkin paths

2017 ◽  
Vol 482 ◽  
pp. 611-620
Author(s):  
Nils Haug ◽  
Thomas Prellberg ◽  
Grzegorz Siudem
Keyword(s):  
Motzkin Paths

scholarly journals Noncrossing linked partitions and large (3,2)-Motzkin paths

2012 ◽  
Vol 312 (11) ◽  
pp. 1918-1922 ◽  
Author(s):  
William Y.C. Chen ◽  
Carol J. Wang
Keyword(s):  
Motzkin Paths

scholarly journals Crossings, Motzkin paths and moments

2011 ◽  
Vol 311 (18-19) ◽  
pp. 2064-2078 ◽  
Author(s):  
Matthieu Josuat-Vergès ◽  
Martin Rubey
Keyword(s):  
Motzkin Paths

Peakless Motzkin paths with marked level steps at fixed height

2021 ◽  
Vol 344 (1) ◽  
pp. 112154
Author(s):  
Naiomi Cameron ◽  
Everett Sullivan
Keyword(s):  
Motzkin Paths

scholarly journals ON THE NUMBER OF ABELIAN BORDERED WORDS (WITH AN EXAMPLE OF AUTOMATIC THEOREM-PROVING)

2014 ◽  
Vol 25 (08) ◽  
pp. 1097-1110 ◽  
Author(s):  
DANIEL GOČ ◽  
NARAD RAMPERSAD ◽  
MICHEL RIGO ◽  
PAVEL SALIMOV
Keyword(s):  
Theorem Proving ◽  
Triangular Lattice ◽  
Automatic Theorem Proving ◽  
Combinatorial Objects ◽  
Letter Alphabet ◽  
Automatic Sequences ◽  
Motzkin Paths ◽  
Automatic Theorem

In the literature, many bijections between (labeled) Motzkin paths and various other combinatorial objects are studied. We consider abelian (un)bordered words and show the connection with irreducible symmetric Motzkin paths and paths in ℤ not returning to the origin. This study can be extended to abelian unbordered words over an arbitrary alphabet and we derive expressions to compute the number of these words. In particular, over a 3-letter alphabet, the connection with paths in the triangular lattice is made. Finally, we characterize the lengths of the abelian unbordered factors occurring in the Thue–Morse word using some kind of automatic theorem-proving provided by a logical characterization of the k-automatic sequences.

Skew Standard Domino Tableaux and Partial Motzkin Paths

2017 ◽  
Vol 21 (1) ◽  
pp. 43-71
Author(s):  
Ting-Yuan Cheng ◽  
Sen-Peng Eu ◽  
Tung-Shan Fu ◽  
Yi-Lin Lee
Keyword(s):  
Domino Tableaux ◽  
Motzkin Paths

Non uniform random generation of generalized Motzkin paths

2006 ◽  
Vol 42 (8-9) ◽  
pp. 603-616 ◽  
Author(s):  
Srečko Brlek ◽  
Elisa Pergola ◽  
Olivier Roques
Keyword(s):  
Random Generation ◽  
Motzkin Paths
Sign in / Sign up

Export Citation Format

Share Document