Author: Johannes CzermakPublisher:
ISBN:
Category : Algebra
Languages : en
Pages : 424
Book Description
Contributions to General Algebra 5
Author: Johannes CzermakPublisher:
ISBN:
Category : Algebra
Languages : en
Pages : 424
Book Description
Contributions to General Algebra
Author: Contributions to General Algebra 13
Author: Ivan ChajdaContributions to Universal Algebra
Author: B. CsákányPublisher: Elsevier
ISBN: 1483103021
Category : Mathematics
Languages : en
Pages : 609
Book Description
Contributions to Universal Algebra focuses on the study of algebra. The compilation first discusses the congruence lattice of pseudo-simple algebras; elementary properties of limit reduced powers with applications to Boolean powers; and congruent lattices of 2-valued algebras. The book further looks at duality for algebras; weak homomorphisms of stone algebras; varieties of modular lattices not generated by their finite dimensional members; and remarks on algebraic operations of stone algebras. The text describes polynomial normal forms and the embedding of polynomial algebras; coverings in the lattice of varieties; embedding semigroups in semigroups generated by idempotents; and endomorphism semigroups and subgroupoid lattices. The book also discusses a report on sublattices of a free lattice, and then presents the cycles in finite semi-distributive lattices; cycles in S-lattices; and summary of results. The text also describes primitive subsets of algebras, ideals, normal sets, and congruences, as well as Jacobson’s density theorem. The book is a good source for readers wanting to study algebra.
Contributions to General Algebra 16
Author: Ivan ChajdaContributions to General Algebra 6
Author: Dietmar DorningerPublisher:
ISBN:
Category : Algebra
Languages : en
Pages : 328
Book Description
Contributions to General Algebra ...
Author: Hermann KautschitschContributions to General Algebra
Author: Cryptography and Computational Number Theory
Author: Kwok Y. LamPublisher: Birkhäuser
ISBN: 3034882955
Category : Computers
Languages : en
Pages : 376
Book Description
This volume contains the refereed proceedings of the Workshop on Cryptography and Computational Number Theory, CCNT'99, which has been held in Singapore during the week of November 22-26, 1999. The workshop was organized by the Centre for Systems Security of the Na tional University of Singapore. We gratefully acknowledge the financial support from the Singapore National Science and Technology Board under the grant num ber RP960668/M. The idea for this workshop grew out of the recognition of the recent, rapid development in various areas of cryptography and computational number the ory. The event followed the concept of the research programs at such well-known research institutions as the Newton Institute (UK), Oberwolfach and Dagstuhl (Germany), and Luminy (France). Accordingly, there were only invited lectures at the workshop with plenty of time for informal discussions. It was hoped and successfully achieved that the meeting would encourage and stimulate further research in information and computer security as well as in the design and implementation of number theoretic cryptosystems and other related areas. Another goal of the meeting was to stimulate collaboration and more active interaction between mathematicians, computer scientists, practical cryptographers and engineers in academia, industry and government.
Algorithms and Order
Author: Ivan RivalPublisher: Springer Science & Business Media
ISBN: 9400926391
Category : Computers
Languages : en
Pages : 491
Book Description
This volume contains the texts of the principal survey papers presented at ALGORITHMS -and ORDER, held· at Ottawa, Canada from June 1 to June 12, 1987. The conference was supported by grants from the N.A.T.O. Advanced Study Institute programme, the University of Ottawa, and the Natural Sciences and Engineering Research Council of Canada. We are grateful for this considerable support. Over fifty years ago, the Symposium on Lattice Theory, in Charlottesville, U.S.A., proclaimed the vitality of ordered sets. Only twenty years later the Symposium on Partially Ordered Sets and Lattice Theory, held at Monterey, U.S.A., had solved many of the problems that had been originally posed. In 1981, the Symposium on Ordered Sets held at Banff, Canada, continued this tradition. It was marked by a landmark volume containing twenty-three articles on almost all current topics in the theory of ordered sets and its applications. Three years after, Graphs and Orders, also held at Banff, Canada, aimed to document the role of graphs in the theory of ordered sets and its applications. Because of its special place in the landscape of the mathematical sciences order is especially sensitive to new trends and developments. Today, the most important current in the theory and application of order springs from theoretical computer seience. Two themes of computer science lead the way. The first is data structure. Order is common to data structures.