Tomaszewski's problem on randomly signed sums, revisited

Ravi B. Boppana, Harrie Hendriks, Martien C. A. van Zuijlen

备注：: Now with three authors. 4 pages
发表信息：: Electronic Journal of Combinatorics 28:2, #P2.35, 2021

英文摘要：

Let $v_1$, $v_2$, ..., $v_n$ be real numbers whose squares add up to 1. Consider the $2^n$ signed sums of the form $S = \sum \pm v_i$. Boppana and Holzman (2017) proved that at least 13/32 of these sums satisfy $|S| \le 1$. Here we improve their bound to $0.427685$.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Proof of Tomaszewski's Conjecture on Randomly Signed Sums

We prove the following conjecture, due to Tomaszewski (1986): Let $X= \sum_{i=1}^{n} a_{i} x_{i}$, where $\sum_i a_i^2=1$ and each $x_i$ is a uniformly random sign. Then $\Pr[|X|\leq 1] \geq 1/2$. Our main novel tools are local concentration inequalities and an improved Berry-Esseen inequality for Rademacher sums.

2021-08-03math.COmath.PR

Tomaszewski's Problem on Randomly Signed Sums: Breaking the 3/8 Barrier

Let $v_1$, $v_2$, ..., $v_n$ be real numbers whose squares add up to 1. Consider the $2^n$ signed sums of the form $S = \sum \pm v_i$. Holzman and Kleitman (1992) proved that at least 3/8 of these sums satisfy $|S| \le 1$. This 3/8 bound seems to be the best their method can achieve. Using a different method, we improve the bound to 13/32, thus breaking the 3/8 barrier.

2017-08-31math.COmath.PR

Improved Bound for Tomaszewski's Problem

In 1986, Tomaszewski made the following conjecture. Given $n$ real numbers $a_{1},...,a_{n}$ with $\sum_{i=1}^{n}a_{i}^{2}=1$, then of the $2^{n}$ signed sums $\pm a_{1} \pm ... \pm a_{n}$, at least half have absolute value at most $1$. Hendriks and Van Zuijlen (2020) and Boppana (2020) independently proved that a proportion of at least $0.4276$ of these sums has absolute value at most $1$. Using different techniques, we improve this bound to $0.46$.

2020-05-11math.COmath.PR

Vexillary signed permutations revisited

We study the combinatorial properties of vexillary signed permutations, which are signed analogues of the vexillary permutations first considered by Lascoux and Schützenberger. We give several equivalent characterizations of vexillary signed permutations, including descriptions in terms of essential sets and pattern avoidance, and we relate them to the vexillary elements introduced by Billey and Lam.

2018-06-04math.AGmath.CO

Springer Numbers and Arnold Families Revisited

For the calculation of Springer numbers (of root systems) of type $B_n$ and $D_n$, Arnold introduced a signed analogue of alternating permutations, called $β_n$-snakes, and derived recurrence relations for enumerating the $β_n$-snakes starting with $k$. The results are presented in the form of double triangular arrays ($v_{n,k}$) of integers, $1\le |k|\le n$. An Arnold family is a sequence of sets of such objects as $β_n$-snakes that are counted by $(v_{n,k})$. As a refinement of Arnold's result, we give analogous arrays of polynomials, defined by recurrence, for the calculation of the polynom…

2021-11-01math.CO