اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدThe closures of wreath products in product action
165
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Let $m$ be a positive integer and let $Omega$ be a finite set. The $m$-closure of $Gle$Sym$(Omega)$ is the largest permutation group on $Omega$ having the same orbits as $G$ in its induced action on the Cartesian product $Omega^m$. The exact formula for the $m$-closure of the wreath product in product action is given. As a corollary, a sufficient condition is obtained for this $m$-closure to be included in the wreath product of the $m$-closures of the factors.
قيم البحث
اقرأ أيضاً
We develop a theory of semidirect products of partial groups and localities. Our concepts generalize the notions of direct products of partial groups and localities, and of semidirect products of groups.
We consider the finitely generated groups acting on a regular tree with almost prescribed local action. We show that these groups embed as cocompact irreducible lattices in some locally compact wreath products. This provides examples of finitely gene
rated simple groups quasi-isometric to a wreath product $C wr F$, where $C$ is a finite group and $F$ a non-abelian free group.
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 prove a Littlewood-Richardson type formula for $(s_{lambda/mu},s_{ u/kappa})_{t^k,t}$, the pairing of two skew Schur functions in the MacDonald inner product at $q = t^k$ for positive integers $k$. This pairing counts graded decomposition numbers
in the representation theory of wreath products of the algebra $C[x]/x^k$ and symmetric groups.
It is an open problem whether definability in Propositional Dynamic Logic (PDL) on forests is decidable. Based on an algebraic characterization by Bojanczyk, et. al.,(2012) in terms of forest algebras, Straubing (2013) described an approach to PDL ba
sed on a k-fold iterated distributive law. A proof that all languages satisfying such a k-fold iterated distributive law are in PDL would settle decidability of PDL. We solve this problem in the case k=2: All languages recognized by forest algebras satisfying a 2-fold iterated distributive law are in PDL. Furthermore, we show that this class is decidable. This provides a novel nontrivial decidable subclass of PDL, and demonstrates the viability of the proposed approach to deciding PDL in general.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
