2013
DOI: 10.37236/3309
|View full text |Cite
|
Sign up to set email alerts
|

An Identity Conjectured by Lacasse via the Tree Function

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.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
4
0

Year Published

2013
2013
2021
2021

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(4 citation statements)
references
References 5 publications
0
4
0
Order By: Relevance
“…Proofs of Lacasse's conjecture were given by Chen et al [11], Prodinger [59], Sun [73], and Younsi [80]. We will prove (3.2.6) by showing that both sides are equal to T (x)/(1 − T (x)) 3 .…”
Section: A Rational Function Expansionmentioning
confidence: 79%
“…Proofs of Lacasse's conjecture were given by Chen et al [11], Prodinger [59], Sun [73], and Younsi [80]. We will prove (3.2.6) by showing that both sides are equal to T (x)/(1 − T (x)) 3 .…”
Section: A Rational Function Expansionmentioning
confidence: 79%
“…3). To this end, it is useful to consider the generating function F (z; q, r) of the weighted Riordan paths, which can be obtained by the so called "Kernel method" [35]. The autocorrelator in terms of F (z; q, r) reads…”
Section: Autocorrelator At T = ∞mentioning
confidence: 99%
“…[2], [5], [20], [23]), the proof we present remains, as far as we know, the only one providing equivalent expressions for the functions ξ and ξ 2 that are simpler and more convenient from a numerical perspective. Furthermore, none of the aforementioned papers [2], [5], [20], [23] discuss the context and relevance of Conjecture 2.1 in the theory of machine learning.…”
mentioning
confidence: 91%