A combinatorial theorem in group theory
E. G. Straus
Math. Comp. 29 (1975), 303-309
Primary 20F10; Secondary 05C15
Full-text PDF Free Access
Similar Articles |
Abstract: There is an anti-Ramsey theorem for inhomogeneous linear equations over a field, which is essentially due to R. Rado . This theorem is generalized to groups to get sharper quantitative and qualitative results. For example, it is shown that for any Abelian group A (written additively) and any mappings of A into itself there exists a k-coloring of A so that the inhomogeneous equation has no solutions with for all . Here the number of colors k can be chosen bounded by which depends on n alone and not on the or b. For non-Abelian groups an analogous qualitative result is proven when b is "residually compact". Applications to anti-Ramsey results in Euclidean geometry are given.
L. Graham, P.
L. Rothschild, J.
Spencer, and E.
G. Straus, Euclidean Ramsey theorems. I, J. Combinatorial
Theory Ser. A 14 (1973), 341–363. MR 0316277
Rado, Note on combinatorial analysis, Proc. London Math. Soc.
(2) 48 (1943), 122–160. MR 0009007
- P. ERDÖS, R. L. GRAHAM, P. MONTGOMERY, B. L. ROTHSCHILD, J. SPENCER & E. G. STRAUS, "Euclidean Ramsey theorems. I," J. Combinatorial Theory Ser. A, v. 14, 1973, pp. 341-363. MR 47 #4825. MR 0316277 (47:4825)
- R. RADO, "Note on combinatorial analysis," Proc. London Math. Soc. (2) v. 48, 1943, pp. 122-160. MR 5, 87. MR 0009007 (5:87a)
Retrieve articles in Mathematics of Computation
Retrieve articles in all journals
Euclidean Ramsey Theorem,
© Copyright 1975
American Mathematical Society