Finite versus infinite: An insufficient shift

@article{Pequignot2016FiniteVI,
  title={Finite versus infinite: An insufficient shift},
  author={Yann Pequignot},
  journal={Advances in Mathematics},
  year={2016},
  volume={320},
  pages={244-249}
}
  • Yann Pequignot
  • Published 2016
  • Mathematics
  • Advances in Mathematics
  • Abstract The shift graph G S is defined on the space of infinite subsets of natural numbers by letting two sets be adjacent if one can be obtained from the other by removing its least element. We show that this graph is not a minimum among the graphs of the form G f defined on some Polish space X , where two distinct points are adjacent if one can be obtained from the other by a given Borel function f : X → X . This answers the primary outstanding question from [8] . 
    3 Citations
    A complexity problem for Borel graphs
    • 5
    • PDF

    References

    SHOWING 1-10 OF 19 REFERENCES
    Shift graphs on precompact families of finite sets of natural numbers
    • 2
    Measurable chromatic numbers
    • 5
    • PDF
    The Set of Better Quasi Orderings is Pi21-complete
    • 5
    BOREL CHROMATIC NUMBERS
    • 133
    Better quasi-orders for uncountable cardinals
    • 36
    Borel Sets and Ramsey's Theorem
    • 248