论文标题
在$ \下划线{12} 0 $ - 避免反转和上升序列
On $\underline{12}0$-avoiding inversion and ascent sequences
论文作者
论文摘要
最近，Yan和第一名作者系统地调查了反转或上升序列的枚举，避免了长度$ 3 $的圆柱图案，其中三个字母中的两个需要相邻。他们与熟悉的组合家庭建立了许多联系，并提出了一些有趣的猜想。本文的目的是解决有关$ \下划线{12} 0 $避免反转或上升序列的枚举的两个猜想。
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 $\underline{12}0$-avoiding inversion or ascent sequences.
