Results 101 to 110 of about 532 (202)

Orders of Finite Reductive Monoids

open access: yes, 2008
We show four formulas for calculating the orders of finite reductive monoids with zero. As applications, these formulas are then used to calculate the orders of finite reductive monoids induced from the $F_q$-split $\J$-irreducible monoids $\overline {K^*ρ(G_0)}$ where $G_0$ is a simple algebraic group over the algebraic closure of $F_q$, and $ρ: G_0 ...
Li, Zhuo, Li, Zhenheng, Cao, You'an
openaire   +2 more sources

Arithmetic of Dedekind cuts of ordered Abelian groups

open access: yes, 2008
We study Dedekind cuts on ordered Abelian groups. We introduce a monoid structure on them, and we characterise, via a suitable representation theorem, the universal part of the theory of such ...
Fornasiero, Antongiulio   +1 more
core   +1 more source

On the automorphism group of a linear algebraic monoid

open access: yes, 1983
Let S S be a connected regular monoid with zero. It is shown that an automorphism of S S is inner if and only if it sends each idempotent of S S to a conjugate idempotent. In the language of semigroup
Mohan S. Putcha
core   +1 more source

On the Structure of Balanced Residuated Partially Ordered Monoids

open access: yes
A residuated poset is a structure $\langle A,\le,\cdot,\backslash,/,1 \rangle$ where $\langle A,\le \rangle$ is a poset and $\langle A,\cdot,1 \rangle$ is a monoid such that the residuation law $x\cdot y\le z\iff x\le z/y\iff y\le x\backslash z$ holds. A residuated poset is balanced if it satisfies the identity $x\backslash x \approx x/x$.
Stefano Bonzio   +4 more
openaire   +3 more sources

Effective Étale-Descent Morphisms in the Category of M-ordered Sets

open access: yes, 2015
A characterization of effective étale-descent morphisms in the category M-Ord of M-ordered sets, for a given monoid M, is obtained using the corresponding characterization in the category Cat of small ...
Basile, Pier Giorgio
core   +1 more source

Classes of Ultrasimplicial Lattice-Ordered Abelian Groups

open access: yes, 1999
A lattice-ordered abelian group is called ultrasimplicial iff every finite set of positive elements belongs to the monoid generated by some finite set of positiveZ-independent elements.
Mundici, Daniele
core   +1 more source

Home - About - Disclaimer - Privacy