On Some Identities of Barred Preferential Arrangements

TL;DR

This paper explores combinatorial identities related to barred preferential arrangements, which are ordered partitions of a set with sections separated by bars, providing new formulas and examples.

Contribution

It derives new combinatorial identities for the number of barred preferential arrangements of finite sets, expanding understanding of their structure.

Findings

Derived identities for barred preferential arrangements

Provided illustrative examples and consequences of these identities

Enhanced combinatorial understanding of ordered partitions with bars

Abstract

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.