The varieties generated by 3-hypergraph semirings

Abstract

In this paper the 3-hypergraph semigroups and 3-hypergraph semirings from 3-hypergraphs H are introduced and the varieties generated by them are studied. It is shown that all 3-hypergraph semirings S H are nonfinitely based and subdirectly irreducible. Also, it is proved that each variety generated by 3-hypergraph semirings is equal to a variety generated by 3-uniform hypergraph semirings. It is well known that both variety V(Sc(abc)) (see, J. Algebra 611: 211--245, 2022 and J. Algebra 623: 64--85, 2023) and variety V(S H) play key role in the theory of variety of ai-semirings, where 3-uniform hypergraph H is a 3-cycle. They are shown that each variety generated by 2-robustly strong 3-colorable 3-uniform hypergraph semirings is equal to variety V(Sc(abc)), and each variety generated by so-called beam-type hypergraph semirings or fan-type hypergraph semirings is equal to the variety V(S H) generated by a 3-uniform 3-cycle hypergraph semiring S H. Finally, an infinite ascending chain is provided in the lattice of subvarieties of the variety generated by all 3-uniform hypergraph semirings. This implies that the variety generated by all 3-uniform hypergraph semirings has infinitely many subvarieties.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…