نتایج جستجو برای: semigroups

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

1994
Y. LATUSHKIN S. MONTGOMERY-SMITH

We study evolutionary semigroups generated by a strongly continuous semi-cocycle over a locally compact metric space acting on Banach fibers. This setting simultaneously covers evolutionary semigroups arising from nonautonomuous abstract Cauchy problems and C0-semigroups, and linear skew-product flows. The spectral mapping theorem for these semigroups is proved. The hyperbolicity of the semigro...

2008
MASAKI IZUMI

We introduce a new construction of E0-semigroups, called generalized CCR flows, with two kinds of descriptions: those arising from sum systems and those arising from pairs of C0-semigroups. We get a new necessary and sufficient condition for them to be of type III, when the associated sum system is of finite index. Using this criterion, we construct examples of type III E0-semigroups, which can...

Journal: :Int. J. Math. Mathematical Sciences 2011
Shouxu Du Xin Zhai Xu K. P. Shum

It has been well known that the band of idempotents of a naturally ordered orthodox semigroup satisfying the “strong Dubreil-Jacotin condition” forms a normal band. In the literature, the naturally ordered orthodox semigroups satisfying the strong Dubreil-Jacotin condition were first considered by Blyth and Almeida Santos in 1992. Based on the name “epigroup” in the paper of Blyth and Almeida S...

2000
PHOEBE HO

Clifford and Preston (1961) showed several important characterizations of right groups. It was shown in Roy and So (1998) that, among topological semigroups, compact right simple or left cancellative semigroups are in fact right groups, and the closure of a right simple subsemigroup of a compact semigroup is always a right subgroup. In this paper, it is shown that such results can be generalize...

Journal: :J. Mathematical Cryptology 2014
Andrew M. Childs Gábor Ivanyos

We describe an efficient quantum algorithm for computing discrete logarithms in semigroups using Shor’s algorithms for period finding and discrete log as subroutines. Thus proposed cryptosystems based on the presumed hardness of discrete logarithms in semigroups are insecure against quantum attacks. In contrast, we show that some generalizations of the discrete log problem are hard in semigroup...

2010
Luc Miller

Fast control cost for heat-like semigroups: Lebeau-Robbiano strategy and Hautus test Luc Miller (joint work with Thomas Duykaerts) Since the seminal work of Russell and Weiss in [7], resolvent conditions for various notions of admissibility, observability and controllability, and for various notions of linear evolution equations have been studied intensively, sometimes under the name of infinit...

2009
J. D. Mitchell

In this paper we propose a general recipe for calculating the automorphism groups of semigroups consisting of partial endomorphisms of relational structures with a single m-ary relation for any m ∈ N over a finite set. We use this recipe to determine the automorphism groups of the following semigroups: the full transformation semigroup, the partial transformation semigroup, and the symmetric in...

2009
MARK KAMBITES M. Kambites

Recent research of the author has studied edge-labelled directed trees under a natural multiplication operation. The class of all such trees (with a fixed labelling alphabet) has an algebraic interpretation, as a free object in the class of adequate semigroups. We consider here a natural subclass of these trees, defined by placing a restriction on edge orientations, and show that the resulting ...

1996
Horst R. Thieme

Positive perturbations of generators of locally Lipschitz continuous increasing integrated semigroups on an abstract L space are again generators of locally Lipschitz continuous increasing integrated semigroups. Positive perturbations of generators of positive dual semigroups on a dual abstract L space are generators of semigroups that are weakly∗ right continuous. These results are reformulate...

Journal: :IJAC 2011
Víctor Blanco Pedro A. García-Sánchez Justo Puerto

This paper presents a new methodology to compute the number of numerical semigroups of given genus or Frobenius number. We apply generating function tools to the bounded polyhedron that classifies the semigroups with given genus (or Frobenius number) and multiplicity. First, we give theoretical results about the polynomial-time complexity of counting these semigroups. We also illustrate the met...

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

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