Counting on Euler and Bernoulli Number Identities

2020/07/23 by Arthur T. Benjamin, Benjamin, Arthur T., John Lentfer +3
Mathematics · Computer Science · #Advanced Mathematical Identities #Advanced Combinatorial Mathematics #Advanced Algebra and Logic

paper · pdf · doi:10.48550/arxiv.2007.12295

Abstract

While there are many identities involving the Euler and Bernoulli numbers, they are usually proved analytically or inductively. We prove two identities involving Euler and Bernoulli numbers with combinatorial reasoning via up-down permutations.

Related

• Two new identities involving the Bernoulli numbers, the Euler numbers,\n and the Stirling numbers of the first kind
• Courte preuve d'une identité comportant les nombres de Bernoulli
• A new refinement of Euler numbers on counting alternating permutations
• Combinatorial aspects of poly-Bernoulli polynomials and poly-Euler numbers
• A curious identity for Bernoulli numbers