Skip to main content

Some combinatorics of multisets

Buy Article:

$60.90 plus tax (Refund Policy)

Abstract:

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.

Document Type: Research Article

DOI: http://dx.doi.org/10.1080/0020739031000078721

Affiliations: 1: Professor of Pure Mathematics Mathematics Department Faculty of Science Ahmadu Bello University Zaria Nigeria, Email: mathdss@yahoo.com 2: Department of Mathematics and Computer Science Barry University 11300 Northeast second Avenue Miami Shores FL 33161 USA singh_j_n@hotmail.com, Email: jsingh@mail.barry.edu

Publication date: July 1, 2003

More about this publication?
tandf/tmes/2003/00000034/00000004/art00002
dcterms_title,dcterms_description,pub_keyword
6
5
20
40
5

Access Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content
Cookie Policy
X
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