← All problems

Problem 3.8 of Abo–Portakal–Sodomaco on Nash discriminants

For every balanced game format d=(d1,…,dn)\boldsymbol{d}=(d_1,\ldots,d_n) with n≥3n\ge 3, where dn−1≤∑i=1n−1(di−1)d_n-1\le\sum_{i=1}^{n-1}(d_i-1), determine the irreducible components of the Nash discriminant variety associated with d\boldsymbol{d}, together with the codimension and degree of each component, including boundary formats.

References

Source: arXiv

Progress summary

Refreshed
Open · solution reported

A new unrefereed preprint claims to complete the problem, but no independent verification of its result was found.

Problem 3.8 asks for the irreducible components and degree of Nash discriminant varieties. The earlier paper presented this as unresolved because the relevant vector bundle is not very ample.

Known results

  • Balanced formats: the real Nash discriminant has codimension one.
  • Boundary cases: it contains an irreducible hypersurface and a component of codimension at least two.
  • Format (2,2,2)(2,2,2): an irreducible degree-66 hypersurface in P11\mathbb{P}^{11}.
  • Formats (d,d)(d,d): two irreducible codimension-22 components, each of degree (d2)\binom{d}{2}; otherwise the real part has codimension one.

October 21, 2026 claimed completion

Neuhaus, Portakal, Sodomaco, and Tung’s preprint Nashtopes and their A-discriminants claims to determine codimensions, degrees, and irreducible components for all balanced formats, including boundary cases. This would complete Problem 3.8, but the claim appears in a single unrefereed preprint and has no independent mathematical assessment in the retrieved sources.

Current status (as of October 2026): Earlier partial results are established, while a complete solution is claimed in an unrefereed preprint but remains unverified.

Sources

Solutions 0

No solutions have been posted yet.