Displaying similar documents to “On strong chain recurrence for maps”

Embeddings of chains into chains

Vítězslav Novák, Tomáš Novotný (2005)

Discussiones Mathematicae - General Algebra and Applications

Similarity:

Continuity of isotone mappings and embeddings of a chain G into another chain are studied. Especially, conditions are found under which the set of points of discontinuity of such a mapping is dense in G.

Weak chain-completeness and fixed point property for pseudo-ordered sets

S. Parameshwara Bhatta (2005)

Czechoslovak Mathematical Journal

Similarity:

In this paper the notion of weak chain-completeness is introduced for pseudo-ordered sets as an extension of the notion of chain-completeness of posets (see [3]) and it is shown that every isotone map of a weakly chain-complete pseudo-ordered set into itself has a least fixed point.

Efficient computation of addition chains

F. Bergeron, J. Berstel, S. Brlek (1994)

Journal de théorie des nombres de Bordeaux

Similarity:

The aim of this paper is to present a unifying approach to the computation of short addition chains. Our method is based upon continued fraction expansions. Most of the popular methods for the generation of addition chains, such as the binary method, the factor method, etc..., fit in our framework. However, we present new and better algorithms. We give a general upper bound for the complexity of continued fraction methods, as a function of a chosen strategy, thus the total number of...

Smooth implications on a finite chain

Yong Su (2019)

Kybernetika

Similarity:

Mas et al. adapted the notion of smoothness, introduced by Godo and Sierra, and discussed two kinds of smooth implications (a discrete counterpart of continuous fuzzy implications) on a finite chain. This work is devoted to exploring the formal relations between smoothness and other six properties of implications on a finite chain. As a byproduct, several classes of smooth implications on a finite chain are characterized.