Around the Hossz\'u-Gluskin theorem for nn-ary groups

We survey results related to the important Hossz\'u-Gluskin Theorem on $n$-ary groups adding also several new results and comments. The aim of this paper is to write all such results in uniform and compressive forms. Therefore some proofs of new results are only sketched or omitted if their completing seems to be not too difficult for readers. In particular, we show as the Hossz\'u-Gluskin Theorem can be used for evaluation how many different $n$-ary groups (up to isomorphism) exist on some small sets. Moreover, we sketch as the mentioned theorem can be also used for investigation of $\mathcal{Q}$-independent subsets of semiabelian $n$-ary groups for some special families $\mathcal{Q}$ of mappings

Decomposition schemes for symmetric n-ary bands

We extend the classical (strong) semilattice decomposition scheme of certain classes of semigroups to the class of idempotent symmetric n-ary semigroups (i.e. symmetric n-ary bands) where n \geq 2 is an integer. More precisely, we show that these semigroups are exactly the strong n-ary semilattices of n-ary extensions of Abelian groups whose exponents divide n-1. We then use this main result to obtain necessary and sufficient conditions for a symmetric n-ary band to be reducible to a semigroup

Proceedings of the 1st International Conference on Algebras, Graphs and Ordered Sets (ALGOS 2020)

International audienceOriginating in arithmetics and logic, the theory of ordered sets is now a field of combinatorics that is intimately linked to graph theory, universal algebra and multiple-valued logic, and that has a wide range of classical applications such as formal calculus, classification, decision aid and social choice.This international conference “Algebras, graphs and ordered set” (ALGOS) brings together specialists in the theory of graphs, relational structures and ordered sets, topics that are omnipresent in artificial intelligence and in knowledge discovery, and with concrete applications in biomedical sciences, security, social networks and e-learning systems. One of the goals of this event is to provide a common ground for mathematicians and computer scientists to meet, to present their latest results, and to discuss original applications in related scientific fields. On this basis, we hope for fruitful exchanges that can motivate multidisciplinary projects.The first edition of ALgebras, Graphs and Ordered Sets (ALGOS 2020) has a particular motivation, namely, an opportunity to honour Maurice Pouzet on his 75th birthday! For this reason, we have particularly welcomed submissions in areas related to Maurice’s many scientific interests:• Lattices and ordered sets• Combinatorics and graph theory• Set theory and theory of relations• Universal algebra and multiple valued logic• Applications: formal calculus, knowledge discovery, biomedical sciences, decision aid and social choice, security, social networks, web semantics..