Resumen de Counting Multiple Cyclic Choices Without Adjacencies

Alice McLeod, William Moser

• We give a particularly elementary solution to the following well-known problem. What is the number of k-subsets X \subseteq In = {1,2,3,...,n} satisfying "no two elements of X are adjacent in the circular display of In"? Then we investigate a new generalization (multiple cyclic choices without adjacencies) and apply it to enumerating a class of 3-line latin rectangles.