English
Related papers

Related papers: A constrained optimization problem for the Fourier…

200 papers

The use of function contracts to specify the behavior of functions often remains limited to the scope of a single function call. Relational properties link several function calls together within a single specification. They can express more…

Software Engineering · Computer Science 2022-05-18 Lionel Blatter , Nikolai Kosmatov , Virgile Prevosto , Pascale Le Gall

The partition function of the q-state Potts model with random ferromagnetic couplings in the large-q limit is generally dominated by the contribution of a single diagram of the high temperature expansion. Computing this dominant diagram…

Statistical Mechanics · Physics 2007-05-23 J-Ch. Angles d'Auriac , F. Igloi , M. Preissmann , A. Sebo

We show a pointwise estimate for the Fourier transform on the line involving the number of times the function changes monotonicity. The contrapositive of the theorem may be used to find a lower bound to the number of local maxima of a…

Classical Analysis and ODEs · Mathematics 2009-11-02 Ryan Berndt

Motivated by various problems in physics and applied mathematics, we look for constraints and properties of real Fourier-positive functions, i.e. with positive Fourier transforms. Properties of the "Dirac comb" distribution and of its…

Mathematical Physics · Physics 2016-05-25 Bertrand G. Giraud , Robi Peschanski

Motivated by a growing list of nontraditional statistical estimation problems of the piecewise kind, this paper provides a survey of known results supplemented with new results for the class of piecewise linear-quadratic programs. These are…

Optimization and Control · Mathematics 2018-08-16 Ying Cui , Tsung-Hui Chang , Mingyi Hong , Jong-Shi Pang

For functions $f(x_{1},x_{2})=f_{0}\big(\max\{|x_{1}|,|x_{2}|\}\big)$ from $L_{1}(\mathbb{R}^{2})$, sufficient and necessary conditions for the belonging of their Fourier transform $\widehat{f}$ to $L_{1}(\mathbb{R}^{2})$ as well as of a…

Classical Analysis and ODEs · Mathematics 2015-12-11 R. M. Trigub

We employ the notions of `sequential function' and `interrogation' (dialogue) in order to define new partial combinatory algebra structures on sets of functions. These structures are analyzed using J. Longley's preorder-enriched category of…

Logic · Mathematics 2009-05-19 Jaap van Oosten

In this note we find optimal one-sided majorants of exponential type for the signum function subject to certain monotonicity conditions. As an application, we use these special functions to obtain a simple Fourier analysis proof of the…

Classical Analysis and ODEs · Mathematics 2023-07-04 Emanuel Carneiro , Friedrich Littmann

We investigate the $L_p \mapsto L_q$ boundedness of the Fourier multipliers. We obtain sufficient conditions, namely, we derive Hormander and Lizorkin type theorems. We also obtain the necessary conditions. For $M$-generalized monotone…

Functional Analysis · Mathematics 2022-10-21 Medet Nursultanov

We give an exposition of some connections between Fourier optimization problems and problems in number theory. In particular, we present some recent conditional bounds under the generalized Riemann hypothesis, achieved via a Fourier…

Number Theory · Mathematics 2024-11-11 Emily Quesada-Herrera

We introduce a general framework for the reconstruction of periodic multivariate functions from finitely many and possibly noisy linear measurements. The reconstruction task is formulated as a penalized convex optimization problem, taking…

Optimization and Control · Mathematics 2020-12-02 Julien Fageot , Matthieu Simeoni

We prove three results concerning convolution operators and lacunary maximal functions associated to dilates of measures. First, we obtain an $H^1$ to $L^{1,\infty}$ bound for lacunary maximal operators under a dimensional assumption on the…

Classical Analysis and ODEs · Mathematics 2012-03-20 Andreas Seeger , James Wright

We consider constraints on the measure of the support for integrable functions on arbitrary measure spaces. It is shown that this non-convex and discontinuous constraint can be equivalently reformulated by the difference of two convex and…

Optimization and Control · Mathematics 2024-10-21 Bastian Dittrich , Daniel Wachsmuth

The aim of this paper is to exhibit a necessary and sufficient condition of optimality for functionals depending on fractional integrals and derivatives, on indefinite integrals and on presence of time delay. We exemplify with one example,…

Classical Analysis and ODEs · Mathematics 2015-12-22 Ricardo Almeida

We propose a general method for optimization with semi-infinite constraints that involve a linear combination of functions, focusing on the case of the exponential function. Each function is lower and upper bounded on sub-intervals by…

Optimization and Control · Mathematics 2014-01-13 Bogdan Dumitrescu , Bogdan C. Sicleru , Florin Avram

We characterize the approximate monomial complexity, sign monomial complexity , and the approximate L 1 norm of symmetric functions in terms of simple combinatorial measures of the functions. Our characterization of the approximate L 1 norm…

Computational Complexity · Computer Science 2017-04-12 Anil Ada , Omar Fawzi , Raghav Kulkarni

Fourier restriction theorems, whose study had been initiated by E.M. Stein, usually describe a family of a priori estimates of the L^q-norm of the restriction of the Fourier transform of a function f in L^p (say, on Euclidean space) to a…

Classical Analysis and ODEs · Mathematics 2016-12-16 Detlef Müller , Fulvio Ricci , James Wright

Under the assumption that orthogonal polynomials of several variables admit an addition formula, we can define a convolution structure and use it to study the Fourier orthogonal expansions on a homogeneous space. We define a maximal…

Classical Analysis and ODEs · Mathematics 2021-12-07 Yuan Xu

In this article, we establish various facts about extremizers for $L^p$-improving convolution operators $T\colon L^p \rightarrow L^q$ associated with compactly-supported probability measures on either $\mathbb{R}^d$ or $\mathbb{T}^d$ . If…

Classical Analysis and ODEs · Mathematics 2023-11-14 James Tautges

Optimization is a key task in a number of applications. When the set of feasible solutions under consideration is of combinatorial nature and described in an implicit way as a set of constraints, optimization is typically NP-hard.…

Artificial Intelligence · Computer Science 2014-10-27 Daniel Le Berre , Emmanuel Lonca , Pierre Marquis