اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدSome operators that preserve the locality of a pseudovariety of semigroups
99
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
It is shown that if V is a local monoidal pseudovariety of semigroups, then K(m)V, D(m)V and LI(m)V are local. Other operators of the form Z(m)(_) are considered. In the process, results about the interplay between operators Z(m)(_) and (_)*D_k are obtained.
قيم البحث
اقرأ أيضاً
We study algebraic and topological properties of the convolution semigroups of probability measures on a topological groups and show that a compact Clifford topological semigroup $S$ embeds into the convolution semigroup $P(G)$ over some topological
group $G$ if and only if $S$ embeds into the semigroup $exp(G)$ of compact subsets of $G$ if and only if $S$ is an inverse semigroup and has zero-dimensional maximal semilattice. We also show that such a Clifford semigroup $S$ embeds into the functor-semigroup $F(G)$ over a suitable compact topological group $G$ for each weakly normal monadic functor $F$ in the category of compacta such that $F(G)$ contains a $G$-invariant element (which is an analogue of the Haar measure on $G$).
This paper enriches the list of properties of the congruence sequences starting from the universal relation and successively performing the operations of lower $t$ and lower $k$. Three classes of completely regular semigroups, namely semigroups for w
hich $ker{sigma}$ is a cryptogroup, semigroups for which $ker{ u}$ is a cryptogroup and semigroups for which $kappa$ is over rectangular bands, are studied. $((omega_t)_k)_t$, $((mathcal{D}_t)_k)_t$ and $((omega_k)_t)_k$ are found to be the least congruences on $S$ such that the quotient semigroups are semigroups for which $ker{sigma}$ is a cryptogroup, $ker{ u}$ is a cryptogroup and $kappa$ is over rectangular bands, respectively. The results obtained present a response to three problems in Petrich and Reillys textbook textquotelefttextquoteleft Completely Regular Semigroupstextquoterighttextquoteright.
As an appropriate generalisation of the features of the classical (Schein) theory of representations of inverse semigroups in $mathscr{I}_{X}$, a theory of representations of inverse semigroups by homomorphisms into complete atomistic inverse algebra
s is developed. This class of inverse algebras includes partial automorphism monoids of entities such as graphs, vector spaces and modules. A workable theory of decompositions is reached; however complete distributivity is required for results approaching those of the classical case.
We give a complete characterization of pseudovarieties of semigroups whose finitely generated relatively free profinite semigroups are equidivisible. Besides the pseudovarieties of completely simple semigroups, they are precisely the pseudovarieties
that are closed under Malcev product on the left by the pseudovariety of locally trivial semigroups. A further characterization which turns out to be instrumental is as the non-completely simple pseudovarieties that are closed under two-sided Karnofsky-Rhodes expansion.
Many hard algorithmic problems dealing with graphs, circuits, formulas and constraints admit polynomial-time upper bounds if the underlying graph has small treewidth. The same problems often encourage reducing the maximal degree of vertices to simpli
fy theoretical arguments or address practical concerns. Such degree reduction can be performed through a sequence of splittings of vertices, resulting in an _expansion_ of the original graph. We observe that the treewidth of a graph may increase dramatically if the splittings are not performed carefully. In this context we address the following natural question: is it possible to reduce the maximum degree to a constant without substantially increasing the treewidth? Our work answers the above question affirmatively. We prove that any simple undirected graph G=(V, E) admits an expansion G=(V, E) with the maximum degree <= 3 and treewidth(G) <= treewidth(G)+1. Furthermore, such an expansion will have no more than 2|E|+|V| vertices and 3|E| edges; it can be computed efficiently from a tree-decomposition of G. We also construct a family of examples for which the increase by 1 in treewidth cannot be avoided.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
