中文
相关论文

相关论文: Another simple proof of an identity conjectured by…

200 篇论文

We give a proof of a conjecture of A. Lacasse in his doctoral thesis which has applications in machine learning algorithms. The proof relies on some interesting binomial sums identities introduced by Abel (1839), and on their generalization…

组合数学 · 数学 2012-09-06 Malik Younsi

We present a proof of a combinatorial conjecture from the second author's Ph.D. thesis. The proof relies on binomial and multinomial sums identities. We also discuss the relevance of the conjecture in the context of PAC-Bayesian machine…

机器学习 · 统计学 2020-06-08 M. Younsi , A. Lacasse

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…

组合数学 · 数学 2013-01-17 Helmut Prodinger

We prove an identity about partitions, previously conjectured in the study of shifted Jack polynomials (math.CO/9903020). The proof given is using $\lambda$-ring techniques. It would be interesting to obtain a bijective proof.

组合数学 · 数学 2007-05-23 Alain Lascoux , Michel Lassalle

We prove a partition identity conjectured by Lassalle (Adv. in Appl. Math. 21 (1998), 457-472).

组合数学 · 数学 2007-05-23 Theresia Eisenkölbl

We prove an identity about partitions with a very elementary formulation. We had previously conjectured this identity, encountered in the study of shifted Jack polynomials (math.CO/9901040). The proof given is using a trivariate generating…

组合数学 · 数学 2007-05-23 Michel Lassalle

We give a simple statistical proof of a binomial identity, by evaluating the Laplace transform of the maximum of n independent exponential random variables in two different ways. As a by product, we obtain a simple proof of an interesting…

统计理论 · 数学 2014-08-19 P. Vellaisamy

In this paper, we give a decomposition of triply rooted trees into three doubly rooted trees. This leads to a combinatorial interpretation of an identity conjectured by Lacasse in the study of the PAC-Bayesian machine learning theory, and…

组合数学 · 数学 2013-01-01 William Y. C. Chen , Janet F. F. Peng , Harold R. L. Yang

In a recent paper, Caracciolo, Sokal and Sportiello presented, inter alia, an algebraic/combinatorial proof for Cayley's identity. The purpose of the present paper is to give a "purely combinatorial" proof for this identity; i.e., a proof…

组合数学 · 数学 2013-09-27 Markus Fulmek

In this note, we present two new identities for derangements. As a corollary, we have a combinatorial proof of the irreducibility of the standard representation of symmetric groups.

组合数学 · 数学 2007-05-23 Le Anh Vinh

Mendes recently conjectured an identity simplifying the Poincar\'e series of the space of equivariant polynomial maps from $\mathbb{R}^{n}$ to a subrepresentation of $Sym^{2}(\mathbb{R}^{n})$. We show how to prove this identity using a…

组合数学 · 数学 2010-11-12 Paul Levande

In this article, we extend some results about algebra $A$ with the group of units $U(A)$ having a special polynomial identity, Laurent polynomial. And we present a new version of B. Hartley Conjecture with these identities.

环与代数 · 数学 2020-12-04 Claudenir Freire Rodrigues

Recently Andrews and Bachraoui proved identities relating certain restricted partitions into distinct even parts with restricted 4-regular partitions by the theory of basic hypergeometric series. They also posed a question regarding…

组合数学 · 数学 2025-09-01 Dandan Chen , Ziyin Zou

The goal of this notice is to present a proof of Bachet's conjecture based exclusively on the fundamental theorem of arithmetic. The novelty of this proof consists in its introduction of a partial order on rational integers through the…

数论 · 数学 2013-10-22 Felix Sidokhine

Recently the second named author discovered a combinatorial identity in the context of vertex representations of quantum Kac-Moody algebras. We give a direct and elementary proof of this identity. Our method is to show a related identity of…

量子代数 · 数学 2007-05-23 Jintai Ding , Naihuan Jing

We present a formal proof in Lean of probably approximately correct (PAC) learnability of the concept class of decision stumps. This classic result in machine learning theory derives a bound on error probabilities for a simple type of…

机器学习 · 计算机科学 2021-01-11 Joseph Tassarotti , Koundinya Vajjha , Anindya Banerjee , Jean-Baptiste Tristan

In a recent work, Andrews gave analytic proofs of two conjectures concerning some variations of two combinatorial identities between partitions of a positive integer into odd parts and partitions into distinct parts discovered by Beck.…

组合数学 · 数学 2018-10-09 Jane Y. X. Yang

We give an elementary probabilistic proof of a binomial identity. The proof is obtained by computing the probability of a certain event in two different ways, yielding two different expressions for the same quantity.

概率论 · 数学 2016-06-14 Jonathon Peterson

In this article, a short combinatorial proof of the Capelli's identity is given. It also leads to an easy proof of the Capelli--Cauchy--Binet identity, a more general form of Capelli's identity. With the technique introduced, the Turnbull's…

组合数学 · 数学 2020-06-23 Rui Xiong

Kanade and Russell conjectured several Rogers-Ramanujan-type partition identities, some of which are related to level $2$ characters of the affine Lie algebra $A_9^{(2)}$. Many of these conjectures have been proved by Bringmann,…

数论 · 数学 2019-12-10 Hjalmar Rosengren
‹ 上一页 1 2 3 10 下一页 ›