Sciweavers

696 search results - page 1 / 140
» A class of combinatorial identities
Sort
View
94
Voted
DM
2006
80views more  DM 2006»
15 years 4 months ago
A class of combinatorial identities
A general theorem for providing a class of combinatorial identities where the sum is over all the partitions of a positive integer is proven. Five examples as the applications of ...
Yingpu Deng
138
Voted
JCT
2011
97views more  JCT 2011»
14 years 11 months ago
The method of combinatorial telescoping
We present a method for proving q-series identities by combinatorial telescoping in the sense that one can transform a bijection or classification of combinatorial objects into a ...
William Y. C. Chen, Qing-Hu Hou, Lisa H. Sun
ATAL
2006
Springer
15 years 7 months ago
False-name-proof combinatorial auction protocol: Groves Mechanism with SubModular Approximation
This paper develops a new combinatorial auction protocol called the Groves Mechanism with SubModular Approximation (GM-SMA). This protocol satisfies the following characteristics:...
Makoto Yokoo, Toshihiro Matsutani, Atsushi Iwasaki
COLT
2000
Springer
15 years 8 months ago
Entropy Numbers of Linear Function Classes
This paper collects together a miscellany of results originally motivated by the analysis of the generalization performance of the “maximum-margin” algorithm due to Vapnik and...
Robert C. Williamson, Alex J. Smola, Bernhard Sch&...
JCT
2006
129views more  JCT 2006»
15 years 4 months ago
A combinatorial proof of the Rogers-Ramanujan and Schur identities
We give a combinatorial proof of the first Rogers-Ramanujan identity by using two symmetries of a new generalization of Dyson's rank. These symmetries are established by direc...
Cilanne Boulet, Igor Pak