اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدSchur rings over a product of Galois rings
260
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The recently developed theory of Schur rings over a finite cyclic group is generalized to Schur rings over a ring R being a product of Galois rings of coprime characteristics. It is proved that if the characteristic of R is odd, then as in the cyclic group case any pure Schur ring over R is the tensor product of a pure cyclotomic ring and Schur rings of rank 2 over non-fields. Moreover, it is shown that in contrast to the cyclic group case there are non-pure Schur rings over R that are not generalized wreath products.
قيم البحث
اقرأ أيضاً
In this paper, we study dot-product sets and $k$-simplices in vector spaces over finite rings. We show that if $E$ is sufficiently large then the dot-product set of $E$ covers the whole ring. In higher dimensional cases, if $E$ is sufficiently large
then the set of simplices and the set of dot-product simplices determined by $E$, up to congurence, have positive densities.
For the direct product $cZtimes cZ_3$ of infinite cyclic group $cZ$ and a cyclic group $cZ_3$ of order $3$, the schur rings over it are classified. In particular, all the schur rings are proved to be traditional.
We study some sum-product problems over matrix rings. Firstly, for $A, B, Csubseteq M_n(mathbb{F}_q)$, we have $$ |A+BC|gtrsim q^{n^2}, $$ whenever $|A||B||C|gtrsim q^{3n^2-frac{n+1}{2}}$. Secondly, if a set $A$ in $M_n(mathbb{F}_q)$ satisfies $|A|ge
q C(n)q^{n^2-1}$ for some sufficiently large $C(n)$, then we have $$ max{|A+A|, |AA|}gtrsim minleft{frac{|A|^2}{q^{n^2-frac{n+1}{4}}}, q^{n^2/3}|A|^{2/3}right}. $$ These improve the results due to The and Vinh (2020), and generalize the results due to Mohammadi, Pham, and Wang (2021). We also give a new proof for a recent result due to The and Vinh (2020). Our method is based on spectral graph theory and linear algebra.
This paper presents the first decoding algorithm for Gabidulin codes over Galois rings with provable quadratic complexity. The new method consists of two steps: (1) solving a syndrome-based key equation to obtain the annihilator polynomial of the err
or and therefore the column space of the error, (2) solving a key equation based on the received word in order to reconstruct the error vector. This two-step approach became necessary since standard solutions as the Euclidean algorithm do not properly work over rings.
The generalized wreath product of permutation groups is introduced. By means of it we study the schurity problem for S-rings over a cyclic group $G$ and the automorphism groups of them. Criteria for the schurity and non-schurity of the generalized wr
eath product of two such S-rings are obtained. As a byproduct of the developed theory we prove that $G$ is a Schur group whenever the total number $Omega(n)$ of prime factors of the integer $n=|G|$ is at most 3. Moreover, we describe the structure of a non-schurian S-ring over $G$ when $Omega(n)=4$. The latter result implies in particular that if $n=p^3q$ where $p$ and $q$ are primes, then $G$ is a Schur group.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
