Department of Mathematics, University of Connecticut, Storrs, Connecticut 06269-3009
Abstract:
Fix an integer and consider real -dimensional . A partition of avoids the polynomial , where each is an -tuple of variables, if there is no set of the partition which contains distinct such that . The polynomial is avoidable if some countable partition avoids it. The avoidable polynomials are studied here. The polynomial is an especially interesting example of an avoidable one. We find (1) a countable partition which avoids every avoidable polynomial over , and (2) a characterization of the avoidable polynomials. An important feature is that both the ``master' partition in (1) and the characterization in (2) depend on the cardinality of .