×
Well done. You've clicked the tower. This would actually achieve something if you had logged in first. Use the key for that. The name takes you home. This is where all the applicables sit. And you can't apply any changes to my site unless you are logged in.

Our policy is best summarized as "we don't care about _you_, we care about _them_", no emails, so no forgetting your password. You have no rights. It's like you don't even exist. If you publish material, I reserve the right to remove it, or use it myself.

Don't impersonate. Don't name someone involuntarily. You can lose everything if you cross the line, and no, I won't cancel your automatic payments first, so you'll have to do it the hard way. See how serious this sounds? That's how serious you're meant to take these.

×
Register


Required. 150 characters or fewer. Letters, digits and @/./+/-/_ only.
  • Your password can’t be too similar to your other personal information.
  • Your password must contain at least 8 characters.
  • Your password can’t be a commonly used password.
  • Your password can’t be entirely numeric.
Enter the same password as before, for verification.
Login

Grow A Dic
Define A Word
Make Space
Set Task
Mark Post
Apply Votestyle
Create Votes
(From: saved spaces)
Exclude Votes
Apply Dic
Exclude Dic

About the Moments of the Generalized Ulam Problem

Click here to flash read.

arXiv:2404.05860v2 Announce Type: replace-cross
Abstract: Given $\pi \in S_n$, let $Z_{n,k}(\pi)=\sum_{1\leq i_1<\dots<\dots<\pi_{i_k}\}$ denote the number of increasing subsequences of length $k$. Consider the problem of studing the distribution of $Z_{n,k}$ for general $k$ and $n$. For the 2nd moment, Ross Pinsky made a combinatorial study by considering a pair of subsequences $i^{(r)}_1<\dots<\dots

Click here to read this post out
ID: 818676; Unique Viewers: 0
Unique Voters: 0
Total Votes: 0
Votes:
Latest Change: April 23, 2024, 7:34 a.m. Changes:
/u/anonymous
Dictionaries:
Words:
Spaces:
Views: 12
CC:
No creative common's license
Comments: