Some combinatorial problems, connected with product-isomorphisms of binary relations
A. E. Kipiani (1988)
Acta Universitatis Carolinae. Mathematica et Physica
Similarity:
A. E. Kipiani (1988)
Acta Universitatis Carolinae. Mathematica et Physica
Similarity:
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.
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 [...]...
L. Drenowski (1976)
Studia Mathematica
Similarity:
Věra Trnková (1975)
Commentationes Mathematicae Universitatis Carolinae
Similarity: