2000 character limit reached
Equal values of certain partition functions via Diophantine equations
Published 10 Feb 2021 in math.NT | (2102.05352v2)
Abstract: Let $A\subset \N_{+}$ and by $P_{A}(n)$ denotes the number of partitions of an integer $n$ into parts from the set $A$. The aim of this paper is to prove several result concerning the existence of integer solutions of Diophantine equations of the form $P_{A}(x)=P_{B}(y)$, where $A, B$ are certain finite sets.
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.