Set Theory and Logic

   

A Note on the Length of Maximal Arithmetic Progressions in Random Subsets

Authors: Yilun Shang

Let $U^{(n)}$ denote the maximal length arithmetic progression in a non-uniform random subset of $\{0,1\}^n$, where $1$ appears with probability $p_n$. By using dependency graph and Stein-Chen method, we show that $U^{(n)}-c_n\ln n$ converges in law to an extreme type distribution with $\ln p_n=-2/c_n$. Similar result holds for $W^{(n)}$, the maximal length aperiodic arithmetic progression (mod $n$).

Comments: 6 Pages.

Download: PDF

Submission history

[v1] 2014-10-04 20:57:05

Unique-IP document downloads: 55 times

Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus