اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدCharacterization of cyclic Schur groups
130
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
A finite group $G$ is called a Schur group, if any Schur ring over $G$ is the transitivity module of a permutation group on the set $G$ containing the regular subgroup of all right translations. It was proved by R. Poschel (1974) that given a prime $pge 5$ a $p$-group is Schur if and only if it is cyclic. We prove that a cyclic group of order $n$ is a Schur group if and only if $n$ belongs to one of the following five (partially overlapped) families of integers: $p^k$, $pq^k$, $2pq^k$, $pqr$, $2pqr$ where $p,q,r$ are distinct primes, and $kge 0$ is an integer.
قيم البحث
اقرأ أيضاً
A Cayley graph is said to be an NNN-graph if it is both normal and non-normal for isomorphic regular groups, and a group has the NNN-property if there exists an NNN-graph for it. In this paper we investigate the NNN-property of cyclic groups, and show that cyclic groups do not have the NNN-property.
A subset $B$ of an Abelian group $G$ is called a difference basis of $G$ if each element $gin G$ can be written as the difference $g=a-b$ of some elements $a,bin B$. The smallest cardinality $|B|$ of a difference basis $Bsubset G$ is called the diffe
rence size of $G$ and is denoted by $Delta[G]$. We prove that for every $ninmathbb N$ the cyclic group $C_n$ of order $n$ has difference size $frac{1+sqrt{4|n|-3}}2le Delta[C_n]lefrac32sqrt{n}$. If $nge 9$ (and $nge 2cdot 10^{15}$), then $Delta[C_n]lefrac{12}{sqrt{73}}sqrt{n}$ (and $Delta[C_n]<frac2{sqrt{3}}sqrt{n}$). Also we calculate the difference sizes of all cyclic groups of cardinality $le 100$.
Let $G$ be a finite cyclic group of order $n ge 2$. Every sequence $S$ over $G$ can be written in the form $S=(n_1g)cdot ... cdot (n_lg)$ where $gin G$ and $n_1,..., n_l in [1,ord(g)]$, and the index $ind (S)$ of $S$ is defined as the minimum of $(n_
1+ ... + n_l)/ord (g)$ over all $g in G$ with $ord (g) = n$. In this paper we prove that a sequence $S$ over $G$ of length $|S| = n$ having an element with multiplicity at least $frac{n}{2}$ has a subsequence $T$ with $ind (T) = 1$, and if the group order $n$ is a prime, then the assumption on the multiplicity can be relaxed to $frac{n-2}{10}$. On the other hand, if $n=4k+2$ with $k ge 5$, we provide an example of a sequence $S$ having length $|S| > n$ and an element with multiplicity $frac{n}{2}-1$ which has no subsequence $T$ with $ind (T) = 1$. This disproves a conjecture given twenty years ago by Lemke and Kleitman.
A Cayley (di)graph $Cay(G,S)$ of a group $G$ with respect to a subset $S$ of $G$ is called normal if the right regular representation of $G$ is a normal subgroup in the full automorphism group of $Cay(G,S)$, and is called a CI-(di)graph if for every
$Tsubseteq G$, $Cay(G,S)cong Cay(G,T)$ implies that there is $sigmain Aut(G)$ such that $S^sigma=T$. We call a group $G$ a NDCI-group if all normal Cayley digraphs of $G$ are CI-digraphs, and a NCI-group if all normal Cayley graphs of $G$ are CI-graphs, respectively. In this paper, we prove that a cyclic group of order $n$ is a NDCI-group if and only if $8 mid n$, and is a NCI-group if and only if either $n=8$ or $8 mid n$.
As a visualization of Cartier and Foatas partially commutative monoid theory, G.X. Viennot introduced heaps of pieces in 1986. These are essentially labeled posets satisfying a few additional properties. They naturally arise as models of reduced word
s in Coxeter groups. In this paper, we introduce a cyclic version, motivated by the idea of taking a heap and wrapping it into a cylinder. We call this object a toric heap, as we formalize it as a labeled toric poset, which is a cyclic version of an ordinary poset. To define the concept of a toric extension, we develop a morphism in the category of toric heaps. We study toric heaps in Coxeter theory, in view of the fact that a cyclic shift of a reduced word is simply a conjugate by an initial or terminal generator. This allows us to formalize and study a framework of cyclic reducibility in Coxeter theory, and apply it to model conjugacy. We introduce the notion of torically reduced, which is stronger than being cyclically reduced for group elements. This gives rise to a new class of elements called torically fully commutative (TFC), which are those that have a unique cyclic commutativity class, and comprise a strictly bigger class than the cyclically fully commutative (CFC) elements. We prove several cyclic analogues of results on fully commutative (FC) elements due to Stembridge. We conclude with how this framework fits into recent work in Coxeter groups, and we correct a minor flaw in a few recently published theorems.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
