English
Related papers

Related papers: Sharp bounds for $t$-Haar multipliers on $L^2$

200 papers

Let $w_\alpha(t) := t^{\alpha}\,e^{-t}$, where $\alpha > -1$, be the Laguerre weight function, and let $\|\cdot\|_{w_\alpha}$ be the associated $L_2$-norm, $$ \|f\|_{w_\alpha} = \left\{\int_{0}^{\infty} |f(x)|^2…

Classical Analysis and ODEs · Mathematics 2017-05-11 Geno Nikolov , Alexei Shadrin

Given an elliptic curve E over Q with complex multiplication having good reduction at 2, we investigate the 2-adic valuation of the algebraic part of the L-value at 1 for a family of quadratic twists. In particular, we prove a lower bound…

Number Theory · Mathematics 2013-04-09 John Coates , Minhyong Kim , Zhibin Liang , Chunlai Zhao

We prove the following correction theorem: every function $f$ on the circumference $\mathbb{T}$ that is bounded by the $\alpha_1$-weight $w$ (this means that $Mw^2 \leq C w^2$) can be modified on a set $e$ with $\int\limits_{e} w \leq \eps$…

Functional Analysis · Mathematics 2016-04-07 D. M. Stolyarov

Projective Reed-Muller codes correspond to subcodes of the Reed-Muller code in which the polynomials being evaluated to yield codewords, are restricted to be homogeneous. The Generalized Hamming Weights (GHW) of a code ${\cal C}$, identify…

Information Theory · Computer Science 2018-06-07 Vinayak Ramkumar , Myna Vajha , P. Vijay Kumar

For any Calder\'on-Zygmund operator $ T$, any weight $ w$, and $ \alpha >1$, the operator $ T$ is bounded as a map from $ L ^{1} (M _{ L \log\log L (\log\log\log L) ^{\alpha } } w )$ into weak-$L^1(w)$. The interest in questions of this…

Classical Analysis and ODEs · Mathematics 2018-11-06 Carlos Domingo-Salazar , Michael T. Lacey , Guillermo Rey

We solve the Kato square root problem for parabolic operators of arbitrary order $2m$ whose coefficients are allowed to depend on both space and time in a merely measurable way and possess boundedness and ellipticity controlled by a…

Analysis of PDEs · Mathematics 2025-11-10 Guoming Zhang

A codeword is associated to a linearized polynomial. The weight distribution of the codewords is determined as the linearized polynomial varies in a family of fixed degree. There is a corresponding result on Wenger graphs from linearized…

Information Theory · Computer Science 2015-02-17 Haode Yan , Chunlei Liu

This paper concerns an analytic and numerical analysis of a class of weighted singular Cauchy integrals with exponential weights $w:=\exp(-Q)$ with finite moments and with smooth external fields $Q:\mathbb R\to [0,\infty)$, with varying…

Classical Analysis and ODEs · Mathematics 2022-08-10 S. B. Damelin , K. Diethelm

We study the boundedness of commutators of the Hardy-Littlewood maximal function and the sharp maximal function on weighted Morrey spaces when the symbols of the commutators belong to weighted Lipschitz spaces. Some new characterizations…

Classical Analysis and ODEs · Mathematics 2023-09-06 Pu Zhang , Di Fan

In this paper we compute the asymptotic behavior of the recurrence coefficients for polynomials orthogonal with respect to a logarithmic weight $w(x){\rm d}x = \log \frac{2k}{1-x}{\rm d}x$ on $(-1,1)$, $k > 1$, and verify a conjecture of…

Classical Analysis and ODEs · Mathematics 2018-06-13 Thomas Oliver Conway , Percy Deift

For each $t\in\mathbb{Q}\setminus\{-1,0,1\}$, define an elliptic curve over $\mathbb{Q}$ by \begin{align*} E_t:y^2=x(x+1)(x+t^2). \end{align*} Using a formula for the root number $W(E_t)$ as a function of $t$ and assuming some standard…

Number Theory · Mathematics 2023-10-05 Jonathan Love

Let $X, Y$ be two complex manifolds of dimension 1 which are countable at infinity, let $D\subset X,$ $ G\subset Y$ be two open sets, let $A$ (resp. $B$) be a subset of $\partial D$ (resp. $\partial G$), and let $W$ be the 2-fold cross…

Complex Variables · Mathematics 2007-05-23 Peter Pflug , Viet-Anh Nguyen

What is the maximum possible value of the lead coefficient of a degree $d$ polynomial $Q(x)$ if $|Q(1)|,|Q(2)|,\ldots,|Q(k)|$ are all less than or equal to one? More generally we write $L_{d,[x_k]}(x)$ for what we prove to be the unique…

Number Theory · Mathematics 2015-06-11 Karl Levy

We define a measure of "complexity" of a braid which is natural with respect to both an algebraic and a geometric point of view. Algebraically, we modify the standard notion of the length of a braid by introducing generators $\Delta\_{ij}$,…

Geometric Topology · Mathematics 2021-09-03 Ivan Dynnikov , Bert Wiest

We give a new characterization of character-automorphic Hardy spaces of order 2 and of their contractive multipliers in terms of de Branges Rovnyak spaces. Keys tools in our arguments are analytic extension and a factorization result for…

Complex Variables · Mathematics 2008-09-07 Daniel Alpay , Mamadou Mboup

Let $A=[A_{ij}]$ be an $n\times n$ operator matrix where each $A_{ij}$ is a bounded linear operator on a complex Hilbert space $\mathcal{H}$. With other numerical radius bounds via contraction operators, we show that $w(A) \leq…

Functional Analysis · Mathematics 2024-07-10 Pintu Bhunia

The (torsion) complexity of a finite edge-weighted graph is defined to be the order of the torsion subgroup of the abelian group presented by its Laplacian matrix. When G is d-periodic (i.e., G has a free action of the rank-d free abelian…

Combinatorics · Mathematics 2017-01-24 Daniel S. Silver , Susan G. Williams

We introduce a family of weight matrices $W$ of the form $T(t)T^*(t)$, $T(t)=e^{\mathscr{A}t}e^{\mathscr{D}t^2}$, where $\mathscr{A}$ is certain nilpotent matrix and $\mathscr{D}$ is a diagonal matrix with negative real entries. The weight…

Classical Analysis and ODEs · Mathematics 2011-02-09 Jorge Borrego , Mirta Castro , Antonio J. Durán

We use the Bellman function method to give an elementary proof of a sharp weighted estimate for the Haar shifts, which is linear in the $A_2$ norm of the weight and in the complexity of the shift. Together with the representation of a…

Classical Analysis and ODEs · Mathematics 2011-05-12 Sergei Treil

We prove that counting the analytic Brouwer degree of rational coefficient polynomial maps in $\operatorname{Map}(\mathbb C^d, \mathbb C^d)$ -- presented in degree-coefficient form -- is hard for the complexity class $\operatorname{\sharp…

Computational Complexity · Computer Science 2025-09-11 Somnath Chakraborty