Skip to main content

Some combinatorics of multisets

Buy Article:

$55.00 plus tax (Refund Policy)

The purpose of this paper is to delineate some insights into the concept of multisets along with a couple of combinatorial results related to multisets. The paper indicates that a general formula needs to be worked out for determining the cardinality of the 'Set' (whose elements may be multisets but do not repeat) of all multisubsets of a finite multiset [x, y, z,…]m, p, t, … in which x occurs at most m times, y occurs at most p times, and so on. It outlines some directions provided in the literature and points out that they all turn out to be inefficient. Finally, a relatively more efficient formula to this effect is provided along with a remark that the problem needs further vindication.
No Reference information available - sign in for access.
No Citation information available - sign in for access.
No Supplementary Data.
No Data/Media
No Metrics

Document Type: Research Article

Affiliations: 1: Professor of Pure Mathematics Mathematics Department Faculty of Science Ahmadu Bello University Zaria Nigeria, Email: [email protected] 2: Department of Mathematics and Computer Science Barry University 11300 Northeast second Avenue Miami Shores FL 33161 USA [email protected], Email: [email protected]

Publication date: 2003-07-01

More about this publication?
  • Access Key
  • Free content
  • Partial Free content
  • New content
  • Open access content
  • Partial Open access content
  • Subscribed content
  • Partial Subscribed content
  • Free trial content
Cookie Policy
Cookie Policy
Ingenta Connect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more