k-flaw Preference Sets

Details k-flaw Preference Sets k-flaw Preference Sets

2008-06-02

arxiv.org/abs/0806.0281v1

Mathematics

Combinatorics

33 pages

Scientific paper

In this paper, let $\mathcal{P}_{n;\leq s;k}^l$ denote a set of $k$-flaw preference sets $(a_1,...,a_n)$ with $n$ parking spaces satisfying that $1\leq a_i\leq s$ for any $i$ and $a_1=l$ and $p_{n;\leq s;k}^l=|\mathcal{P}_{n;\leq 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;\leq s;k}^l$ and give the generating functions for these sequences.

Affiliated with

Also associated with

No associations

Rating

k-flaw Preference Sets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with k-flaw Preference Sets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and k-flaw Preference Sets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-631627