2
votes
0answers
66 views

The lattice points of a f.g. rational cone form a f.g. monoid.

In their book "Polytopes, Rings, and K-Theory" Bruns and Gubeladze sketch an alternative approach to Gordan's Lemma, which is stated in the headline (f.g. = finitely generated). I don't understand the ...
1
vote
1answer
56 views

If $G,H$ are monoids and not groups, prove that $f(e_G)=e_H$ may be wrong.

Problem: If $f:G\longrightarrow H$ is a homomorphism of groups, then $f(e_G)=e_H$ and $f(a^{-1})=f(a)^{-1}, \forall a\in G$. Show by example that the first conclusion may be false if $G, H$ are ...
1
vote
0answers
59 views

How many associative ternary operations there are on a finite set?

We know that algebraic operation a is function $f:\underbrace{\left ( X\times X\times \cdots \times X\right )}_{t\ \text{times}}\rightarrow{X}$ If $X$ is a set and and cardinality is $|X|=n$ then ...
2
votes
0answers
37 views

Commutative Cancellative Semigroup: When is an irreducible element prime?

Suppose $(S,\cdot)$ is a semigroup with neutral element $e$ (i.e. $xe=ex=x$ for all $x\in S$) and the following properties: S is commutative: $xy=yx$. S is cancellative: $xy = xz$ implies $y = z$. ...
0
votes
1answer
30 views

Involution on semigroups with identity

I'm trying to understand the following: Let $S$ be a semigroup. By an involution on $S$ we mean a map $* : S \to S$ satisfying for all $a,b\in S$ $(ab)^*=b^*a^*$ $(a^*)^*=a $ My problem is the ...
2
votes
1answer
20 views

Does a discrete semilattice of finite width have finite number of points between any pair of elements.

Let $(S,<)$ be a countably infinite semilattice such that: 1) $S$ is no-where dense - i.e. there does not exist a subset $T$ such that for all $a,b\in T$ with $a<b$, there exists $c\in T$ with ...
2
votes
1answer
30 views

A construction using a semiring

In page number 3 of J.S. Golan's book Semirings and their applications, there is a result which says that if $R$ is a hemiring and $S$ is a subhemiring of $R$ which is a semiring having ...
1
vote
1answer
27 views

Semigroups — Underlying Set Non Empty or it can be Empty?

Many authors consider Semigroups being Non Empty sets. Others include empty sets as Semigroups. What is the rationale behind both choices ?
3
votes
0answers
50 views

semidirect product of semigroups

Let $S,T$ be two semigroups. A function $f:S\to T$ is called multiplicative if for any $x,y\in S$ we have $f(xy)=f(x)f(y)$. If $T=S$ then $f:S\to S$ is called automorphism on $S$. A function ...
2
votes
2answers
29 views

Semigroups and units

I am working my way though Basic Algebra 1. I am currently on chapter 1 , and more specifically I busy with the following exercise: "Let $S$ be a set a define a product in $S$ by $ab=b $. Show that ...
0
votes
1answer
45 views

How to show $c-b\lt b-a$

The question: Let $G$ be an Arf semigroup and $a\lt b\lt c$ be three consecutive elements in $G$. How to show that $c-b\lt b-a$ and how to show that this is not necessarily the case for every ...
0
votes
0answers
54 views

What are $\Gamma$-semigroups?

I have some problems with $\Gamma$-Semigroups, the definition that I've found is A $\Gamma$-Semigroup is a pair $(M,\Gamma)$ defined as follow If $x,y$ and $z$ are in $M$ and $\alpha$ and ...
0
votes
1answer
33 views

Isomorphism of direct product of semigroups

I would appreciate some help with the following problem. Consider four semigroups $A,B,C,D$. I was able to prove that $A\cong C\wedge B\cong D$ implies $A\times B\cong C\times D$. But does also ...
1
vote
1answer
38 views

positive integer polynomial under the usual polynomial multiplication

