Groups with a Maximal Irredundant 6-Cover

ABSTRACT

A cover for a group G is a collection of proper subgroups whose union is the whole group G. A cover is irredundant if no proper sub-collection is also a cover, and is called maximal if all its members are maximal subgroups. For an integer n > 2, a cover with n members is called an n-cover. Also, we denote σ (G) = n if G has an n-cover and does not have any m-cover for each integer m < n. In this article, we completely characterize groups with a maximal irredundant 6-cover with core-free intersection. As an application of this result, we characterize the groups G with σ (G) = 6. The intersection of an irredundant n-cover is known to have index bounded by a function of n, though in general the precise bound is not known. We also prove that the exact bound is 36 when n is 6.     

On the code generated by the incidence matrix of points and hyperplanes in <Emphasis Type=Italic>PG</Emphasis>(<Emphasis Type=Italic>n</Emphasis>,<Emphasis Type=Italic>q</Emphasis>) and its dual

In this paper, we study the p-ary linear code C(PG(n,q)), q = p ^h , p prime, h ≥ 1, generated by the incidence matrix of points and hyperplanes of a Desarguesian projective space PG(n,q), and its dual code. We link the codewords of small weight of this code to blocking sets with respect to lines in PG(n,q) and we exclude all possible codewords arising from small linear blocking sets. We also look at the dual code of C(PG(n,q)) and we prove that finding the minimum weight of the dual code can be reduced to finding the minimum weight of the dual code of points and lines in PG(2,q). We present an improved upper bound on this minimum weight and we show that we can drop the divisibility condition on the weight of the codewords in Sachar’s lower bound (Geom Dedicata 8:407–415, 1979). G. Van de Voorde’s research was supported by the Institute for the Promotion of Innovation through Science and Technology in Flanders (IWT-Vlaanderen).     

有限群极大子群的θ-子群偶

N.P.Mukherjee和 P.Bhattacharya在“On theta pairs for a maximal sub-group”(Proc.Amer.Math.Soc,Vl09N3(1990))一文中定义了有限群的极大子群的θ-子群偶概念,研究了极大子群的极大θ-子群偶对群结构的影响,得到了一系列结果.本文在进一步探究θ-子群偶性质的基础上,对该文中一系列主要结果作出了本质性的改进,并给出了可解性、幂零性的一些新刻划.     

The covering radius of PGL2(q)

The covering radius of a subset $C$ of the symmetric group ${\mathrm{S}}_n$ is the maximal Hamming distance of an element of ${\mathrm{S}}_n$ from $C$. This note determines the covering radii of the finite $2$-dimensional projective general linear groups. It turns out that the covering radius of ${\mathrm{PGL}}_2\left(q\right)$ is $q?2$ if $q$ is even, and is $q?3$ if $q$ is odd.     

Frattini子群循环的有限$p$-群中的非交换集和极大Abel子群

设G是一个群,X是G的一个子集,若对于任意x,y∈X且x≠y,都有xy≠yx,则称X是G的一个非交换集.进一步,如果对于G中的任意其它非交换子集Y,都有|X|≥|Y|,那么称X是G的一个极大非交换集.文中确定了Frattini子群循环的有限p-群中极大非交换集和极大Abel子群的势.     

Small weight codewords in the codes arising from Desarguesian projective planes

We study codewords of small weight in the codes arising from Desarguesian projective planes. We first of all improve the results of K. Chouinard on codewords of small weight in the codes arising from PG(2, p), p prime. Chouinard characterized all the codewords up to weight 2p in these codes. Using a particular basis for this code, described by Moorhouse, we characterize all the codewords of weight up to 2p + (p−1)/2 if p ≥ 11. We then study the codes arising from . In particular, for q ₀ = p prime, p ≥ 7, we prove that the codes have no codewords with weight in the interval [q + 2, 2q − 1]. Finally, for the codes of PG(2, q), q = p ^h , p prime, h ≥ 4, we present a discrete spectrum for the weights of codewords with weights in the interval [q + 2, 2q − 1]. In particular, we exclude all weights in the interval [3q/2, 2q − 1]. Geertrui Van de Voorde research is supported by the Institute for the Promotion of Innovation through Science and Technology in Flanders (IWT-Vlaanderen) Joost Winne was supported by the Fund for Scientific Research - Flanders (Belgium).     

