Ordered k-flaw Preferences Sets

arXiv0806.0279MaRDI QIDQ6209750FDOQ6209750

Authors: Po-Yi Huang, Jun Ma, Yeong-Nan Yeh 

Publication date: 2 June 2008

Abstract: In this paper, we focus on ordered $k$-flaw preference sets. Let $mathcal{OP}_{n,geqk}$ denote the set of ordered preference sets of length $n$ with at least $k$ flaws and $mathcal{S}_{n,k}=(x_1,\mathrm{...},x_{n-k})mid{x}_1+x_2+\mathrm{...}+x_{n-k}=n+k,x_{i}inmathbbN$. We obtain a bijection from the sets $mathcal{OP}_{n,geqk}$ to $mathcal{S}_{n,k}$. Let $mathcal{OP}_{n,k}$ denote the set of ordered preference sets of length $n$ with exactly $k$ flaws. An $(n,k)$-emph{flaw path} is a lattice path starting at $(0,0)$ and ending at $(2n,0)$ with only two kinds of steps--rise step: $U=(1,1)$ and fall step: $D=(1,-1)$ lying on the line $y=-k$ and touching this line. Let $mathcal{D}_{n,k}$ denote the set of $(n,k)$-flaw paths. Also we establish a bijection between the sets $mathcal{OP}_{n,k}$ and $mathcal{D}_{n,k}$. Let $o{p}_{n,geqk,leql}^m$ $(o{p}_{n,k,=l}^m)$ denote the number of preference sets $alpha=(a_1,\mathrm{...},a_n)$ with at least $k$ (exact) flaws and leading term $m$ satisfying $a_{i}leql$ for any $i$ $(max{a}_{i}mid1leqileqn=l)$, respectively. With the benefit of these bijections, we obtain the explicit formulas for $o{p}_{n,geqk,leql}^m$. Furthermore, we give the explicit formulas for $o{p}_{n,k,=l}^m$. We derive some recurrence relations of the sequence formed by ordered $k$-flaw preference sets of length $n$ with leading term $m$. Using these recurrence relations, we obtain the generating functions of some corresponding $k$-flaw preference sets.

Mathematics Subject Classification ID

Combinatorial inequalities (05A20) Linear transformations, semilinear transformations (15A04)

This page was built for publication: Ordered k-flaw Preferences Sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6209750)