Decomposing sequences into monotonic subsequences

Details Decomposing sequences into monotonic subsequences Decomposing sequences into monotonic subsequences

2006-03-27

arxiv.org/abs/math/0603634v1

Mathematics

Combinatorics

4 pages

Scientific paper

The function f:X -> Y is called k-monotonically increasing if there is a partition X = X_1 U ... U X_k such that f|X_i : X_i -> Y is monotonically increasing for i=1,...,k. It is proved that a one-to-one function f:N -> N is k-monotonically increasing if and only if every set of k+1 positive integers contains two integers x,x' with x < x' such that f(x) <= f(x'). The function f:X \to Y is called k-monotonic if there is a partition X = X_1 U ... U X_k such that f|X_i : X_i -> Y is monotonically increasing or monotonically decreasing for i=1,...,k. It is also proved that there does not exist a k-monotonic function from N onto Q.

Affiliated with

Also associated with

No associations

Rating

Decomposing sequences into monotonic subsequences 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 Decomposing sequences into monotonic subsequences, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Decomposing sequences into monotonic subsequences will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-463529