Semihypergroup Theory is the first book devoted to the semihypergroup theory and it includes basic results concerning semigroup theory and algebraic hyperstructures, which represent the most general algebraic context in which reality can be modelled. Hyperstructures represent a natural extension of classical algebraic structures and they were introduced in 1934 by the French mathematician Marty. Since then, hundreds of papers have been published on this subject. - Offers the first book devoted to the semihypergroup theory - Presents an introduction to recent progress in the theory of semihypergroups - Covers most of the mathematical ideas and techniques required in the study of semihypergroups - Employs the notion of fundamental relations to connect semihypergroups to semigroups

The symmetry of hyperoperation is expressed by hypergroup, more extensive hyperalgebraic structures than hypergroups are studied in this paper. The new concepts of neutrosophic extended triplet semihypergroup (NET- semihypergroup) and neutrosophic extended triplet hypergroup (NET-hypergroup) are firstly introduced, some basic properties are obtained, and the relationships among NET- semihypergroups, regular semihypergroups, NET-hypergroups and regular hypergroups are systematically are investigated. Moreover, pure NET-semihypergroup and pure NET-hypergroup are investigated, and a strucuture theorem of commutative pure NET-semihypergroup is established. Finally, a new notion of weak commutative NET-semihypergroup is proposed, some important examples are obtained by software MATLAB, and the following important result is proved: every pure and weak commutative NET-semihypergroup is a disjoint union of some regular hypergroups which are its subhypergroups.

This book contains 37 papers by 73 renowned experts from 13 countries around the world, on following topics: neutrosophic set; neutrosophic rings; neutrosophic quadruple rings; idempotents; neutrosophic extended triplet group; hypergroup; semihypergroup; neutrosophic extended triplet group; neutrosophic extended triplet semihypergroup and hypergroup; neutrosophic offset; uninorm; neutrosophic offuninorm and offnorm; neutrosophic offconorm; implicator; prospector; n-person cooperative game; ordinary single-valued neutrosophic (co)topology; ordinary single-valued neutrosophic subspace; α-level; ordinary single-valued neutrosophic neighborhood system; ordinary single-valued neutrosophic base and subbase; fuzzy numbers; neutrosophic numbers; neutrosophic symmetric scenarios; performance indicators; financial assets; neutrosophic extended triplet group; neutrosophic quadruple numbers; refined neutrosophic numbers; refined neutrosophic quadruple numbers; multigranulation neutrosophic rough set; nondual; two universes; multiattribute group decision making; nonstandard analysis; extended nonstandard analysis; monad; binad; left monad closed to the right; right monad closed to the left; pierced binad; unpierced binad; nonstandard neutrosophic mobinad set; neutrosophic topology; nonstandard neutrosophic topology; visual tracking; neutrosophic weight; objectness; weighted multiple instance learning; neutrosophic triangular norms; residuated lattices; representable neutrosophic t-norms; De Morgan neutrosophic triples; neutrosophic residual implications; infinitely ∨-distributive; probabilistic neutrosophic hesitant fuzzy set; decision-making; Choquet integral; e-marketing; Internet of Things; neutrosophic set; multicriteria decision making techniques; uncertainty modeling; neutrosophic goal programming approach; shale gas water management system.

We introduce the notions of neutrosophic extended triplet LA-semihypergroup, neutrosophic extended triplet LA-hypergroup, which can reflect some symmetry of hyperoperation and discuss the relationships among them and regular LA-semihypergroups, LA-hypergroups, regular LA-hypergroups. In particular, we introduce the notion of strong pure neutrosophic extended triplet LA-semihypergroup, get some special properties of it and prove the construction theorem about it under the condition of asymmetry. The examples in this paper are all from Python programs.

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.

The book covers different aspects of real-world applications of optimization algorithms. It provides insights from the Fourth International Conference on Harmony Search, Soft Computing and Applications held at BML Munjal University, Gurgaon, India on February 7–9, 2018. It consists of research articles on novel and newly proposed optimization algorithms; the theoretical study of nature-inspired optimization algorithms; numerically established results of nature-inspired optimization algorithms; and real-world applications of optimization algorithms and synthetic benchmarking of optimization algorithms.