全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

关于第二类Stirling数的一个恒等式的三种证明
Three Proofs of an Identity Involving Stirling Numbers of the Second Kind

DOI: 10.12677/aam.2025.141009, PP. 63-68

Keywords: 第二类Stirling数,集合划分,连续对,反号对合,容斥原理
Stirling Numbers of the Second Kind
, Set Partition, Succession, Sign-Reversing Involution, Inclusion-Exclusion Principle

Full-Text   Cite this paper   Add to My Lib

Abstract:

Sheila Sundaram在研究对称群上关于子词序的具有特定秩的子偏序集的同调表示时,得到了一个关于第二类Stirling数的恒等式,并提出如何给出此恒等式的一个组合证明这样一个公开问题。本文旨在给出此恒等式的两个新的证明以及重新构造前人使用的一个反号对合以给出一个对合证明,从而回答了Sundaram提出的问题。此外,我们还给出了此恒等式左侧和式的一个组合解释,这一组合解释源自于Mansour和Munagi的结果。
Sheila Sundaram obtained an identity between Stirling numbers of the second kind while studying representations of the symmetric group on the homology of rank-selected subposets of subword order. She posed an open question that how to give a combinatorial proof of this identity. The aim of the paper is to present two new proofs as well as reproduce a sign-reversing involution proof of this curious identity, thereby answering the question posed by Sundaram. Moreover, we also provide a combinatorial interpretation of the left-hand side of this identity which is originally due to Mansour and Munagi.

References

[1]  Stanley, R.P. (2012) Enumerative Combinatorics, Vol. 1. Second Edition, Cambridge University Press.
[2]  Sundaram, S. (2021) The Reflection Representation in the Homology of Subword Order. Algebraic Combinatorics, 4, 879-907.
https://doi.org/10.5802/alco.184
[3]  Mansour, T. and Munagi, A.O. (2014) Set Partitions with Circular Successions. European Journal of Combinatorics, 42, 207-216.
https://doi.org/10.1016/j.ejc.2014.06.008
[4]  Shattuck, M. (2015) Combinatorial Proofs of Some Stirling Number Formulas. Pure Mathematics and Applications, 25, 107-113.
https://doi.org/10.1515/puma-2015-0009
[5]  Proof of Identity Involving Stirling Numbers of the Second Kind.
https://mathoverflow.net/questions/287788

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133