Computer Science – Discrete Mathematics
Scientific paper
2010-07-27
Computer Science
Discrete Mathematics
LaTeX, 16 pages
Scientific paper
In this paper, we proposed an interesting problem that might be classified into enumerative combinatorics. Featuring a distinctive two-fold dependence upon the sequences' terms, our problem can be really difficult, which calls for novel approaches to work it out for any given pair $(m,n)$. Complete or partial solutions for $m=2, 3$ with smaller $n$'s are listed. Moreover, we have proved the necessary condition for $p(m,n) \neq 0$ and suggested an elegant asymptotic formula for $p(2,n)$. In addition, several challenging conjectures are provided, together with concise comments.
No associations
LandOfFree
The Multiple Permutation Problem and Some Conjectures 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 The Multiple Permutation Problem and Some Conjectures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Multiple Permutation Problem and Some Conjectures will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-320646