Related papers: Two variants of the Froiduire-Pin Algorithm for fi…
An algorithm for the explicit computation of a complete set of primitive central idempotents, Wedderburn decomposition and the automorphism group of the semisimple group algebra of a finite metabelian group is developed. The algorithm is…
In this paper we give an algorithm for the computation of all the Arf numerical semigroups with a given genus. Moreover, we generalize the concept of genus of a numerical semigroup to good semigroups of $\mathbb{N}^r$ and we give a…
The representation theory of finite groups began with Frobenius's factorization of Dedekind's group determinant. In this paper, we consider the case of the semigroup determinant. The semigroup determinant is nonzero if and only if the…
In this paper, a semigroup algebra consisting of polynomial expressions with coefficients in a field $F$ and exponents in an additive submonoid $M$ of $\mathbb{Q}_{\ge 0}$ is called a Puiseux algebra and denoted by $F[M]$. Here we study the…
Algorithms to construct minimal left group codes are provided. These are based on results describing a complete set of orthogonal primitive idempotents in each Wedderburn component of a semisimple finite group algebra FG for a large class…
The pseudo-Frobenius numbers of a numerical semigroup are those gaps of the numerical semigroup that are maximal for the partial order induced by the semigroup. We present a procedure to detect if a given set of integers is the set of…
We present a general strategy to extend quantum cluster algorithms for S=1/2 spin systems, such as the loop algorithm, to systems with arbitrary size of spins. In general, the partition function of a high-S spin system is represented in…
We study affine semigroup rings as algebras over subsemigroup rings. From this relative viewpoint with respect to a given subsemigroup ring, the fibered sum of two affine semigroup algebras is constructed. Such a construction is compared to…
We introduce a module-theoretic approach and a linear-programming method to compute the matricial dimension of numerical semigroups. We use these to compute the matricial dimension of every numerical semigroup with Frobenius number at most…
Geometric methods proposed by Stallings for treating finitely generated subgroups of free groups were successfully used to solve a wide collection of decision problems for free groups and their subgroups. It turns out that Stallings'…
We investigate Cayley graphs of finite semigroups and monoids. First, we look at semigroup digraphs, i.e., directed Cayley graphs of semigroups, and give a Sabidussi-type characterization in the case of monoids. We then correct a proof of…
Given a finitely generated subgroup $H$ of a free group $F$, we present an algorithm which computes $g_1,\ldots,g_m\in F$, such that the set of elements $g\in F$, for which there exists a non-trivial $H$-equation having $g$ as a solution,…
We algorithmically compute integral Eilenberg-MacLane homology of all semigroups of order at most $8$ and present some particular semigroups with notable classifying spaces, refuting conjectures of Nico. Along the way, we give an…
We describe the main questions connected to torsion subgroups in the unit group of integral group rings of finite groups and algorithmic methods to attack these questions. We then prove the Zassenhaus Conjecture for Amitsur groups and prove…
We describe an algorithm that uses Stallings' folding technique to decompose an element of $Aut(F_n)$ as a product of Whitehead automorphisms (and hence as a product of Nielsen transformations.) We use this to give an alternative method of…
Let $(X,\bullet )$ be a groupoid (binary algebra) and $Bin(X\dot{)}$ denote the collection of all groupoids defined on $X$. We introduce two methods of factorization for this binary system under the binary groupoid product \textquotedblleft…
In 1990, Backelin showed that the number of numerical semigroups with Frobenius number $f$ approaches $C_i \cdot 2^{f/2}$ for constants $C_0$ and $C_1$ depending on the parity of $f$. In this paper, we generalize this result to semigroups…
Given a finite abelian group $G$ and elements $x, y \in G$, we prove that there exists $\phi \in \text{Aut}(G)$ such that $\phi(x) = y$ if and only if $G/\langle x \rangle \cong G/\langle y \rangle$. This result leads to our development of…
Biclustering, also called co-clustering, block clustering, or two-way clustering, involves the simultaneous clustering of both the rows and columns of a data matrix into distinct groups, such that the rows and columns within a group display…
Let $\Delta$ be a numerical semigroup and let $d\ge 2$ be an integer. We study the fiber of the quotient map \(S\mapsto S/d\) over $\Delta$. We describe its elements as semigroups of the form $\langle X\rangle+d\Delta$, for suitable finite…