The Generalized Wilf Conjecture for generalized numerical monoids

About 3 years old · traced to

Let n≥2n\geq 2, and let TT be a generalized numerical monoid (GMS), meaning a complement-finite submonoid of Nn−1\mathbb N^{n-1}. Let H(T)=Nn−1∖TH(T)=\mathbb N^{n-1}\setminus T be its hole set. Define

c(T)=∣{a∈Nn−1:a≤b for some b∈H(T)}∣c(T)=\left|\{\mathbf a\in\mathbb N^{n-1}:\mathbf a\leq\mathbf b\text{ for some }\mathbf b\in H(T)\}\right|

and

n(T)=∣{a∈T:a≤b for some b∈H(T)}∣,n(T)=\left|\{\mathbf a\in T:\mathbf a\leq\mathbf b\text{ for some }\mathbf b\in H(T)\}\right|,

where a≤b\mathbf a\leq\mathbf b means coordinatewise inequality, and let e(T)e(T) be the cardinality of a minimal generating set of TT. Generalized Wilf Conjecture. One has

(n−1)c(T)≤e(T)n(T).(n-1)c(T)\leq e(T)n(T).

This conjecture is the commutative generalized numerical-monoid analogue of the Unipotent Wilf Conjecture and is attributed in the paper to Cisto, Delgado, Farrán, Failla, Pérez, and Utano. Its general status is not resolved here.

References

Primary source

Mahir Bilen Can and Naufil Sakran, “On Generalized Wilf Conjectures”, arXiv:2306.05530 (2023).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.