2000 character limit reached
On the class of dominant and subordinate products
Published 10 Mar 2013 in math.NT and math.CO | (1303.2362v1)
Abstract: In this paper we provide proofs of two new theorems that provide a broad class of partition inequalities and that illustrate a na\"ive version of Andrews' anti-telescoping technique quite well. These new theorems also put to rest any notion that including parts of size 1 is somehow necessary in order to have a valid irreducible partition inequality. In addition, we prove (as a lemma to one of the theorems) a rather nontrivial class of rational functions of three variables has entirely nonnegative power series coefficients.
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.