The winning strategy for Hironaka's polyhedra game is almost arbitrary

DOI10.1016/J.JPAA.2010.12.005zbMATH Open1215.14053OpenAlexW1983363158MaRDI QIDQ538063FDOQ538063

Zhiming Zheng, Sheng-Ming Ma

Publication date: 23 May 2011

Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpaa.2010.12.005

zbMATH Keywords

resolution of singularitiesNewton polyhedratwo-player game

Mathematics Subject Classification ID

2-person games (91A05) Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Singularities in algebraic geometry (14B05)

Cites Work

• The Hironaka theorem on resolution of singularities (Or: A proof we always wanted to understand)
• Title not available (Why is that?)
• A short solution to Hironaka's polyhedra game
• Three power series techniques
• Title not available (Why is that?)

Cited In (3)

• Multivision: An Intractable Impartial Game with a Linear Winning Strategy
• Title not available (Why is that?)
• A counterexample to Hironaka's hard polyhedra game

   Recommendations

• A short solution to Hironaka's polyhedra game 👍 👎
• Title not available (Why is that?) 👍 👎
• A counterexample to Hironaka's hard polyhedra game 👍 👎
• A game for the resolution of singularities 👍 👎
• Stratégies gagnantes dans certains jeux topologiques 👍 👎

This page was built for publication: The winning strategy for Hironaka's polyhedra game is almost arbitrary

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q538063)