Some combinatorial results on smooth permutations

We show that any smooth permutation σ ∈ S_n is characterized by the set C(σ) of transpositions and 3-cycles in the Bruhat interval (S_n)_≤σ, and that σ is the product (in a certain order) of the transpositions in C(σ). We also characterize the image of the map σ ↦→ C(σ). As an application, we show that σ is smooth if and only if the intersection of (S_n)_≤σ with every conjugate of a parabolic subgroup of S_n admits a maximum. This also gives another approach for enumerating smooth permutations and subclasses thereof. Finally, we relate covexillary permutations to smooth ones and rephrase the results in terms of the (co)essential set in the sense of Fulton.