On a Class of Lattice Ordered Inverse Semigroups

E-unitary inverse monoids and the Cayley graph of a group presentation

The word problem for inverse monoids presented by one idempotent relator

It is well-known that on an inverse semigroup S the relation ≦ defined by a ≦ b if and only if aa−1 = ab−1 is a partial order (called the natural partial order) on S and that this relation is closely related to the global structure of S (cf. (1, §7.1), (10)). Our purpose here is to study a partial order on regular semigroups that coincides with the relation defined above on inverse semigroups. It is found that this relation has properties very similar to the properties of the natural partial order on inverse semigroups. However, this relation is not, in general, compatible with the multiplication in the semigroup. We show that this is true if and only if the semigroup is pseudo-inverse (cf. (8)). We also show how this relation may be used to obtain a simple description of the finest primitive congruence and the finest completely simple congruence on a regular semigroup.

The word problem for inverse monoids generated by a set Γ subject to relations of the form e = f, where e and f are both idempotents in the free inverse monoid generated by Γ, is investigated. It is shown that for every fixed monoid of this form the word problem can be solved in polynomial time which solves an open problem of Margolis and Meakin. For the uniform word problem, where the presentation is part of the input, EXPTIME-completeness is shown. For the Cayley-graphs of these monoids, it is shown that the first-order theory with regular path predicates is decidable. Regular path predicates allow to state that there is a path from a node x to a node y that is labeled with a word from some regular language. As a corollary, the decidability of the generalized word problem is deduced. Finally, it is shown that the Cayley-graph of the free inverse monoid has an undecidable monadic second-order theory.

We study some aspects of Schein’s theory of cosets for closed inverse subsemigroups of inverse semigroups. We establish an index formula for chains of subsemigroups, and an analogue of M. Hall’s Theorem on the number of cosets of a fixed finite index. We then investigate the relationships between the following properties of a closed inverse submonoid of an inverse monoid: having finite index; being a recognizable subset; being a rational subset; being finitely generated (as a closed inverse submonoid). A remarkable result of Margolis and Meakin shows that these properties are equivalent for a closed inverse submonoid of a free inverse monoid.

Comparing and ranking information is an important topic in social and information sciences, and in particular on the web. Its objective is to measure the difference of the preferences of voters on a set of candidates and to compute a consensus ranking. Commonly, each voter provides a total order or a bucket order of all candidates, where bucket orders allow ties. In this work we consider the generalization of total and bucket orders to partial orders and compare them by the nearest neighbor and the Hausdorff Kendall tau distances. For total and bucket orders these distances can be computed in $\mathcal{O}(n \log n)$ time. We show that the computation of the nearest neighbor Kendall tau distance is NP-hard, 2-approximable and fixed-parameter tractable for a total and a partial order. The computation of the Hausdorff Kendall tau distance for a total and a partial order is shown to be coNP-hard. The rank aggregation problem is known to be NP-complete for total and bucket orders, even for four voters and solvable in $\mathcal{O}(n\log n)$ for two voters. It is NP-complete for two partial orders and the nearest neighbor Kendall tau distance. For the Hausdorff Kendall tau distance it is in $\mathbf{\Sigma_2^p}$ , but not in NP or coNP unless $\ensuremath{\mathbf{NP}} = \ensuremath{\mathbf{coNP}} $ , even for four voters.

We introduce a preorder on an inverse semigroup S associated to any normal inverse subsemigroup N, that lies between the natural partial order and Green’s $${\mathcal {J}}$$ –relation. The corresponding equivalence relation $$\simeq _N$$ is not necessarily a congruence on S, but the quotient set does inherit a natural ordered groupoid structure. We show that this construction permits the factorisation of any inverse semigroup homomorphism into a composition of a quotient map and a star-injective functor, and that this decomposition implies a classification of congruences on S. We give an application to the congruence and certain normal inverse subsemigroups associate to an inverse monoid presentation.

Comparing and ranking information is an important topic in social and information sciences, and in particular on the web. Its objective is to measure the difference of the preferences of voters on a set of candidates and to compute a consensus ranking. Commonly, each voter provides a total order of all candidates. Recently, this approach was generalized to bucket orders, which allow ties. In this work we further generalize and consider total, bucket, interval and partial orders. The disagreement between two orders is measured by the nearest neighbor Spearman footrule distance, which has not been studied so far. For two bucket orders and for a total and an interval order the nearest neighbor Spearman footrule distance is shown to be computable in linear time, whereas for a total and a partial order the computation is NP-hard, 4-approximable and fixed-parameter tractable. Moreover, in contrast to the well-known efficient solution of the rank aggregation problem for total orders, we prove the NP-completeness for bucket orders and establish a 4-approximation.

