ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Nak⁡T(n,t)\operatorname{Nak}^{\mathcal{T}}(n,t) denote the maximum possible Nakamura number among weighted games on nn players with tt types of players, where t∈N>0t\in\mathbb{N}_{>0}. If nn is sufficiently large, then the asymptotic Nakamura-number conjecture.

n−t+1≤Nak⁡T(n,t)≤n−t+2.n-t+1\le \operatorname{Nak}^{\mathcal{T}}(n,t)\le n-t+2.

The preceding proposition establishes the corresponding values for t≤4t\le 4, while the paper leaves the determination of the three Nakamura-number functions for t>4t>4 open. Thus the stated bounds are supported by small-parameter computations but remain open in general.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.