Preprint
Article

This version is not peer-reviewed.

L2 Boundedness of Discrete Double Hilbert Transform Along polynomials

Submitted:

11 October 2021

Posted:

13 October 2021

Read the latest preprint version here

Abstract
We will show $L^{2}$ boundedness of Discrete Double Hilbert Transform along polynomials satisfying some conditions. Double Hilbert exponential sum along polynomials:$\mu(\xi)$ is Fourier multiplier of discrete double Hilbert transform along polynomials. In chapter 1, we define the reverse Newton diagram. In chapter 2, We make approximation formula for the multiplier of one valuable discrete Hilbert transform by study circle method. In chapter 3, We obtain result that $\mu(\xi)$ is bounded by constants if $|D|\geq2$ or all $(m,n)$ are not on one line passing through the origin. We study property of $1/(qt^{n})$ and use circle method (Propsotion 2.1) to calculate sums. We also envision combinatoric thinking about $\mathbb{N}^{2}$ lattice points in j-k plane for some estimates. Finally, we use geometric property of some inequalities about $(m,n)\in\Lambda$ to prove Theorem 3.3. In chapter 4, We obtain the fact that $\mu(\xi)$ is bounded by sums which are related to $\log_{2}({\xi_{1}-a_{1}\slash {q}})$ and $\log_{2}({\xi_{2}-a_{2}\slash {q}})$ and the boundedness of double Hilbert exponential sum for even polynomials with torsion without conditions in Theorem 3.3. We also use $\mathbb{N}^{2}$ lattice points in j-k plane and Proposition 2.1 which are shown in chapter 2 and some estimates to show that Fourier multiplier of discrete double Hilbert transform is bounded by terms about $\log$ and integral this with torsion is bounded by constants.
Keywords: 
;  ;  ;  ;  ;  ;  
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

Disclaimer

Terms of Use

Privacy Policy

Privacy Settings

© 2025 MDPI (Basel, Switzerland) unless otherwise stated