2000 character limit reached
A Combinatorial Proof of a Schmidt Type Theorem of Andrews and Paule
Published 5 Nov 2021 in math.CO | (2111.03367v2)
Abstract: This note is devoted to a combinatorial proof of a Schmidt type theorem due to Andrews and Paule. A four-variable refinement of Andrews and Paule's theorem is also obtained based on this combinatorial construction.
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.