Harnessing the unwieldy MEX function

MaRDI QIDQ2949120zbMATH OpenFDO

Authors Aviezri S. Fraenkel, Udi Peled

Publication date 7 October 2015

zbMATH Keywords

approximately linear functioncombinatorical gamecomplexitytake-away game

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial games (91A46)

Recommendations

• The minimal excludant in integer partitions
• Further generalizations of the Wythoff game and the minimum excludant
• Partitions and the minimal excludant
• A Nim‐like Game and Dynamic Recurrence Relations
• Distribution of generalized mex-related integer partitions

Cited in

(16)

• Partitions and the minimal excludant
• Verification and generation of unrefinable partitions
• On the maximal part in unrefinable partitions of triangular numbers
• A polynomial algorithm for a two parameter extension of Wythoff NIM based on the Perron-Frobenius theory
• Self-containing sequences, fractal sequences, selection functions, and parasequences
• Unrefinable partitions into distinct parts in a normalizer chain
• The minimal excludant in integer partitions
• Complementary equations with advanced subscripts
• Divisibility and distribution of mex-related integer partitions of Andrews and Newman
• ON A CONJECTURE FOR A REFINEMENT OF THE SUM OF MINIMAL EXCLUDANTS
• A modular idealizer chain and unrefinability of partitions with repeated parts
• Arithmetic properties and asymptotic formulae for \(\sigma_o \mathrm{mex}(n)\) and \(\sigma_e \mathrm{mex}(n)\)
• The second minimal excludant and mex sequences
• Variants of Wythoff game with terminal positions or blocking maneuvers
• The number of maximal unrefinable partitions
• On a generalisation of the minimal excludant function

This page was built for publication: Harnessing the unwieldy MEX function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2949120)