A short proof of the Almkvist-Meurman theorem
Number Theory
2023-10-25 v1 Combinatorics
Abstract
We give a short generating function proof of the Almkvist-Meurman theorem: For integers and , define the numbers by . Equivalently, , where is the Bernoulli polynomial. Then is an integer. The proof is related to Postnikov's functional equation for the generating function for intransitive trees.
Keywords
Cite
@article{arxiv.2310.15312,
title = {A short proof of the Almkvist-Meurman theorem},
author = {Ira M. Gessel},
journal= {arXiv preprint arXiv:2310.15312},
year = {2023}
}