Skip to main content
MathOverflow
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
Profile Activity

87 Actions

All Accepts Posts Badges Comments Revisions Reviews Suggestions
comment
Complexity of a combinatorial constraint
It is "for some $s<r$". Thanks~
revised
Complexity of a combinatorial constraint
added 1 character in body
asked
Complexity of a combinatorial constraint
comment
Combinatorially defined effectively closed set
You can think of it that way. A "naturally" defined (for non logicians) $Q$.
comment
Combinatorially defined effectively closed set
It's explained @NoahSchweber. I'd also be happy to see an algebrically defined one~
revised
Combinatorially defined effectively closed set
added 197 characters in body
comment
Combinatorially defined effectively closed set
Thanks for responding @JoelDavidHamkins~ But this definition isn't purely combinatorial. I will add more explanation in my question.
asked
Combinatorially defined effectively closed set
revised
Small set in partition-large class
added 1020 characters in body
revised
Small set in partition-large class
added 66 characters in body
revised
Small set in partition-large class
new thinking on the question
revised
Small set in partition-large class
added 706 characters in body
accepted
Ramseyan property of structure
asked
Small set in partition-large class
awarded
 Yearling
comment
A gap problem in elementary additive combinatorics
This doesn't seems true. Let $x_1,\cdots$ be increasing and fast growing. For any $M\in \chi(a,b)$, $Mx^T$ necessarily involves elements of $\mathbf{x}$ other than $x_1$.
awarded
 Yearling
awarded
 Commentator
comment
Covering subset with large probability
Right. I need to rethink about the question I'm asking. I actually want $N$ to be very large and $k$ fixed (but yet sufficiently large).
revised
Covering subset with large probability
deleted 2 characters in body