1965
DOI: 10.2307/2373068
|View full text |Cite
|
Sign up to set email alerts
|

A Combinatorial Problem Connected with Differential Equations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

2
117
0
3

Year Published

1979
1979
2006
2006

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 122 publications
(122 citation statements)
references
References 0 publications
2
117
0
3
Order By: Relevance
“…All the functionslXkare non-decreasing,and convergeto infinity with their argument. The same holds for IX too, which grows more slowly than any of the IXk' Note thatlX(n):'24 for all n:'2A (4) which is a tower with 65536 2's, thus lX(n):'24 for all practical purpOses.…”
Section: Statement Of Main Resultsmentioning
confidence: 73%
See 3 more Smart Citations
“…All the functionslXkare non-decreasing,and convergeto infinity with their argument. The same holds for IX too, which grows more slowly than any of the IXk' Note thatlX(n):'24 for all n:'2A (4) which is a tower with 65536 2's, thus lX(n):'24 for all practical purpOses.…”
Section: Statement Of Main Resultsmentioning
confidence: 73%
“…Is the maximal total length of such a sequence linear in the number of nodes of the corresponding tree? (4) There is a similarity between the two problems studied here and in [16], in that they both involve path compressions on trees and they both attain similar upper and lower bounds. Is there some general problem of this kind, of which both our problem and that of [16] are special instances?…”
Section: Open Problemsmentioning
confidence: 71%
See 2 more Smart Citations
“…It can be seen that P is 3-noncrossing in Klazar's sense if and only if there do not exist 6 elements Klazar's definition of 3-noncrossing partitions is different from ours. For example, let P be the partition 15-246-37 of [7], with standard representation as follows: r r r r r r r 1 2 3 4 5 6 7…”
Section: Theorem 11 Asserts the Symmetric Distribution Of Cr(p ) Andmentioning
confidence: 99%