English
Related papers

Related papers: The Baker-Schmidt problem for dual approximation a…

200 papers

We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance \eps in Hausdorff distance, as the Minkowski sum of another polygonal shape P with a disk of fixed radius? If…

Computational Geometry · Computer Science 2011-09-13 Eric Berberich , Dan Halperin , Michael Kerber , Roza Pogalnikova

We prove that every quasisphere is the Gromov-Hausdorff limit of a sequence of locally smooth uniform quasispheres. We also prove an analogous result in the bi-Lipschitz setting. This extends recent results of D. Ntalampekos from dimension…

Metric Geometry · Mathematics 2025-04-10 Spencer Cattalani

Two subanalytic subsets of R^n are called s-equivalent at a common point P if the Hausdorff distance between their intersections with the sphere centered at P of radius r vanishes of order greater than s when r tends to 0. In this paper we…

Algebraic Geometry · Mathematics 2012-09-17 Massimo Ferrarotti , Elisabetta Fortuna , Leslie Wilson

Semidefinite programs (SDPs) are standard convex problems that are frequently found in control and optimization applications. Interior-point methods can solve SDPs in polynomial time up to arbitrary accuracy, but scale poorly as the size of…

Optimization and Control · Mathematics 2022-01-10 Jared Miller , Yang Zheng , Mario Sznaier , Antonis Papachristodoulou

The classical Besicovitch-Federer projection theorem implies that the d-dimensional Hausdorff measure of a set in Euclidean space with non-negligible d-unrectifiable part will strictly decrease under orthogonal projection onto almost every…

Functional Analysis · Mathematics 2017-10-11 Harrison Pugh

The badly approximable points in $\mathbb{R}^d$ are those for which Dirichlet's approximation theorem cannot be improved by more than a constant, that is, they are the points most difficult to approximate by rational vectors. An important…

Number Theory · Mathematics 2026-03-13 Roope Anttila , Jonathan M. Fraser , Henna Koivusalo

In this paper, we apply the so-called Alexandrov-Bakelman-Pucci (ABP) method to establish some geometric inequalities. We first prove a logarithmic Sobolev inequality for closed $n$-dimensional minimal submanifolds $\Sigma$ of $\mathbb…

Differential Geometry · Mathematics 2023-05-11 Doanh Pham

Bardeen's 1968 idea of a regular black hole spacetime was revived by Hayward in 2006 through the construction of a new example of such a geometry. Later it was realised by Neves and Saa, that a wider, two-parameter class exists, with…

General Relativity and Quantum Cosmology · Physics 2022-08-15 Poulami Dutta Roy , Sayan Kar

The space of all non degenerate bilinear structures on a manifold $M$ carries a one parameter family of pseudo Riemannian metrics. We determine the geodesic equation, covariant derivative, curvature, and we solve the geodesic equation…

Differential Geometry · Mathematics 2016-09-06 Olga Gil-Medrano , Peter W. Michor , Martin Neuwirther

In semialgebraic geometry, projections play a prominent role. A definable choice is a semialgebraic selection of one point in every fiber of a projection. Definable choices exist by semialgebraic triviality, but their complexity depends…

Algebraic Geometry · Mathematics 2025-03-11 Antonio Lerario , Luca Rizzi , Daniele Tiberio

In this paper, we study the Hausdorff dimension of self-similar measures and sets on the real line, where the generating iterated function system consists of some maps that share the same fixed point. In particular, we will show that out of…

Dynamical Systems · Mathematics 2025-07-09 Balázs Bárány , Manuj Verma

In this paper we prove an upper bound on the "size" of the set of multiplicatively $\psi$-approximable points in $\mathbb R^d$ for $d>1$ in terms of $f$-dimensional Hausdorff measure. This upper bound exactly complements the known lower…

Number Theory · Mathematics 2018-03-12 Mumtaz Hussain , David Simmons

Let $\Psi :[1,\infty )\rightarrow \mathbb{R}_{+}$ be a non-decreasing function, $a_{n}(x)$ the $n$'{th} partial quotient of $x$ and $q_{n}(x)$ the denominator of the $n$'{th} convergent. The set of $\Psi $-Dirichlet non-improvable numbers…

Number Theory · Mathematics 2019-05-20 Ayreena Bakhtawar , Philip Bos , Mumtaz Hussain

This paper is a starting point towards computing the Hausdorff dimension of submanifolds and the Hausdorff volume of small balls in a sub-Riemannian manifold with singular points. We first consider the case of a strongly equiregular…

Metric Geometry · Mathematics 2013-01-17 Roberta Ghezzi , Frédéric Jean

This work is motivated by problems on simultaneous Diophantine approximation on manifolds, namely, establishing Khintchine and Jarnik type theorems for submanifolds of R^n. These problems have attracted a lot of interest since Kleinbock and…

Number Theory · Mathematics 2016-04-01 Victor Beresnevich

For a C^{1+\alpha} diffeomorphism f preserving a hyperbolic ergodic SRB measure \mu, Katok's remarkable results assert that \mu can be approximated by a sequence of hyperbolic sets \{\Lambda_n\}_{n\geq1}. In this paper, we prove the…

Dynamical Systems · Mathematics 2022-02-24 Juan Wang , Congcong Qu , Yongluo Cao

We consider a $(1+1)$-dimensional theory with a single real scalar field $\phi$ whose kinematics is modified by a generalizing function $f(\phi)$. After briefly reviewing its Bogomol'nyi-Prasad-Sommerfield (BPS) structure, we focus on a…

High Energy Physics - Theory · Physics 2026-02-11 R. Casana , E. da Hora , F. C. Simas

The problem of the optimal approximation of circular arcs by parametric polynomial curves is considered. The optimality relates to the Hausdorff distance and have not been studied yet in the literature. Parametric polynomial curves of low…

Numerical Analysis · Mathematics 2021-02-26 Aleš Vavpetič , Emil Žagar

We present a space and time efficient practical parallel algorithm for approximating the diameter of massive weighted undirected graphs on distributed platforms supporting a MapReduce-like abstraction. The core of the algorithm is a…

Distributed, Parallel, and Cluster Computing · Computer Science 2015-11-10 Matteo Ceccarello , Andrea Pietracaprina , Geppino Pucci , Eli Upfal

Analyzing high-dimensional data with manifold learning algorithms often requires searching for the nearest neighbors of all observations. This presents a computational bottleneck in statistical manifold learning when observations of…

Machine Learning · Computer Science 2022-03-11 Fan Cheng , Anastasios Panagiotelis , Rob J Hyndman