English
Related papers

Related papers: On the Hardy--Littlewood majorant problem for arit…

200 papers

This paper deals with a class of neural SDEs and studies the limiting behavior of the associated sampled optimal control problems as the sample size grows to infinity. The neural SDEs with $N$ samples can be linked to the $N$-particle…

Optimization and Control · Mathematics 2025-06-19 Huafu Liao , Alpár R. Mészáros , Chenchen Mou , Chao Zhou

We give a weak factorization proof of the Hardy space $H^{p}(\mathbb{R}^{n})$ in the multilinear setting, for $\frac{n}{n+1} < p <1$. As a consequence, we obtain a characterization of the boundedness of the commutator $[b,T]$ from…

Classical Analysis and ODEs · Mathematics 2018-02-07 Marie-Jose S. Kuffner

Starting from the first Hardy-Littlewood conjecture some topics will be covered: an empirical approach to the distribution of the twin primes in classes mod(10) and a simplified proof of the Bruns theorem . Finally, it will be explored an…

History and Overview · Mathematics 2019-04-22 Marco Bortolomasi , Arturo Ortiz-Tapia

Let $D\ne \mathbb{C}$ be a simply connected domain and $f$ be the Riemann mapping from $\mathbb{D}$ onto $D$. The Hardy number of $D$ is the supremum of all $p$ for which $f$ belongs in the Hardy space ${H^p}\left( \mathbb{D} \right)$. A…

Complex Variables · Mathematics 2021-06-04 Christina Karafyllia

Let $\Lambda$ be the von Mangoldt function and $r_{\textit{HL}}(n) = \sum_{m_1 + m_2^2 = n} \Lambda(m_1),$ be the counting function for the Hardy-Littlewood numbers. Let $N$ be a sufficiently large integer. We prove that…

Number Theory · Mathematics 2018-06-22 Alessandro Languasco , Alessandro Zaccagnini

Let $M_G$ denotes the centered Hardy-Littlewood maximal function associated to the Carnot-Carath\'eodory distance or to the pseudo-distance associated to the fundamental solution of the Grushin operator on $\R_x^n \times \R_u$, $\Delta_G =…

Classical Analysis and ODEs · Mathematics 2012-07-16 Hong-Quan Li

This is a chapter from PhD Thesis by Stefano Biagi (advisor: prof. A. Bonfiglioli). We overview existing results showing that it is possible to generalize the classical Hardy's Inequality to more general linear partial differential…

Analysis of PDEs · Mathematics 2016-01-29 Stefano Biagi , Andrea Bonfiglioli

Let $\zeta = \xi + i\xi'$ where $\xi, \xi'$ are iid copies of a mean zero, variance one, subgaussian random variable. Let $N_n$ be a $n \times n$ random matrix with entries that are iid copies of $\zeta$. We prove that there exists a $c \in…

Probability · Mathematics 2017-10-10 Kyle Luh

In this paper we prove that the Hardy-Littlewood maximal operator is bounded on Morrey spaces $\mathcal{M}_{1,\lambda}(\rn)$, $0 \le \la < n$ for radial, decreasing functions on $\rn$

Classical Analysis and ODEs · Mathematics 2015-07-16 A. Gogatishvili , R. Ch. Mustafayev

Inspired by the potential of improving tractability via gap- or above-guarantee parametrisations, we investigate the complexity of Dominating Set when given a suitable lower-bound witness. Concretely, we consider being provided with a…

Data Structures and Algorithms · Computer Science 2019-06-24 Carl Einarson , Felix Reidl

We show upper bounds on the maximal dimension $d$ of Hilbert cubes $H=a_0+\{0,a_1\}+\cdots + \{0, a_d\}\subset S \cap [1, N]$ in several sets $S$ of arithmetic interest such as the squares, powerful numbers and pure powers.

Number Theory · Mathematics 2015-10-20 Rainer Dietmann , Christian Elsholtz

Let $S^{(\Lambda)}$ denote the classical Littlewood-Paley square function formed with respect to a lacunary sequence $\Lambda$ of positive integers. Motivated by a remark of Pichorides, we obtain sharp asymptotic estimates of the behaviour…

Classical Analysis and ODEs · Mathematics 2019-02-28 Odysseas Bakas

Let $N$ be a finite set, let $p \in (0,1)$, and let $N_p$ denote a random binomial subset of $N$ where every element of $N$ is taken to belong to the subset independently with probability $p$ . This defines a product measure $\mu_p$ on the…

Combinatorics · Mathematics 2014-09-25 Ehud Friedgut , Jeff Kahn , Clara Shikhelman

Large H-selfadjoint random matrices are considered. The matrix $H$ is assumed to have one negative eigenvalue, hence the matrix in question has precisely one eigenvalue of nonpositive type. It is showed that this eigenvalue converges in…

Functional Analysis · Mathematics 2012-06-29 Michal Wojtylak

The idea that many important classes of signals can be well-represented by linear combinations of a small set of atoms selected from a given dictionary has had dramatic impact on the theory and practice of signal processing. For practical…

Information Theory · Computer Science 2015-03-18 Quan Geng , Huan Wang , John Wright

We give a quantitative characterization of the pairs of weights $(w,v)$ for which the dyadic version of the one-sided Hardy-Littlewood maximal operator satisfies a restricted weak $(p,p)$ type inequality, for $1\leq p<\infty$. More…

Classical Analysis and ODEs · Mathematics 2021-05-25 Fabio Berra

In the Determinant Maximization problem, given an $n\times n$ positive semi-definite matrix $\bf{A}$ in $\mathbb{Q}^{n\times n}$ and an integer $k$, we are required to find a $k\times k$ principal submatrix of $\bf{A}$ having the maximum…

Data Structures and Algorithms · Computer Science 2024-02-20 Naoto Ohsaka

One of the main differences between the central limit theorem and the Poisson law of small numbers is that the former possesses the large sample property (LSP), i.e., the error of normal approximation to the sum of $n$ independent…

Probability · Mathematics 2019-06-25 Tianshu Cong , Aihua Xia , Fuxi Zhang

This note has a twofold purpose. To improve the best known lower estimates of the Hardy-Littlewood inequality for $m$-linear forms in $\ell_{p}$ spaces and to provide a closed formula encompassing the cases $p>2m$ and $% p=2m.$ Our approach…

Functional Analysis · Mathematics 2015-04-30 Daniel Pellegrino

The objective of this article is to formalize the definition of NP problems. We construct a mathematical model of discrete problems as independence systems with weighted elements. We introduce two auxiliary sets that characterize the…

Data Structures and Algorithms · Computer Science 2007-05-23 Anatoly D. Plotnikov