Discussion about math, puzzles, games and fun. Useful symbols: ÷ × ½ √ ∞ ≠ ≤ ≥ ≈ ⇒ ± ∈ Δ θ ∴ ∑ ∫ • π ƒ ¹ ² ³ °
 

You are not logged in. Post a replyTopic review (newest first)
Hi naumberg
Hi;
Hi bobbym! Code:input: sequence x(1),...x(n) output: length Y of an increasing subsequence y(1)<=...<=y(Y) Y = 0 \\ counting the length of the subsequence s = zero array \\ storing the subsequence here \\ go through intervals elements of L_j for j = 1 to m { \\ boolean helper to implement stopping time, i.e. breaking condition for the loop success == 0 while (success == 0) do { \\ go through elements of L_j for k = (j1)*m+1 to j*m { \\ find a larger element which is still small enough if (s(Y) <= x_k <= s(Y)+1/m) { Y = Y+1 \\ length of subsequence ++ s(Y) = x_k \\ store element success == 1 \\ stop searching in L_j \\ and go to next interval } } } } return(Y) Now let us estimate the expectation of $Y$,
Hi Naumberg; was a major achievement. I could not find anyway to tie in what they were doing with the sharper bound you are interested in. I would very much like to see your answer when you find it.
Cool. Thanks in advance for your help!
Hi;
Logging in is sometimes helpful ...
Hi;
Mmh, I am really a newbie
Hi;
Unfortunately not. But I could scan you the respective page from the notes. Is there a possibility to upload it here?
Hi;
Hi
Hi;
Sure. In the lecture we had the following version of Erdos/Szerkeres which applies to continuous data as well: Now define another sequence In our exercise we need to prove that 