Anticoncentration of Random Vectors via the Strong Perfect Graph Theorem

IF 1 2区数学 Q1 MATHEMATICS Combinatorica Pub Date : 2024-12-17 DOI:10.1007/s00493-024-00124-0

Tomas Juškevičius, Valentas Kurauskas

引用次数: 0

Abstract

In this paper we give anticoncentration bounds for sums of independent random vectors in finite-dimensional vector spaces. In particular, we asymptotically establish a conjecture of Leader and Radcliffe (SIAM J Discrete Math 7:90–101, 1994) and a question of Jones (SIAM J Appl Math 34:1–6, 1978). The highlight of this work is an application of the strong perfect graph theorem by Chudnovsky et al. (Ann Math 164:51–229, 2006) in the context of anticoncentration.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

通过强完美图定理反集中随机向量

本文给出了有限维向量空间中独立随机向量之和的反集中边界。特别是，我们渐近地建立了利德和拉德克里夫的猜想（SIAM J Discrete Math 7:90-101, 1994）和琼斯的问题（SIAM J Appl Math 34:1-6, 1978）。这项工作的亮点是 Chudnovsky 等人 (Ann Math 164:51-229, 2006) 在反集中背景下对强完美图定理的应用。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

Combinatorica 数学-数学

CiteScore

1.90

自引率

0.00%

发文量

审稿时长

>12 weeks

期刊介绍： COMBINATORICA publishes research papers in English in a variety of areas of combinatorics and the theory of computing, with particular emphasis on general techniques and unifying principles. Typical but not exclusive topics covered by COMBINATORICA are - Combinatorial structures (graphs, hypergraphs, matroids, designs, permutation groups). - Combinatorial optimization. - Combinatorial aspects of geometry and number theory. - Algorithms in combinatorics and related fields. - Computational complexity theory. - Randomization and explicit construction in combinatorics and algorithms.

期刊最新文献

Unfriendly Partition Conjecture Holds for Line Graphs Improved Upper Bound for the Size of a Trifferent Code Anticoncentration of Random Vectors via the Strong Perfect Graph Theorem Any Two-Coloring of the Plane Contains Monochromatic 3-Term Arithmetic Progressions Hamilton Transversals in Tournaments