The determinant of \(\)-smooth semigroups
Abstract
This paper continues the investigation of non-zero determinants associated with finite semigroups containing a pair of non-commuting idempotents, as initiated in~Sha-Det2. We focus on a class of semigroups, called \( \)-smooth semigroups, that allow meaningful structural analysis despite the absence of \( \)-transitivity. Within this framework, we develop a method for computing contracted semigroup determinants, building on and extending the approach carried over from~Sha-Det2. These computations are motivated by applications in coding theory, particularly by the potential extending the MacWilliams theorem for codes over semigroup algebras.
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.