Counting Restricted Partitions of Integers into Fractions: Symmetry and Modes of the Generating Function and a Connection to $ω(t)$
Abstract: Motivated by the study of integer partitions, we consider partitions of integers into fractions of a particular form, namely with constant denominators and distinct odd or even numerators. When numerators are odd, the numbers of partitions for integers smaller than the denominator form symmetric patterns. If the number of terms is restricted to $h$, then the nonzero terms of the generating function are unimodal, with the integer $h$ having the most partitions. Such properties can be applied to a particular class of nonlinear Diophantine equations. We also examine partitions with even numerators. We prove that there are $2{\omega(t)}-2$ partitions of an integer $t$ into fractions with the first $x$ consecutive even integers for numerators and equal denominators of $y$, where $0<y<x<t$. We then use this to produce corollaries such as a Dirichlet series identity and an extension of the prime omega function to the complex plane, though this extension is not analytic everywhere.
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.