consider the set of polynomials with positive integer coefficients together with the operation, usual multiplication of polynomials. now my first question is does this set together with the ...
1
vote
1answer
31 views

Findout if $\min(x,y)$ and $\max(x,y)$ are semigroup, monoid or group

I need to find out whether $A \oplus B := \max(A,B)$ or $A \ominus B := \min(A,B)$ form a semigroup, monoid or group for $\oplus : \mathbb{N} \times \mathbb{N} \to \mathbb{N}$ and $\ominus : ...
1
vote
1answer
46 views

Generalising cover maps from monoids to semigroups

Let $T,S$ be monoids. A partial surjective mapping $\psi : T \to S$ is called a cover map if for each $s \in S$ there exists some $\hat{s} \in T$ called a cover of $s$ such that for each $t \in ...
2
votes
1answer
74 views

What does $\mathcal{J}$ stand for in Green relations?

Following this book The Algebraic Theory of Semigroups, Volume I , we see that: $a\mathcal{L}b$ means $a$ and $b$ generate the same principle left ideal of the semigroup $S$. $a\mathcal{R}b$ means ...
2
votes
1answer
47 views

Testing for the cancellation laws

When I'm given a presentation of a finitely generated semigroup/monoid, are there any tricks I could use to check if it is cancellative on both sides? I'm not asking for a general algorithm, as I ...
4
votes
1answer
100 views

Naturally Ordered Semigroup: Why does axioms imply order of group is infinite countable ? Why are every group equal up to isomorphism?

Naturally Ordered Semigroup: http://www.proofwiki.org/wiki/Definition:Naturally_Ordered_Semigroup I know $\mathbb N$ is a naturally ordered semigroup by definition. Also I know that the naturally ...
6
votes
0answers
50 views

What can we learn about a magma by studying these monoids?

Given a magma $(X,*)$, we get three monoids in the following way. First, define a pair of functions $L,R : X \rightarrow (X \rightarrow X).$ $$(Lx)(y) = x*y,\quad (Rx)(y) = y*x$$ Then each of the ...
1
vote
1answer
45 views

Does Cartesian Product and Collection of all Sets Perform a Semigroup?

We know that the Cartesian Product is a binary operation. Also it is an associative operation. We know that Cartesian Product of two set is again set, there is even closure axiom. So I need to know ...
0
votes
0answers
58 views

Principal ideal in a semigroup ring.

Let $S= \langle(0,1),(3,2),(5,2) \rangle \subset \mathbb{N}^2 $ be a semigroup and consider the semigroup ring $K[S]$, with $K$ a field. We can consider the principal ideal generated by ...
1
vote
2answers
54 views

If a semigroup satisfies these identities, is it necessarily commutative?

Suppose a semigroup $X$ satisfies the following identities. $$xya\equiv yxa,\quad axy \equiv ayx$$ Without assuming anything further, can we deduce that $X$ satisfies $xy \equiv yx$? In particular, ...
0
votes
1answer
26 views

Do cosets of this semigroup partition this ring?

Let $R = \Bbb{Z}^3$ be the usual direct product ring, and let $S = \{ (k^a, k^b, k^c) : k \in \Bbb{Z} - \{0\}\}$ be a subsemigroup of $R$. Then do the cosets $aS$ partition $R$? Let $R^* = S^{-1}R$ ...
1
vote
1answer
50 views

Unique idempotents in semigroups

In a finite semigroups every element has a unique idempotent power, just take $s^{n!}$ where $n = |S|, s \in S$. In an infinite semigroup there are clearly elements without idempotents, just take ...
3
votes
2answers
74 views

On the powerset of a monoid, does the second operation play nice with the first? Indeed, is it even useful?

Let $X$ denote a monoid. Then we can make $Y = \mathcal{P}(X)$ into a monoid, too. Define $$AB = \{ab \mid a \in A, b \in B\}$$ for all $A,B \in Y.$ We see immediately that $1$ (shorthand for $\{1\}$) ...
2
votes
1answer
50 views

