نتایج جستجو برای: h_v semigroup

تعداد نتایج: 6016  

2010
Victoria Gould V. Gould

Inverse semigroups form a variety of unary semigroups, that is, semigroups equipped with an additional unary operation, in this case a 7→ a−1. The theory of inverse semigroups is perhaps the best developed within semigroup theory, and relies on two factors: an inverse semigroup S is regular, and has semilattice of idempotents. Three major approaches to the structure of inverse semigroups have e...

2009
J. MARTIN LINDSAY ADAM G. SKALSKI

Convolution semigroups of states on a quantum group form the natural noncommutative analogue of convolution semigroups of probability measures on a locally compact group. Here we initiate a theory of weakly continuous convolution semigroups of functionals on a C∗-bialgebra, the noncommutative counterpart of a locally compact semigroup. On locally compact quantum groups we obtain a bijective cor...

2016
DANIEL A. ROMANO

The setting of this research is Bishop’s constructive mathematics. Following ideas of Chan and Shum, exposed in their famous paper “Homomorphisms of implicative semigroups”, we discuss the structure of implicative semigroups on sets with tight apartness. Moreover, we use anti-orders instead of partial orders. We study concomitant issues induced by existence of apartness and anti-orders giving s...

2012
Xiaomin Zhang

In this paper, the class of weakly left C-wrpp semigroups which includes the class of weakly left C-rpp semigroups as a subclass is introduced. To particularly show that the spined product of a left C-wrpp semigroup and a right normal band which is a weakly left C-wrpp semifroup by virtue of left C-full Ehremann cyber groups recently obtained by authors Li-Shum, results obtained by Tang and Du-...

Journal: :IJAC 2009
Isabel Goffa Eric Jespers Jan Okninski

Let A be a finitely generated commutative algebra over a field K with a presentation A = K〈X1, . . . , Xn | R〉, where R is a set of monomial relations in the generators X1, . . . , Xn. So A = K[S], the semigroup algebra of the monoid S = 〈X1, . . . , Xn | R〉. We characterize, purely in terms of the defining relations, when A is an integrally closed domain, provided R contains at most two relati...

2012
Mutsumi Saito William N. Traves WILLIAM N. TRAVES

This paper studies algebras of operators associated to a semigroup algebra. The ring of differential operators is shown to be anti-isomorphic to the symmetry algebra and both are described explicitly in terms of the semigroup. As an application, we produce a criterion to determine the equivalence of A-hypergeometric systems. Conditions under which associated algebras are finitely generated are ...

Journal: :Int. J. Math. Mathematical Sciences 2008
Xiaojiang Guo

Let R be a commutative ring and S a finite locally inverse semigroup. It is proved that the semigroup algebra R S is isomorphic to the direct product of Munn algebras M R GJ , mJ , nJ ;PJ with J ∈ S/J, where mJ is the number of R-classes in J , nJ the number of L-classes in J , and GJ a maximum subgroup of J . As applications, we obtain the sufficient and necessary conditions for the semigroup ...

2006
HEYDAR RADJAVI PETER ROSENTHAL Joseph A. Ball

It is shown that a transitive, closed, homogeneous semigroup of linear transformations on a finite-dimensional space either has zero divisors or is simultaneously similar to a group consisting of scalar multiples of unitary transformations. The proof begins with the result that for each closed homogeneous semigroup with no zero divisors there is a k such that the spectral radius satisfies r(AB)...

2004
Gretchen L. Matthews

We consider those positive integers that are not representable as linear combinations of terms of a generalized arithmetic progression with nonnegative integer coefficients. To do this, we make use of the numerical semigroup generated by a generalized arithmetic progression. The number of integers nonrepresentable by such a numerical semigroup is determined as well as that of its dual. In addit...

2008
Enrico Formenti Jarkko Kari Siamak Taati

We study the group-valued and semigroup-valued conservation laws in cellular automata (CA). We provide examples to distinguish between semigroup-valued, group-valued and real-valued conservation laws. We prove that, even in one-dimensional case, it is undecidable if a CA has any non-trivial conservation law of each type. For a fixed range, each CA has a most general (group-valued or semigroup-v...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید