The minimal excludant and colored partitions
From MaRDI portal
Publication:2199815
Recommendations
Cites work
Cited in
(17)- A reversal of Schur's partition theorem
- A modular idealizer chain and unrefinability of partitions with repeated parts
- A refinement of a result of Andrews and Newman on the sum of minimal excludants
- PED and POD partitions: combinatorial proofs of recurrence relations
- Minimal excludant over partitions into distinct parts
- Unrefinable partitions into distinct parts in a normalizer chain
- Partitions and the minimal excludant
- The minimal excludant in integer partitions
- A minimal excludant over overpartitions
- Combinatorial perspectives on the crank and mex partition statistics
- On the combinatorics of \(r\)-chain minimal and maximal excludants
- Arithmetic properties and asymptotic formulae for \(\sigma_o \mathrm{mex}(n)\) and \(\sigma_e \mathrm{mex}(n)\)
- Distribution of generalized mex-related integer partitions
- 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)