Related papers: Invariance of Hironaka's characteristic polyhedron

Let $(R,M,k)$ be a regular local G-ring with regular system of parameters $(u_1, \ldots ,u_d,y)$. We prove that the Hironaka characteristic polyhedron $\Delta (f;u_1, \ldots ,u_d)$, $f \not \in (u_1, \ldots ,u_d)$ of a hypersurface…

Hironaka's characteristic polyhedron is an important combinatorial object reflecting the local nature of a singularity. We prove that it can be determined without passing to the completion if the local ring is a G-ring and if additionally…

Hironaka's concept of characteristic polyhedron of a singularity has been one of the most powerful and fruitful ideas of the last decades in singularity theory. In fact, since then combinatorics have become a major tool in many important…

Given an irreducible hypersurface singularity of dimension $d$ (defined by a polynomial $f\in K[[ {\bf x} ]][z]$) and the projection to the affine space defined by $K[[ {\bf x} ]]$, we construct an invariant which detects whether the…

These expository notes, addressed to non-experts, are intended to present some of Hironaka's ideas on his theorem of resolution of singularities. We focus particularly on those aspects which have played a central role in the constructive…

We study oriented connected closed polyhedral surfaces with non-degenerate triangular faces in three-dimensional Euclidean space, calling them polyhedra for short. A polyhedron is called flexible if its spatial shape can be changed…

We use some basic properties of binomial and Stirling numbers to prove that the Euler characteristic is, essentially, the unique numerical topological invariant for compact polyhedra which can be expressed as a linear combination of the…

We prove that every three-dimensional polyhedron is uniquely determined by its dihedral angles and edge lengths, even if nonconvex or self-intersecting, under two plausible sufficient conditions: (i) the polyhedron has only convex faces and…

The holomorphy conjecture states roughly that Igusa's zeta function associated to a hypersurface and a character is holomorphic on $\mathbb{C}$ whenever the order of the character does not divide the order of any eigenvalue of the local…

Automated program verification often proceeds by exhibiting inductive invariants entailing the desired properties.For numerical properties, a classical class of invariants is convex polyhedra: solution sets of system of linear…

How much of the combinatorial structure of a pointed polyhedron is contained in its vertex-facet incidences? Not too much, in general, as we demonstrate by examples. However, one can tell from the incidence data whether the polyhedron is…

Based on previous work by the author we deduce that the invariant introduced by Bierstone and Milman in order to give a proof for constructive resolution of singularities in characteristic zero can be determined purely by considering…

An invariant of three-dimensional orientable manifolds is built on the base of a solution of pentagon equation expressed in terms of metric characteristics of Euclidean tetrahedra.

If a real value invariant of compact combinatorial manifolds (with or without boundary) depends only on the number of simplices in each dimension on the manifold, then the invariant is completely determined by Euler characteristics of the…

Let $P$ be a (non necessarily convex) embedded polyhedron in $\R^3$, with its vertices on an ellipsoid. Suppose that the interior of $P$ can be decomposed into convex polytopes without adding any vertex. Then $P$ is infinitesimally rigid.…

We characterize the Archimedean solids among the convex uniform polyhedra via face embeddings into a regular Tetrahedron. This result has been listed without proof in the literature.

In this paper we prove the identity that generalizes the Andrews-Gordon identity. Also we discuss the relation of our formula to the geometry of affine flag varieties and to the geometry of polyhedra.

Building upon works of Hironaka, Bierstone-Milman, Villamayor and Wlodarczyk, we give an a priori estimate for the complexity of the simplified Hironaka algorithm. As a consequence of this result, we show that there exists canonical…

We prove an equivariant version of Hironaka's theorem on elimination of points of indeterminacy. Our arguments rely on canonical resolution of singularities.

A triangulation of a simplicial complex $\Delta$ is called uniform if the $f$-vector of its restriction to a face of $\Delta$ depends only on the dimension of that face. This paper proves that the entries of the $h$-vector of a uniform…