اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدRewriting the check of 8-rewritability for $A_5$
144
0
0.0
(
0
)
تأليف
Alexander Konovalov
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The group $G$ is called $n$-rewritable for $n>1$, if for each sequence of $n$ elements $x_1, x_2, dots, x_n in G$ there exists a non-identity permutation $sigma in S_n$ such that $x_1 x_2 cdots x_n = x_{sigma(1)} x_{sigma(2)} cdots x_{sigma(n)}$. Using computers, Blyth and Robinson (1990) verified that the alternating group $A_5$ is 8-rewritable. We report on an independent verification of this statement using the computational algebra system GAP, and compare the performance of our sequential and parallel code with the original one.
قيم البحث
اقرأ أيضاً
We prove that a group is presented by finite convergent length-reducing rewriting systems where each rule has left-hand side of length 3 if and only if the group is plain. Our proof goes via a new result concerning properties of embedded circuits in
geodetic graphs, which may be of independent interest in graph theory.
We show that groups presented by inverse-closed finite convergent length-reducing rewriting systems are characterised by a striking geometric property: their Cayley graphs are geodetic and side-lengths of non-degenerate triangles are uniformly bounde
d. This leads to a new algebraic result: the group is plain (isomorphic to the free product of finitely many finite groups and copies of $mathbb Z$) if and only if a certain relation on the set of non-trivial finite-order elements of the group is transitive on a bounded set. We use this to prove that deciding if a group presented by an inverse-closed finite convergent length-reducing rewriting system is not plain is in $mathsf{NP}$. A yes answer would disprove a longstanding conjecture of Madlener and Otto from 1987. We also prove that the isomorphism problem for plain groups presented by inverse-closed finite convergent length-reducing rewriting systems is in $mathsf{PSPACE}$.
Code loops are certain Moufang $2$-loops constructed from doubly even binary codes that play an important role in the construction of local subgroups of sporadic groups. More precisely, code loops are central extensions of the group of order $2$ by a
n elementary abelian $2$-group $V$ in the variety of loops such that their squaring map, commutator map and associator map are related by combinatorial polarization and the associator map is a trilinear alternating form. Using existing classifications of trilinear alternating forms over the field of $2$ elements, we enumerate code loops of dimension $d=mathrm{dim}(V)le 8$ (equivalently, of order $2^{d+1}le 512$) up to isomorphism. There are $767$ code loops of order $128$, and $80826$ of order $256$, and $937791557$ of order $512$.
We focus on ontology-mediated queries (OMQs) based on (frontier-)guarded existential rules and (unions of) conjunctive queries, and we investigate the problem of FO-rewritability, i.e., whether an OMQ can be rewritten as a first-order query. We adopt
two different approaches. The first approach employs standard two-way alternating parity tree automata. Although it does not lead to a tight complexity bound, it provides a transparent solution based on widely known tools. The second approach relies on a sophisticated automata model, known as cost automata. This allows us to show that our problem is 2ExpTime-complete. In both approaches, we provide semantic characterizations of FO-rewritability that are of independent interest.
We make an investigation of modular $Gamma^{prime}_5 simeq A^{prime}_5$ group in inverse seesaw framework. Modular symmetry is advantageous because it reduces the usage of extra scalar fields significantly. Moreover, the Yukawa couplings are expresse
d in terms of Dedekind eta functions, which also have a $q$ expansion form, utilized to achieve numerical simplicity. Our proposed model includes six heavy fermion superfields i.e., $mathcal{N}_{Ri}$, $mathcal{S}_{Li}$ and a weighton. The study of neutrino phenomenology becomes simplified and effective by the usage of $A^prime_5$ modular symmetry, which provides us a well defined mass structure for the lepton sector. Here, we observe that all the neutrino oscillation parameters, as well as the effective electron neutrino mass in neutrinoless double beta decay can be accommodated in this model. We also briefly discuss the lepton flavor violating decays $ell_i to ell_j gamma$ and comment on non-unitarity of lepton mixing matrix.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
