2014/02/24 by David Callan, Callan, David · 1 citation
Computer Science · Engineering · Mathematics · #Advanced Combinatorial Mathematics #Coding theory and cryptography #graph theory and CDMA systems #math.CO #msc:05A15
paper · pdf · doi:10.48550/arxiv.1402.5898
6 pages
arxiv created 2014/02/24 · arxiv updated 2014/02/25
Chen and collaborators give a recursively defined bijection from 021-avoiding ascent sequences to 021-avoiding (aka 132-avoiding) permutations. Here we give an algorithmic bijection from 021-avoiding ascent sequences to Dyck paths. Our bijection does not appear to be closely related to the Chen bijection but, like the Chen bijection, it preserves several interesting statistics.