Skew Dyck paths without up--down--left
Helmut Prodinger
TL;DR
This paper enumerates a specific class of skew Dyck paths avoiding a particular subword and counts occurrences of a certain pattern, extending known integer sequence results.
Contribution
It introduces a new enumeration for skew Dyck paths without a specific subword and analyzes pattern occurrences, expanding existing combinatorial sequence data.
Findings
Enumeration formulas for skew Dyck paths without 'up-down-left'
Counting of 'up-down-left' subword occurrences in these paths
Extension of results in the Encyclopedia of Integer Sequences
Abstract
Skew Dyck paths without up-down-left are enumerated. In a second step, the number of contiguous subwords 'up-down-left' are counted. This explains and extends results that were posted in the Encyclopedia of Integer Sequences.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematics and Applications · History and Theory of Mathematics · Advanced Combinatorial Mathematics