2000 character limit reached
More on the indivisibility of $\mathbb{Q}$
Published 4 Jul 2024 in math.LO, cs.LO, and math.CO | (2407.03722v1)
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.