Minimal Excludant Function

The Minimal Excludant Function is a combinatorial function in combinatorial game theory that assigns to each finite set of non-negative integers the smallest non-negative integer not present in the set, serving as a foundational operation for determining nim-values and canonical game outcomes.

3

Publications

93

Citations

3

Authors

3

Institutions

Publications per year

2017–2026

2

Variants

MexMex Function

Authors

3

  1. GE
    George E. Andrews

    Pennsylvania State University, United States

    2 publications · 83 citations

    2

    h-index

  2. DN
    David Newman

    National Cancer Institute, United States

    2 publications · 83 citations

    2

    h-index

  3. VG
    Vladimir Gurvich

    Rutgers, The State University of New Jersey, United States

    1 publications · 10 citations

    1

    h-index

  4. AY
    Andrew Y. Z. Wang

    University of Electronic Science and Technology of China, China

    1 publications · 10 citations

    0

    h-index

  5. RL
    Runqiao Li

    Wuxi Institute of Technology, China

    1 publications · 10 citations

    0

    h-index

1–5 of 3

Venues

  1. Annals of Combinatorics

    AC · 1 publications · 55 citations

    1

    h-index

  2. Discrete Applied Mathematics

    1 publications · 10 citations

    1

    h-index

  3. Journal of integer sequences

    1 publications · 28 citations

    1

    h-index

  4. Discrete Mathematics

    1 publications · 10 citations

1–4