Related papers: Factorizations of the same length in abelian monoi…

Let $S$ be an infinite discrete semigroup. The operation on $S$ extends uniquely to the Stone-\v{C}ech compactification $\beta S$ making $\beta S$ a compact right topological semigroup with $S$ contained in its topological center. As such,…

We provide an algorithm that computes a set of generators for any complete ideal in a smooth complex surface. More interestingly, these generators admit a presentation as monomials in a set of maximal contact elements associated to the…

We consider a problem that involves finding similar elements in a collection of sets. The problem is motivated by applications in machine learning and pattern recognition. We formulate the similar elements problem as an optimization and…

In our earlier article~\cite{CanSakran} we initiated a study of the complement-finite submonoids of the group of integer points of a unipotent linear algebraic group. In the present article, we continue to develop tools and techniques for…

Let $\mathcal S$ be a semigroup of partial isometries acting on a complex, infinite-dimensional, separable Hilbert space. In this paper we seek criteria which will guarantee that the selfadjoint semigroup $\mathcal T$ generated by $\mathcal…

Given a finite group $G$ and a generating set $S \subseteq G$, the diameter $diam(G,S)$ is the least integer $n$ such that every element of $G$ is the product of at most $n$ elements of $S$. In this paper, for bounded $|S|$, we characterize…

The aim of this paper is to study the $p$-Frobenius vector of affine semigroups $S\subset \mathbb N^q$; that is, the maximum element, with respect to a graded monomial order, with at most $p$ factorizations in $S$. We produce several…

Let $S$ be a nonnegative semiring of the real line, called here a positive semiring. We study factorizations in both the additive monoid $(S,+)$ and the multiplicative monoid $(S\setminus\{0\}, \cdot)$. In particular, we investigate when,…

To any lattice $L \subset \mathbb{Z}^{m}$ one can associate the lattice ideal $I_{L} \subset K[x_{1},...,x_{m}]$. This paper concerns the study of the relation between the binomial arithmetical rank and the minimal number of generators of…

We prove that for any $\ell \geq 0$, there exists an algorithm which takes as input a description of a semi-algebraic subset $S \subset \mathbb{R}^k$ given by a quantifier-free first order formula $\phi$ in the language of the reals, and…

This paper considers numerical semigroups $S$ that have a non-principal relative ideal $I$ such that $\mu_S(I)\mu_S(S-I)=\mu_S(I+(S-I)) $. We show the existence of an infinite family of such which $I+(S-I)=S\backslash\{0\}$. We also show…

We study the structure of the commutative multiplicative monoid $\mathbb N_0[x]^*$ of all the non-zero polynomials in $\mathbb Z[x]$ with non-negative coefficients. We show that $\mathbb N_0[x]^*$ is not a half-factorial monoid and is not a…

We generalize the notion of symmetric semigroups, pseudo symmetric semigroups, and row factorization matrices for pseudo Frobenius elements of numerical semigroups to the case of semigroups with maximal projective dimension (MPD…

A numerical semigroup is an additive subsemigroup of the non-negative integers. In this paper, we consider parametrized families of numerical semigroups of the form $P_n = \langle f_1(n), \ldots, f_k(n) \rangle$ for polynomial functions…

The inclusion ideal graph $\mathcal{I}n(S)$ of a semigroup $S$ is an undirected simple graph whose vertices are all nontrivial left ideals of $S$ and two distinct left ideals $I, J$ are adjacent if and only if either $I \subset J$ or $J…

We consider factorizations $G=XY$ where $G$ is a general group, $X$ and $Y$ are normal subsets of $G$ and any $g\in G$ has a unique representation $g=xy$ with $x\in X$ and $y\in Y$. This definition coincides with the customary and…

We combine the language of monoids with the language of preorders so as to refine some fundamental aspects of the classical theory of factorization and prove an abstract factorization theorem with a variety of applications. In particular,…

It has been recently observed that fundamental aspects of the classical theory of factorization can be greatly generalized by combining the languages of monoids and preorders. This has led to various theorems on the existence of certain…

Let $n$ be a positive integer and $\mathcal M$ a set of rational $n \times n$-matrices such that $\mathcal M$ generates a finite multiplicative semigroup. We show that any matrix in the semigroup is a product of matrices in $\mathcal M$…

We study the following problem, first introduced by Dekking. Consider an infinite word x over an alphabet {0,1,...,k-1} and a semigroup homomorphism S:{0,1,...,k-1}* -> N. Let L_x denote the set of factors of x. What conditions on S and the…