Dioid partitions of groups

Abstract A partition of a group is a dioid partition if the following three conditions are met: The setwise product of any two parts is a union of parts, there is a part that multiplies as an identity element, and the inverse of a part is a part. This kind of a group partition was first introduced by Tamaschke in 1968. We show that a dioid partition defines a dioid structure over the group, analogously to the way a Schur ring over a group is defined. After proving fundamental properties of dioid partitions, we focus on three part dioid partitions of cyclic groups of prime order. We provide classification results for their isomorphism types as well as for the partitions themselves.

[1]  Anne Penfold Street,et al.  Group Ramsey Theory , 1974, J. Comb. Theory, Ser. A.

[2]  Mikhail E. Muzychuk,et al.  Schur rings , 2009, Eur. J. Comb..

[3]  Olaf Tamaschke.  On the theory of Schur-Rings , 1969 .

[4]  Francisco J. Valverde-Albacete,et al.  Activating Generalized Fuzzy Implications from Galois Connections , 2015, A Passion for Fuzzy Sets.

[5]  Ben Green,et al.  Sum-free sets in abelian groups , 2003 .

[6]  H. P. Yap.  Structure of maximal sum-free sets in $C_p$ , 1970 .

[7]  Harold Davenport,et al.  On the Addition of Residue Classes , 1935 .

[8]  Jeremy Gunawardena,et al.  Idempotency: An introduction to idempotency , 1998 .

[9]  Terence Tao,et al.  Additive combinatorics , 2007, Cambridge studies in advanced mathematics.

[10]  A. Vosper,et al.  The Critical Pairs of Subsets of a Group of Prime Order , 1956 .

[11]  John J. Cannon,et al.  Groups equal to a product of three conjugate subgroups , 2015, 1501.05676.

[12]  Olaf Tamaschke.  An extension of group theory toS-semigroups , 1968 .

[13]  Gregory A. Freiman,et al.  On sum-free sets modulo $p$ , 2006 .

[14]  Ishay Haviv,et al.  Symmetric Complete Sum-free Sets in Cyclic Groups , 2017, Electron. Notes Discret. Math..

[15]  Stasys Jukna,et al.  Extremal Combinatorics - With Applications in Computer Science , 2001, Texts in Theoretical Computer Science. An EATCS Series.

[16]  A. Cauchy.  Oeuvres complètes: Recherches sur les nombres , 2009 .

[17]  Fabio Gadducci,et al.  Petri Nets Are Dioids , 2008, AMAST.

[18]  Michel Minoux,et al.  Graphs, dioids and semirings : new models and algorithms , 2008 .

[19]  Vsevolod F. Lev,et al.  A refined bound for sum-free sets in groups of prime order , 2008 .

[20]  Gady Kozma,et al.  Bases and decomposition numbers of finite groups , 1992 .

[21]  Basil Gordon.  A generalization of the coset decomposition of a finite group. , 1965 .

[22]  Michel Minoux,et al.  Dioïds and semirings: Links to fuzzy sets and other applications , 2007, Fuzzy Sets Syst..

[23]  M. Klin,et al.  The isomorphism problem for circulant graphs via Schur ring theory , 1999, Codes and Association Schemes.

[24]  Anne Penfold Street,et al.  Maximal sum-free sets in finite abelian groups , 1970, Bulletin of the Australian Mathematical Society.

[25]  H. Wielandt,et al.  Finite Permutation Groups , 1964 .

[26]  Xiaolan Xie,et al.  Formal methods in manufacturing , 2014 .