首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Avoidable algebraic subsets of Euclidean space
Authors:James H Schmerl
Institution:Department of Mathematics, University of Connecticut, Storrs, Connecticut 06269-3009
Abstract:Fix an integer $n\ge 1$ and consider real $n$-dimensional $\mathbb{R}^n$. A partition of $\mathbb{R}^n$ avoids the polynomial $p(x_0,x_1,\dotsc,x_{k-1})\in\mathbb Rx_0,x_1,\dotsc,x_{k-1}]$, where each $x_i$ is an $n$-tuple of variables, if there is no set of the partition which contains distinct $a_0,a_1,\dotsc,a_{k-1}$ such that $p(a_0,a_1,\dotsc,a_{k-1})=0$. The polynomial is avoidable if some countable partition avoids it. The avoidable polynomials are studied here. The polynomial $\|x-y\|^2-\|y-z\|^2$ is an especially interesting example of an avoidable one. We find (1) a countable partition which avoids every avoidable polynomial over $Q$, 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 $\mathbb R$.

Keywords:Algebraic sets  avoidable polynomials  infinite combinatorics
点击此处可从《Transactions of the American Mathematical Society》浏览原始摘要信息
点击此处可从《Transactions of the American Mathematical Society》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号