Another simple proof of an identity conjectured by Lacasse

2013/01/04 by Yidong Sun, Sun, Yidong
Mathematics · #Advanced Combinatorial Mathematics #Advanced Mathematical Identities #CO #Combinatorics (math.CO) #FOS: Mathematics #Mathematics and Applications

paper · pdf · doi:10.48550/arxiv.1301.0679

openalex publication_date 2013/01/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this note, using the derangement polynomials and their umbral representation, we give another simple proof of an identity conjectured by Lacasse in the study of the PAC-Bayesian machine learning theory.

Citations

• Proof of a Combinatorial Conjecture Coming from the PAC-Bayesian Machine Learning Theory

Related

• Proof of a Combinatorial Conjecture Coming from the PAC-Bayesian Machine Learning Theory
• An identity conjectured by Lacasse via the tree function
• A combinatorial conjecture from PAC-Bayesian machine learning
• Decomposition of Triply Rooted Trees
• New proofs of Melzak's identity