Displaying similar documents to “Kleinberg sequences and partition cardinals below δ₅¹”

Strong sequences and partition relations

Joanna Jureczko (2017)

Annales Universitatis Paedagogicae Cracoviensis. Studia Mathematica

Similarity:

The first result in partition relations topic belongs to Ramsey (1930). Since that this topic has been still explored. Probably the most famous partition theorem is Erdös-Rado theorem (1956). On the other hand in 60’s of the last century Efimov introduced strong sequences method, which was used for proving some famous theorems in dyadic spaces. The aim of this paper is to generalize theorem on strong sequences and to show that it is equivalent to generalized version of well-known Erdös-Rado...

Algebra of Polynomially Bounded Sequences and Negligible Functions

Hiroyuki Okazaki (2015)

Formalized Mathematics

Similarity:

In this article we formalize negligible functions that play an essential role in cryptology [10], [2]. Generally, a cryptosystem is secure if the probability of succeeding any attacks against the cryptosystem is negligible. First, we formalize the algebra of polynomially bounded sequences [20]. Next, we formalize negligible functions and prove the set of negligible functions is a subset of the algebra of polynomially bounded sequences. Moreover, we then introduce equivalence relation...

On the correlation of families of pseudorandom sequences of k symbols

Kit-Ho Mak, Alexandru Zaharescu (2016)

Acta Arithmetica

Similarity:

In an earlier paper Gyarmati introduced the notion of f-correlation for families of binary pseudorandom sequences as a measure of randomness in the family. In this paper we generalize the f-correlation to families of pseudorandom sequences of k symbols and study its properties.

Ramseyan ultrafilters

Lorenz Halbeisen (2001)

Fundamenta Mathematicae

Similarity:

We investigate families of partitions of ω which are related to special coideals, so-called happy families, and give a dual form of Ramsey ultrafilters in terms of partitions. The combinatorial properties of these partition-ultrafilters, which we call Ramseyan ultrafilters, are similar to those of Ramsey ultrafilters. For example it will be shown that dual Mathias forcing restricted to a Ramseyan ultrafilter has the same features as Mathias forcing restricted to a Ramsey ultrafilter....