More on the indivisibility of $\mathbbQ$
<|reference_start|>More on the indivisibility of $\mathbbQ$: We study the complexity of the computational task ``Given a colouring $c : \mathbb{Q} \to \mathbf{k}$, find a monochromatic $S \subseteq \mathbb{Q}$ such that $(S,<) \cong (\mathbb{Q},<)$''. The framework is Weihrauch reducibility. Our results answer some open questions recently raised by Gill, and by Dzhafarov, Solomon and Valenti.<|reference_end|>
@article{pauly2024more,
    title={More on the indivisibility of $\mathbb{Q}$},
    author={Arno Pauly},
    journal={arXiv preprint arXiv:2407.03722},
    year={2024},
    archivePrefix={arXiv},
    eprint={2407.03722},
    primaryClass={math.LO cs.LO math.CO}
}