Related papers: Arithmetic properties encoded in undermonoids
Using automata-theoretic approach, Giambruno and Restivo have investigated on the intersection of two finitely generated submonoids of the free monoid over a finite alphabet. In particular, they have obtained Hanna Neumann property for a…
A subset $S$ of an integral domain $R$ is called a semidomain provided that the pairs $(S,+)$ and $(S, \cdot)$ are semigroups with identities. The study of factorizations in integral domains was initiated by Anderson, Anderson, and…
In this paper we study finite monoids M such that the group algebras over a domain R for all Schutzenberger groups of M are cell algebras. We show that for any such M the monoid algebra A over R has a standard cell algebra structure. Using…
A partial monoid $P$ is a set with a partial multiplication $\times$ (and total identity $1_P$) which satisfies some associativity axiom. The partial monoid $P$ may be embedded in a free monoid $P^*$ and the product $\star$ is simulated by…
We study the parameterized complexity of the following factorization problem: given elements $a,a_1, \ldots, a_m$ of a monoid and a parameter $k$, can $a$ be written as the product of at most (or exactly) $k$ elements from $a_1, \ldots,…
A locally compact group $G$ has the factorization property if the map $$C^*(G)\odot C^*(G)\ni a\otimes b\mapsto \lambda(a)\rho(b)\in\mathcal B(L^2(G))$$ is continuous with respect to the minimal C*-norm. This paper seeks to initiate a…
Matrix properties are a type of property of categories which includes the ones of being Mal'tsev, arithmetical, majority, unital, strongly unital and subtractive. Recently, an algorithm has been developed to determine implications…
In this paper, we prove that a finitely embedded $R$-module $M$ is Artinian if and only if for every prime ideal $\mathfrak{p}$ of $R$ with $(0:_RM)\subseteq \mathfrak{p}$, there exists a submodule $N^\mathfrak{p}$ of $M$ such that…
Marek Kuczma asked in 1980 whether for every positive integer $n,$ there exists a subsemigroup $M$ of a group $G,$ such that $G$ is equal to the $n$-fold product $M\,M^{-1} M\,M^{-1} \dots\,M^{(-1)^{n-1}},$ but not to any proper initial…
Let $H$ be a monoid, $\mathscr F(X)$ be the free monoid on a set $X$, and $\pi_H$ be the unique extension of the identity map on $H$ to a monoid homomorphism $\mathscr F(H) \to H$. Given $A \subseteq H$, an $A$-word $\mathfrak z$ (i.e., an…
Given a Noetherian ring $A$, the collection of all integrally closed ideals in $A$ which contain a nonzerodivisor, denoted $ic(A)$, forms a cancellative monoid under the operation $I*J=\overline{IJ}$, the integral closure of the product.…
Let $R$ be an integral domain. For elements $a,b \in R$, let $[a,b]$ denote their greatest common divisor, if it exists. We say that $R$ has the Z-property if whenever $a,b,c,d$ and $e$ are nonzero nonunits of $R$ such that $abc=de$, then…
We investigate the computational complexity of deciding whether a given univariate integer polynomial p(x) has a factor q(x) satisfying specific additional constraints. When the only constraint imposed on q(x) is to have a degree smaller…
Let $S \subset \mathbb{N}_0$ be a numerical monoid and let $\mathcal P_{\mathrm{fin}} (S)$, resp $\mathcal P_{\mathrm{fin},0}(S)$, denote the power monoid, resp. the restricted power monoid, of $S$, that is the set of all finite nonempty…
We study the way in which the abstract structure of a small overlap monoid is reflected in, and may be algorithmically deduced from, a small overlap presentation. We show that every C(2) monoid admits an essentially canonical C(2)…
A Puiseux monoid is an additive submonoid of the real line consisting of rationals. We say that a Puiseux monoid is reciprocal if it can be generated by the reciprocals of the terms of a strictly increasing sequence of pairwise relatively…
We introduce several classes of monoids satisfying up to five axioms and establish basic theories on their arithmetics. The one satisfying all the axioms is named natural monoid. Two typical examples are 1) the monoid $\mathbb{N}$ of…
A symmetric positive semi-definite matrix A is called completely positive if there exists a matrix B with nonnegative entries such that A=BB^T. If B is such a matrix with a minimal number p of columns, then p is called the cp-rank of A. In…
Let $H$ be a transfer Krull monoid over a subset $G_0$ of an abelian group $G$ with finite exponent. Then every non-unit $a\in H$ can be written as a finite product of atoms, say $a=u_1 \cdot \ldots \cdot u_k$. The set $\mathsf L(a)$ of all…
We show that a QWEP von Neumann algebra has the weak* positive approximation property if and only if it is seemingly injective in the following sense: there is a factorization of the identity of $M$ $$Id_M=vu: M{\buildrel…