k-flaw Preference Sets

Abstract: In this paper, let

m a t h c a l P_{n; l e q s; k}^{l}

denote a set of

k

-flaw preference sets

(a_{1}, ..., a_{n})

with

n

parking spaces satisfying that

1 l e q a_{i} l e q s

for any

i

and

a_{1} = l

and

p_{n; l e q s; k}^{l} = | m a t h c a l P_{n; l e q s; k}^{l} |

. We use a combinatorial approach to the enumeration of

k

-flaw preference sets by their leading terms. The approach relies on bijections between the

k

-flaw preference sets and labeled rooted forests. Some bijective results between certain sets of

k

-flaw preference sets of distinct leading terms are also given. We derive some formulas and recurrence relations for the sequences

p_{n; l e q s; k}^{l}

and give the generating functions for these sequences.

This page was built for publication: k-flaw Preference Sets