For any amalgam ( S , T ; U ) (S,\,T;\,U) of inverse semigroups, it is shown that the natural partial order on S ∗ U T S{{\ast }_U}T , the (inverse semigroup) free product of S S and T T amalgamating U U , has a simple form on S ∪ T S \cup T . In particular, it follows that the semilattice of S ∗ U T S{{\ast }_U}T is a bundled semilattice of the corresponding semilattice amalgam ( E ( S ) , E ( T ) ; E ( U ) ) (E(S),\,E(T);\,E(U)) ; taken jointly with a result of Teruo Imaoka, this gives that the class of generalized inverse semigroups has the strong amalgamation property. Preserving finiteness is also considered.

Finding all solutions of equations in free groups and monoids with involution

The word problem for inverse monoids generated by a set $Gamma$ subject to relations of the form $e=f$, where $e$ and $f$ are both idempotents in the free inverse monoid generated by $Gamma$, is investigated. It is shown that for every fixed monoid of this form the word problem can be solved in polynomial time which solves an open problem of Margolis and Meakin. For the uniform word problem, where the presentation is part of the input, EXPTIME-completeness is shown. For the Cayley-graphs of these monoids, it is shown that the first-order theory with regular path predicates is decidable. Regular path predicates allow to state that there is a path from a node $x$ to a node $y$ that is labeled with a word from some regular language. As a corollary, the decidability of the generalized word problem is deduced. Finally, some results on free partially commutative inverse monoids are presented.

Comparing genomes of different species is a crucial problem in comparative genomics. Different measures have been proposed to compare two genomes: number of common intervals, number of adjacencies, number of reversals, etc. These measures are classically used between two totally ordered genomes. However, genetic mapping techniques often give rise to different maps with some unordered genes. Starting from a partial order between genes of a genome, one method to find a total order consists in optimizing a given measure between a linear extension of this partial order and a given total order of a close and well-known genome. However, for most common measures, the problem turns out to be NP-hard. In this paper, we propose a (0,1)-linear programming approach to compute a linear extension of one genome that maximizes the number of common intervals (resp. the number of adjacencies) between this linear extension and a given total order. Next, we propose an algorithm to find linear extensions of two partial orders that maximize the number of adjacencies.KeywordsPartial OrderTotal OrderLinear ExtensionBoolean VariableReduction RuleThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Given a nonempty set \(X\) and \(Y\subseteq X\), we denote by \(T(X,Y)\) the subsemigroup of the full transformation semigroup \(\mathcal{T}_X\) on \(X\) consisting of all transformations whose range is contained in \(Y\). In this paper, we endow the semigroup \(T(X,Y)\) with the natural partial order and investigate when two elements are related, then find elements which are compatible with the order. Also, we characterize the minimal elements and the maximal elements.

The flow set with partial order is a mixed-integer set described by a budget on total flow and a partial order on the arcs that may carry positive flow. This set is a common substructure of resource allocation and scheduling problems with precedence constraints and robust network flow problems under demand/capacity uncertainty. We give a polyhedral analysis of the convex hull of the flow set with partial order. Unlike for the flow set without partial order, cover-type inequalities based on partial order structure are a function of a lifting sequence. We study the lifting sequences and describe structural results on the lifting coefficients for general and simpler special cases. We show that all lifting coefficients can be computed in polynomial time by solving maximum weight closure problems in general. For the special case of induced-minimal covers, we give a sequence-dependent characterization of the lifting coefficients. We prove, however, if the partial order is defined by an arborescence, then lifting is sequence-independent and all lifting coefficients can be computed in linear time. Moreover, if the partial order is defined by a path (total order), then the coefficients can be expressed explicitly. We also give a complete polyhedral description of the flow set with partial order for the polynomially-solvable total order case. We show that finding an optimal lifting order for a given induced-minimal cover and a given fractional solution is a submodular optimization problem, which is solved greedily. Finally, we present preliminary computational results with a cutting-plane algorithm based on the lifting and separation results.

Type B semigroups are generalizations of inverse semigroups, and every inverse semigroup admits an [Formula: see text]-unitary cover (M. Petrich, Inverse Semigroups (Wiley, New York, 1984)). Motivated by studying [Formula: see text]-unitary cover for inverse semigroups, and as a continuation of Petrich’s works in inverse semigroups, in this paper, we first introduce the concept of ∗-prehomomorphism of a type B semigroup. After obtaining some basic properties, we get some structure theorems and give some conditions for a type B semigroup which is constructed by using the ∗-prehomomorphism to be proper. In particular, we introduce the notion of [Formula: see text]-unitary good cover for an abundant semigroup, and prove that every type B semigroup with compatible natural partial order admits an [Formula: see text]-unitary good cover.