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


Cyclic automorphisms of a countable graph and random sum-free sets
Authors:Peter J Cameron
Institution:(1) Merton College, OX1 4JD Oxford, England;(2) California Institute of Technology, 91125 Pasadena, CA, USA
Abstract:Cyclic automorphisms of the countable universal ultrahomogeneous graph are investigated using methods of Baire category and measure theory. This leads to the study of random sumfree sets; it is shown that the probability that such a set consists entirely of odd numbers is strictly positive, and bounds are given.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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