Displaying similar documents to “On a generalized recurrence for Bell numbers.”

Complete sequences of coanalytic sets

Riccardo Camerlo (2014)

Fundamenta Mathematicae

Similarity:

The notion of a complete sequence of pairwise disjoint coanalytic sets is investigated. Several examples are given and such sequences are characterised under analytic determinacy. The ideas are based on earlier results of Saint Raymond, and generalise them.

The positivity problem for fourth order linear recurrence sequences is decidable

Pinthira Tangsupphathawat, Narong Punnim, Vichian Laohakosol (2012)

Colloquium Mathematicae

Similarity:

The problem whether each element of a sequence satisfying a fourth order linear recurrence with integer coefficients is nonnegative, referred to as the Positivity Problem for fourth order linear recurrence sequence, is shown to be decidable.

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...