当前位置: X-MOL 学术Probl. Inf. Transm. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Exponentially Ramsey Sets
Problems of Information Transmission ( IF 1.2 ) Pub Date : 2019-01-28 , DOI: 10.1134/s0032946018040051
A. A. Sagdeev

We study chromatic numbers of spaces \(\mathbb{R}_p^n=(\mathbb{R}^n, \ell_p)\) with forbidden monochromatic sets. For some sets, we for the first time obtain explicit exponentially growing lower bounds for the corresponding chromatic numbers; for some others, we substantially improve previously known bounds.

中文翻译:

指数拉姆西集

我们研究带有禁止单色集的空间的色数\(\ mathbb {R} _p ^ n =(\ mathbb {R} ^ n,\ ell_p)\)。对于某些集合,我们首次获得了对应色数的显式指数增长下界。对于其他一些,我们大大改善了先前已知的界限。
更新日期:2019-01-28
down
wechat
bug