Skip to Main content Skip to Navigation
Journal articles

The largest singletons in weighted set partitions and its applications

Abstract : Recently, Deutsch and Elizalde studied the largest fixed points of permutations. Motivated by their work, we consider the analogous problems in weighted set partitions. Let A (n,k) (t) denote the total weight of partitions on [n + 1] = \1,2,..., n + 1\ with the largest singleton \k + 1\. In this paper, explicit formulas for A (n,k) (t) and many combinatorial identities involving A (n,k) (t) are obtained by umbral operators and combinatorial methods. In particular, the permutation case leads to an identity related to tree enumerations, namely, [GRAPHICS] where D-k is the number of permutations of [k] with no fixed points.
Document type :
Journal articles
Complete list of metadata

Cited literature [15 references]  Display  Hide  Download

https://hal.inria.fr/hal-00990479
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Submitted on : Tuesday, May 13, 2014 - 3:39:04 PM
Last modification on : Thursday, September 7, 2017 - 1:03:39 AM
Long-term archiving on: : Monday, April 10, 2017 - 10:21:31 PM

File

1766-6688-1-PB.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00990479, version 1

Collections

Citation

Yidong Sun, Yanjie Xu. The largest singletons in weighted set partitions and its applications. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2011, Vol. 13 no. 3 (3), pp.75--86. ⟨hal-00990479⟩

Share

Metrics

Record views

90

Files downloads

965