Note on normal sequences of chain complexes
Klaus Heiner Kamps (1978)
Colloquium Mathematicae
Similarity:
Klaus Heiner Kamps (1978)
Colloquium Mathematicae
Similarity:
Katsuya Yokoi (2015)
Annales Polonici Mathematici
Similarity:
This paper is concerned with strong chain recurrence introduced by Easton. We investigate the depth of the transfinite sequence of nested, closed invariant sets obtained by iterating the process of taking strong chain recurrent points, which is a related form of the central sequence due to Birkhoff. We also note the existence of a Lyapunov function which is decreasing off the strong chain recurrent set. As an application, we give a necessary and sufficient condition for the coincidence...
Marko D. Lekop (1973)
Publications de l'Institut Mathématique
Similarity:
D. W. Hajek, R. G. Wilson (1982)
Matematički Vesnik
Similarity:
Bukh, Boris (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
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.
Jarmila Hedlíková (1977)
Mathematica Slovaca
Similarity:
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.
J. Mioduszewski (1971)
Colloquium Mathematicae
Similarity:
Hisahiro Tamano (1971)
Fundamenta Mathematicae
Similarity:
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...