2010/07/27 by Zan Pan, Pan, Zan
Computer Science · Engineering · Mathematics · #Advanced Combinatorial Mathematics #Advanced Mathematical Theories #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #cs.DM #graph theory and CDMA systems #math.CO
paper · pdf · doi:10.48550/arxiv.1007.4663
LaTeX, 16 pages
arxiv created 2010/07/27 · openalex publication_date 2010/07/27 · arxiv updated 2010/07/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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) ≠ 0 and suggested an elegant asymptotic formula for p(2,n). In addition, several challenging conjectures are provided, together with concise comments.