A mean identity for longest increasing subsequence problems

Details A mean identity for longest increasing subsequence problems A mean identity for longest increasing subsequence problems

2000-04-12

arxiv.org/abs/math/0004082v2

Mathematics

Combinatorics

15 pages, LaTeX. Continuous limits consolidated, other minor changes

Scientific paper

We show that a wide variety of generalized increasing subsequence problems admit a one parameter family of extensions for which we can exactly compute the mean length of the longest increasing subsequence. By the nature of the extension, this gives upper bounds on the mean in the unextended model, which turn out to be asymptotically tight for all of the models that have so far been analyzed. A heuristic analysis based on this fact gives not just the asymptotic mean but also the asymptotic scale factor, again agreeing with all known cases.

Affiliated with

Also associated with

No associations

Rating

A mean identity for longest increasing subsequence problems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A mean identity for longest increasing subsequence problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A mean identity for longest increasing subsequence problems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-573705