Related papers: Finitely presented left orderable monsters
It was proved by Oliveira and Silva (2005) that every finitely generated inverse subsemigroup of the monogenic free inverse semigroup $FI_1$ is finitely presented. The present paper continues this development, and gives generating sets and…
Motivated by recent activity in low-dimensional topology, we provide a new criterion for left-orderability of a group under the assumption that the group is circularly-orderable: A group $G$ is left-orderable if and only if $G \times…
We construct a metrizable semitopological semilattice $X$ whose partial order $P=\{(x,y)\in X\times X:xy=x\}$ is a non-closed dense subset of $X\times X$. As a by-product we find necessary and sufficient conditions for the existence of a…
Uninorms play a prominent role both in the theory and the applications of Aggregations and Fuzzy Logic. In this paper the class of group-like uninorms is introduced and characterized. First, two variants of a general construction -- called…
We show that the following problems are decidable in a rank 2 free group F_2: does a given finitely generated subgroup H contain primitive elements? and does H meet the orbit of a given word u under the action of G, the group of…
We investigate the orbits of automaton semigroups and groups to obtain algorithmic and structural results, both for general automata but also for some special subclasses. First, we show that a more general version of the finiteness problem…
In this article, we show that a group $G$ is the union of two proper subsemigroups if and only if $G$ has a nontrivial left-orderable quotient. Furthermore, if $G$ is the union of two proper semigroups, then there exists a minimum normal…
We introduce a class $\A$ of finitely generated residually finite accessible groups with some natural restriction on one-ended vertex groups in their JSJ-decompositions. We prove that the profinite completion of groups in $\A$ almost…
By a proper cover of a finite group G we mean an extension of a nontrivial finite group by G. Our purpose is to show that a proper cover of a finite simple group L of Lie type always contains an element whose order differs from the element…
This work presents an example of a finitely presented semigroup $S$ containing an infinite nonnilpotent nil ideal $LS$, whose elements do not have a square (i.e. any word of the type $LXYYZ$ equals zero.)
In this paper we're considering the question of whether or not a partial order on a finite set is realisable as a Smale order of a structurally stable diffeomorphism or flow acting on a closed manifold. We classify the orders that are…
This paper has been withdrawn by the authors due to a crucial computational error. In this paper we deal with the finite case. We prove that a finite bounded ordered set can be represented as the order of principal congruences of a finite…
We find a condition on the acylindrical action of a finitely presented group on a simplicial tree which guarantees that this action will be dominated by an acylindrical action with finitely generated edge stabilisers, and find the first…
Stackability for finitely presented groups consists of a dynamical system that iteratively moves paths into a maximal tree in the Cayley graph. Combining with formal language theoretic restrictions yields auto- or algorithmic stackability,…
We present a streamlined and (hopefully) accessible proof of the model-completeness of the weak monadic second order version of a dense linear order with left-endpoint but no right-endpoint in a particular finite signature. We also show how…
We introduce L-presentations: group presentations given by a generating set, a set of relations and a set of substitution rules on the generating set producing more relations. We first study in full generality the structure of finitely…
We show that every complemented modular lattice can be converted into a left residuated lattice where the binary operations of multiplication and residuum are term operations. The concept of an operator left residuated poset was introduced…
A preferential arrangement of a finite set is an ordered partition. Associated with each such ordered partition is a chain of subsets or blocks endowed with a linear order. The chain may be split into sections by the introduction of a…
A regular ordered semigroup $S$ is called right inverse if every principal left ideal of $S$ is generated by an $\mathcal{R}$-unique ordered idempotent. Here we explore the theory of right inverse ordered semigroups. We show that a regular…
We consider the approximation properties of finite element spaces on quadrilateral meshes. The finite element spaces are constructed starting with a given finite dimensional space of functions on a square reference element, which is then…