All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 3 Next

Displaying 41 – 60 of 111

Showing per page

Extended Ramsey theory for words representing rationals

Vassiliki Farmaki, Andreas Koutsogiannis (2013)

Fundamenta Mathematicae

Ramsey theory for words over a finite alphabet was unified in the work of Carlson, who also presented a method to extend the theory to words over an infinite alphabet, but subject to a fixed dominating principle. In the present work we establish an extension of Carlson's approach to countable ordinals and Schreier-type families developing an extended Ramsey theory for dominated words over a doubly infinite alphabet (in fact for ω-ℤ*-located words), and we apply this theory, exploiting the Budak-Işik-Pym...

Extraresolvability of balleans

Igor V. Protasov (2007)

Commentationes Mathematicae Universitatis Carolinae

A ballean is a set endowed with some family of balls in such a way that a ballean can be considered as an asymptotic counterpart of a uniform topological space. We introduce and study a new cardinal invariant of a ballean, the extraresolvability, which is an asymptotic reflection of the corresponding invariant of a topological space.

On colored set partitions of type B n

David Wang (2014)

Open Mathematics

Generalizing Reiner’s notion of set partitions of type B n, we define colored B n-partitions by coloring the elements in and not in the zero-block respectively. Considering the generating function of colored B n-partitions, we get the exact formulas for the expectation and variance of the number of non-zero-blocks in a random colored B n-partition. We find an asymptotic expression of the total number of colored B n-partitions up to an error of O(n −1/2log7/2 n], and prove that the centralized and...

Currently displaying 41 – 60 of 111