Investigation reveals modified ascent sequences avoiding a length 4 pattern in Cayley permutations, suggesting deeper combinatorial insights.
Modified ascent sequences, initially defined as the bijective images of ascent sequences under a certain hat map, have also been characterized as Cayley permutations where each entry is a leftmost copy if and only if it is an ascent top. These sequences play a significant role in the study of Fishburn structures. In this paper, we investigate (primitive) modified ascent sequences avoiding a pattern of length 4 by combining combinatorial and algebraic techniques, including the application of the kernel method. Our results confirm several conjectures posed by Cerbai.
No takes yet. Share an insight, caveat, or question.
Lin et al. (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: