location:  Publications → journals
Search results

Search: MSC category 05A05 ( Permutations, words, matrices )

 Expand all        Collapse all Results 1 - 1 of 1

1. CMB 2005 (vol 48 pp. 244)

McLeod, Alice; Moser, William
 Counting Multiple Cyclic Choices Without Adjacencies We give a particularly elementary solution to the following well-known problem. What is the number of $k$-subsets $X \subseteq I_n=\{1,2,3,\dots,n\}$ satisfying no two elements of $X$ are adjacent in the circular display of $I_n$''? Then we investigate a new generalization (multiple cyclic choices without adjacencies) and apply it to enumerating a class of 3-line latin rectangles. Categories:05A19, 05A05
 top of page | contact us | privacy | site map |