Motzkin numbers

From MaRDI portal
Revision as of 09:43, 31 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5906304

DOI10.1006/EUJC.1998.0235zbMath0915.05004OpenAlexW2911684622MaRDI QIDQ5906304

Martin Aigner

Publication date: 23 June 1999

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/eujc.1998.0235




Related Items (56)

Normalizers of ad-nilpotent idealsEnumerative aspects of secondary structuresBijections and the Riordan groupDecompositions and eigenvectors of Riordan matricesHankel determinants and shifted periodic continued fractionsλ > 4Cross-bifix-free sets generation via Motzkin pathsANISOTROPIC STEP, SURFACE CONTACT, AND AREA WEIGHTED DIRECTED WALKS ON THE TRIANGULAR LATTICEMotzkin monoids and partial Brauer monoidsColored Motzkin Paths of Higher OrderHankel determinants of linear combinations of consecutive Catalan-like numbersHalf of a Riordan array and restricted lattice pathsLog-convexity and strong \(q\)-\(\log\)-convexity for some triangular arraysInfinitely log-monotonic combinatorial sequencesHankel determinants of sums of consecutive Motzkin numbersThe \(\mathfrak{uvu}\)-avoiding \((a, b, c)\)-generalized Motzkin paths with vertical steps: bijections and statistic enumerationsDeterminant identities for the Catalan, Motzkin and Schröder numbersA direct method for evaluating some nice Hankel determinants and proofs of several conjecturesCounting cycles on planar graphs in subexponential timeDyck Words, Lattice Paths, and Abelian BordersCounting cycles on planar graphs in subexponential timeEnumeration via ballot numbersCombinatorial proofs of addition formulasUnnamed ItemFrom crossing-free graphs on wheel sets to embracing simplices and polytopes with few verticesStieltjes moment sequences for pattern-avoiding permutationsMotzkin algebrasUnnamed ItemPeakless Motzkin paths with marked level steps at fixed heightAsymptotic \(r\)-log-convexity and P-recursive sequencesBell polynomials and \(k\)-generalized Dyck pathsOn the log-convexity of combinatorial sequencesOrthogonal polynomials approach to the Hankel transform of sequences based on Motzkin numbersRiordan group involutionsHankel determinants for some common lattice pathsSkew standard domino tableaux and partial Motzkin pathsUnnamed ItemLogarithmic behavior of some combinatorial sequencesAnalytic properties of combinatorial triangles related to Motzkin numbersSeven (lattice) paths to log-convexityStructural properties of Potts model partition functions and chromatic polynomials for lattice stripsUnnamed ItemRealizability of some combinatorial sequencesSome open questions about random walks, involutions, limiting distributions, and generating functionsExhaustive generation of some lattice paths and their prefixesLog-convexity of Aigner-Catalan-Riordan numbersTaylor expansions for the generating function of Catalan-like numbersThe sets of flattened partitions with forbidden patternsRiordan group involutions and the \(\varDelta \)-sequenceHankel determinants for convolution powers of Catalan numbersUnnamed ItemHigher order Turán inequalities for combinatorial sequencesCatalan-like numbers and determinantsMotzkin paths, Motzkin polynomials and recurrence relationsSome statistics on generalized Motzkin paths with vertical stepsA new statistic on Dyck paths for counting 3-dimensional Catalan words







This page was built for publication: Motzkin numbers