Related papers: A Combinatorial Analysis Of Higher Order Generalis…
A barred preferential arrangement is a preferential arrangement onto which a number of identical bars are inserted in between the blocks of the preferential arrangement. In this study we examine combinatorial properties of barred…
Given an ordered set partition, when one insert a number of bars in-between the blocks of the ordered set partition the result is a barred preferential arrangement. In this study, using the notion of barred preferential arrangements we…
When one inserts a number of identical bars in between blocks of an ordered set partition, they get a barred preferential arrangement. In this study we define a new generalization of barred preferential arrangements, by considering barred…
A preferential arrangement of a set is a total ordering of the elements of that set with ties allowed. A barred preferential arrangement is one in which the tied blocks of elements are ordered not only amongst themselves but also with…
In this study we introduce a second type of higher order generalised geometric polynomials. This we achieve by examining the generalised stirling numbers $S(n; k;\alpha;\beta;\gamma)$ [Hsu & Shiue,1998] for some negative arguments. We study…
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…
The introduction of bars in-between blocks of an ordered set partition(preferential arrangement) results in a barred ordered set partition(barred preferential arrange- ment). Having the restriction that some blocks of barred preferential…
A preferential arrangement of a set $X_n=\{1,2,...,n\}$ is an ordered partition of the set $X_n$ induced with a linear order. Separation of blocks of a preferential arrangement with bars result in the notation of barred preferential…
Patience Sorting is a combinatorial algorithm that can be viewed as an iterated, non-recursive form of the Schensted Insertion Algorithm. In recent work the authors have shown that Patience Sorting provides an algorithmic description for…
A combinatorial methods are used to investigate some properties of certain generalized Stirling numbers, including explicit formula and recurrence relations. Furthermore, an expression of these numbers with symmetric function is deduced.
We discuss a general combinatorial framework for operator ordering problems by applying it to the normal ordering of the powers and exponential of the boson number operator. The solution of the problem is given in terms of Bell and Stirling…
In this article we give a computational study of combinatorics of the discriminantal arrangements. The discriminantal arrangements are parametrized by two positive integers n and k such that n>k. The intersection lattice of the…
We define a new family of generalized Stirling permutations that can be interpreted in terms of ordered trees and forests. We prove that the number of generalized Stirling permutations with a fixed number of ascents is given by a natural…
An arrangement of hyperplanes is a finite collection of hyperplanes in a real Euclidean space. To such a collection one associates the characteristic polynomial that encodes the combinatorics of intersections of the hyperplanes. Finding the…
In this paper, we consider ordered set partitions obtained by imposing conditions on the size of the lists, and such that the first $r$ elements are in distinct blocks, respectively. We introduce a generalization of the Lah numbers. For…
Patience Sorting is a combinatorial algorithm that can be viewed as an iterated, non-recursive form of the Schensted Insertion Algorithm. In recent work the authors extended Patience Sorting to a full bijection between the symmetric group…
We present a combinatorial method of constructing solutions to the normal ordering of boson operators. Generalizations of standard combinatorial notions - the Stirling and Bell numbers, Bell polynomials and Dobinski relations - lead to…
Generalised polynomials are maps constructed by applying the floor function, addition, and multiplication to polynomials. Despite superficial similarity, generalised polynomials exhibit many phenomena which are impossible for polynomials.…
We consider the numbers arising in the problem of normal ordering of expressions in canonical boson creation and annihilation operators. We treat a general form of a boson string which is shown to be associated with generalizations of…
Set partitions and permutations with restrictions on the size of the blocks and cycles are important combinatorial sequences. Counting these objects lead to the sequences generalizing the classical Stirling and Bell numbers. The main focus…