Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference14 articles.
1. P. Erdős: On a lemma of Littlewood and Offord, Bull. Amer. Math. Soc. 51 (1945), 898–902.
2. P. Erdős: Extremal problems in number theory, 1965, Proc. Sympos. Pure Math., Vol. VIII pp. 181–189 Amer. Math. Soc., Providence, R.I.
3. P. Frankl and Z. Füredi: Solution of the Littlewood-Offord problem in high dimensions, Ann. of Math. 128(2) (1988), 259–270.
4. J. Griggs, J. Lagarias, A. Odlyzko and J. Shearer: On the tightest packing of sums of vectors, European J. Combin. 4(3) (1983), 231–236.
5. G. Halász: Estimates for the concentration function of combinatorial number theory and probability, Period. Math. Hungar. 8(3–4) (1977), 197–211.
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The singularity probability of a random symmetric matrix is exponentially small;Journal of the American Mathematical Society;2024-01-19
2. Matrix anti-concentration inequalities with applications;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09
3. Fooling Polytopes;Journal of the ACM;2022-01-31
4. On the number of Hadamard matrices via anti-concentration;Combinatorics, Probability and Computing;2021-09-10
5. Anti-concentration for subgraph counts in random graphs;The Annals of Probability;2021-04-01