2014/10/22 by Antonio Bernini, Bernini, Antonio, Luca Ferrari +1
Computer Science · Mathematics · #Advanced Algebra and Logic #Advanced Combinatorial Mathematics #Combinatorics (math.CO) #FOS: Mathematics #math.CO #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1410.6046
13 pages, 4 figures
openalex publication_date 2014/10/22 · arxiv created 2015/11/05 · arxiv updated 2015/11/06 · openalex created_date 2025/10/24 · openalex updated_date 2026/07/28
We introduce vincular pattern posets, then we consider in particular the quasi-consecutive pattern poset, which is defined by declaring σ≤ τ whenever the permutation τ contains an occurrence of the permutation σ in which all the entries are adjacent in τ except at most the first and the second. We investigate the Möbius function of the quasi-consecutive pattern poset and we completely determine it for those intervals [σ,τ] such that σ occurs precisely once in τ.