Corpus ID: 1978712

The Multiple Permutation Problem and Some Conjectures

@article{Pan2010TheMP,
  title={The Multiple Permutation Problem and Some Conjectures},
  author={Zan Pan},
  journal={ArXiv},
  year={2010},
  volume={abs/1007.4663}
}
  • Zan Pan
  • Published 27 July 2010
  • Mathematics, Computer Science
  • ArXiv
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… Expand

References

SHOWING 1-5 OF 5 REFERENCES
Combinatorics of permutations
  • M. Bóna
  • Mathematics, Computer Science
  • SIGA
  • 2008
TLDR
This book discusses Permutations as Genome Rearrangements, algorithms and permutations, and the proof of the Stanley-Wilf Conjecture. Expand
The Art of Computer Programming
  • vol. 3: Sorting and Searching, 2nd edition, Addison Wesley
  • 1998
Asymptotic formulae in combinatory analysis
Enumerative Combinatorics
  • vol. 1, 2nd edition, Cambridge University Press, Cambridge/New York
  • 1997
A Convergent Series for the Partition Function p(n).
  • H. Rademacher
  • Mathematics, Medicine
  • Proceedings of the National Academy of Sciences of the United States of America
  • 1937