On the best constants of Schur multipliers of second order divided difference functions
Martijn Caspers, Jesse Reimann

TL;DR
This paper provides new bounds and proofs for the boundedness of bilinear Schur multipliers related to second order divided difference functions, sharpening previous asymptotic bounds and establishing optimality in certain cases.
Contribution
The authors introduce a new proof technique using bilinear transference and the Hörmander-Mikhlin-Schur multiplier theorem, significantly improving bounds for second order divided difference functions.
Findings
Established upper bounds for Schur multipliers involving second order divided differences.
Proved lower bounds that match the upper bounds asymptotically, demonstrating optimality.
Sharpened the understanding of the constants involved in the boundedness of these multipliers.
Abstract
We give a new proof of the boundedness of bilinear Schur multipliers of second order divided difference functions, as obtained earlier by Potapov, Skripka and Sukochev in their proof of Koplienko's conjecture on the existence of higher order spectral shift functions. Our proof is based on recent methods involving bilinear transference and the H\"ormander-Mikhlin-Schur multiplier theorem. Our approach provides a significant sharpening of the known asymptotic bounds of bilinear Schur multipliers of second order divided difference functions. Furthermore, we give a new lower bound of these bilinear Schur multipliers, giving again a fundamental improvement on the best known bounds obtained by Coine, Le Merdy, Potapov, Sukochev and Tomskova. More precisely, we prove that for and with we have \[…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · graph theory and CDMA systems · Wireless Communication Networks Research
