نتایج جستجو برای: demorgan triple semigroup
تعداد نتایج: 53922 فیلتر نتایج به سال:
Let T X be the full transformation semigroup on the setX and let T X,Y {α ∈ T X : Xα ⊆ Y}. Then T X,Y is a sub-semigroup of T X determined by a nonempty subset Y of X. In this paper, we give a necessary and sufficient condition for T X,Y to be regular. In the case that T X,Y is not regular, the largest regular sub-semigroup is obtained and this sub-semigroup is shown to determine the Green’s re...
In a semigroup, the combinatorial definitions of syndetic, piecewise syndetic, and IP are equivalent to their algebraic characterizations in terms of βS. We introduce the analogous definitions and characterizations of syndetic, piecewise syndetic, and IP for an adequate partial semigroup and show that equivalence between the combinatorial definition and algebraic characterization is lost once w...
Denote by (R, ·) the multiplicative semigroup of an associative algebra R over an infinite field, and let (R, ◦) represent R when viewed as a semigroup via the circle operation x ◦ y = x + y + xy. In this paper we characterize the existence of an identity in these semigroups in terms of the Lie structure of R. Namely, we prove that the following conditions on R are equivalent: the semigroup (R,...
A locally testable semigroup S is a semigroup with the property that for some nonnegative integer k, called the order or level of local testability, two words u and v in some set of generators for S are equal in the semigroup if (1) the pre x and su x of the words of length k coincide, and (2) the set of intermediate substrings of length k of the words coincide. The local testability problem fo...
A new fundamental solution semigroup for operator differential Riccati equationsis developed. This fundamental solution semigroup is constructed via an auxiliary finite horizonoptimal control problem whose value functional growth with respect to time horizon is determinedby a particular solution of the operator differential Riccati equation of interest. By exploiting semi-convex...
Fix a finite semigroup S and let a1, . . . , ak , b be tuples in a direct power S. The subpower membership problem (SMP) asks whether b can be generated by a1, . . . , ak. If S is a finite group, then there is a folklore algorithm that decides this problem in time polynomial in nk. For semigroups this problem always lies in PSPACE. We show that the SMP for a full transformation semigroup on 3 o...
The construction by Hall of a fundamental orthodox semigroup WB from a band B provides an important tool in the study of orthodox semigroups. We present here a semigroup SB that plays the role of WB for a class of semigroups having a band of idempotents B. Specifically, the semigroups we consider are weakly B-abundant and satisfy the congruence condition (C). Any orthodox semigroup S with E(S) ...
In this note we give an alternative construction of free groups by working with semigroups. We also give some basic properties of free groups. A semigroup is a nonempty set with an associative binary operation. If S is a semigroup, we denote the operation by (a, b) 7→ ab. If S has an identity, then we call S a semigroup with 1. Such semigroups are often called monoids. We will restrict our atte...
Abstract A semigroup generated by two dimensional C contracting maps is considered. We call a such semigroup regular if the maximum K of the conformal dilatations of generators, the maximum l of the norms of the derivatives of generators and the smoothness α of the generators satisfy a compatibility condition K < 1/l. We prove that the shape of the image of the core of a ball under any element ...
By a Boolean inverse semigroup we mean an inverse semigroup whose semilattice of idempotents is a Boolean algebra. We study representations of a given inverse semigroup S in a Boolean inverse semigroup which are tight in a certain well defined technical sense. These representations are supposed to preserve as much as possible any trace of Booleannes present in the semilattice of idempotents of ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید