English
Related papers

Related papers: Smoothness and decay properties of the limiting Qu…

200 papers

In this paper we prove a uniform Fourier restriction estimate over the class of simple curves where the last coordinate function can be extended to a holomorphic function of bounded frequency in a sufficiently large disc. The proof is based…

Classical Analysis and ODEs · Mathematics 2023-03-31 Jaume de Dios Pont , Helge Jørgen Samuelsen

Let $f:\mathbb{R}^k\to \mathbb{R}$ be a measurable function, and let $\{U_i\}_{i\in\mathbb{N}}$ be a sequence of i.i.d. random variables. Consider the random process $Z_i=f(U_{i},...,U_{i+k-1})$. We show that for all $\ell$, there is a…

Probability · Mathematics 2016-08-10 Noga Alon , Ohad N. Feldheim

A. Ya. Zaslavskii's results on the existence of a linear (affine) selection for a linear (affine) or superlinear (convex) map $\Phi : K \to 2^Y$ defined on a convex cone (convex set) $K$ having the interpolation property are extended. We…

Functional Analysis · Mathematics 2012-06-18 Dmitry V. Rutsky

In [1] the authors showed some basic properties of a pre-order that arose in combinatorial number theory, namely the finite embeddability between sets of natural numbers, and they presented its generalization to ultrafilters, which is…

Logic · Mathematics 2014-06-13 Lorenzo Luperi Baglini

The density of polynomials in a weighted space of infinitely differentiable functions in a multidimensional real space is proved under minimal conditions on weight functions and on differences between weight functions. We apply this result…

Classical Analysis and ODEs · Mathematics 2007-05-23 P. V. Fedotova , I. Kh. Musin

The independence density of a finite hypergraph is the probability that a subset of vertices, chosen uniformly at random contains no hyperedges. Independence densities can be generalized to countable hypergraphs using limits. We show that,…

Combinatorics · Mathematics 2016-04-20 Paul Balister , Béla Bollobás , Karen Gunderson

Inspired by recent work on learning with distribution shift, we give a general outlier removal algorithm called iterative polynomial filtering and show a number of striking applications for supervised learning with contamination: (1) We…

Machine Learning · Computer Science 2026-01-13 Adam R. Klivans , Konstantinos Stavropoulos , Kevin Tian , Arsen Vasilyan

Let $A$ be the product of an abelian variety and a torus over a number field $K$, and let $m$ be a positive integer. If $\alpha \in A(K)$ is a point of infinite order, we consider the set of primes $\mathfrak p$ of $K$ such that the…

Number Theory · Mathematics 2021-07-01 Peter Bruin , Antonella Perucca

We introduce a sorting machine consisting of $k+1$ stacks in series: the first $k$ stacks can only contain elements in decreasing order from top to bottom, while the last one has the opposite restriction. This device generalizes \cite{SM},…

Data Structures and Algorithms · Computer Science 2019-10-10 Giulio Cerbai , Lapo Cioni , Luca Ferrari

Using the existence of infinite numbers $k$ in the non-Archimedean ring of Robinson-Colombeau, we define the hyperfinite Fourier transform (HFT) by considering integration extended to $[-k,k]^{n}$ instead of $(-\infty,\infty)^{n}$. In order…

Functional Analysis · Mathematics 2022-10-03 Akbarali Mukhammadiev , Diksha Tiwari , Paolo Giordano

Let $f: B^n \rightarrow {\mathbb R}$ be a $d+1$ times continuously differentiable function on the unit ball $B^n$, with $\max_{z\in B^n} \| f(z) \|=1$. A well-known fact is that if $f$ vanishes on a set $Z\subset B^n$ with a non-empty…

Classical Analysis and ODEs · Mathematics 2023-09-11 Gil Goldman , Yosef Yomdin

We prove that every topologically transitive shift of finite type in one dimension is topologically conjugate to a subshift arising from a primitive random substitution on a finite alphabet. As a result, we show that the set of values of…

Dynamical Systems · Mathematics 2020-04-15 Philipp Gohlke , Dan Rust , Timo Spindeler

This paper describes the quality of convergence to an infinitely divisible law relative to free multiplicative convolution. We show that convergence in distribution for products of identically distributed and infinitesimal free random…

Functional Analysis · Mathematics 2014-05-07 Michael Anshelevich , Jiun-Chau Wang , Ping Zhong

We study the approximation capabilities of two families of univariate polynomials that arise in applications of quantum signal processing. Although approximation only in the domain $[0,1]$ is physically desired, these polynomial families…

Classical Analysis and ODEs · Mathematics 2022-04-11 Rahul Sarkar , Theodore J. Yoder

For any fixed field $K\!\in\!\{\mathbb{Q}_2,\mathbb{Q}_3,\mathbb{Q}_5, \ldots\}$, we prove that all polynomials $f\!\in\!\mathbb{Z}[x]$ with exactly $3$ (resp. $2$) monomial terms, degree $d$, and all coefficients having absolute value at…

Number Theory · Mathematics 2021-07-21 J. Maurice Rojas , Yuyu Zhu

In this paper we show that certain sets are dense in $\mathbb{R}$. We give some applications. For example, we show an analytical proof that $q^{\frac{1}{n}}$, $q$ is a prime number and $e$; are irrational numbers. As another application we…

Classical Analysis and ODEs · Mathematics 2016-03-21 Manas R. Sahoo

Discretization of the uniform norm of functions from a given finite dimensional subspace of continuous functions is studied. Previous known results show that for any $N$-dimensional subspace of the space of continuous functions it is…

Functional Analysis · Mathematics 2024-05-08 E. D. Kosov , V. N. Temlyakov

In this article we prove the existence of sets $E \subseteq \mathbb{R}$ of zero Fourier dimension such that it is possible to restrict the Fourier transform to $E$ on a certain non-trivial range $[1,\tilde{p})$ with $1<\tilde{p}<2$. This…

Classical Analysis and ODEs · Mathematics 2026-03-24 Iván Polasek , Ezequiel Rela

We consider the convolution model where i.i.d. random variables $X_i$ having unknown density $f$ are observed with additive i.i.d. noise, independent of the $X$'s. We assume that the density $f$ belongs to either a Sobolev class or a class…

Statistics Theory · Mathematics 2009-09-29 Cristina Butucea

The Shapley-Folkman theorem shows that Minkowski averages of uniformly bounded sets tend to be convex when the number of terms in the sum becomes much larger than the ambient dimension. In optimization, Aubin and Ekeland [1976] show that…

Optimization and Control · Mathematics 2019-07-02 Thomas Kerdreux , Igor Colin , Alexandre d'Aspremont
‹ Prev 1 3 4 5 6 7 10 Next ›