A counterexample to Hironaka's ''hard'' polyhedra game (Q5896205)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3842042
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A counterexample to Hironaka's ''hard'' polyhedra game |
scientific article; zbMATH DE number 3842042 |
Statements
A counterexample to Hironaka's ''hard'' polyhedra game (English)
0 references
1982
0 references
Hironaka has proposed a combinatorial game, played with Newton polyhedra of singularities, whose affirmative solution would imply the local uniformization theorem over a field of any characteristic. In this paper we give a counterexample to this game. However, our examples does not come from algebraic geometry (the game is a good bit stronger than the local uniformization theorem).
0 references
Hironaka hard polyhedra game
0 references
Newton pollyhedron
0 references
resolution of singularities
0 references
local uniformization theorem
0 references
normal flatness
0 references
blowing-up
0 references
0.8603777289390564
0 references
0.8060113191604614
0 references
0.7659112215042114
0 references
0.7575233578681946
0 references
