2015/03/20 by Sithembele Nkonkobe, Nkonkobe, S., V. Murali +1
Engineering · Mathematics · #Advanced Combinatorial Mathematics #Advanced Mathematical Identities #Combinatorics (math.CO) #FOS: Mathematics #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.1503.06173
openalex publication_date 2015/03/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
A preferential arrangement of a finite set is an ordered partition. Associated with each such ordered partition is a chain of subsets or blocks endowed with a linear order. The chain may be split into sections by the introduction of a vertical bar, leading to the notion of a barred preferential arrangements. In this paper we derive some combinatorial identities satisfied by the number of possible barred preferential arrangements of an n-element set. We illustrate with some suitable examples highlighting some important consequences of the identities.