On the number of combinations without certain separations

From MaRDI portal
Publication:925023

DOI10.1016/J.EJC.2007.06.024zbMATH Open1178.05007arXiv0805.1276OpenAlexW2003064372MaRDI QIDQ925023FDOQ925023


Authors: Yidong Sun, Toufik Mansour Edit this on Wikidata


Publication date: 29 May 2008

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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 m1,2m1,...,pm1 objects and provide three different formulas when m,pgeq1 and ngeqpm(k1). 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 m1,2m1,...,pm1 objects is given by , where m,pgeq1 and ngeqmpk+1.


Full work available at URL: https://arxiv.org/abs/0805.1276




Recommendations




Cites Work


Cited In (11)





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)