2015/11/05 by Boris Šobot, Šobot, Boris
Computer Science · Mathematics · #semigroups and automata theory #Advanced Algebra and Geometry #Advanced Combinatorial Mathematics
paper · pdf · doi:10.48550/arxiv.1511.01731
We consider five divisibility orders on the Stone-Čech compactification βN. We find antichains of incompatible elements, and characterize maximal and minimal elements. The main result shows that two of these relations, |L and |LN, are strictly stronger than the Rudin-Keisler order.