Extensions of partial cyclic orders, Euler numbers and multidimensional boustrophedons
英文摘要：
We enumerate total cyclic orders on $\left\{1,\ldots,n\right\}$ where we prescribe the relative cyclic order of consecutive triples $(i,{i+1},{i+2})$, these integers being taken modulo $n$. In some cases, the problem reduces to the enumeration of descent classes of permutations, which is done via the boustrophedon construction. In other cases, we solve the question by introducing multidimensional versions of the boustrophedon. In particular we find new interpretations for the Euler up/down numbers and the Entringer numbers.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
