k-flaw Preference Sets
| dc.creator | Huang, Po-Yi | |
| dc.creator | Ma, Jun | |
| dc.creator | Yeh, Jean | |
| dc.date | 2008-06-02 | |
| dc.date.accessioned | 2026-07-07T09:42:13Z | |
| dc.date.available | 2026-07-07T09:42:13Z | |
| dc.description | 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. | |
| dc.description | 33 pages | |
| dc.identifier | https://arxiv.org/abs/0806.0281 | |
| dc.identifier | http://arxiv.org/abs/0806.0281 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/162103 | |
| dc.subject | Combinatorics | |
| dc.subject | 05A20; 15A04 | |
| dc.title | k-flaw Preference Sets | |
| dc.type | text |