On the parity of generalized partition functions III
Fethi Ben Said, Jean-Louis Nicolas (ICJ), Ahlem Zekraoui

TL;DR
This paper characterizes elements of a specific set where the associated partition function is even for all sufficiently large integers and provides an asymptotic estimate for the set's counting function.
Contribution
It extends previous results by explicitly identifying elements of a set related to partition functions and offers an asymptotic estimate for its size.
Findings
Identifies elements of set A with even partition functions for all n ≥ 6
Provides an asymptotic estimate for the counting function of set A
Improves upon earlier results by J.-L. Nicolas
Abstract
Improving on some results of J.-L. Nicolas \cite {Ndeb}, the elements of the set , for which the partition function (i.e. the number of partitions of with parts in ) is even for all are determined. An asymptotic estimate to the counting function of this set is also given.
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
TopicsAdvanced Mathematical Identities · Functional Equations Stability Results · Advanced Combinatorial Mathematics
