An identity conjectured by Lacasse via the tree function
classification
🧮 math.CO
keywords
functionconjecturedidentitylacassetreeanothercombinatorialfound
read the original 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.
This paper has not been read by Pith yet.
Forward citations
Cited by 2 Pith papers
-
The most discriminable quantum states in the multicopy regime
k-designs achieve maximal discriminability for pure states in multi-copy minimum-error discrimination; mixed states outperform for larger ensembles, with quantum offering quadratic advantage over classical.
-
The most discriminable quantum states in the multicopy regime
k-designs achieve maximal multi-copy discriminability for pure states when N suffices, mixed states outperform beyond that, and quantum offers quadratic advantage over classical in Bayes capacity terms.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.