Counting Multiple Cyclic Choices Without Adjacencies

• Autores: Alice McLeod, William Moser
• Localización: Canadian mathematical bulletin, ISSN 0008-4395, Vol. 48, Nº 2, 2005, págs. 244-250
• Idioma: inglés
• DOI: 10.4153/cmb-2005-022-4
• Texto completo no disponible (Saber más ...)
• Resumen

  • 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.