On the number of combinations without certain separations

Abstract: In this paper we enumerate the number of ways of selecting

k

objects from

n

objects arrayed in a line such that no two selected ones are separated by

m - 1, 2 m - 1, ..., p m - 1

objects and provide three different formulas when

m, p g e q 1

and

n g e q p m (k - 1)

. Also, we prove that the number of ways of selecting

k

objects from

n

objects arrayed in a circle such that no two selected ones are separated by

m - 1, 2 m - 1, ..., p m - 1

objects is given by

, where

m, p g e q 1

and

n g e q m p k + 1

.

Review text

The authors enumerate combinatorially the number of ways of selecting \(k\) objects from \(n\) objects arrayed in a line (respectively in a circle), such that no two selected ones are separated by \(m-1\), \(2m-1, \dots,pm-1\) objects. These results generalize respective ones of \textit{I. Kaplansky} [Bull. Am. Math. Soc. 49, 784--785 (1943; Zbl 0060.02904)] and \textit{J. Konvalina} [J. Comb. Theory, Ser. A 31, 101--107 (1981; Zbl 0469.05003)].

Recommendations

Cites work

Cited in

(17)

This page was built for publication: On the number of combinations without certain separations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q925023)