Singletons and adjacencies of set partitions of type B
نویسندگان
چکیده
We show that the joint distribution of the number of singleton pairs and the number of adjacency pairs is symmetric over the set partitions of type Bn without zero-block, in analogy with the result of Callan for ordinary partitions.
منابع مشابه
Singleton free set partitions avoiding a 3-element set
The definition and study of pattern avoidance for set partitions, which is an analogue of pattern avoidance for permutations, begun with Klazar. Sagan continued his work by considering set partitions which avoids a single partition of three elements, and Goyt generalized these results by considering partitions which avoids any family of partitions of a 3-element set. In this paper we enumerate ...
متن کاملOn Conjugates for Integer Compositions and Set Partitions
There is a familiar conjugate for integer partitions: transpose the Ferrers diagram, and an analogous conjugate for integer compositions. Here we propose a conjugate for set partitions and exhibit statistics interchanged by the conjugate, both for compositions and set partitions. 0 The Conjugate of an Integer Partition A partition of n is a weakly decreasing list of positive integers, called it...
متن کاملStirling number of the fourth kind and lucky partitions of a finite set
The concept of Lucky k-polynomials and in particular Lucky χ-polynomials was recently introduced. This paper introduces Stirling number of the fourth kind and Lucky partitions of a finite set in order to determine either the Lucky k- or Lucky χ-polynomial of a graph. The integer partitions influence Stirling partitions of the second kind.
متن کاملAsymptotic Behavior of the Average of the Adjacencies of the Topological Entities in Some Simplex Partitions
In this communication a general kind of simplex partitions are studied. These partitions are associated to some recurrence relations. The study of these equations lead us to set some properties in 2D and 3D about the average adjacencies of the topological entities defining the mesh, when the number of refinements tends to infinite. We prove that this limit is independent of the considered parti...
متن کاملk-Efficient partitions of graphs
A set $S = {u_1,u_2, ldots, u_t}$ of vertices of $G$ is an efficientdominating set if every vertex of $G$ is dominated exactly once by thevertices of $S$. Letting $U_i$ denote the set of vertices dominated by $u_i$%, we note that ${U_1, U_2, ldots U_t}$ is a partition of the vertex setof $G$ and that each $U_i$ contains the vertex $u_i$ and all the vertices atdistance~1 from it in $G$. In this ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 311 شماره
صفحات -
تاریخ انتشار 2011