2022/05/03 by Victoria Gould, Gould, Victoria, Georgia Schneider +1
Computer Science · Decision Sciences · #Advanced Algebra and Logic #FOS: Mathematics #Fuzzy and Soft Set Theory #Rings and Algebras (math.RA) #semigroups and automata theory
paper · doi:10.48550/arxiv.2205.01405
openalex publication_date 2022/05/03 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Let Q be an inverse semigroup. A subsemigroup S of Q is a left I-order in Q and Q is a semigroup of left I-quotients of S if every element in Q can be written as a-1b, where a, b ∈ S and a-1 is the inverse of a in the sense of inverse semigroup theory. If we insist on being able to take a and b to be R-related in Q we say that S is straight in Q and Q is a semigroup of straight left I-quotients of S. We give a set of necessary and sufficient conditions for a semigroup to be a straight left I-order. The conditions are in terms of two binary relations, corresponding to the potential restrictions of R and L from an oversemigroup, and an associated partial order. Our approach relies on the meet structure of the L of inverse semigroups. We prove that every finite left I-order is straight and give an example of a left I-order which is not straight.