A relation on 132-avoiding permutation patterns

Abstract: Rudolph conjectures that for permutations

p

and

q

of the same length,

A_{n} (p) l e A_{n} (q)

for all

n

if and only if the spine structure of

T (p)

is less than or equal to the spine structure of

T (q)

in refinement order. We prove one direction of this conjecture, by showing that if the spine structure of

T (p)

is less than or equal to the spine structure of

T (q)

, then

A_{n} (p) l e A_{n} (q)

for all

n

. We disprove the opposite direction by giving a counterexample, and hence disprove the conjecture.

Recommendations

Cited in

(5)

This page was built for publication: A relation on 132-avoiding permutation patterns