Systematic study of Schmidt-type partitions via weighted words
Isaac Konan

TL;DR
This paper develops explicit formulas for weighted sums over over-partitions, generalizing Schmidt-type theorems and introducing block partitions, linking them to plane partitions and Eulerian polynomials.
Contribution
It provides a unified explicit formula for Schmidt-type sums over over-partitions, extends known theorems to non-periodic sequences, and introduces block partitions as a new generalization.
Findings
Derived explicit formulas for sums over over-partitions.
Established new Schmidt-type theorems for non-periodic sequences.
Linked block partitions to Eulerian polynomials and plane partitions.
Abstract
Let be a sequence with elements in a commutative monoid . In this paper, we provide an explicit formula for where run through some subsets of over-partitions, and is a certain product of ``colors'' assigned to the parts of , and is a formal power of for . This formula allows us not only to retrieve several known Schmidt-type theorems but also to provide new Schmidt-type theorems for non-periodic sequences . For example, when , if there exists such and otherwise, we obtain the following statement: for all non-negative integer , the number of partitions such that is equal to the number of plane partitions of .…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical functions and polynomials · Advanced Mathematical Identities · Functional Equations Stability Results