Generation and random generation: From simple groups to maximal subgroups

Let G   be a finite group and let d(G)$d(G)$ be the minimal number of generators for G  . It is well known that d(G)=2$d(G)=2$ for all (non-abelian) finite simple groups. We prove that d(H)?4$d(H)?4$ for any maximal subgroup H of a finite simple group, and that this bound is best possible.     

Minimal 1-saturating sets and complete caps in binary projective spaces

In binary projective spaces PG(v,2), minimal 1-saturating sets, including sets with inner lines and complete caps, are considered. A number of constructions of the minimal 1-saturating sets are described. They give infinite families of sets with inner lines and complete caps in spaces with increasing dimension. Some constructions produce sets with an interesting symmetrical structure connected with inner lines, polygons, and orbits of stabilizer groups. As an example we note an 11-set in PG(4,2) called “Pentagon with center”. The complete classification of minimal 1-saturating sets in small geometries is obtained by computer and is connected with the constructions described.     

On the “Shidov Property” and a Formation Satisfying It

If G is a nonsoluble finite group, the intersection of the maximal subgroups of G which are not nilpotent is the Frattini subgroup of G. This was proved by Shidov (1971 Shidov , L. I. ( 1971 ). On maximal subgroups of finite groups . Sibirsk. Mat. Zh. 12 ( 3 ): 682 – 683 . [Google Scholar]). The authors here present a new formation ? larger than the formation of the nilpotent groups for which the analogous of the theorem of Shidov holds. The theorem makes use of the classification of finite simple groups.     

模糊粗糙群中的同态映射(英文)

This paper is devoted to the discussion of homomorphic properties of fuzzy rough groups.The fuzzy approximation space was generated by fuzzy normal subgroups and the fuzzy rough approximation operators were discussed in the frame of fuzzy rough set model.The basic properties of fuzzy rough approximation operators were obtained.     

Parametrization of tamely ramified maximal tori using bounded subgroups

Let be a reductive group defined over a local complete field F with discrete valuation, and split over some unramified extension of F, and let G be its group of F-points. In this paper, we define a class of abelian “torus-like” subgroups in nonreductive groups, called pseudo-tori, which generalizes the notion of torus, and we establish a correspondence between conjugacy classes of tamely ramified maximal tori of G and association classes of maximal pseudo-tori of the quotients of parahorics of G by their second congruence subgroup, viewed as groups of k-points of algebraic groups defined over the residual field k of F.      

On finite matroids with two more hyperplanes than points

One of the most interesting results about finite matroids of finite rank and generalized projective spaces is the result of Basterfield, Kelly and Green (1968/1970) (J.G. Basterfield, L.M. Kelly, A characterization of sets of n points which determine n hyperplanes, in: Proceedings of the Cambridge Philosophical Society, vol. 64, 1968, pp. 585-588; C. Greene, A rank inequality for finite geometric lattices, J. Combin Theory 9 (1970) 357-364) affirming that any matroid contains at least as many hyperplanes as points, with equality in the case of generalized projective spaces. Consequently, the goal is to characterize and classify all matroids containing more hyperplanes than points. In 1996, I obtained the classification of all finite matroids containing one more hyperplane than points. In this paper a complete classification of finite matroids with two more hyperplanes than points is obtained. Moreover, a partial contribution to the classification of those matroids containing a certain number of hyperplanes more than points is presented.     

Maximal covers of finite groups

Abstract

Let λ(G) be the maximum number of subgroups in an irredundant covering of the finite group G. We prove that if G is a group with λ(G) ≤ 6, then G is supersolvable. We also describe the structure of groups G with λ(G) = 6. Moreover, we show that if G is a group with λ(G)?<?31, then G is solvable.     

The influence of X-semipermutability of subgroups on the structure of finite groups

Let A be a subgroup of a group G and X be a nonempty subset of G. A is said to be X-semipermutable in G if A has a supplement T in G such that A is X-permutable with every subgroup of T. In this paper, we investigate further the influence of X-semipermutability of some subgroups on the structure of finite groups. Some new criteria for a group G to be supersoluble or p-nilpotent are obtained.