当前位置: X-MOL 学术Random Struct. Algorithms › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
An asymmetric random Rado theorem for single equations: The 0-statement
Random Structures and Algorithms ( IF 0.9 ) Pub Date : 2021-08-21 , DOI: 10.1002/rsa.21039
Robert Hancock 1, 2 , Andrew Treglown 3
Affiliation  

A famous result of Rado characterizes those integer matrices A which are partition regular, that is, for which any finite coloring of the positive integers gives rise to a monochromatic solution to the equation urn:x-wiley:rsa:media:rsa21039:rsa21039-math-0001. Aigner-Horev and Person recently stated a conjecture on the probability threshold for the binomial random set urn:x-wiley:rsa:media:rsa21039:rsa21039-math-0002 having the asymmetric random Rado property: given partition regular matrices urn:x-wiley:rsa:media:rsa21039:rsa21039-math-0003 (for a fixed urn:x-wiley:rsa:media:rsa21039:rsa21039-math-0004), however one r-colors urn:x-wiley:rsa:media:rsa21039:rsa21039-math-0005, there is always a color urn:x-wiley:rsa:media:rsa21039:rsa21039-math-0006 such that there is an i-colored solution to urn:x-wiley:rsa:media:rsa21039:rsa21039-math-0007. This generalizes the symmetric case, which was resolved by Rödl and Ruciński, and Friedgut, Rödl and Schacht. Aigner-Horev and Person proved the 1-statement of their asymmetric conjecture. In this paper, we resolve the 0-statement in the case where the urn:x-wiley:rsa:media:rsa21039:rsa21039-math-0008 correspond to single linear equations. Additionally we close a gap in the original proof of the 0-statement of the (symmetric) random Rado theorem.

中文翻译:

单个方程的非对称随机 Rado 定理:0 语句

Rado 的一个著名结果表征了那些是分区规则的整数矩阵A,也就是说,对于正整数的任何有限着色都会产生方程的单色解骨灰盒:x-wiley:rsa:媒体:rsa21039:rsa21039-math-0001。Aigner-Horev 和 Person 最近提出了一个关于骨灰盒:x-wiley:rsa:媒体:rsa21039:rsa21039-math-0002具有非对称随机 Rado 属性的二项式随机集的概率阈值的猜想:给定分区正则矩阵骨灰盒:x-wiley:rsa:媒体:rsa21039:rsa21039-math-0003(对于一个固定的骨灰盒:x-wiley:rsa:媒体:rsa21039:rsa21039-math-0004),无论是一个r -colors 骨灰盒:x-wiley:rsa:媒体:rsa21039:rsa21039-math-0005,总有一种颜色骨灰盒:x-wiley:rsa:媒体:rsa21039:rsa21039-math-0006使得存在一个i色的解决方案骨灰盒:x-wiley:rsa:媒体:rsa21039:rsa21039-math-0007. 这概括了由 Rödl 和 Ruciński 以及 Friedgut、Rödl 和 Schacht 解决的对称情况。Aigner-Horev 和 Person 证明了他们的不对称猜想的 1-陈述。在本文中,我们解决了骨灰盒:x-wiley:rsa:媒体:rsa21039:rsa21039-math-0008对应于单个线性方程组的情况下的 0 语句。此外,我们在(对称)随机 Rado 定理的 0 陈述的原始证明中填补了空白。
更新日期:2021-08-21
down
wechat
bug