نتایج جستجو برای: n parameter semigroup

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

Journal: :International Journal of Pure and Apllied Mathematics 2013

2007
Changsoo Bahn Chul Ki Ko

Employing the construction method of Dirichlet forms on standard forms of von Neu-mann algebras developed in Pa], we construct Dirichlet forms and associated symmetric Markovian semigroups on CCR algebras with respect to quasi-free states. More precisely, let A(h 0) be the CCR algebra over a complex separable pre-Hilbert space h 0 and let ! be a quasi-free state on A(h 0). For any normalized ad...

Journal: :International Journal of Pure and Apllied Mathematics 2015

2014
Maohua Le

In this paper we prove that A(a,n) is a Smarandache semigroup.

1998
Haixuan Yang Li Fang

The author proves that, if S is an FIC-semigroup or a completely regular semigroup, and if RS is a ring with identity, then R < E(S) > is a ring with identity. Throughout this paper, R denotes as a ring with identity. Let S be a semigroup, X ⊆ S . The following notations are used in the paper: < X > : the subsemigroup of S generated by X ; |X| : the cardinal number of X ; E(S): the set of idemp...

1998
TORBEN MAACK BISGAARD Palle E. T. Jorgensen

For a certain constant δ > 0 (a little less than 1/4), every function f : N0 → ]0,∞[ satisfying f(n)2 ≤ δf(n − 1)f(n + 1), n ∈ N, is a Stieltjes indeterminate Stieltjes moment sequence. For every indeterminate moment sequence f : N0 → R there is a positive definite matrix sequence (an) which is not of positive type and which satisfies tr(an+2) = f(n), n ∈ N0. For a certain constant ε > 0 (a lit...

Journal: :Theor. Comput. Sci. 2012
Janusz A. Brzozowski Baiyu Li Yuli Ye

The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of the class of regular languages is the maximal syntactic complexity of languages in that class, taken as a function of the state complexity n of these languages. We study the syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages. We...

2001
KENNETH R. DAVIDSON

Free semigroup algebras are wot-closed algebras generated by n isometries with pairwise orthogonal ranges. They were introduced in [27] as an interesting class of operator algebras in their own right. The prototype algebra, obtained from the left regular representation of the free semigroup on n letters, was introduced by Popescu [45] in connection with multi-variable non-commutative dilation t...

2007
Hiroki Sumi

We investigate the dynamics of semigroups generated by polynomial maps on the Riemann sphere such that the postcritical set in the complex plane is bounded. Moreover, we investigate the associated random dynamics of polynomials. We show that for such a polynomial semigroup, if A and B are two connected components of the Julia set, then one of A and B surrounds the other. A criterion for the Jul...

2008
Alan J. Cain Graham P. Oliver Nikola Ruskuc Richard M. Thomas

This paper studies FA-presentable structures and gives a complete classification of the finitely generated FA-presentable cancellative semigroups. We show that a finitely generated cancellative semigroup is FA-presentable if and only if it is a subsemigroup of a virtually abelian group.

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

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