RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive

Probl. Peredachi Inf., 2018 Volume 54, Issue 4, Pages 82–109 (Mi ppi2282)

This article is cited in 14 papers

Large Systems

Exponentially Ramsey sets

A. A. Sagdeev

Laboratory of Advanced Combinatorics and Network Applications, Moscow Institute of Physics and Technology (State University), Moscow, Russia

Abstract: We study chromatic numbers of spaces $\mathbb{R}^n_p=(\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.

UDC: 621.391.1:519.1

Received: 08.12.2017
Revised: 17.06.2018
Accepted: 13.11.2018


 English version:
Problems of Information Transmission, 2018, 54:4, 372–396

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024