2020/03/26 by Zhicong Lin, Shishuo Fu, Lin, Zhicong +1
Computer Science · Engineering · Mathematics · #Advanced Combinatorial Mathematics #Coding theory and cryptography #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.2003.11813
openalex publication_date 2020/03/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Recently, Yan and the first named author investigated systematically the enumeration of inversion or ascent sequences avoiding vincular patterns of length 3, where two of the three letters are required to be adjacent. They established many connections with familiar combinatorial families and proposed several interesting conjectures. The objective of this paper is to address two of their conjectures concerning the enumeration of \underline120-avoiding inversion or ascent sequences.