ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Is there a way to utilize GS and Galvin-Prikry-like theorems in the LOCAL model? A natural question is, whether one can relate determinacy arguments to the shift graph. Is it possible to construct functions with large Borel chromatic num- ber using determinacy arguments? Does it follow from the Axiom of Determinacy over ZF that χ(GS ) is infinite? Note that it is a long standing open problem, whether AD implies the Ramsey- property for subsets of [N]N , and this is would be an intermediate result. Descriptive Combinatorics, LOCAL Algorithms and Random Processes 453

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.