论文信息 - The Number of Dense Arrangements - 字舞流文

The Number of Dense Arrangements

Abstract Consider arrangements of N elements of two kinds, A and B , such that any segment of length m contains at least k type A elements. We evaluate the number of such arrangements.

[1] S. Wallenstein,et al. Probabilities for the Size of Largest Clusters and Smallest Intervals , 1974 .

[2] B. Saperstein. Note on a clustering problem , 1975 .

[3] Joseph Naus. Probabilities for a Generalized Birthday Problem , 1974 .

[4] J. Naus. The Distribution of the Size of the Maximum Cluster of Points on a Line , 1965 .

[5] C. L. Mallows,et al. Some Aspects of the Random Sequence , 1965 .

[6] F. Hwang. A Generalization of the Karlin-McGregor Theorem on Coincidence Probabilities and an Application to Clustering , 1977 .

[7] A Simpler Expression for $K$th Nearest Neighbor Coincidence Probabilities , 1975 .

[8] Bernard Saperstein,et al. The Generalized Birthday Problem , 1972 .

[9] Multiple Coverage of the Line , 1979 .

[10] Joseph Naus,et al. Probabilities for a $k$th Nearest Neighbor Problem on the Line , 1973 .