The minimal excludant and colored partitions
zbMATH Open1447.05021MaRDI QIDQ2199815FDOQ2199815
Mircea Merca, Cristina Ballantine
Publication date: 14 September 2020
Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)
Full work available at URL: http://www.mat.univie.ac.at/~slc/wpapers/FPSAC2020//23.html
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Combinatorial aspects of partitions of integers (05A17) Radix representation; digital problems (11A63) Elementary theory of partitions (11P81)
Cites Work
Cited In (12)
- A modular idealizer chain and unrefinability of partitions with repeated parts
- A reversal of Schur's partition theorem
- Minimal excludant over partitions into distinct parts
- PED and POD partitions: combinatorial proofs of recurrence relations
- Unrefinable partitions into distinct parts in a normalizer chain
- Combinatorial perspectives on the Crank and mex partition statistics
- Arithmetic properties and asymptotic formulae for \(\sigma_o \mathrm{mex}(n)\) and \(\sigma_e \mathrm{mex}(n)\)
- On mex-related partition functions of Andrews and Newman
- A further look at cubic partitions
- Verification and generation of unrefinable partitions
- A new generalization of the minimal excludant arising from an analogue of Franklin's identity
- 6-regular partitions: new combinatorial properties, congruences, and linear inequalities
This page was built for publication: The minimal excludant and colored partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2199815)