Skip to main content
Jiayi Liu's user avatar
Jiayi Liu's user avatar
Jiayi Liu's user avatar
Jiayi Liu
  • Member for 9 years, 6 months
  • Last seen more than a month ago
awarded
Loading…
Loading…
accepted
asked
Loading…
accepted
awarded
revised
Is the consecutive sum set large in general?
deleted 47 characters in body
Loading…
Loading…
accepted
asked
Loading…
asked
Loading…
asked
Loading…
accepted
revised
Loading…
asked
Loading…
Loading…
comment
Complexity of a combinatorial constraint
Thanks for answering~ I didn't expect different $r$ would make a difference. Your construction gives a $Q$ for $r=2$ as following. Put $(X,Y)$ in $Q$ where $Y=(\emptyset,\emptyset), (\emptyset,\omega), (\omega,\emptyset)\in (2^\omega)^2$ depending on $f(X)=0,1,2$ respectively. Where $(\emptyset,\emptyset)$ denotes such $(Y_0,Y_1)\in (2^\omega)^2$ that $Y_0^{-1}(1)=Y_1^{-1}(1)=\emptyset$ (similarly for $(\emptyset,\omega), (\omega,\emptyset)$). So $Q$ could be $\Pi_1^1$ for $r=3$ by Jonathan's comment.
accepted
1
2 3 4 5