Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.36381

Outer Lipschitz Geometry of Unions of Tangential Nodal Sets

José Edson Sampaio·Luan Moura Sousa·Emanoel Ferreira de Souza
View original source ↗Read source document ↗Export metadata ↓

Abstract

In 2000, Birbrair and Fernandes proved that the Hölder Semicomplex of the branches of a germ of a curve with its contact orders is a complete invariant of outer bi-Lipschitz equivalence of definable sets in polynomially bounded o-minimal structures. They also proved a realization theorem for it, i.e., for each Hölder semicomplex $G$, there is a germ of a semialgebraic curve $(X,x_0)$ such that the Hölder Semicomplex of $(X,x_0)$ coincides with $G$. In 2000, Birbrair proposed the problem of finding and characterizing all the Hölder semicomplexes that can be realized as a Hölder Semicomplex of a real analytic curve. Solving this problem in its full generality is a notoriously hard task; however, in this paper, we provide a complete answer to this problem when we restrict it to tangential nodal curves: curves defined as the union of the zero set of a harmonic function and its tangent cone at a fixed point.

Explore related subjects

math.MGmath.CVmath.NT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

José Edson Sampaio, Luan Moura Sousa, Emanoel Ferreira de Souza. 2026-10-26. Outer Lipschitz Geometry of Unions of Tangential Nodal Sets. https://arxiv.org/abs/2610.36381

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

KEEP EXPLORING

Related papers

arXiv2026

Non-separable arrangements of convex bodies revisited

A problem posed by Erdős in 1945 initiated the study of non-separable arrangements of convex bodies. A finite collection of convex bodies in Euclidean $d$-space is called a non-separable family (or NS-family) if every hyperplane intersecting their convex hull also intersects at least one member of the family. Recent work has focused on minimal coverings of NS-families consisting of positive homothetic convex bodies. In this paper, we strengthen these results by establishing their stability analogues and analyze weakly non-separable families of convex polytopes. We also examine weakly $k$-impassable families of convex $d$-polytopes for $0<k<d-1$ and study tightness of NS-lattice arrangements.

math.MG↗
arXiv2026

Hyperbolicity Beyond Convexity in the Alexandrov-Fenchel Inequality

We establish an Alexandrov--Fenchel type inequality in which one of the reference bodies is replaced by a function whose Hessian satisfies a balancing condition on its eigenvalues, without being required to be positive semidefinite. The proof hinges on a new extension of Alexandrov's inequality for mixed discriminants. As applications, we derive a log-concavity principle for linear functionals of area measures, answering a question of Colesanti, Hug, and Saorín-Gómez, as well as Brunn--Minkowski type inequalities for intrinsic volumes of mean section bodies, answering a question of Schuster.

math.MG↗
arXiv2026

Approximating the Euclidean Ball by Polytopes: Surprising Rates in High Dimensions

We determine the sharp dimensional dependence of the asymptotic approximation error for the Euclidean unit ball $B_2^d\subset\mathbb{R}^d$ by polytopes with a prescribed number of vertices in the relative symmetric difference metric. Specifically, we prove that $$\lim_{N\to\infty}N^{2/(d-1)}\inf_{P\in P_d(N)}\frac{\operatorname{vol}_d(P\triangle B_2^d)}{\operatorname{vol}_d(B_2^d)}=Θ(d^{-1/2}),$$ where $P_d(N)$ consists of polytopes with at most $N$ vertices and no containment restriction. Equivalently, the classical Laguerre-Delone triangulation numbers satisfy $\operatorname{ldel}_{d-1}=Θ(d^{-1/2})$. This improves the lower bound $Ω(d^{-1})$ of Böröczky (2000) and the upper bound $O(1)$ of Ludwig, Schütt and Werner (2006). In contrast, the corresponding asymptotic coefficient for approximation with a prescribed number of facets has order one, as shown by Kur (2020). We also establish non-asymptotic bounds showing that, for every fixed $\varepsilon\in(0,1)$, the ball admits an $\varepsilon$-approximation with at most $\exp(C(\varepsilon)\sqrt d)$ vertices, whereas approximating the hypercube to the same accuracy requires at least $\exp(c(\varepsilon)d)$ vertices. Consequently, the ball does not maximize the optimal relative approximation error among convex bodies, even up to an absolute multiplicative constant at the same vertex budget. Thus Macbeath's theorem (1951) on the extremality of the ball for inscribed approximation does not extend to polytopes in arbitrary position.

math.MG↗