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

Vincular or dashed patterns resemble classical patterns except that some ofthe letters within an occurrence are required to be adjacent. We prove severalinfinite families of Wilf-equivalences for k-ary words involving vincularpatterns containing a single dash, which explain the majority of theequivalences witnessed for such patterns of length four. When combined withprevious results, numerical evidence, and some arguments in specific cases, weobtain the complete Wilf-classification for all vincular patterns of lengthfour containing a single dash. In some cases, our proof shows further that theequivalence holds for multiset permutations since it is seen to respect thenumber of occurrences of each letter within a word. Some related enumerativeresults are provided for patterns {\sigma} of length four, among themgenerating function formulas for the number of members of [k]^n avoiding any{\sigma} of the form 11a-b.

On avoidance of patterns of the form {\sigma}-{\tau} by words over a finite alphabet