Related papers: On Bounding Problems on Totally Ordered Commutativ…

Commutative totally ordered monoids abound, number systems for example. When the monoid is not assumed commutative, one may be hard pressed to find an example. One suggested by Professor Orr Shalit are the countable ordinals with addition.…

Let G be an additive abelian group whose finite subgroups are all cyclic. Let A_1,...,A_n (n>1) be finite subsets of G with cardinality k>0, and let b_1,...,b_n be pairwise distinct elements of G with odd order. We show that for every…

Let $G$ be an abelian group of finite order $n$, and let $h$ be a positive integer. A subset $A$ of $G$ is called {\em weakly $h$-incomplete}, if not every element of $G$ can be written as the sum of $h$ distinct elements of $A$; in…

We consider partially ordered sets of combinatorial structures under consecutive orders, meaning that two structures are related when one embeds in the other such that `consecutive' elements remain consecutive in the image. Given such a…

A subset $A$ of a commutative semigroup $X$ is called a $B_h$ set in $X$ if the only solutions to $a_1+\dots+a_h = b_1 + \cdots +b_h$ (with $a_i,b_i \in A$) are the trivial solutions $\{a_1,\dots,a_h\} = \{b_1,\dots,b_h\}$ (as multisets).…

An element e of an ordered semigroup $(S,\cdot,\leq)$ is called an ordered idempotent if $e\leq e^2$. We call an ordered semigroup $S$ idempotent ordered semigroup if every element of $S$ is an ordered idempotent. Every idempotent semigroup…

Combinatorics on multisets is used to deduce new upper and lower bounds on the number of numerical semigroups of each given genus, significantly improving existing ones. In particular, it is proved that the number $n_g$ of numerical…

The problem of embedding an ample semigroup in an inverse semigroup as a (2, 1, 1)-type subalgebra is known to be undecidable. In this article, we investigate the problem for certain classes of ample semigroups. We also give examples of…

Let $(G,+)$ be an abelian group and consider a subset $A \subseteq G$ with $|A|=k$. Given an ordering $(a_1, \ldots, a_k)$ of the elements of $A$, define its {\em partial sums} by $s_0 = 0$ and $s_j = \sum_{i=1}^j a_i$ for $1 \leq j \leq…

For a sequence $S$ of terms from an abelian group $G$ of length $|S|$, let $\Sigma_n(S)$ denote the set of all elements that can be represented as the sum of terms in some $n$-term subsequence of $S$. When the subsum set is very small,…

Can a large system be fully characterized using its subsystems via inductive reasoning? Is it possible to completely reduce the behavior of a complex system to the behavior of its simplest "atoms"? In the following paper we answer these…

We consider set covering problems where the underlying set system satisfies a particular replacement property w.r.t. a given partial order on the elements: Whenever a set is in the set system then a set stemming from it via the replacement…

Let $ x $ be an element of a finite group $ G $ and denote the order of $ x $ by $ \mathrm{ord}(x) $. We consider a finite group $ G $ such that $ \gcd(\mathrm{ord}(x),\mathrm{ord}(y))\leqslant 2 $ for any two vanishing elements $ x $ and $…

We propose a new approach to the half-liberation question, for the compact groups $T_N\subset G_N\subset U_N$, where $T_N=\mathbb Z_2^N$. Indeed, we can construct a quantum group $T_N^*\subset G_N^*\subset U_N^*$, simply by setting…

Two families $\mathcal{A}$ and $\mathcal{B}$ of sets are said to be cross-intersecting if each member of $\mathcal{A}$ intersects each member of $\mathcal{B}$. For any two integers $n$ and $k$ with $0 \leq k \leq n$, let ${[n] \choose \leq…

An algebraic structure is said to be congruence permutable if its arbitrary congruences $\alpha$ and $\beta$ satisfy the equation $\alpha \circ \beta =\beta \circ \alpha$, where $\circ$ denotes the usual composition of binary relations. For…

In this paper we characterize the monoid congruences of commutative semigroups by the help of the notion of the separator of subsets of semigroups. We show that every monoid congruence of a commutative semigroup S can be constructed by the…

Let $A_1,\ldots,A_n$ be finite subsets of an additive abelian group $G$ with $|A_1|=\cdots=|A_n|\ge2$. Concerning the two new kinds of restricted sumsets $$L(A_1,\ldots,A_n)=\{a_1+\cdots+a_n:\ a_1\in A_1,\ldots,a_n\in A_n,\ \text{and}\…

Let $n$ be a positive integer, and let $A$ be a set of $k\ge 2n-1$ integers. For the restricted sumset $$ S_n(A)=\{a_1+\cdots +a_n:\ a_1,\ldots,a_n\in A,\ \text{and}\ a_i^2\neq a_j^2\ \text{for} \ 1\le i<j\le n\}, $$ by a 2002 result of Liu…

Let $G$ be a finite, non-trivial abelian group of exponent $m$, and suppose that $B_1, ..., B_k$ are generating subsets of $G$. We prove that if $k>2m \ln \log_2 |G|$, then the multiset union $B_1\cup...\cup B_k$ forms an additive basis of…