Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1207.1902

A constructive elementary method for local resolution of singularities

Michael Greenblatt
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper we simplify and otherwise improve the local resolution of singularities algorithm of [G1]-[G3], providing a local resolution of singularities method that works for functions with convergent power series over an arbitrary local field of characteristic zero. The algorithm of this paper is an entirely elementary classical analysis argument, using only the implicit function theorem and elementary facts about power series and Newton polyhedra. Several examples are given. The methods are quite different from traditional resolution of singularities methods. In a separate paper arxiv:1104.4684, the methods of this paper (but for the most part not the resolution of singularities theorems themselves) are used to prove results concerning oscillatory integrals, exponential sums, and related matters. Note: This paper should be viewed as a replacement for the resolution of singularities portion of older versions of arxiv:1104.4684, as this paper is quite a bit different from that algorithm, and should be a lot easier to read. For one, standard blowups are used here, rather than the monomial maps of arxiv:1104.4684 which forced one to deal with technical issues related to such monomial maps not necessarily being one to one. Secondly, the complicated iterated domain subdivisions using Newton polyhedra that were done in arxiv:1104.4684 have been reduced to a short one-stage argument, given in section 2. Thirdly, forming partitions of unity can be done more naturally in the context of the newer algorithm (see Lemma 3.5).

Explore related subjects

math.CAmath.AG

Keep this discovery

BibTeXRIS

Michael Greenblatt. 2015-03-24. A constructive elementary method for local resolution of singularities. https://arxiv.org/abs/1207.1902

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

On the log-concavity of the composite Bessel function $x^{\alpha}J_{\nu }\left( \beta x^{\gamma}\right) $

For a twice differentiable function $f:\left( a,b\right) \rightarrow \mathbb{R}$ define $v\left( f\right) =f^{\prime}f^{\prime}-f^{\prime\prime }f.$ It is well known that the positivity of $v\left( f\right) $ implies that the function $\left\vert f\right\vert $ is strictly log-concave on each subinterval which does not contain zeros of $f.$ In this paper we provide criteria for the positivity of $v\left( F\right) $ for the composite Bessel function $F\left( x\right) =J_{\alpha,\beta,\gamma,\nu}\left( x\right) :=x^{\alpha}J_{\nu}\left( \beta x^{\gamma}\right) $ for positive numbers $\beta$ and $\gamma$ and real numbers $\alpha$ and $\nu.$

math.CA↗
arXiv2026

Riesz capacity ratios with negative exponents

We investigate sharp inequalities for ratios of Riesz capacities with negative exponents by combining computational experiments with rigorous analysis. For finite subsets of the line, we prove positivity of equilibrium masses when $-1<p<0$, enabling numerical tests of conjectured extremal ratios. In the plane, comparisons of the disk with regular polygon vertex sets reveal a cascade of transitions among the tested competitors and suggest a precise conjecture for the equilibrium measure of odd polygons, for which we give a partial proof. Numerical intersections of equality curves show that the regions where these sets outperform the disk are not simply nested. Similar numerical intersections occur in three dimensions between the regular-simplex equality curve and those of explicit five-point and six-point configurations. Motivated by the dimensional dependence of these comparisons, we prove that for each fixed $p<-2<q<0$, the regular simplex has a larger capacity ratio than the ball in all sufficiently large dimensions. Accompanying Python and Mathematica code supports reproduction and further testing of the conjectures.

math.CA↗
arXiv2026

Shorter proof of dimension-free $L^p$ estimates for maximal Riesz transforms

We provide a shorter and more direct proof of $L^p$ estimates for maximal Riesz transforms (of an arbitrary order) in terms of the corresponding Riesz transforms, with a constant independent of the dimension of the Euclidean space $\mathbb R^d$. This result was originally proved by Mateu, Orobitg, P\'erez and Verdera with a constant depending on the dimension, and improved to a dimension-free inequality by Kucharski, Wr\'obel and Zienkiewicz.

math.CA↗