Reverse Littlewood-Offord problem: lower bound for the number of choices of signs such that $|pm a_1dotspm...
$begingroup$
Let $n$ be a positive integer. For $mathbf{a}inmathbb R^n$ let $N(mathbf{a})$ be the number of choices of $epsilonin{-1,1}^n$ such that
$$Biggl|sum_{i=1}^nepsilon_ia_iBiggr|leq max_{1leq ileq n}|a_i|.$$
Example. for $n$ even and $a=(1,dots,1),$ we are counting $epsilon$ with $|sum_{i=1}^nepsilon_i|leq 1,$ which forces $epsilon$ to have exactly $n/2$ entries of $-1,$ so $N(1,dots,1)$ is the central binomial coefficient $binom{n}{n/2}.$
Is it true that $N(mathbf a)geq binom{n}{n/2}$ for even $n$?
I also have a conjectured lower bound for odd $n$ if you're interested. Define $$B_n=N(1,dots,1,tfrac12)=2binom{n-1}{lfloor (n-1)/2rfloor}=
begin{cases}
binom{n}{n/2}&text{ for $n$ even}\
2binom{n-1}{(n-1)/2}&text{ for $n$ odd.}
end{cases}
$$
I've confirmed $N(mathbf a)geq B_n$ by picking random vectors $mathbf{a}$ uniformly at random, but these tests aren't very convincing since it doesn't even find $B_n$ for $ngeq 9.$
For $n=3$ we always have $N(mathbf{a})geq B_3=4$: assume $1=a_1geq a_2geq a_3geq 0,$ then $a_1-a_2-a_3$ and $a_1-a_2+a_3$ and their negations all lie in $[-1,1].$
This would be a reversed form of the Littlewood-Offord problem, where Erdős showed there are at most $binom{n}{lfloor n/2rfloor}$ vectors $epsilonin{-1,1}^n$ such that $Bigl|sum_{i=1}^nepsilon_ia_iBigr|leq color{red}{min}_{1leq ileq n}|a_i|.$
It's a version of Tomaszewski's Problem with the $ell^2$ norm replaced by $ell^infty.$
I believe a positive answer would also provide a lower bound for the Minimum number of balanced partitions.
combinatorics inequality
asked Jan 14 at 15:25
DapDap
19.1k842
$endgroup$
add a comment |
$begingroup$
Let $n$ be a positive integer. For $mathbf{a}inmathbb R^n$ let $N(mathbf{a})$ be the number of choices of $epsilonin{-1,1}^n$ such that
$$Biggl|sum_{i=1}^nepsilon_ia_iBiggr|leq max_{1leq ileq n}|a_i|.$$
Example. for $n$ even and $a=(1,dots,1),$ we are counting $epsilon$ with $|sum_{i=1}^nepsilon_i|leq 1,$ which forces $epsilon$ to have exactly $n/2$ entries of $-1,$ so $N(1,dots,1)$ is the central binomial coefficient $binom{n}{n/2}.$
Is it true that $N(mathbf a)geq binom{n}{n/2}$ for even $n$?
I also have a conjectured lower bound for odd $n$ if you're interested. Define $$B_n=N(1,dots,1,tfrac12)=2binom{n-1}{lfloor (n-1)/2rfloor}=
begin{cases}
binom{n}{n/2}&text{ for $n$ even}\
2binom{n-1}{(n-1)/2}&text{ for $n$ odd.}
end{cases}
$$
I've confirmed $N(mathbf a)geq B_n$ by picking random vectors $mathbf{a}$ uniformly at random, but these tests aren't very convincing since it doesn't even find $B_n$ for $ngeq 9.$
For $n=3$ we always have $N(mathbf{a})geq B_3=4$: assume $1=a_1geq a_2geq a_3geq 0,$ then $a_1-a_2-a_3$ and $a_1-a_2+a_3$ and their negations all lie in $[-1,1].$
This would be a reversed form of the Littlewood-Offord problem, where Erdős showed there are at most $binom{n}{lfloor n/2rfloor}$ vectors $epsilonin{-1,1}^n$ such that $Bigl|sum_{i=1}^nepsilon_ia_iBigr|leq color{red}{min}_{1leq ileq n}|a_i|.$
It's a version of Tomaszewski's Problem with the $ell^2$ norm replaced by $ell^infty.$
I believe a positive answer would also provide a lower bound for the Minimum number of balanced partitions.
combinatorics inequality
asked Jan 14 at 15:25
DapDap
19.1k842
$endgroup$
add a comment |
$begingroup$
Let $n$ be a positive integer. For $mathbf{a}inmathbb R^n$ let $N(mathbf{a})$ be the number of choices of $epsilonin{-1,1}^n$ such that
$$Biggl|sum_{i=1}^nepsilon_ia_iBiggr|leq max_{1leq ileq n}|a_i|.$$
Example. for $n$ even and $a=(1,dots,1),$ we are counting $epsilon$ with $|sum_{i=1}^nepsilon_i|leq 1,$ which forces $epsilon$ to have exactly $n/2$ entries of $-1,$ so $N(1,dots,1)$ is the central binomial coefficient $binom{n}{n/2}.$
Is it true that $N(mathbf a)geq binom{n}{n/2}$ for even $n$?
I also have a conjectured lower bound for odd $n$ if you're interested. Define $$B_n=N(1,dots,1,tfrac12)=2binom{n-1}{lfloor (n-1)/2rfloor}=
begin{cases}
binom{n}{n/2}&text{ for $n$ even}\
2binom{n-1}{(n-1)/2}&text{ for $n$ odd.}
end{cases}
$$
I've confirmed $N(mathbf a)geq B_n$ by picking random vectors $mathbf{a}$ uniformly at random, but these tests aren't very convincing since it doesn't even find $B_n$ for $ngeq 9.$
For $n=3$ we always have $N(mathbf{a})geq B_3=4$: assume $1=a_1geq a_2geq a_3geq 0,$ then $a_1-a_2-a_3$ and $a_1-a_2+a_3$ and their negations all lie in $[-1,1].$
This would be a reversed form of the Littlewood-Offord problem, where Erdős showed there are at most $binom{n}{lfloor n/2rfloor}$ vectors $epsilonin{-1,1}^n$ such that $Bigl|sum_{i=1}^nepsilon_ia_iBigr|leq color{red}{min}_{1leq ileq n}|a_i|.$
It's a version of Tomaszewski's Problem with the $ell^2$ norm replaced by $ell^infty.$
I believe a positive answer would also provide a lower bound for the Minimum number of balanced partitions.
combinatorics inequality
asked Jan 14 at 15:25
DapDap
19.1k842
$endgroup$
Let $n$ be a positive integer. For $mathbf{a}inmathbb R^n$ let $N(mathbf{a})$ be the number of choices of $epsilonin{-1,1}^n$ such that
$$Biggl|sum_{i=1}^nepsilon_ia_iBiggr|leq max_{1leq ileq n}|a_i|.$$
Example. for $n$ even and $a=(1,dots,1),$ we are counting $epsilon$ with $|sum_{i=1}^nepsilon_i|leq 1,$ which forces $epsilon$ to have exactly $n/2$ entries of $-1,$ so $N(1,dots,1)$ is the central binomial coefficient $binom{n}{n/2}.$
Is it true that $N(mathbf a)geq binom{n}{n/2}$ for even $n$?
I also have a conjectured lower bound for odd $n$ if you're interested. Define $$B_n=N(1,dots,1,tfrac12)=2binom{n-1}{lfloor (n-1)/2rfloor}=
begin{cases}
binom{n}{n/2}&text{ for $n$ even}\
2binom{n-1}{(n-1)/2}&text{ for $n$ odd.}
end{cases}
$$
I've confirmed $N(mathbf a)geq B_n$ by picking random vectors $mathbf{a}$ uniformly at random, but these tests aren't very convincing since it doesn't even find $B_n$ for $ngeq 9.$
For $n=3$ we always have $N(mathbf{a})geq B_3=4$: assume $1=a_1geq a_2geq a_3geq 0,$ then $a_1-a_2-a_3$ and $a_1-a_2+a_3$ and their negations all lie in $[-1,1].$
This would be a reversed form of the Littlewood-Offord problem, where Erdős showed there are at most $binom{n}{lfloor n/2rfloor}$ vectors $epsilonin{-1,1}^n$ such that $Bigl|sum_{i=1}^nepsilon_ia_iBigr|leq color{red}{min}_{1leq ileq n}|a_i|.$
It's a version of Tomaszewski's Problem with the $ell^2$ norm replaced by $ell^infty.$
I believe a positive answer would also provide a lower bound for the Minimum number of balanced partitions.
combinatorics inequality
combinatorics inequality
asked Jan 14 at 15:25
DapDap
19.1k842
asked Jan 14 at 15:25
DapDap
19.1k842
edited Jan 30 at 8:04
Dap
asked Jan 14 at 15:25
DapDap
19.1k842
asked Jan 14 at 15:25
DapDap
19.1k842
asked Jan 14 at 15:25
DapDap
19.1k842
19.1k842
add a comment |
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3073343%2freverse-littlewood-offord-problem-lower-bound-for-the-number-of-choices-of-sign%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3073343%2freverse-littlewood-offord-problem-lower-bound-for-the-number-of-choices-of-sign%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
