Related papers: Existence of $E_0$--Semigroups for Arveson Systems…
To a numerical semigroup $S$, Eliahou associated a number $E(S)$ and proved that numerical semigroups for which the associated number is non negative satisfy Wilf's conjecture. The search for counterexamples for the conjecture of Wilf is…
We prove that every strongly commuting pair of CP_0-semigroups has a minimal E_0-dilation. This is achieved in two major steps, interesting in themselves: 1: we show that a strongly commuting pair of CP_0-semigroups can be represented via a…
We improve on earlier results on the closure under free products of the class of automaton semigroups. We consider partial automata and show that the free product of two self-similar semigroups (or automaton semigroups) is self-similar (an…
Ehresmann semigroups may be viewed as biunary semigroups equipped with domain and range operations satisfying some equational laws. Motivated by some of the main examples, we here define ordered Ehresmann semigroups, and consider their…
Riemannian and pseudo-Riemannian symmetric spaces with semisimple transvection group are known and classified for a long time. Contrary to that the description of pseudo-Riemannian symmetric spaces with non-semisimple transvection group is…
A major theme in arithmetic combinatorics is proving multiple recurrence results on semigroups (such as Szemer\'edi's theorem) and this can often be done using methods of ergodic Ramsey theory. What usually lies at the heart of such proofs…
In this paper we discuss the problem of existence of so called weak Sierpi\'nski sets in groups. It is known that group $G$ has a Sierpi\'nski subset if and only if it contains a free subgroup. In their paper, Tomkowicz and Wagon…
We generalize the Poisson-Lie T-duality by making use of the structure of the affine Poisson group which is the concept introduced some time ago in Poisson geometry as a generalization of the Poisson-Lie group. We also introduce a new…
Delorme suggested that the set of all complete intersection numerical semigroups can be computed recursively. We have implemented this algorithm, and particularized it to several subfamilies of this class of numerical semigroups: free and…
The isomorphism of 0-homology groups of a categorical at zero semigroup and homology groups of its 0-reflector is proved. Some applications of 0-homology to Eilenberg-MacLane homology of semigroups are given.
Paterson showed how to construct an etale groupoid from an inverse semigroup using ideas from functional analysis. This construction was later simplified by Lenz. We show that Lenz's construction can itself be further simplified by using…
This paper is a continuation of the paper "Numerical Semigroups: Ap\'ery Sets and Hilbert Series". We consider the general numerical AA-semigroup, i.e., semigroups consisting of all non-negative integer linear combinations of relatively…
A numerical semigroup is an additive subsemigroup of the natural numbers that contains zero and has finite complement. A numerical semigroup is irreducible if it cannot be written as an intersection of numerical semigroups properly…
In a recent volume of Mathematics Magazine (Vol. 90, No. 3, June 2017) there is an interesting article by Seth Zimmerman, titled Detecting Deficiencies: An Optimal Group Testing Algorithm. The claim in the summary is contradictory to…
In this paper we provide an overview of the class of inverse semigroups $S$ such that every congruence on $S$ relates at least one idempotent to a non-idempotent; such inverse semigroups are called $E$-disjunctive. This overview includes…
In this paper, we construct a new homology theory for semi-groups satisfying the self distributivity axiom or the idempotency axiom. Next, we consider the geometric realization corresponding to the homology theory. We continue with the…
The monogenic free inverse semigroup $FI_1$ is not finitely presented as a semigroup due to the classic result by Schein (1975). We extend this result and prove that a finitely generated subsemigroup of $FI_1$ is finitely presented if and…
We prove several results from different areas of extremal combinatorics, giving complete or partial solutions to a number of open problems. These results, coming from areas such as extremal graph theory, Ramsey theory and additive…
It is shown that the classification theorems for semisimple algebraic groups in characteristic zero can be derived quite simply and naturally from the corresponding theorems for Lie algebras by using a little of the theory of tensor…
We prove that, in both real and complex cases, there exists a pair of matrices that generates a dense subsemigroup of the set of $n\times n$ matrices.