Some combinatorial problems, connected with product-isomorphisms of binary relations
A. E. Kipiani (1988)
Acta Universitatis Carolinae. Mathematica et Physica
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Ramsey's Theorem”
Some combinatorial problems, connected with product-isomorphisms of binary relations
On the selector of twin functions
Marian Turzański (1998)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
A theorem is proved which could be considered as a bridge between the combinatorics which have a beginning in the dyadic spaces theory and the partition calculus.
The Catalan Numbers. Part II 1
Karol Pąk (2006)
Formalized Mathematics
Similarity:
In this paper, we define sequence dominated by 0, in which every initial fragment contains more zeroes than ones. If n ≥ 2 · m and n > 0, then the number of sequences dominated by 0 the length n including m of ones, is given by the formula [...] and satisfies the recurrence relation [...] Obviously, if n = 2 · m, then we obtain the recurrence relation for the Catalan numbers (starting from 0) [...] Using the above recurrence relation we can see that [...] where [...] and hence [...]...
An extension of a theorem of Rosenthal on operators acting from
L. Drenowski (1976)
Studia Mathematica
Similarity: