English
Related papers

Related papers: Arithmetic structures in smooth subsets of F_p

200 papers

We propose a fast proximal Newton-type algorithm for minimizing regularized finite sums that returns an $\epsilon$-suboptimal point in $\tilde{\mathcal{O}}(d(n + \sqrt{\kappa d})\log(\frac{1}{\epsilon}))$ FLOPS, where $n$ is number of…

Machine Learning · Computer Science 2017-08-30 Xuanqing Liu , Cho-Jui Hsieh , Jason D. Lee , Yuekai Sun

Let $P_1,...,P_n$ be generic homogeneous polynomials in $n$ variables of degrees $d_1,...,d_n$ respectively. We prove that if $\nu$ is an integer satisfying ${\sum_{i=1}^n d_i}-n+1-\min\{d_i\}<\nu,$ then all multivariate subresultants…

Algebraic Geometry · Mathematics 2007-05-23 Laurent Busé , Carlos D'Andrea

The $3k-4$ Theorem asserts that, if $A,\,B\subseteq \mathbb Z$ are finite, nonempty subsets with $|A|\geq |B|$ and $|A+B|=|A|+|B|+r< |A|+2|B|-3$, then there are arithmetic progressions $P_A$ and $P_B$ of common difference with $X\subseteq…

Number Theory · Mathematics 2024-02-26 David J. Grynkiewicz

We develop the foundations of a general framework for producing optimal upper and lower bounds on the sum $\sum_p a_p$ over primes $p$, where $(a_n)_{x/2<n\le x}$ is an arbitrary non-negative sequence satisfying Type I and Type II…

Number Theory · Mathematics 2024-07-22 Kevin Ford , James Maynard

The generalized smooth condition, $(L_{0},L_{1})$-smoothness, has triggered people's interest since it is more realistic in many optimization problems shown by both empirical and theoretical evidence. Two recent works established the…

Machine Learning · Computer Science 2023-10-31 Zijian Liu , Srikanth Jagabathula , Zhengyuan Zhou

In this paper, we consider Barron functions $f : [0,1]^d \to \mathbb{R}$ of smoothness $\sigma > 0$, which are functions that can be written as \[ f(x) = \int_{\mathbb{R}^d} F(\xi) \, e^{2 \pi i \langle x, \xi \rangle} \, d \xi \quad…

Functional Analysis · Mathematics 2022-08-17 Felix Voigtlaender

Given a subset of $\mathbb C$ containing $x,y$, one can add $x + y,\,x - y,\,xy$ or (when $y\ne0$) $x/y$ or any $z$ such that $z^2=x$. Let $p$ be a prime Fermat number. We prove that it is possible to obtain from $\{1\}$ a set containing…

Number Theory · Mathematics 2018-03-19 Eugene Kogan

Following Stolarsky, we say that a natural number n is flimsy in base b if some positive multiple of n has smaller digit sum in base b than n does; otherwise it is sturdy. We develop algorithmic methods for the study of sturdy and flimsy…

Data Structures and Algorithms · Computer Science 2020-02-10 Trevor Clokie , Thomas F. Lidbetter , Antonio Molina Lovett , Jeffrey Shallit , Leon Witzman

In the recent years so-called Morrey smoothness spaces attracted a lot of interest. They can (also) be understood as generalisations of the classical spaces $A^s_{p,q} (\mathbb{R}^n)$, $A\in \{B,F\}$, in $\mathbb{R}^n$, where the parameters…

Functional Analysis · Mathematics 2021-10-22 Dorothee D. Haroske , Hans Triebel

Let $f$ be a half-integral weight cusp form of level $4N$ for odd and squarefree $N$ and let $a(n)$ denote its $n^{\rm th}$ normalized Fourier coefficient. Assuming that all the coefficients $a(n)$ are real, we study the sign of $a(n)$ when…

Number Theory · Mathematics 2020-07-14 Corentin Darreye

Let $M$ be a compact smooth manifold with corners and $N$ be a finite dimensional smooth manifold without boundary which admits local addition. We define a smooth manifold structure to general sets of continuous mapings $\mathcal{F}(M,N)$…

Differential Geometry · Mathematics 2025-10-03 Matthieu F. Pinaud

We formulate an affine invariant implementation of the accelerated first-order algorithm in Nesterov (1983). Its complexity bound is proportional to an affine invariant regularity constant defined with respect to the Minkowski gauge of the…

Optimization and Control · Mathematics 2016-11-29 Alexandre d'Aspremont , Cristóbal Guzmán , Martin Jaggi

We demonstrate $k+1$-term arithmetic progressions in certain subsets of the real line whose "higher-order Fourier dimension" is sufficiently close to 1. This Fourier dimension, introduced in previous work, is a higher-order (in the sense of…

Classical Analysis and ODEs · Mathematics 2015-01-20 Marc Carnovale

We make use of a result of Hurwitz and Reznick, and a consequence of this result due to Fidalgo and Kovacec, to determine a new sufficient condition for a polynomial $f\in\mathbb{R}[X_1,...,X_n]$ of even degree to be a sum of squares. This…

Optimization and Control · Mathematics 2012-11-15 Mehdi Ghasemi , Murray Marshall

For a large prime $p$, and a polynomial $f$ over a finite field $F_p$ of $p$ elements, we obtain a lower bound on the size of the multiplicative subgroup of $F_p^*$ containing $H\ge 1$ consecutive values $f(x)$, $x = u+1, \ldots, u+H$,…

Number Theory · Mathematics 2014-01-28 Igor E. Shparlinski

We fix a gap in our proof of an upper bound for the number of positive integers $n\le x$ for which the Euler function $\varphi(n)$ has all prime factors at most $y$. While doing this we obtain a stronger, likely best-possible result.

Number Theory · Mathematics 2018-09-06 W. D. Banks , J. B. Friedlander , C. Pomerance , I. E. Shparlinski

In a previous work, we showed that Besov spaces do not enjoy the restriction property unless $q\leq p$. Specifically, we proved that if $p<q$, then it is always possible to construct a function $f\in B_{p,q}^s(\mathbb{R}^N)$ such that…

Functional Analysis · Mathematics 2025-10-16 Julien Brasseur

Let $f\in\Bbb F_q[X_1,\dots,X_n]$ with $\deg f=d>0$ and let $Z(f)=\{(x_1,\dots,x_n)\in \Bbb F_q^n: f(x_1,\dots,x_n)=0\}$. Ax's theorem states that $|Z(f)|\equiv 0\pmod {q^{\lceil n/d\rceil-1}}$, that is, $\nu_p(|Z(f)|)\ge m(\lceil…

Number Theory · Mathematics 2015-12-17 Xiang-dong Hou

In this note, an upper bound for the sum of fractional parts of certain smooth functions is established. Such sums arise naturally in numerous problems of analytic number theory. The main feature is here an improvement of the main term due…

Number Theory · Mathematics 2019-01-03 Olivier Bordellès

Soft extrapolation refers to the problem of recovering a function from its samples, multiplied by a fast-decaying window and perturbed by an additive noise, over an interval which is potentially larger than the essential support of the…

Numerical Analysis · Mathematics 2018-12-26 Dmitry Batenkov , Laurent Demanet , Hrushikesh N. Mhaskar
‹ Prev 1 8 9 10 Next ›