English
Related papers

Related papers: Whitney extensions and orthonormal expansions

200 papers

This note addresses the quantitative aspect of the bilipschitz extension problem. The main result states that any bilipschitz embedding of $\mathbb R$ into $\mathbb R^2$ can be extended to a bilipschitz self-map of $\mathbb R^2$ with a…

Complex Variables · Mathematics 2012-05-01 Leonid V. Kovalev

One of the major challenges in finite element methods is the mitigation of spurious oscillations near sharp layers and discontinuities known as the Gibbs phenomenon. In this article, we propose a set of functionals to identify spurious…

Numerical Analysis · Mathematics 2023-03-09 M. ten Eikelder , S. Stoter , Y. Bazilevs , D. Schillinger

This study defines an orbitwise expansive point (OE) as a point, such as $x$ in a metric space $(X,\rho)$, if there is a number $d>0$ such that the orbits of a few points inside an arbitrary open sphere will maintain a distance greater than…

Dynamical Systems · Mathematics 2025-05-02 Debasish Bhattacharjee , Humayan Kobir , Santanu Acharjee

Given a simplicial complex $K$, we consider several notions of geometric complexity of embeddings of $K$ in a Euclidean space ${\mathbb R}^d$: thickness, distortion, and refinement complexity (the minimal number of simplices needed for a PL…

Metric Geometry · Mathematics 2014-09-30 Michael Freedman , Vyacheslav Krushkal

We study the Riemannian distance function from a fixed point (a point-wise target) of Euclidean space in the presence of a compact obstacle bounded by a smooth hypersurface. First, we show that such a function is locally semiconcave with a…

Optimization and Control · Mathematics 2021-10-25 Paolo Albano , Vincenzo Basco , Piermarco Cannarsa

One of the most basic, longstanding open problems in the theory of dynamical systems is whether reachability is decidable for one-dimensional piecewise affine maps with two intervals. In this paper we prove that for injective maps, it is…

Dynamical Systems · Mathematics 2023-03-20 Faraz Ghahremani , Edon Kelmendi , Joël Ouaknine

Expansion testing aims to decide whether an $n$-node graph has expansion at least $\Phi$, or is far from any such graph. We propose a quantum expansion tester with complexity $\widetilde{O}(n^{1/3}\Phi^{-1})$. This accelerates the…

Quantum Physics · Physics 2020-09-23 Simon Apers

As is well-known, the Witten deformation of the De Rham complex computes the De Rham cohomology. In this paper we study the Witten deformation on a noncompact manifold and restrict it to differential forms which behave polynomially near…

Differential Geometry · Mathematics 2007-05-23 Michael Farber , Eugenii Shustin

The task of finding an extension to a given partial drawing of a graph while adhering to constraints on the representation has been extensively studied in the literature, with well-known results providing efficient algorithms for…

Computational Geometry · Computer Science 2023-02-21 Sujoy Bhore , Robert Ganian , Liana Khazaliya , Fabrizio Montecchiani , Martin Nöllenburg

We study the Dirichlet problem for harmonic maps between hyperbolic planes, under the assumption that the Euclidean harmonic extension of the boundary map is quasiconformal.

Analysis of PDEs · Mathematics 2014-06-18 Anestis Fotiadis

We introduce W-spin structures on a Riemann surface and give a precise definition to the corresponding W-spin equations for any quasi-homogeneous polynomial W. Then, we construct examples of nonzero solutions of spin equations in the…

Differential Geometry · Mathematics 2008-02-23 Huijun Fan , Tyler J. Jarvis , Yongbin Ruan

Given a finite CW complex $K$, we use a version of the Goodwillie-Weiss tower to formulate an obstruction theory for embedding $K$ into a Euclidean space $\mathbb{R}^d$. For $2$-dimensional complexes in $\mathbb{R}^4$, a geometric analogue…

Algebraic Topology · Mathematics 2024-07-31 Gregory Arone , Vyacheslav Krushkal

Let $\mathbb{F}_q$ be a finite field of order $q$ and $E$ be a set in $\mathbb{F}_q^d$. The distance set of $E$ is defined by $\Delta(E):=\{\lVert x-y \rVert :x,y\in E\}$, where $\lVert \alpha \rVert=\alpha_1^2+\dots+\alpha_d^2$. Iosevich,…

Combinatorics · Mathematics 2024-06-19 Firdavs Rakhmonov

Cheeger's fundamental inequality states that any edge-weighted graph has a vertex subset $S$ such that its expansion (a.k.a. conductance) is bounded as follows: \[ \phi(S) \defeq \frac{w(S,\bar{S})}{\min \set{w(S), w(\bar{S})}} \leq…

Data Structures and Algorithms · Computer Science 2015-03-19 Anand Louis , Prasad Raghavendra , Prasad Tetali , Santosh Vempala

This paper is devoted to Hardy inequalities concerning distance functions from submanifolds of arbitrary codimensions in the Riemannian setting. On a Riemannian manifold with non-negative curvature, we establish several sharp weighted Hardy…

Differential Geometry · Mathematics 2021-01-13 Yunxia Chen , Naichung Conan Leung , Wei Zhao

The question of extension of locally defined maps to the entire space arises in many problems of analysis (e.g., local linearization of functional equations). A known classical method of extension of smooth local maps on Banach spaces uses…

Dynamical Systems · Mathematics 2024-12-16 Genrich Belitskii , Victoria Rayskin

The problem of recovering the configuration of points from their partial pairwise distances, referred to as the Euclidean Distance Matrix Completion (EDMC) problem, arises in a broad range of applications, including sensor network…

Optimization and Control · Mathematics 2026-05-07 Chandler Smith , HanQin Cai , Abiy Tasissa

Distance geometry explores the properties of distance spaces that can be exactly represented as the pairwise Euclidean distances between points in $\mathbb{R}^d$ ($d \geq 1$), or equivalently, distance spaces that can be isometrically…

Computational Geometry · Computer Science 2025-03-26 Matthias Bentert , Fedor V. Fomin , Petr A. Golovach , M. S. Ramanujan , Saket Saurabh

Let $P$ be a Poisson algebra, $E$ a vector space and $\pi : E \to P$ an epimorphism of vector spaces with $V = {\rm Ker} (\pi)$. The global extension problem asks for the classification of all Poisson algebra structures that can be defined…

Rings and Algebras · Mathematics 2015-01-06 A. L. Agore , G. Militaru

Expander decompositions form the basis of one of the most flexible paradigms for close-to-linear-time graph algorithms. Length-constrained expander decompositions generalize this paradigm to better work for problems with lengths, distances…

Data Structures and Algorithms · Computer Science 2024-05-16 Bernhard Haeupler , D Ellis Hershkowitz , Zihan Tan
‹ Prev 1 8 9 10 Next ›