Abstract
Let satisfy , and let be uniformly random signs and . It is conjectured that has . The best lower bound so far is , due to Oleszkiewicz. In this paper we improve this to .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.