Paul Federbush
Published 2018-08-28Version 1
Given an integer g, g > 1, an integer w, -1 < w <g - 1, and a set of g distinct numbers, c_1, ..., c_g, we present a conjectured identity for Stirling numbers of the first kind. We have proven all the equalities in case g < 7; and for the case g = 7, provided w < 4. These expressions arise from an aspect of the study of the dimer-monomer problem on regular graphs.
Two new identities involving the Bernoulli numbers, the Euler numbers, and the Stirling numbers of the first kind
Explicit formulas for computing Bernoulli numbers of the second kind and Stirling numbers of the first kind
On an alternating sum of factorials and Stirling numbers of the first kind: trees, lattices, and games
![QR code for arXiv:1808.09264 [math.CO]](http://oss.arxitics.com/images/favicon.svg)