Fields with Prescribed Quadratic Form Schemes.
Automorphisms of Witt rings of global fields
We construct an uncountable set of strong automorphisms of the Witt ring of a global field.
Communication Complexity And Linearly Ordered Sets
The paper is devoted to the communication complexity of lattice operations in linearly ordered finite sets. All well known techniques ([4, Chapter 1]) to determine the communication complexity of the infimum function in linear lattices disappoint, because a gap between the lower and upper bound is equal to O(log2 n), where n is the cardinality of the lattice. Therefore our aim will be to investigate the communication complexity of the function more carefully. We consider a family of so called interval...
Kazimierz Szymiczek (1939-2015)
Page 1