English
Related papers

Related papers: Rectifiability and approximate differentiability o…

200 papers

Phase retrieval in real or complex Hilbert spaces is the task of recovering a vector, up to an overall unimodular multiplicative constant, from magnitudes of linear measurements. In this paper, we assume that the vector is normalized, but…

Probability · Mathematics 2019-11-19 Dylan Domel-White , Bernhard G. Bodmann

An open set U of the real numbers R is produced such that the expansion (R,+,x,U) of the real field by U defines a Borel isomorph of (R,+,x,N) but does not define N. It follows that (R,+,x,U) defines sets in every level of the projective…

Logic · Mathematics 2008-12-06 H. Friedman , K. Kurdyka , C. Miller , P. Speissegger

In the Euclidean $k$-Means problem we are given a collection of $n$ points $D$ in an Euclidean space and a positive integer $k$. Our goal is to identify a collection of $k$ points in the same space (centers) so as to minimize the sum of the…

Data Structures and Algorithms · Computer Science 2021-09-21 Fabrizio Grandoni , Rafail Ostrovsky , Yuval Rabani , Leonard J. Schulman , Rakesh Venkat

Suppose that $\Omega \subset \mathbb{R}^{n+1}$, $n \ge 2$, is an open set satisfying the corkscrew condition with an $n$-dimensional ADR boundary, $\partial \Omega$. In this note, we show that if harmonic functions are…

Analysis of PDEs · Mathematics 2018-01-19 Simon Bortz , Olli Tapiola

We present a family of high-order finite element approximation spaces on a pyramid, and associated unisolvent degrees of freedom. These spaces consist of rational basis functions. We establish conforming, exactness and polynomial…

Numerical Analysis · Mathematics 2010-10-29 Nilima Nigam , Joel Phillips

For any $p\in[1,\infty]$, we prove that the set of simple functions taking at most $k$ different values is proximinal in $L^p$ for all $k\geq 1$. We introduce the class of uniformly approximable subsets of $L^p$, which is larger than the…

Classical Analysis and ODEs · Mathematics 2022-09-07 Guillaume Grelier , Jaime San Martín

We resolve a problem posed by Mattila, Serapioni and Serra Cassano concerning the role of density assumptions in the characterization of rectifiable sets of low codimension in Heisenberg groups. Specifically, we prove that the positive…

Metric Geometry · Mathematics 2025-09-10 Kennedy Obinna Idu

The monadic theory of $(\mathbb R,\le)$ with quantification restricted to Borel sets is decidable. The Boolean combinations of $F_\sigma$ sets form an elementary substructure of the Borel sets. Under determinacy hypotheses, the proof…

Logic · Mathematics 2026-03-10 Sven Manthe

We find sufficient conditions on a set $\mathscr{M}\subset\mathbf{R}^n\times\mathscr{L}(\mathbf{R}^n,\mathbf{R}^m)$ ensuring that the set of functions such that $(F(x),DF(x))\in\mathscr{M}$ is rectifiable. We also prove a more general…

Analysis of PDEs · Mathematics 2023-08-29 Claudio Afeltra

We consider a general linear parabolic problem with extended time boundary conditions (including initial value problems and periodic ones), and approximate it by the implicit Euler scheme in time and the Gradient Discretisation method in…

Numerical Analysis · Mathematics 2023-08-22 J Droniou , R Eymard , T Gallouët , C Guichard , R Herbin

In this note, we present an abstract approach to study asymptotic orders for adaptive approximations with respect to a monotone set function $\mathfrak{J}$ defined on dyadic cubes. We determine the exact upper order in terms of the critical…

Optimization and Control · Mathematics 2025-03-18 Marc Kesseböhmer , Aljoscha Niemann

A topological space $X$ is called resolvable if it contains a dense subset with dense complement. Using only basic principles, we show that whenever the space $X$ has a resolving subset that can be written as an at most countably infinite…

Functional Analysis · Mathematics 2022-08-24 Marcel de Jeu , Jan Harm van der Walt

Neural ordinary differential equations (NODEs) is an invertible neural network architecture promising for its free-form Jacobian and the availability of a tractable Jacobian determinant estimator. Recently, the representation power of NODEs…

Machine Learning · Computer Science 2020-12-07 Takeshi Teshima , Koichi Tojo , Masahiro Ikeda , Isao Ishikawa , Kenta Oono

We show that several dichotomy theorems concerning the second level of the Borel hierarchy are special cases of the $\aleph_0$-dimensional generalization of the open graph dichotomy, which itself follows from the usual proof(s) of the…

Logic · Mathematics 2018-03-09 Raphaël Carroy , Benjamin D. Miller , Dániel T. Soukup

Let $X$ be a Polish space, $d$ a pseudo-metric on $X$. If $\{(u,v):d(u,v)<\delta\}$ is ${\bf\Pi}^1_1$ for each $\delta>0$, we show that either $(X,d)$ is separable or there are $\delta>0$ and a perfect set $C\subseteq X$ such that…

Logic · Mathematics 2010-06-24 Longyun Ding

We present a new partial order reduction method for reachability analysis of nondeterministic labeled transition systems over metric spaces. Nondeterminism arises from both the choice of the initial state and the choice of actions, and the…

Logic in Computer Science · Computer Science 2018-05-14 Chuchu Fan , Zhenqi Huang , Sayan Mitra

Optimal higher-order Sobolev type embeddings are shown to follow via isoperimetric inequalities. This establishes a higher-order analogue of a well-known link between first-order Sobolev embeddings and isoperimetric inequalities. Sobolev…

Functional Analysis · Mathematics 2013-11-04 Andrea Cianchi , Luboš Pick , Lenka Slavíková

We study the Falconer distance set problem in Euclidean space and obtain improved dimensional estimates under natural Fourier analytic assumptions cast in terms of the Fourier dimension and spectrum. Interestingly, under reasonably mild…

Classical Analysis and ODEs · Mathematics 2026-04-22 Jonathan M. Fraser , Thang Pham

Optimization problems, generalized equations, and the multitude of other variational problems invariably lead to the analysis of sets and set-valued mappings as well as their approximations. We review the central concept of set-convergence…

Optimization and Control · Mathematics 2020-02-25 Johannes O. Royset

An open problem that is widely regarded as one of the most important in quantum query complexity is to resolve the quantum query complexity of the k-distinctness function on inputs of size N. While the case of k=2 (also called Element…

Quantum Physics · Physics 2023-03-15 Nikhil S. Mande , Justin Thaler , Shuchen Zhu