2
votes
0answers
49 views

Pseudovarieties of monoids

All (pseudo)varieties considered here are (pseudo)varieties of monoids. It is known that any (finite or infinite) monoid that satisfies the identities \begin{equation} xhxyty = xhyxty, \quad ...
1
vote
0answers
128 views

Standard name for a Monoid/Semigroup with $a+b \leq a, b$?

I have seen suplattice and inflattice being used when dealing with a lattice. What about when you don't have a lattice? For instance, for reals $a,b > 0$, define $$a \oplus b = ...
4
votes
1answer
173 views

Is the monoid of taking iterated images and inverse images freely generated by the image and inverse image operation?

Let $\mathcal{F}$ denote the class of all functions. Let $U,L:\mathcal{F}\rightarrow\mathcal{F}$ denote the mappings where if $f:X\rightarrow Y$, then $U(f):P(X)\rightarrow P(Y),L(f):P(Y)\rightarrow ...
2
votes
0answers
97 views

Orbit-Stabilizer theorem for continuous groups

The orbit-stabilizer relationship (also known as the orbit-stabilizer theorem) is very clear for finite groups. Is there an equivalent relation for continuous groups? Also, is there a similar notion ...
4
votes
2answers
158 views

Embedding a linearly ordered free monoid into a linearly ordered group

A linearly ordered (shortly, l.o.) monoid is a triple $\mathbb M = (M, \cdot, \le)$ for which $(M, \cdot)$ is a (multiplicatively written) monoid and $\le$ is a total order on $M$ such that $xy < ...
3
votes
0answers
125 views

Correspondence between numerical semigroups and polynomials?

A numerical semigroup $A$ is defined as a subsemigroup of the semigroup $(\mathbb{N},+)$ of the positive integers such that the set $\mathbb{N}\setminus A$ is finite. Equivalently (for a subsemigroup) ...
3
votes
0answers
127 views

What is the combinatorial data classifying non-normal affine toric varieties?

Recall that a toric variety is a variety $V$ containing an open dense algebraic torus. Here an algebraic torus means a finite product of copies of the multiplicative group of the ground field (which I ...
5
votes
3answers
170 views

Locally finite varieties which are not finitely generated

Let $\Sigma$ be a signature consisting of operations with finite arity. Let $\mathcal{V}$ be a variety of algebras for this signature. Further suppose that $\mathcal{V}$ is locally finite i.e. every ...
2
votes
1answer
93 views

Maximal sub-inverse semigroups of $M_n(\mathbb{C})$ and $M_n(F_p)$

An inverse semigroup $S$ is a semigroup in which every element $x \in S$ has a unique inverse $y \in S$ such that $x = xyx$ and $y = yxy$. Are there some references characterizing the maximal ...
4
votes
1answer
133 views

Progress on group languages characterizations

Def. A group language is a recognizable language whose syntactic monoid is a group. q1. Is it known a "nice" combinatorial characterization of group languages ? q1.1. If no, is it well understood ...
2
votes
2answers
290 views

How many idempotent relations are there on an $n$-element set?

As far as I know, it is an open problem to give a formula counting transitive relations on an $n$-element set. Is it easier to count the idempotent relations, that is relations that are both ...
7
votes
2answers
296 views

Is there a general result that theorems about finite structures proved in ZFC can be proved in ZF?

The title question is too vague so let me be specific. Much of modern finite semigroup theory uses profinite semigroups and properties of profinite semigroups that depend on the existence of prime ...
3
votes
0answers
237 views

Is there a homological way to compute quiver presentations?

I have recently been studying with colleagues the representation theory of certain finite monoids that come up in probability theory and combinatorics, see Ken Brown's beautiful survey here. These ...
19
votes
2answers
591 views

Mapping from a finite index subgroup onto the whole group

Dear All, here is the question: Does there exist a finitely generated group $G$ with a proper subgroup $H$ of finite index, and an (onto) homomorphism $\phi:G\to G$ such that $\phi(H)=G$? My guess ...
4
votes
0answers
214 views

What is the pro-algebraic completion of the free semigroup on one generator?

This question is motivated by an attempt to understand what is going on in Tom's post from a certain point of view. Let $\mathbb N^+$ be the free semigroup on one generator (so the positive natural ...
3
votes
1answer
227 views

submonoid of a matrix monoid with a common eigenvector

Hello, I am considering two real invertible $3\times 3$ matrices $A$ and $B$ and a nonzero vector $v\in\mathbb{R}^3$ and i am wondering if the submonoid $E$ of the monoid $(A,B)$ genererated by $A$ ...
1
vote
1answer
184 views

The intersection of Block Groups and R-trivial (finite) monoids

Let $\textbf{BG}$ be the pseudovariety of block groups, also known as $\textbf{EJ}, \textbf{PG},\ldots,\text{etc.}$(see [1]), and let $\textbf{R}$ be the pseudovariety of R-trivial monoids, by the ...
5
votes
2answers
474 views

Do all finitely generated nilpotent semigroups have polynomial growth?

The notion of nilpotency passes nicely from groups to semigroups. Define $q_1(x,y)=xy$ and $$q_{i+1}(x,y,z_1,\cdots,z_i)=q_i(x,y,z_1,\cdots,z_{i-1})z_iq_i(y,x,z_1,\cdots,z_{i-1})$$ inductively for all ...
0
votes
1answer
128 views

Small set of acts over a countable monoid?

Given a countable monoid $S$, is the set of all (isomorphic representatives of) $S$-acts a small set?
14
votes
12answers
2k views

Why semigroups could be important?

There is known a lot about the use of groups -- they just really appear a lot, and appear naturally. Is there any known nice use of semigroups in Maths to sort of prove they are indeed important in ...
9
votes
3answers
477 views

The concept “conjugate class” in monoids.

Is there any concept in monoids that is similar to the concept "conjugate class" in groups? For example, are there any such similar concept in symmetric inverse monoids? Thank you very much.
4
votes
2answers
344 views

Membership problem in monoids

What is the simplest example of a monoid with undecidable membership problem? In other words, I'm looking for a concrete monoid $S$ such that there is no algorithm which takes elements $s_1,...,s_n$ ...
5
votes
1answer
322 views

Representations of products of groups (and monoids)

I have very little knowledge of representation theory, but the following has come up in my summer undergrad research project (relates to conformal field theory and geometric function theory). Suppose ...
3
votes
2answers
306 views

What is the relation between the number syntactic congruence classes, and the number of Nerode relation classes?

For a monoid $M$ and a subset $S$ of $M$, define the syntactic congruence $\equiv_S$ of $S$ as the least congruence on $M$ that saturates $S$, i.e. : $$u \equiv_S v \Leftrightarrow (\forall x, y)[xuy ...
1
vote
1answer
229 views

Vocabulary on monoid periodicity

I'm learning about periodic languages, and I'm confused over the vocabulary used to describe the periodicity of (syntactic) monoids. If I understand correctly, a monoid M is periodic if : $$(\forall ...