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
Parents
3
Partitions and the Minimal Excludant
George E. Andrews, David Newman · Annals of Combinatorics · 2019 · 55 citations
1–4 of 3
3
2
h-index
2
h-index
Rutgers, The State University of New Jersey, United States
1 publications · 10 citations
1
h-index
University of Electronic Science and Technology of China, China
1 publications · 10 citations
0
h-index
0
h-index
1–5 of 3
3
Rockaway Waterfront Alliance
Far Rockaway, United States
2 h-index
2 publications
83 citations
Rutgers, The State University of New Jersey
New Brunswick, United States
1 h-index
1 publications
10 citations

Pennsylvania State University
State College, United States
1 h-index
1 publications
55 citations

University of Electronic Science and Technology of China
Chengdu, China
1 publications
10 citations
Wuxi Institute of Technology
Wuxi, China
1 publications
10 citations
1–5 of 3
AC · 1 publications · 55 citations
1
h-index
1 publications · 10 citations
1
h-index
1 publications · 28 citations
1
h-index
1 publications · 10 citations
1–4