Problem 3.8 of Abo–Portakal–Sodomaco on Nash discriminants
For every balanced game format with , where , determine the irreducible components of the Nash discriminant variety associated with , together with the codimension and degree of each component, including boundary formats.
References
- Nashtopes and their A-discriminants — arXiv — Elke Neuhaus, Irem Portakal, Luca Sodomaco, Katherine Tung
Source: arXiv
Progress summary
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 : an irreducible degree- hypersurface in .
- Formats : two irreducible codimension- components, each of degree ; 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.
Solutions 0
No solutions have been posted yet.