An identity conjectured by Lacasse via the tree function

zbMATH Open1295.05037arXiv1301.3669MaRDI QIDQ396802FDOQ396802

Authors: Helmut Prodinger 

Publication date: 14 August 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: A. Lacasse conjectured a combinatorial identity in his study of learning theory. Various people found independent proofs. Here is another one that is based on the study of the tree function, with links to Lamberts $W$-function and Ramanujan's $Q$-function. It is particularly short.

Full work available at URL: https://arxiv.org/abs/1301.3669

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• A simple proof of an identity of Lacasse
• A combinatorial proof of Louck's conjecture
• Decomposition of triply rooted trees
• Proofs and applications for a combinatorial identity
• On the Lambert \(w\) function

zbMATH Keywords

enumerationtree function

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19)

Cites Work

• On the Lambert \(w\) function
• Title not available (Why is that?)
• Decomposition of triply rooted trees
• On Ramanujan's \(Q\)-function
• A simple proof of an identity of Lacasse

Cited In (5)

• A context-free grammar for the Ramanujan-Shor polynomials
• A simple proof of an identity of Lacasse
• A combinatorial proof of Louck's conjecture
• Decomposition of triply rooted trees
• Lagrange inversion

This page was built for publication: An identity conjectured by Lacasse via the tree function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q396802)