A semigroup $S$ that $|S| > 2$ is regular if and only if $x^2=x$ for any $x \in S$ where $S-\{x\}$ is a group

A semi-group $S$ is called regular if for any $y \in S$ there exists $a \in S$ such that $yay=y$. Let $S$ be a semi-group with more than two elements and $x \in S$ be such an element that $S - ...
1
vote
1answer
39 views

Does there exist a commutative magma such that $\mid$ is transitive, which is not a semigroup?

Let $M$ denote a commutative magma, and write $x \mid y$ iff $xa=y$ for some $a \in M$. If $M$ is a semigroup, then $\mid$ is transitive. Does there exist a commutative magma such that $\mid$ is ...
2
votes
1answer
70 views

If $S$ is a right group, then every $\mathcal L$-class is a $\mathcal H$-class and also a subgroup.

A semigroup $S$ is called right simple if it contains no proper right ideal. A semigroup that is right simple and left cancellative is called a right group. This is equivalent to saying that, for any ...
4
votes
1answer
94 views

definition of (semi)group (co)homology

I'm puzzled why "group cohomology" contains terms 'group' (instead of 'semigroup') and 'cohomology' (instead oh 'homology and cohomology'). I'm new to the subject. Please inform me of any claims ...
4
votes
0answers
64 views

Can we say anything about the structure of the semigroup of non-coprime pairs after this?

Let $S = \{(a,b) : \ a, b \in \Bbb{Z} \wedge \gcd(a,b) \neq 1 \}$. Then it forms a semigroup under componentwise multiplication and if we add an exception, that even though $\gcd(1,1) = 1$, we ...
1
vote
0answers
48 views

What operations is this set closed under? The set of all $\{(a,b) : (a,b) \in \Bbb{Z}^2, \gcd(a,b) \neq 1\}$.

Let $S = \{(a,b): a,b \in \Bbb{Z}, \gcd(a,b) \neq 1 \}$. Under what binary operations is $S$ closed (that we can come up with)? I came up with the following: $$ \begin{align*} (a,b)(c,d) = \\ ...
0
votes
0answers
27 views

Proper term for a monotonic magma

Let $M$ be the multiplication table for a finite magma. Entries are labeled $0,\ldots,n-1$. M has the property that $M(i,j)\ge i, M(i,j) \ge j$. What is the proper term for this kind of magma and ...
1
vote
3answers
94 views

Semigroups isomorphism [duplicate]

Does there exist an isomorphism between the semigroups $S(4)$ and ‎‎‎‎‎‎$\mathbf Z_{256‎‎‎‎‎‎‎}$.‎ $S(4)$ is the set of all maps from the set $X$ to itself and $X = \{1, 2, 3, 4\}$. $S(4)$ is a ...
1
vote
1answer
79 views

Semigroup isomorphism

Does there exist an isomorphism between the semigroups $S(4)$ and $\mathbb{‎‎‎‎‎Z}_{‎256}$?‎ $S(4)$ is the set of all maps from the set $X$ to itself and $X =\{1, 2, 3, 4\}$, $S(4)$ is a ...
3
votes
1answer
196 views

G is a group if and only if for all $a,b∈G$, $ax=b$ has solution; true or false? Why?

I think we only need $ax=b$ or $ya=b$ have solutions in $G$, I'll prove it. Proof: (I) $G$ is a group $\implies$ $a^{-1}ax=a^{-1}b$ $\implies$ $x=a^{-1}b$ $\implies$ $ax=b$ has solutions in $G$ ...
9
votes
1answer
100 views

Does the Trace product in a semigroup have any relation with Trace of a matrix / matrix product

I recently read an article on generalized inverses and Green's relations (by X.Mary). The framework is semigroups, but obviously it has a lot of application within matrix theory. In the article ...
0
votes
1answer
40 views

Why $f(x)=x$ for any $x\in f(X)$?

The set $S(X,X)$ of all mappings of a set $X$ to itself with the composition of mappings in the role of multiplication, where $|X|>1$. Why is not it a group? Let $X$ be a nonempty set. Then the ...
1
vote
3answers
41 views

