Loading [MathJax]/extensions/MathZoom.js
Displaying 321 –
340 of
456
It was shown in [7] that any right reversible, cancellative ordered semigroup can be embedded into an ordered group and as a consequence, it was shown that a commutative ordered semigroup can be embedded into an ordered group if and only if it is cancellative. In this paper we introduce the concept of -maher and -maher semigroups and use a technique similar to that used in [7] to show that any left reversible cancellative ordered or -maher semigroup can be embedded into an ordered group.
Let A be a finite-dimensional algebra over an algebraically closed field with radical square zero, and such that all simple A-modules have dimension at most two. We give a characterization of those A that have finitely many conjugacy classes of left ideals.
We present an algorithm for computing the greatest integer that is not a solution of the modular Diophantine inequality , with complexity similar to the complexity of the Euclid algorithm for computing the greatest common divisor of two integers.
We study semigroups of labellings associated to a graph. These generalise the Jukes-Cantor model and phylogenetic toric varieties defined in [Buczynska W., Phylogenetic toric varieties on graphs, J. Algebraic Combin., 2012, 35(3), 421–460]. Our main theorem bounds the degree of the generators of the semigroup by g + 1 when the graph has first Betti number g. Also, we provide a series of examples where the bound is sharp.
Currently displaying 321 –
340 of
456