Related papers: Decomposition of intra-regular $po$-$\Gamma$-semig…

Let $X$ be a set and let $S$ be an inverse semigroup of partial bijections of $X$. Thus, an element of $S$ is a bijection between two subsets of $X$, and the set $S$ is required to be closed under the operations of taking inverses and…

We study the right and left commutation semigroups of finite metacyclic groups with trivial centre. These are presented \[G(m,n,k) = \left\langle {a,b;{a^m} = 1,{b^n} = 1,{a^b} = {a^k}} \right\rangle \quad (m,n,k\in\mathbb{Z}^+)\] with…

Let M be a filtered module. Some properties of elements of M are "generic" in the following sense: (being open/stable) if an element z of M has a property P then any approximation of z has P; (being dense) any element of M is approximated…

For G a group and g in G, we define mappings pg(G) and lg(G) from G into G by pg(x)=[x,g] and lg(x)=[g,x]. We let P(G) and L(G) denote the subsemigroups of the set of all mappings from G to G generated by {pg: g in G} and {lg: g in G},…

We present an effective method for computing parametric primary decomposition via comprehensive Gr\"obner systems. In general, it is very difficult to compute a parametric primary decomposition of a given ideal in the polynomial ring with…

Let $G$ be a countable cancellative amenable semigroup and let $(F_n)$ be a (left) F{\o}lner sequence in $G$. We introduce the notion of an $(F_n)$-normal element of $\{0,1\}^G$. When $G$ = $(\mathbb N,+)$ and $F_n = \{1,2,...,n\}$, the…

Considering finite extensions K[A] \subseteq K[B] of positive affine semigroup rings over a field K we have developed in [1] an algorithm to decompose K[B] as a direct sum of monomial ideals in K[A]. By computing the regularity of…

Let $a$ be a non-invertible transformation of a finite set and let $G$ be a group of permutations on that same set. Then $\genset{G, a}\setminus G$ is a subsemigroup, consisting of all non-invertible transformations, in the semigroup…

Let $\sigma =\{\sigma_i |i\in I\}$ is some partition of all primes $\mathbb{P}$ and $G$ a finite group. A subgroup $H$ of $G$ is said to be $\sigma$-subnormal in $G$ if there exists a subgroup chain $H=H_0\leq H_1\leq \cdots \leq H_n=G$…

Regular chains and triangular decompositions are fundamental and well-developed tools for describing the complex solutions of polynomial systems. This paper proposes adaptations of these tools focusing on solutions of the real analogue:…

The aim of this note is to point out some inaccuracies in our paper \cite{HD} and to fix them. Some new notions are introduced and properties of them are investigated.

The prime graph $\Gamma(G)$ of a finite group $G$ (also known as the Gruenberg-Kegel graph) has as its vertices the prime divisors of $|G|$, and $p\text-q$ is an edge in $\Gamma(G)$ if and only if $G$ has an element of order $pq$. Since…

Suppose that $x$, $y$ are elements of a finite group $G$ lying in conjugacy classes of coprime sizes. We prove that $\langle x^G \rangle \cap \langle y^G \rangle$ is an abelian normal subgroup of $G$ and, as a consequence, that if $x$ and…

Stanley decompositions are used in invariant theory and the theory of normal forms for dynamical systems to provide a unique way of writing each invariant as a polynomial in the Hilbert basis elements. Since the required Stanley…

Assume $G$ is a definable group in a stable structure $M$. Newelski showed that the semigroup $S_G(M)$ of complete types concentrated on $G$ is an inverse limit of the $\infty$-definable (in $M^{eq}$) semigroups $S_{G,\Delta}(M)$. He also…

In this article, we first prove that the type of an affine semigroup ring is equal to the number of maximal elements of the Ap\'ery set with respect to the set of exponents of the monomials, which form a maximal regular sequence. Further,…

Let $V$ be a vector space and $U$ a fixed subspace of $V$. We denote the semigroup of all linear transformations on $V$ under composition of functions by $L(V)$. In this paper, we study the semigroup of all linear transformations on $V$…

Motivated by situations in which the removal of a zero (a.k.a., an absorbing element) from a semigroup yields a subsemigroup with another zero, sets of quasi-zeros (a.k.a., quasi-absorbing elements) are introduced as well as primitive…

Seymour's decomposition theorem is a hallmark result in matroid theory presenting a structural characterization of the class of regular matroids. Formalization of matroid theory faces many challenges, most importantly that only a limited…

A finite group $G$ is called uniformly semi-rational if there exists an integer $r$ such that the generators of every cyclic sugroup $\langle x \rangle$ of $G$ lie in at most two conjugacy classes, namely $x^G$ or $(x^r)^G$. In this paper,…