اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدCoset closure of a circulant S-ring and schurity problem
185
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Let $G$ be a finite group. There is a natural Galois correspondence between the permutation groups containing $G$ as a regular subgroup, and the Schur rings (S-rings) over~$G$. The problem we deal with in the paper, is to characterize those S-rings that are closed under this correspondence, when the group $G$ is cyclic (the schurity problem for circulant S-rings). It is proved that up to a natural reduction, the characteristic property of such an S-ring is to be a certain algebraic fusion of its coset closure introduced and studied in the paper. Basing on this characterization we show that the schurity problem is equivalent to the consistency of a modular linear system associated with a circulant S-ring under consideration. As a byproduct we show that a circulant S-ring is Galois closed if and only if so is its dual.
قيم البحث
اقرأ أيضاً
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.
A Schur ring (S-ring) over a group $G$ is called separable if every of its similaritities is induced by isomorphism. We establish a criterion for an S-ring to be separable in the case when the group $G$ is cyclic. Using this criterion, we prove that
any S-ring over a cyclic $p$-group is separable and that the class of separable circulant S-rings is closed with respect to duality.
A permutation group is said to be quasiregular if every its transitive constituent is regular, and a quasiregular coherent configuration can be thought as a combinatorial analog of such a group: the transitive constituents are replaced by the homogen
eous components. In this paper, we are interested in the question when the configuration is schurian, i.e., formed by the orbitals of a permutation group, or/and separable, i.e., uniquely determined by the intersection numbers. In these terms, an old result of Hanna Neumann is, in a sense, dual to the statement that the quasiregular coherent configurations with cyclic homogeneous components are schurian. In the present paper, we (a) establish the duality in a precise form and (b) generalize the latter result by proving that a quasiregular coherent configuration is schurian and separable if the groups associated with homogeneous components have distributive lattices of normal subgroups.
The triangle covering number of a graph is the minimum number of vertices that hit all triangles. Given positive integers $s,t$ and an $n$-vertex graph $G$ with $lfloor n^2/4 rfloor +t$ edges and triangle covering number $s$, we determine (for large
$n$) sharp bounds on the minimum number of triangles in $G$ and also describe the extremal constructions. Similar results are proved for cliques of larger size and color critical graphs. This extends classical work of Rademacher, ErdH os, and Lovasz-Simonovits whose results apply only to $s le t$. Our results also address two conjectures of Xiao and Katona. We prove one of them and give a counterexample and prove a modified version of the other conjecture.
In 1981, ErdH{o}s and Hajnal asked whether the sum of the reciprocals of the odd cycle lengths in a graph with infinite chromatic number is necessarily infinite. Let $mathcal{C}(G)$ be the set of cycle lengths in a graph $G$ and let $mathcal{C}_text{
odd}(G)$ be the set of odd numbers in $mathcal{C}(G)$. We prove that, if $G$ has chromatic number $k$, then $sum_{ellin mathcal{C}_text{odd}(G)}1/ellgeq (1/2-o_k(1))log k$. This solves ErdH{o}s and Hajnals odd cycle problem, and, furthermore, this bound is asymptotically optimal. In 1984, ErdH{o}s asked whether there is some $d$ such that each graph with chromatic number at least $d$ (or perhaps even only average degree at least $d$) has a cycle whose length is a power of 2. We show that an average degree condition is sufficient for this problem, solving it with methods that apply to a wide range of sequences in addition to the powers of 2. Finally, we use our methods to show that, for every $k$, there is some $d$ so that every graph with average degree at least $d$ has a subdivision of the complete graph $K_k$ in which each edge is subdivided the same number of times. This confirms a conjecture of Thomassen from 1984.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
