Adobe PDF (1.36 MB)
Title Details:
Machines and Monoids
Authors: Georgiou, Dimitrios
Reviewer: Soudris, Dimitrios
Subject: MATHEMATICS AND COMPUTER SCIENCE > >
MATHEMATICS AND COMPUTER SCIENCE > MATHEMATICS > >
MATHEMATICS AND COMPUTER SCIENCE > MATHEMATICS > FIELD THEORY AND POLYNOMIALS > CONNECTIONS WITH LOGIC
Keywords:
Inclusions and Equivalence relations
Partially Ordered Sets
Grids and Boolean Algebras
Monoids and Groups
Symmetries
Permutations
Rings and Fields
Description:
Abstract:
Three are the basic types of relations that are considered in discrete mathematics: Equivalence relations, the partial order relations and functions. A special form of functions is the binary operator which will used in this chapter, as it is a great tool for combining functions. The combinations of functions are called compositions. Particular algebraic structures, monoids and groups, are briefly described in the next part of it of capital. The choice of this topic was made based on the usefulness of these structures in their use computers or even in computer science applications. Variety of course systems, such as crystals and hydrogen atoms, can be modeled by symmetric groups. Group theory and the closely related representation theory therefore have many important implications applications in physics, chemistry, and materials science. Group theory is also fundamental to public key cryptography theory. In particular, however, the user of this e-book the study of symmetry groups is of interest, as the specific groups present a particularly large interest in computer science. Finally, elements of functions, data flows, and directed graphs will be combined to to present the mathematical models called Machines.
Table of Contents:
Relations, Inclutions and Equivalence Relations - Partially ordered sets, lattices and Boolean Algebras - Monoids and Groups - Symmetries, Permutations, Rings and Fields -Machines.
Linguistic Editors: Kioseoglou, Nerina
Tromara, Sofia
Technical Editors: Stragali, Faidra
Graphic Editors: Stragali, Faidra
Type: Chapter
Creation Date: 21-12-2015
Item Details:
License: Attribution – NonCommercial – NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
Spatial Coverage: Χωρίς γεωγραφική κάλυψη.
Temporal Coverage: Χωρίς χρονική κάλυψη
Handle http://hdl.handle.net/11419/456
Bibliographic Reference: Georgiou, D. (2015). Machines and Monoids [Chapter]. In Georgiou, D., Antoniou, E., & Chatzimichailidis, A. 2015. Discrete Mathematical Structures in Computer Science [Undergraduate textbook]. Kallipos, Open Academic Editions. https://hdl.handle.net/11419/456
Language: Greek
Is Part of: Discrete Mathematical Structures in Computer Science
Number of pages 59
Typical Learning Time: PT23H00M00S
Version: 1η έκδ.
Publication Origin: Kallipos, Open Academic Editions