Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 2

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  permutacje rozbieżne
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote On Erdos' theorem for monotonic subsequences
EN
In this paper finite one-one sequences of reals are studied. We consider the strengthening of famous Erdös'theorem. We discuss the lengths of the largest decreasing and increasing subsequences of the given sequences. Also, we study the length of the largest monotonic subsequences, which the first or the last elment is equal to a given elment ai of the sequence a. What is particulary important is the connection betwen estimation of these values with the problem of the existence of the3-elements monotonic subsequences of a having the form{ak, ak+1, ak+2}. Moreover, we introduce some conditons which are sufficient to the existence of such 3-elments subsequences of sequence a. As a new example of the application of Erdös' theorem for monotonic subsequences we give a combinatoric characterization of divergent permutations.
2
Content available remote The strongly and weakly divergent permutations
EN
We introduce the concepts of strongly and weakly divergent permutations and consider some relations between them.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.