English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

A \emph{Dyck path} is a lattice path in the first quadrant of the $xy$-planethat starts at the origin, ends on the $x$-axis, and consists of the samenumber of North-East steps $U$ and South-East steps $D$. A \emph{valley} is asubpath of the form $DU$. A Dyck path is called \emph{restricted $d$-Dyck} ifthe difference between any two consecutive valleys is at least $d$ (right-handside minus left-hand side) or if it has at most one valley. In this paper wegive some connections between restricted $d$-Dyck paths and both, thenon-crossing partitions of $[n]$ and some subfamilies of polyominoes. We alsogive generating functions to count several aspects of these combinatorialobjects.

Some Connections Between Restricted Dyck Paths, Polyominoes, and Non-Crossing Partitions