Realizing Partitions Respecting Full and Partial Order Information
Journal of discrete algorithms(2008)
摘要
For n∈N, we consider the problem of partitioning the interval [0,n) into k subintervals of positive integer lengths ℓ1,…,ℓk such that the lengths satisfy a set of simple constraints of the form ℓi⋄ijℓj where ⋄ij is one of <, >, or =. In the full information case, ⋄ij is given for all 1⩽i,j⩽k. In the sequential information case, ⋄ij is given for all 1
更多查看译文
关键词
Integer partitions,Integer sequences,Subset-sum,Rhythm pattern,Rhythm perception,Modular arithmetic
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要