Hypergroup Theory (Hardcover)

The book presents an updated study of hypergroups, being structured on 12 chapters in starting with the presentation of the basic notions in the domain: semihypergroups, hypergroups, classes of subhypergroups, types of homomorphisms, but also key notions: canonical hypergroups, join spaces and complete hypergroups. A detailed study is dedicated to the connections between hypergroups and binary relations, starting from connections established by Rosenberg and Corsini. Various types of binary relations are highlighted, in particular equivalence relations and the corresponding quotient structures, which enjoy certain properties: commutativity, cyclicity, solvability.A special attention is paid to the fundamental beta relationship, which leads to a group quotient structure. In the finite case, the number of non-isomorphic Rosenberg hypergroups of small orders is mentioned. Also, the study of hypergroups associated with relations is extended to the case of hypergroups associated to n-ary relations. Then follows an applied excursion of hypergroups in important chapters in mathematics: lattices, Pawlak approximation, hypergraphs, topology, with various properties, characterizations, varied and interesting examples. The bibliography presented is an updated one in the field, followed by an index of the notions presented in the book, useful in its study.

General

Imprint:	World Scientific Publishing Co Pte Ltd
Country of origin:	Singapore
Release date:	February 2022
First published:	2022
Authors:	Bijan Davvaz • Violeta Leoreanu-fotea
Format:	Hardcover
Pages:	300
ISBN-13:	978-981-12-4938-9
Categories:	Books > Science & Mathematics > Mathematics > Algebra > Groups & group theory Promotions
LSN:	981-12-4938-5
Barcode:	9789811249389

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!