اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدBases for pseudovarieties closed under bideterministic product
63
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We show that if $mathsf V$ is a semigroup pseudovariety containing the finite semilattices and contained in $mathsf {DS}$, then it has a basis of pseudoidentities between finite products of regular pseudowords if, and only if, the corresponding variety of languages is closed under bideterministic product. The key to this equivalence is a weak generalization of the existence and uniqueness of $mathsf J$-reduced factorizations. This equational approach is used to address the locality of some pseudovarieties. In particular, it is shown that $mathsf {DH}capmathsf {ECom}$ is local, for any group pseudovariety $mathsf H$.
قيم البحث
اقرأ أيضاً
We extend work of the first author and Khoussainov to show that being Cayley automatic is closed under taking the restricted wreath product with a virtually infinite cyclic group. This adds to the list of known examples of Cayley automatic groups.
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.
This paper is a contribution to the theory of finite semigroups and their classification in pseudovarieties, which is motivated by its connections with computer science. The question addressed is what role can play the consideration of an order compa
tible with the semigroup operation. In the case of unions of groups, so-called completely regular semigroups, the problem of which new pseudovarieties appear in the ordered context is solved. As applications, it is shown that the lattice of pseudovarieties of ordered completely regular semigroups is modular and that taking the intersection with the pseudovariety of bands defines a complete endomorphism of the lattice of all pseudovarieties of ordered semigroups.
The minimal base size $b(G)$ for a permutation group $G$, is a widely studied topic in the permutation group theory. Z. Halasi and K. Podoski proved that $b(G)leq 2$ for coprime linear groups. Motivated by this result and the probabilistic method use
d by T. C. Burness, M. W. Liebeck and A. Shalev, it was asked by L. Pyber that for coprime linear groups $Gleq GL(V)$, whether there exists a constant $c$ such that the probability of that a random $c$-tuple is a base for $G$ tends to 1 as $|V|toinfty$. While the answer to this question is negative in general, it is positive under the additional assumption that $G$ is even primitive as a linear group. In this paper, we show that almost all $11$-tuples are bases for coprime primitive linear groups.
We investigate the interplay between mutual unbiasedness and product bases for multiple qudits of possibly different dimensions. A product state of such a system is shown to be mutually unbiased to a product basis only if each of its factors is mutua
lly unbiased to all the states which occur in the corresponding factors of the product basis. This result implies both a tight limit on the number of mutually unbiased product bases which the system can support and a complete classification of mutually unbiased product bases for multiple qubits or qutrits. In addition, only maximally entangled states can be mutually unbiased to a maximal set of mutually unbiased product bases.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
