Related papers: Arithmetic of additively reduced monoid semidomain…

The semiring of discrete dynamical systems is a simple algebraic model for modularity in deterministic systems. The objects of the semiring are finite transformations (viewed as directed graphs and regarded up to isomorphism), the sum of…

We investigate compressibility of the dimension of positive semidefinite matrices while approximately preserving their pairwise inner products. This can either be regarded as compression of positive semidefinite factorizations of…

We discuss various square-free and radical factorizations and existence of some divisors in monoids in the context of: atomicity, ascending chain condition for principal ideals, a pre-Schreier property, a greatest common divisor property…

In this paper, we consider the existence of a factorization of a monic, bounded motion polynomial. We prove existence of factorizations, possibly after multiplication with a real polynomial and provide algorithms for computing polynomial…

Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but they have not been studied systematically in the context 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…

Let $R$ be a commutative ring with identity and $M$ a unitary $R$-module. The purpose of this paper is to introduce the concept of semi-$n$-submodules as an extension of semi $n$-ideals and $n$-submodules. A proper submodule $N$ of $M$ is…

Let $S\subseteq \mathbb N^p$ be a semigroup, any $P\subseteq S$ is an ideal of $S$ if $P+S\subseteq P$, and an $I(S)$-semigroup is the affine semigroup $P\cup \{0\}$, with $P$ an ideal of $S$. We characterise the $I(S)$-semigroups and the…

A partial automorphism of a semigroup $S$ is any isomorphism between its subsemigroups, and the set all partial automorphisms of $S$ with respect to composition is the inverse monoid called the partial automorphism monoid of $S$. Two…

Let $F$ be a field, $p$ a prime number, $X$ an indeterminate over $F$, $D_n =F[X^{\frac{1}{p^n}}, X^{-\frac{1}{p^n}}]$ for each integer $n \geq 0$ and $D = \bigcup\limits_{n\in\mathbb{N}_0}D_n.$ Then $D$ is a one-dimensional B{\'e}zout…

We provide algorithms for performing computations in generalized numerical semigroups, that is, submonoids of $\mathbb{N}^{d}$ with finite complement in $\mathbb{N}^{d}$. These semigroups are affine semigroups, which in particular implies…

Submodular function minimization (SFM) is a fundamental and efficiently solvable problem class in combinatorial optimization with a multitude of applications in various fields. Surprisingly, there is only very little known about constraint…

If $\mathbb{F}$ is an ordered field and $M$ is a finite-rank torsion-free monoid, then one can embed $M$ into a finite-dimensional vector space over $\mathbb{F}$ via the inclusion $M \hookrightarrow \text{gp}(M) \hookrightarrow \mathbb{F}…

Differential modules over a commutative differential ring R which are finitely generated projective as ring modules, with differential homomorphisms, form an additive category, so their isomorphism classes form a monoid. We study the…

In this paper we introduce and investigate the notion of semiseparable functor. One of its first features is that it allows a novel description of separable and naturally full functors in terms of faithful and full functors, respectively.…

The semijoin operation is a fundamental operation of relational algebra that has been extensively used in query processing. Furthermore, semijoins have been used to formulate desirable properties of acyclic schemas; in particular, a schema…

Let $S$ be a semigroup (written multiplicatively). Endowed with the operation of setwise multiplication induced by $S$ on its parts, the non-empty subsets of $S$ form themselves a semigroup, denoted by $\mathcal P(S)$. Accordingly, we say…

An integral domain $D$ is called a \emph{prime-divisor-finite domain} (PDF-domain) if every nonzero element has only finitely many nonassociate prime divisors. A domain $D$ is said to be a \emph{tightly prime-divisor-finite domain}…

Let $R$ be a commutative noetherian ring of dimension $d$ and $M$ be a commutative$,$ cancellative$,$ torsion-free monoid of rank $r$. Then $S$-$dim(R[M]) \leq max\{1, dim(R[M])-1 \} = max\{1, d+r-1 \}$. Further$,$ we define a class of…

A semigroup $S$ is called an equational domain (e.d.) if any finite union of algebraic sets over $S$ is algebraic. For a semigroup $S$ with a finite ideal we find the necessary and sufficient conditions to be an e.d.