2000 character limit reached
A Set of Conjectured Identities for Stirling Numbers of the First Kind (1808.09264v1)
Published 28 Aug 2018 in math.CO, math-ph, and math.MP
Abstract: 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.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.