English
Related papers

Related papers: Estimating the distance from testable affine-invar…

200 papers

We study the Erd\H os-Falconer distance problem for a set $A\subset \mathbb{F}^2$, where $\mathbb{F}$ is a field of positive characteristic $p$. If $\mathbb{F}=\mathbb{F}_p$ and the cardinality $|A|$ exceeds $p^{5/4}$, we prove that $A$…

Combinatorics · Mathematics 2022-05-05 Brendan Murphy , Giorgis Petridis , Thang Pham , Misha Rudnev , Sophie Stevens

We show that for various classes C of sparse graphs, and several measures of distance to such classes (such as edit distance and elimination distance), the problem of determining the distance of a given graph G to C is fixed-parameter…

Data Structures and Algorithms · Computer Science 2015-02-23 Jannis Bulian , Anuj Dawar

In this paper we consider continued fraction (CF) expansions on intervals different from $[0,1]$. For every $x$ in such interval we find a CF expansion with a finite number of possible digits. Using the natural extension, the density of the…

Dynamical Systems · Mathematics 2016-06-17 Cor Kraaikamp , Niels Langeveld

The proximinality of certain subspaces of spaces of bounded affine functions is proved. The results presented here are some linear versions of an old result due to Mazur. For the proofs we use some sandwich theorems of Fenchel's duality…

Functional Analysis · Mathematics 2019-07-24 Maysam Maysami Sadr

By the continuous mapping theorem, if a sequence of $d$-dimensional random vectors $(\mathbf{W}_n)_{n\geq1}$ converges in distribution to a multivariate normal random variable $\Sigma^{1/2}\mathbf{Z}$, then the sequence of random variables…

Probability · Mathematics 2020-03-18 Robert E. Gaunt

A method for approximating continuous functions $\mathbb{Z}_{p}^{n}\rightarrow\mathbb{Z}_{p}$ by a linear superposition of continuous functions $\mathbb{Z}_{p}\rightarrow\mathbb{Z}_{p}$ is presented and a polynomial regression model is…

Mathematical Physics · Physics 2025-04-02 Alexander P. Zubarev

The average distance from a node to all other nodes in a graph, or from a query point in a metric space to a set of points, is a fundamental quantity in data analysis. The inverse of the average distance, known as the (classic) closeness…

Social and Information Networks · Computer Science 2015-06-29 Shiri Chechik , Edith Cohen , Haim Kaplan

Let $p$ be a prime, let $S$ be a non-empty subset of $\mathbb{F}_p$ and let $0<\epsilon\leq 1$. We show that there exists a constant $C=C(p, \epsilon)$ such that for every positive integer $k$, whenever $\phi_1, \dots, \phi_k:…

Combinatorics · Mathematics 2023-06-02 W. T. Gowers , Thomas Karam

In this paper we show how to approximate ("learn") a function f, where X and Y are metric spaces.

Functional Analysis · Mathematics 2007-09-14 Kerry M. Soileau

In this paper, exact rate of approximation of functions by linear means of Fourier series and Fourier integrals and corresponding $K$-functionals are expressed via special moduli of smoothness. . Introduction is given in $\S 1$. In $\S2$…

Classical Analysis and ODEs · Mathematics 2016-06-27 R. M. Trigub

We present an algorithm for testing halfspaces over arbitrary, unknown rotation-invariant distributions. Using $\tilde O(\sqrt{n}\epsilon^{-7})$ random examples of an unknown function $f$, the algorithm determines with high probability…

Data Structures and Algorithms · Computer Science 2018-11-02 Nathaniel Harms

Monadically stable and monadically NIP classes of structures were initially studied in the context of model theory and defined in logical terms. They have recently attracted attention in the area of structural graph theory, as they…

Logic in Computer Science · Computer Science 2023-11-28 Jan Dreier , Nikolas Mählmann , Sebastian Siebertz , Szymon Toruńczyk

An elimination tree of a connected graph $G$ is a rooted tree on the vertices of $G$ obtained by choosing a root $v$ and recursing on the connected components of $G-v$ to obtain the subtrees of $v$. The graph associahedron of $G$ is a…

Data Structures and Algorithms · Computer Science 2026-03-24 Luís Felipe I. Cunha , Ignasi Sau , Uéverton S. Souza , Mario Valencia-Pabon

In this paper we characterize the distance between the function $f$ and the set $C^{\infty}_{\mathrm{comp}}(\mathbb{R}^d)$ in generalized Morrey spaces $L_{p,\phi}(\mathbb{R}^d)$ with variable growth condition. We also prove that the…

Functional Analysis · Mathematics 2025-01-30 Satoshi Yamaguchi

We show that for multivariate Freud-type weights $W_\alpha(x)=\exp(-|x|^\alpha)$, $\alpha>1$, any convex function $f$ on $R^d$ satisfying $fW_\alpha\in L_p(R^d)$ if $1\le p<\infty$, or $\lim_{|x|\to\infty}f(x)W_\alpha(x)=0$ if $p=\infty$,…

Classical Analysis and ODEs · Mathematics 2014-11-14 Oleksandr Maizlish , Andriy Prymak

Given a compact semialgebraic set S of R^n and a polynomial map f from R^n to R^m, we consider the problem of approximating the image set F = f(S) in R^m. This includes in particular the projection of S on R^m for n greater than m. Assuming…

Optimization and Control · Mathematics 2015-07-23 Victor Magron , Didier Henrion , Jean-Bernard Lasserre

A topological invariant of a polynomial map $p:X\to B$ from a complex surface containing a curve $C\subset X$ to a one-dimensional base is given by a rational second homology class in the compactification of the moduli space of genus $g$…

Algebraic Geometry · Mathematics 2007-05-23 Paul Norbury

In this paper we present an equivalent statement to the Jacobian conjecture. For a polynomial map F on an affine space of dimension n, we define recursively n finite sequences of polynomials. We give an equivalent condition to the…

Commutative Algebra · Mathematics 2016-01-05 Elzbieta Adamus , Pawel Bogdan , Teresa Crespo , Zbigniew Hajto

In this paper we study variations of the Hopf theorem concerning continuous maps $f$ of a compact Riemannian manifold $M$ of dimension $n$ to $\mathbb{R}^n$. We investigate the case when $M$ is a closed convex $n$-dimensional surface and…

Metric Geometry · Mathematics 2025-04-22 I. M. Shirokov

Distance function to a compact set plays a central role in several areas of computational geometry. Methods that rely on it are robust to the perturbations of the data by the Hausdorff noise, but fail in the presence of outliers. The…

Computational Geometry · Computer Science 2011-02-25 Leonidas J. Guibas , Quentin Mérigot , Dmitriy Morozov
‹ Prev 1 4 5 6 7 8 10 Next ›