Symmetric monochromatic subsets in colorings of the Lobachevsky plane
نویسندگان
چکیده
We prove that for each partition of the Lobachevsky plane into finitely many Borel pieces one of the cells of the partition contains an unbounded centrally symmetric subset. It follows from [B1] (see also [BP1, Theorem 1]) that for each partition of the n-dimensional space R into n pieces one of the pieces contains an unbounded centrally symmetric subset. On the other hand, R admits a partition into (n+ 1) Borel pieces containing no unbounded centrally symmetric subset. For n = 2 such a partition is drawn at the picture: b b b b b " " " " " B0 B1 B2 Taking the same partition of the Lobachevsky plane H, we can see that each cell Bi does contain a unbounded centrally symmetric subset (for such a set just take any hyperbolic line lying in Bi). We call a subset S of the hyperbolic plane H 2 centrally symmetric or else symmetric with respect to a point c ∈ H if S = fc(S) where fc : H 2 → H is the involutive isometry ofH assigning to each point x ∈ H the unique point y ∈ H such that c is the midpoint of the segment [x, y]. The map fc is called the central symmetry of H 2 with respect to the point c. The following theorem shows that the Lobachevsky plane differs dramatically from the Euclidean plane from the Ramsey point of view. Theorem 1. For any partition H = B1 ∪ · · · ∪ Bm of the Lobachevsky plane into finitely many Borel pieces one of the pieces contains an unbounded centrally symmetric subset. Proof. We shall prove a bit more: given a partition H = B1 ∪ · · · ∪ Bm of the Lobachevsky plane into m Borel pieces we shall find i ≤ m and an unbounded subset S ⊂ Bi symmetric with respect to some point c in an arbitrarily small neighborhood of some finite set F ⊂ H depending only on m. To define this set F it will be convenient to work in the Poincaré model of the Lobachevsky plane H. In this model the hyperbolic plane H is identified with 1991 Mathematics Subject Classification. 05D10, 51M09, 54H09.
منابع مشابه
On Asymmetric Colorings of Integer Grids
Let ν(Z) be the minimal number of colors enough to color the m-dimensional integer grid Z so that there would be no infinite monochromatic symmetric subsets. Banakh and Protasov [3] compute ν(Z) = m + 1. For the one-dimensional case this just means that one can color positive integers in red, while negative in blue, thereby avoiding an infinite monochromatic symmetric subset by trivial reason. ...
متن کاملSymmetry and Colorings : Some Results
We survey some principal results and open problems related to colorings of algebraic and geometric objects endowed with symmetries. In this paper we give a survey of principal results and open problems related to colorings and symmetry. Starting in 1995 from seminal questions of I.V.Protasov [13],[15], the subject quickly tranformed into a field which can be considered as an independent branch ...
متن کاملJa n 20 09 SYMMETRY AND COLORINGS : SOME RESULTS AND OPEN PROBLEMS
We survey some principal results and open problems related to colorings of algebraic and geometric objects endowed with symmetries. In this paper we give a survey of principal results and open problems related to colorings and symmetry. Starting in 1995 from seminal questions of I.V.Protasov [13],[15], the subject quickly tranformed into a field which can be considered as an independent branch ...
متن کاملMonochrome Symmetric Subsets in Colorings of Finite Abelian Groups
A subset S of a group G is symmetric if there is an element g ∈ G such that gS−1g = S. We study some Ramsey type functions for symmetric subsets in finite Abelian groups.
متن کاملMonochromatic 4-term arithmetic progressions in 2-colorings of Zn
This paper is motivated by a recent result of Wolf [12] on the minimum number of monochromatic 4-term arithmetic progressions (4-APs, for short) in Zp, where p is a prime number. Wolf proved that there is a 2-coloring of Zp with 0.000386% fewer monochromatic 4-APs than random 2-colorings; the proof is probabilistic and non-constructive. In this paper, we present an explicit and simple construct...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics & Theoretical Computer Science
دوره 12 شماره
صفحات -
تاریخ انتشار 2010