Combinatorial proofs of formulas for power sums

被引：0
|
作者：
Carl Wagner
机构：
[1] Department of Mathematics,
[2] The University of Tennessee,undefined
[3] Knoxville,undefined
[4] TN 37996-1300,undefined
[5] USA,undefined
来源：
Archiv der Mathematik | 1997年 / 68卷
关键词：
Combinatorial Proof;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We give combinatorial proofs of several formulas for power sums.
引用
收藏
页码：464 / 467
页数：3
相关论文
共 50 条
  • [31] The combinatorial degrees of proofs and equations
    Stein, S
    ALGEBRA UNIVERSALIS, 1996, 35 (03) : 472 - 484
  • [32] Combinatorial PCPs with Short Proofs
    Or Meir
    computational complexity, 2016, 25 : 1 - 102
  • [33] Combinatorial proofs of Fibonacci identities
    Yang, Harold R.L.
    Proceedings of SPIE - The International Society for Optical Engineering, 2022, 12259
  • [34] On Combinatorial Proofs for Modal Logic
    Acclavio, Matteo
    Strassburger, Lutz
    AUTOMATED REASONING WITH ANALYTIC TABLEAUX AND RELATED METHODS, TABLEAUX 2019, 2019, 11714 : 223 - 240
  • [35] Inequalities for combinatorial sums
    Horst Alzer
    Man Kam Kwong
    Archiv der Mathematik, 2017, 108 : 601 - 607
  • [36] Inequalities for combinatorial sums
    Alzer, Horst
    Kwong, Man Kam
    ARCHIV DER MATHEMATIK, 2017, 108 (06) : 601 - 607
  • [37] Elementary proofs and the sums differences problem
    Katz, Nets Hawk
    COLLECTANEA MATHEMATICA, 2006, : 275 - 280
  • [38] DEPTH OF PROOFS, DEPTH OF CUT FORMULAS AND COMPLEXITY OF CUT FORMULAS
    ZHANG, WH
    THEORETICAL COMPUTER SCIENCE, 1994, 129 (01) : 193 - 206
  • [39] BIJECTIVE PROOFS OF FORMULAS WITH (-1)n
    Guzicki, W. O. J. C. I. E. C. H.
    Zakrzewski, P. I. O. T. R.
    FIBONACCI QUARTERLY, 2022, 60 (03): : 262 - 266
  • [40] Verification of proofs of unsatisfiability for CNF formulas
    Goldberg, E
    Novikov, Y
    DESIGN, AUTOMATION AND TEST IN EUROPE CONFERENCE AND EXHIBITION, PROCEEDINGS, 2003, : 886 - 891
12345