All Questions
11 questions
2
votes
1
answer
116
views
On the maximum elements of a numerical semigroup that have order between $n$ and $2n$
Let $S$ be a submonoid of the non-negative integers $\mathbb Z_{\geq 0}.$ If $\mathbb Z_{\geq 0} \setminus S$ is finite, we say that $S$ is a numerical semigroup. Let $S^*$ denote the collection of ...
2
votes
1
answer
94
views
What are the n-ary subsemigroups of $\mathbb{N}$?
There is a well-known result about the subsemigroups of $\mathbb{N}$ stating that the additive subsemigroup generated by a (finite) set $A$ of $\mathbb{N}$ is cofinite in $\mathbb{N}$ if and only if $\...
3
votes
2
answers
172
views
On the Hilbert function of a numerical semigroup
Recall that a numerical semigroup $S$ is a submonoid of the non-negative integers $\mathbb Z_{\geq 0}$ whose relative complement $\mathbb Z_{\geq 0} \setminus S$ is finite. Observe that the collection ...
51
votes
3
answers
3k
views
Is each squared finite group trivial?
A semigroup $S$ is defined to be squared if there exists a subset $A\subseteq S$ such that the function $A\times A\to S$, $(x,y)\mapsto xy$, is bijective.
Problem: Is each squared finite group ...
1
vote
1
answer
77
views
What is the minimal possible size of a subset of this semigroup satisfying the following conditions?
Suppose $A$ is some set. Let's define a pair semigroup over $A$ as $P[A] = (A\times A \cup \{0\}, \circ)$, where the $\circ$ operation is defined by the following two identities:
$\forall a \in P[A]$ ...
10
votes
0
answers
367
views
A formula for Frobenius number of certain numerical semigroups
The old formula for the Frobenius number of a numerical semigroup generated by two elements can be stated as follows: assume $\gcd\{a+1,b+1\}=1$, then the Frobenius number of $S= \left<a+1,b+1\...
1
vote
0
answers
29
views
Generating larger atoms from smaller ones in a simple $\text{C}_0$-monoid
Let $P$ be a finite set, $\mathscr F(P)$ the free abelian monoid with basis $P$ (which I'll write multiplicatively), $H$ a submonoid of $\mathscr F(P)$, and $\mathcal A(H)$ the set of atoms of $H$ (...
3
votes
0
answers
96
views
Given a primitive finite set $A\subseteq\bf N$ with $0\in A$, find two more primitive sets $B,C\subseteq\bf N$ with $B\ne C$ and $A+B=A+C$
Let $\mathcal P_{{\rm fin},0}(\mathbf N)$ be the monoid of all finite subsets of $\mathbf N$ containing $0$ with the operation of set addition
$$
(X, Y) \mapsto X + Y := \{x+y: x \in X \text{ and }y \...
0
votes
0
answers
125
views
Embedding a cancellative monoid into another in such a way that $|X-x|=|X|$, where $X$ is a fixed finite set and $x\in X$
Preliminaries.
Let $\mathbb A = (A, +)$ be a possibly non-commutative semigroup. For $X, Y \subseteq A$ we set
$$
X - Y := \{a \in A: a + y \in X\text{ for some }y \in Y\},
$$
which is just the usual ...
10
votes
2
answers
444
views
Iterated sumset inequalities in cancellative semigroups
This question is motivated by the following well-known theorems:
Thm (Plünnecke): If $A$ is a finite nonempty subset of an abelian group, then for every $n$ we have $|A^n| \le \frac{|AA|^n}{|A|^n}|A|$...
13
votes
1
answer
2k
views
Coin problem with permutations
Let $a,b,c$ be positive integers with gcd$(a,b,c)=1$, and let $\mathbb{N}$ denote the set of nonnegative integers.
It is well known that $\mathbb{N} \setminus (a \mathbb{N}+b \mathbb{N} + c \mathbb{N}...