Let x denote the stabilizing character of the action of the finite group G on the finite set X. Let xk denote \G\-1ΣσEGx(σ)K. It is well known that xk is the number of orbits of the induced action of G on the Cartesian product X(k). We show if G is a least (k l)-fold transitive on X, then xk can be expressed in terms of Stirling numbers of both kinds. Three identities between Stirling numbers and the stabilizing character sequence are obtained. © 1976, American Mathematical Society
In this paper we generalize a well-known identity relating Stirling numbers of the second kind and E...
AbstractIn Part I, Stirling numbers of both kinds were used to define a binomial (Laurent) series of...
This article introduces a remarkable class of combinatorial numbers, the Stirling set numbers. They...
This chapter is dedicated to counting partitions of sets and partitions of sets into cycles, and als...
AbstractIn this paper we provide an algebraic approach to the generalized Stirling numbers (GSN). By...
In the paper, the authors find several identities, including a new recurrence relation for the Stirl...
Given a group G acting on a set S, Mobius inversion over the lattice of sub-groups can be used to ob...
In the present article we introduce two new combinatorial interpretations of the r-Whitney numbers o...
AbstractLet [n] be the set {1,2, … , n} and σ a given permutation in Sn, the symmetric group on [n]....
AbstractIn this paper we give a combinatorial interpretation of two classes of generalized Stirling ...
AbstractIn this paper we consider a function L(x→)=L(a,b,c,d;e;f,g), which can be written as a linea...
AbstractThe theory of modular binomial lattices enables the simultaneous combinatorial analysis of f...
The combinatorial role of unsigned Stirling and Lah numbers is reexamined in connection with ordinar...
This book is a unique work which provides an in-depth exploration into the mathematical expertise, p...
AbstractGiven a group G acting on a set S, Möbius inversion over the lattice of subgroups can be use...
In this paper we generalize a well-known identity relating Stirling numbers of the second kind and E...
AbstractIn Part I, Stirling numbers of both kinds were used to define a binomial (Laurent) series of...
This article introduces a remarkable class of combinatorial numbers, the Stirling set numbers. They...
This chapter is dedicated to counting partitions of sets and partitions of sets into cycles, and als...
AbstractIn this paper we provide an algebraic approach to the generalized Stirling numbers (GSN). By...
In the paper, the authors find several identities, including a new recurrence relation for the Stirl...
Given a group G acting on a set S, Mobius inversion over the lattice of sub-groups can be used to ob...
In the present article we introduce two new combinatorial interpretations of the r-Whitney numbers o...
AbstractLet [n] be the set {1,2, … , n} and σ a given permutation in Sn, the symmetric group on [n]....
AbstractIn this paper we give a combinatorial interpretation of two classes of generalized Stirling ...
AbstractIn this paper we consider a function L(x→)=L(a,b,c,d;e;f,g), which can be written as a linea...
AbstractThe theory of modular binomial lattices enables the simultaneous combinatorial analysis of f...
The combinatorial role of unsigned Stirling and Lah numbers is reexamined in connection with ordinar...
This book is a unique work which provides an in-depth exploration into the mathematical expertise, p...
AbstractGiven a group G acting on a set S, Möbius inversion over the lattice of subgroups can be use...
In this paper we generalize a well-known identity relating Stirling numbers of the second kind and E...
AbstractIn Part I, Stirling numbers of both kinds were used to define a binomial (Laurent) series of...
This article introduces a remarkable class of combinatorial numbers, the Stirling set numbers. They...