Ricky X. F. Chen

Plane Permutations and Applications to a Result of Zagier--Stanley and Distances of Permutations

In this paper, we introduce plane permutations, i.e. pairs

Narayana polynomials and some generalizations

\mathfrak{p}=(s,\pi)

On the local genus distribution of graph embeddings

where

Another combinatorial proof of a result of Zagier and Stanley

s

A simple framework on sorting permutations.

is an

Linear sequential dynamical systems and the Moebius functions of partially ordered sets

n

Narayana polynomial and some generalizations

-cycle and

Garden-of-Eden states and fixed points of monotone dynamical systems

\pi

Linear sequential dynamical systems, incidence algebras, and Möbius functions

is an arbitrary permutation, represented as a two-row array. Accordingly a plane permutation gives rise to three distinct permutations: the permutation induced by the upper horizontal (

On a lower bound for sorting signed permutations by reversals

s