Related papers: G. S. Tseytin's seven-relation semigroup with unde…
The problem behind this paper is the proper measurement of the degree of quality/acceptability/distance to arbitrage of trades. We are narrowing the class of coherent acceptability indices introduced by Cherny and Madan (2007) by imposing…
We study automaton structures, i.e. groups, monoids and semigroups generated by an automaton, which, in this context, means a deterministic finite-state letter-to-letter transducer. Instead of considering only complete automata, we…
This paper aims to introduce a construction technique of set-theoretic solutions of the Yang-Baxter equation, called strong semilattice of solutions. This technique, inspired by the strong semilattice of semigroups, allows one to obtain new…
Relation algebra and its reducts provide us with a strong tool for reasoning about nondeterministic programs and their partial correctness. Demonic calculus, introduced to model the behaviour of a machine where the demon is in control of…
We consider the complexity of Green's relations when the semigroup is given by transformations on a finite set. Green's relations can be defined by reachability in the (right/left/two-sided) Cayley graph. The equivalence classes then…
We call a restriction semigroup almost perfect if it is proper and its least monoid congruence is perfect. We show that any such semigroup is isomorphic to a `$W$-product' $W(T,Y)$, where $T$ is a monoid, $Y$ is a semilattice and there is a…
We present a new proof for the main claim made in the author's paper "On the identity bases of Brandt semigroups" (Ural. Gos. Univ. Mat. Zap. 14, no.1 (1985), 38--42); this claim provides an identity basis for an arbitrary Brandt semigroup…
Given a regular language L, we effectively construct a unary semigroup that recognizes the topological closure of L in the free unary semigroup relative to the variety of unary semigroups generated by the pseudovariety R of all finite…
This paper pursues an investigation on groups equipped with an $L$-ordered relation, where $L$ is a fixed complete complete Heyting algebra. First, by the concept of join and meet on an $L$-ordered set, the notion of an $L$-lattice is…
A major motivation for the development of semigroup theory was, and still is, its applications to the study of formal languages. Therefore, it is not surprising that the correspondence $\mathcal X\mapsto B(\mathcal X)$, associating to each…
Numerical semigroups have been extensively studied throughout the literature, and many of their invariants have been characterized. In this work, we generalize some of the most important results about symmetry, pseudo-symmetry, or…
We consider the class of groups whose word problem is poly-context-free; that is, an intersection of finitely many context-free languages. We show that any group which is virtually a finitely generated subgroup of a direct product of free…
We generalise a key result of one-relator group theory, namely Magnus's Freiheitssatz, to partially commutative groups, under sufficiently strong conditions on the relator. The main theorem shows that under our conditions, on an element $r$…
We prove that the word problem of a finitely generated group $G$ is in NP (solvable in polynomial time by a non-deterministic Turing machine) if and only if this group is a subgroup of a finitely presented group $H$ with polynomial…
In continuous first-order logic, the union of definable sets is definable but generally the intersection is not. This means that in any continuous theory, the collection of $\varnothing$-definable sets in one variable forms a…
The aim of this note is to point out some inaccuracies in our paper \cite{HD} and to fix them. Some new notions are introduced and properties of them are investigated.
In this paper one construction of composition formations was introduced. This construction contains formations of quasinilpotent groups, $c$-supersoluble groups, groups defined by ranks of chief factors and some new classes of groups. A…
A theorem of Glasner from 1979 shows that if $Y \subset \mathbb{T} = \mathbb{R}/\mathbb{Z}$ is infinite then for each $\epsilon > 0$ there exists an integer $n$ such that $nY$ is $\epsilon$-dense. This has been extended in various works by…
The consistency problem for a class of algebraic structures asks for an algorithm to decide for any given conjunction of equations whether it admits a non-trivial satisfying assignment within some member of the class. By Adyan (1955) and…
This is an English translation of three articles, originally written in German, by Wilhelm Magnus (1907--1990). The articles are from 1930, 1931, and 1932, respectively, and were the first articles published on one-relator group theory. The…