相关论文: Sharp bounds for $t$-Haar multipliers on $L^2$

Previous work of the second author and Wolf showed that given a set $A\subseteq \mathbb{F}_p^n$ of bounded $\textrm{VC}_2$-dimension, there is a high rank quadratic factor $\mathcal{B}$ of bounded complexity such that $A$ is approximately…

In this expository paper, we mainly study orthogonal arrays (OAs) of strength two having a row that is repeated $m$ times. It turns out that the Plackett-Burman bound (\cite{PB}) can be strengthened by a factor of $m$ for orthogonal arrays…

We study sharp growth conditions for the boundedness of the Hardy-Littlewood maximal function in the generalized Orlicz spaces. We assume that the generalized Orlicz function $\phi(x, t)$ satisfies the standard continuity properties (A0),…

C. Stockdale, P. Villarroya, and B. Wick introduced the $\epsilon$-maximal operator to prove the Haar multiplier is bounded on the weighted spaces $L^p(w)$ for a class of weights larger than $A_p$. We prove the $\epsilon$-maximal operator…

Recently the matrix $A_2$ conjecture was disproved. Indeed, the growth of the vector Hilbert transform in the matrix weighted $L^2(W)$ space was shown to be at best a constant multiple of $[W]_{\mathbf{A}_2}^{3/2}$. This bound had…

We study Hardy classes on the disk associated to the equation $\bar\d w=\alpha\bar w$ for $\alpha\in L^r$ with $2\leq r<\infty$. The paper seems to be the first to deal with the case $r=2$. We prove an analog of the M.~Riesz theorem and a…

We extend a classical result by Triebel on boundedness of bandlimited multipliers on $L^p(\mathbb{R}^n)$, $0<p\leq 1$, to a vector-valued and matrix-weighted setting with boundedness of the bandlimited multipliers obtained on $L^p(W)$,…

We prove sharp homogeneous improvements to $L^1$ weighted Hardy inequalities involving distance from the boundary. In the case of a smooth domain, we obtain lower and upper estimates for the best constant of the remainder term. These…

We prove that there are 3-CNF formulas over n variables that can be refuted in resolution in width w but require resolution proofs of size n^Omega(w). This shows that the simple counting argument that any formula refutable in width w must…

In the context of CA conjecture for holographic complexity, we study the action growth rate at late time approximation for general quadratic curvature theory of gravity. We show how the Lloyd's bound saturates for charged and neutral black…

Let $A_q(n,d)$ be the maximum order (maximum number of codewords) of a $q$-ary code of length $n$ and Hamming distance at least $d$. And let $A(n,d,w)$ that of a binary code of constant weight $w$. Building on results from algebraic graph…

It is known that the inequality \begin{align*}\int_{-W/2}^{W/2}|\widehat{f}(\xi)|^2d\xi\leq \int_{-W/2}^{W/2}|\widehat{|f|^*}(\xi)|^2d\xi \end{align*} between the quadratic spectral concentration of a function and that of its decreasing…

We will show that for $q<p$ there exists an $\al < \infty$ such that \[ \pi_{pq}(T) \pl \le c_{pq} \pi_{pq}^{[n^{\alpha}]}(T) \mbox{for all $T$ of rank $n$.}\] Such a polynomial number is only possible if $q=2$ or $q<p$. Furthermore, the…

The dyadic paraproduct is bounded in weighted Lebesgue spaces $L_p(w)$ if and only if the weight $w$ belongs to the Muckenhoupt class $A_p^d$. However, the sharp bounds on the norm of the dyadic paraproduct are not known even in the…

We determine the higher weight spectra of $q$-ary Reed-Muller codes $C_q=RM_q(2,2)$ for all prime powers $q$. This is equivalent to finding the usual weight distributions of all extension codes of $C_q$ over every field extension of $F_q$…

The maximum size of a binary code is studied as a function of its length N, minimum distance D, and minimum codeword weight W. This function B(N,D,W) is first characterized in terms of its exponential growth rate in the limit as N tends to…

For 1<p<infty and for weight w in A_p, we show that the r-variation of the Fourier sums of any function in L^p(w) is finite a.e. for r larger than a finite constant depending on w and p. The fact that the variation exponent depends on w is…

In the recent work \cite{shi18}, a combinatorial problem concerning linear codes over a finite field $\F_q$ was introduced. In that work the authors studied the weight set of an $[n,k]_q$ linear code, that is the set of non-zero distinct…

In the present paper we shall establish n-dimensional Hardy's inequalities with non-doubling weight functions of the distance to the boundary, where the boundary is a $C^2$ class bounded domain of $R^N$. This work is essentially based on…

Recently, Brandt, Maus and Uitto [PODC'19] showed that, in a restricted setting, the dependency of the complexity of the distributed Lov\'asz Local Lemma (LLL) on the chosen LLL criterion exhibits a sharp threshold phenomenon: They proved…