English
Related papers

Related papers: The Beurling-Selberg Box Minorant Problem via Line…

200 papers

Band-limited functions are fundamental objects that are widely used in systems theory and signal processing. In this paper we refine a recent nonparametric, nonasymptotic method for constructing simultaneous confidence regions for…

Machine Learning · Statistics 2026-01-27 Balázs Csanád Csáji , Bálint Horváth

Among functions majorized by indicator functions of sets with measure one, which functions have maximal Fourier transforms in the $L^q$ norm? We partially prove the existence of such functions using techniques from additive combinatorics to…

Classical Analysis and ODEs · Mathematics 2019-08-28 Dominique Maldague

We prove new lower bounds on the maximum size of subsets $A\subseteq \{1,\dots,N\}$ or $A\subseteq \mathbb{F}_p^n$ not containing three-term arithmetic progressions. In the setting of $\{1,\dots,N\}$, this is the first improvement upon a…

Number Theory · Mathematics 2024-06-19 Christian Elsholtz , Zach Hunter , Laura Proske , Lisa Sauermann

Let X be a UMD space with type t and cotype q, and let T be a Fourier multiplier operator with a scalar-valued symbol m. If the Mihlin multiplier estimate holds for all partial derivatives of m up to the order n/max(t,q')+1, then T is…

Functional Analysis · Mathematics 2009-09-18 Tuomas P. Hytönen

In this paper, we first determine the minimum possible size of an Fq-linear set of rank k in PG(1, q^n). We obtain this result by relating it to the number of directions determined by a linearized polynomial whose domain is restricted to a…

Combinatorics · Mathematics 2018-04-23 Jan De Beule , Geertrui Van de Voorde

We generalize the idea of a multiplier in two different ways and generalize a recent result of Geiss, Montomery-Smith and Saksman. First of all, we consider multipliers in the form of a vector acting on a scalar function. Using this…

Classical Analysis and ODEs · Mathematics 2011-10-26 Nicholas Boros , Alexander Volberg

This short note presents a linear algebraic approach to proving dimension lower bounds for linear methods that solve $L^2$ function approximation problems. The basic argument has appeared in the literature before (e.g., Barron, 1993) for…

Machine Learning · Computer Science 2025-08-20 Daniel Hsu

Chapter 1 deals with the problem of the existence of an upper/lower envelope from a convex cone or, more generally, a convex set for functions on the projective limit of vector lattices with values in the completion of the Kantorovich space…

Functional Analysis · Mathematics 2018-12-31 B. N. Khabibullin , A. P. Rozit , E. B. Khabibullina

The present paper pioneers the study of the Dirichlet problem with $L^q$ boundary data for second order operators with complex coefficients in domains with lower dimensional boundaries, e.g., in $\Omega := \mathbb R^n \setminus \mathbb R^d$…

Analysis of PDEs · Mathematics 2018-10-17 Joseph Feneuil , Svitlana Mayboroda , Zihui Zhao

This paper discusses the frequency function of multiple-valued Dirichlet minimizing functions in the special case when the domain and range are both two dimensional. It shows that the frequency function must be of value k/2 for some…

Analysis of PDEs · Mathematics 2007-05-23 Wei Zhu

We study the existence of polynomial kernels for the problem of deciding feasibility of integer linear programs (ILPs), and for finding good solutions for covering and packing ILPs. Our main results are as follows: First, we show that the…

Computational Complexity · Computer Science 2013-02-18 Stefan Kratsch

An upper bound of the variation of argument of a holomorphic function along a curve on a Riemann surface is given. This bound is expressed through the Bernstein index of the function multiplied by a geometric constant. The Bernstein index…

Dynamical Systems · Mathematics 2007-05-23 Yulij Ilyashenko

In recent years, many connections have been made between minimal codes, a classical object in coding theory, and other remarkable structures in finite geometry and combinatorics. One of the main problems related to minimal codes is to give…

Information Theory · Computer Science 2023-02-13 Martin Scotti

We study lower bounds for the norm of the product of polynomials and their applications to the so called \emph{plank problem.} We are particularly interested in polynomials on finite dimensional Banach spaces, in which case our results…

Functional Analysis · Mathematics 2016-06-07 Daniel Carando , Damian Pinasco , Jorge Tomás Rodríguez

In this note, we study the size of the support of integer solutions to linear equations $Ax=b, ~x\in\Z^n$ where $A\in\Z^{m\times n}, b\in\Z^n$. We give an upper bound on the smallest support size as a function of $A$, taken as a worst case…

Optimization and Control · Mathematics 2025-03-04 Yatharth Dubey , Siyue Liu

We study Fourier frames of exponentials on fractal measures associated with a class of affine iterated function systems. We prove that, under a mild technical condition, the Beurling dimension of a Fourier frame coincides with the Hausdorff…

Functional Analysis · Mathematics 2010-06-07 Dorin Ervin Dutkay , Deguang Han , Qiyu Sun , Eric Weber

We introduce a class of dimension reduction estimators based on an ensemble of the minimum average variance estimates of functions that characterize the central subspace, such as the characteristic functions, the Box--Cox transformations…

Statistics Theory · Mathematics 2012-03-16 Xiangrong Yin , Bing Li

We solve the Neumann problem in the half space $\mathbb{R}^{n+1}_+$, for higher order elliptic differential equations with variable self-adjoint $t$-independent coefficients, and with boundary data in the negative smoothness space $\dot…

Analysis of PDEs · Mathematics 2019-07-01 Ariel Barton

We consider the classical problem of determining the largest possible cardinality of a minimal presentation of a numerical monoid with given embedding dimension and multiplicity. Very few values of this cardinality are known. In addressing…

Combinatorics · Mathematics 2025-05-14 Alessio Moscariello , Alessio Sammartano

In this paper, we focus on a q-analogue of the Riemann zeta function at positive integers, which can be written for s\in\N^* by \zeta_q(s)=\sum_{k\geq 1}q^k\sum_{d|k}d^{s-1}. We give a new lower bound for the dimension of the vector space…

Combinatorics · Mathematics 2007-12-12 Frederic Jouhet , Elie Mosaki