Etude algorithmique de réseaux construits avec la forme trace. (Algorithmic study of lattices constructed by means of the trace form).
Bachoc, Christine, Batut, Christian (1992)
Experimental Mathematics
Similarity:
Bachoc, Christine, Batut, Christian (1992)
Experimental Mathematics
Similarity:
M. E. Adams (1974)
Colloquium Mathematicae
Similarity:
P. Rema (1965)
Fundamenta Mathematicae
Similarity:
R. Beazer (1974)
Colloquium Mathematicae
Similarity:
Batut, Christian, Quebbemann, Heinz-Georg, Scharlau, Rudolf (1995)
Experimental Mathematics
Similarity:
G. Szasz (1976)
Matematički Vesnik
Similarity:
Edward Marczewski (1963)
Colloquium Mathematicum
Similarity:
B. Węglorz (1967)
Colloquium Mathematicae
Similarity:
Ami Korren (2001)
Visual Mathematics
Similarity:
J. Quinn, R. Reichard (1974)
Colloquium Mathematicae
Similarity:
Rudolf Scharlau (1994)
Mathematische Zeitschrift
Similarity:
V.B. Repnitskii (1995)
Semigroup forum
Similarity:
Y. A. Abramovich, A. K. Kitover
Similarity:
A linear operator T: X → Y between vector lattices is said to be disjointness preserving if T sends disjoint elements in X to disjoint elements in Y. Two closely related questions are discussed in this paper: (1) If T is invertible, under what assumptions does the inverse operator also preserve disjointness? (2) Under what assumptions is the operator T regular? These problems were considered by the authors in [5] but the current paper (closely related to [5] but self-contained) reflects...