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
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 objects from objects arrayed in a line such that no two selected ones are separated by objects and provide three different formulas when and . Also, we prove that the number of ways of selecting objects from objects arrayed in a circle such that no two selected ones are separated by objects is given by , where and .
Full work available at URL: https://arxiv.org/abs/0805.1276
Recommendations
Cites Work
Cited In (11)
- Title not available (Why is that?)
- The number of \(s\)-separated \(k\)-sets in various circles
- On arithmetic partitions of \(\mathbb Z_n\)
- Partitions of \(\mathbb Z_n\) into arithmetic progressions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
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)