Example for a claim

If $H$ is a subsemigroup of a semigroup $S$, then it may happen that, for some $a$ and $b$ in $S$, the sets $aH$ and $bH$ don't coincide and, nonetheless, are not disjoint. Does there exist an ...
3
votes
3answers
108 views

How could I understand this sentence:

How could I understand this sentence: For any subgroup $H$ of a group $G$ we have $H^2=HH=H$. However, in general, the same is not true for subsemigroups of semigroups. Thanks a lot!
0
votes
2answers
78 views

How could I prove that the equality $a^na^m=a^{n+m}$ in a semigroup with identity?

Let $S$ be a semigroup with a identity. How could I prove that the equality $a^na^m=a^{n+m}$ which holds for all $n,m \in \mathbb Z$. Note that $a \in S$ and $\mathbb Z$ denotes the set of all ...
1
vote
2answers
293 views

Is associative binary operator closed on this subset?

Here is the problem: Suppose that $*$ is an associative binary operation on a set $S$. Let $$H:= \{a \in S\mid a * x = x * a \mbox{ for all }x\in S\}.$$ In other words, $H$ is consisting of all ...
1
vote
1answer
154 views

If in a semigroup $S$, $\forall x \exists ! y:xyx=x$, then $S$ is a group [duplicate]

If for all $x$ in a semigroup $S$, there exists a unique $y$ such that $x y x=x$, then $S$ is a group. (Not to be confused with inverse semigroup, where only $y$ satisfying both $xyx=x$ and $yxy=y$ is ...
-1
votes
2answers
105 views

Building factor semigroup w.r.t. $I_n = \{ w \in A^+ : |w| \ge n \}$.

I don't understand the following factor semigroup. Consider the pseudovariety $N$ of nilpotent semigroups. For any finite alphabet $A$, let $I_n = \{ w \in A^+ : |w| \ge n \}$. Then $A^+ / I_n$ is ...
1
vote
1answer
75 views

Proving $\mathcal{D}$-class of semigroup.

Theorem 2.17 If $a$ and $b$ are elements of a semigroup $S$, then $ab\in R_a\cap L_b$ if and only if $R_b\cap L_a$ contains an idempotent. If this is the case, then $$aH_b = H_a b = H_a H_b ...
4
votes
1answer
31 views

Semigroup which satisfied $(xy)^{\pi} = (xy)^{\pi}x$ and principal right ideals

Let $(S,\cdot)$ be a finite semigroup, then every $s \in S$ has an unique idempotent power, i.e. there exists a smallest $i \in \mathbb N$ such that $s^i$ is idempotent. It is the unique idempotent in ...
7
votes
3answers
410 views

Is a semigroup $G$ with left identity and right inverses a group?

Hungerford's Algebra poses the question: Is it true that a semigroup $G$ that has a left identity element and in which every element has a right inverse is a group? Now, If both the identity and the ...
6
votes
1answer
113 views

Structure theorem for finitely generated commutative $semi$groups.

$\newcommand{\ZZ}{\mathbb{Z}}$ It is a classical theorem that a finitely generated commutative group is isomorphic to one of the form: $$ \ZZ^n \oplus \ZZ/{m_1}\ZZ \oplus \ZZ/{m_2}\ZZ \oplus \dots ...
1
vote
2answers
156 views

Whether $L=\{(a^m,a^n)\}^*$ is regular or not?

I am condidering the automatic structure for Baumslag-Solitar semigroups. And I have a question. For any $m,n \in Z$, whether the set $L=\{(a^m,a^n)\}^*$ is regular or not. Here a set is regular means ...
5
votes
1answer
185 views

Help me prove equivalently of regular semigroup and group.

Let $S$ be a semigroup. Prove that the following are equivalent: $\forall a \in S \exists! x \in S$ such that $ax \in E(S)$ where $E(S)$ is the set of all idempotent. $\forall a \in S \exists! x \in ...