On the counting function of the sets of parts \(\mathcal A\) such that the partition function \(p(\mathcal {A},n)\) takes even values for \(n\) large enough
From MaRDI portal
Publication:2497489
DOI10.1016/j.disc.2005.11.022zbMath1109.05019OpenAlexW2106772779MaRDI QIDQ2497489
Houda Lahouar, Jean Louis Nicolas, Fethi Ben Saïd
Publication date: 4 August 2006
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2005.11.022
Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Elementary theory of partitions (11P81)
Related Items
ON SETS SUCH THAT THE PARTITION FUNCTION IS EVEN FROM A CERTAIN POINT ON ⋮ On the parity of generalized partition functions. III ⋮ On the elements of sets with even partition function ⋮ Sets with even partition functions and 2-adic integers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a conjecture of Nicolas-Sárközy about partitions
- On the parity of additive representation functions
- Partitions functions with periodic parity
- Sur un théorème de Mertens. (On a theorem of Mertens)
- Even partition functions
- On some sets with even valued partition function
- Approximate formulas for some functions of prime numbers
- Sets of parts such that the partition function is even
- Sur une application de la formule de Selberg–Delange
- On the parity of generalized partition functions. II
