The Existence of p-blocksof a Finite Group With a Given Defect Group

Brauer's problem 19［B］——in terms of group theoreticalproperties count the number of p-blocks with a given defect group——has been studied by many authors.Among them G. R. Robinson gave a pricise formula for the number. Of courseit is by no means easy to calculate by the formula. So it is still interesting tofind other formula counting the number or conditions for the existence ofp-blocks.     

有限群亏零p-块的存在性

对p-阶子群均共轭的群的亏零p-块的存在性给出了一些刻画.同时给出了偶阶群亏零p-块的存在性.     

给定亏群的p块的存在性

在本文中,主要研究了群G在其子群的指标上的一些作用,并用这些作用得到了一些给定亏群的块的存在性.     

The Existence of p-Blocks with a Submaximal-Subgroup of a Sylow p-Subgroup as Defect Group

Abstract

In this paper,we will determine the existence of blocks with submaximal subgroups of Sylow p-subgroups of a finite group G as defect groups.     

混合边条件约束下的有限变形弹性动力学解的存在性*

本文证明了在系统超势及其梯度(对Green应变)满足适当条件的混合边值约束下的有限弹性动力学系统的解是存在.     

The Number of Permutation Polynomials of a Given Degree Over a Finite Field

We relate the number of permutation polynomials in F_q[x] of degree d≤q−2 to the solutions (x₁,x₂,…,x_q) of a system of linear equations over F_q, with the added restriction that x_i≠0 and x_i≠x_j whenever i≠j. Using this we find an expression for the number of permutation polynomials of degree p−2 in F_p[x] in terms of the permanent of a Vandermonde matrix whose entries are the primitive pth roots of unity. This leads to nontrivial bounds for the number of such permutation polynomials. We provide numerical examples to illustrate our method and indicate how our results can be generalised to polynomials of other degrees.     

On the Existence of 3-Generator, 3-Relation Finite 2-Groups with a Given (Co)Class

In this article, we show that for any positive integer k there is a 3-generator, 3-relation finite 2-group of class (respectively, coclass) k provided that k ≥ 4 (respectively, k ≥ 5).     

On Finite Groups with a Given Number of Centralizers

For a finite group G, let Cent(G) denote the set of centralizers of single elements of G and #Cent(G) = |Cent(G)|. G is called an n-centralizer group if #Cent(G) = n, and a primitive n-centralizer group if #Cent(G) = #Cent(G/Z(G)) = n. In this paper, we compute #Cent(G) for some finite groups G and prove that, for any positive integer n 2, 3, there exists a finite group G with #Cent(G) = n, which is a question raised by Belcastro and Sherman [2]. We investigate the structure of finite groups G with #Cent(G) = 6 and prove that, if G is a primitive 6-centralizer group, then G/Z(G) A₄, the alternating group on four letters. Also, we prove that, if G/Z(G) A₄, then #Cent(G) = 6 or 8, and construct a group G with G/Z(G) A₄ and #Cent(G) = 8.This research was in part supported by a grant from IPM.2000 Mathematics Subject Classification: 20D99, 20E07     

Finite Groups with a Given Set of Character Degrees

Let G be a finite group with {1, q, r, qm, q ² m, rqm} as the character degree set, where r and q are distinct primes and m>1 is an integer not divisible by q or r. We show that G is solvable and the derived length of G equals 3.     

The Group of Automorphisms of the Rational Group Algebra of a Finite Metacyclic Group

We investigate the group of automorphisms Aut(? G) of a rational group algebra ? G of a finite metacyclic group G by first describing the simple components of the Wedderburn decomposition of ? G and then investigating when two of these simple components are isomorphic.     

Extremal Graphs With a Given Number of Perfect Matchings

Let denote the maximum number of edges in a graph having n vertices and exactly p perfect matchings. For fixed p, Dudek and Schmitt showed that for some constant when n is at least some constant . For , they also determined and . For fixed p, we show that the extremal graphs for all n are determined by those with vertices. As a corollary, a computer search determines and for . We also present lower bounds on proving that for (as conjectured by Dudek and Schmitt), and we conjecture an upper bound on . Our structural results are based on Lovász's Cathedral Theorem.     

Existence of Monochromatic Simplices of Given Volume in a Colored Rational Lattice

Mathematical Notes -     

The Projective Cover of the Trivial Module Over a Group Algebra of a Finite Group

We determine all finite groups G such that the Loewy length (socle length) of the projective cover P(k _G ) of the trivial kG-module k _G is four, where k is a field of characteristic p > 0 and kG is the group algebra of G over k, by using previous results and also the classification of finite simple groups. As a by-product we prove also that if p = 2 then all finite groups G such that the Loewy lengths of the principal block algebras of kG are four, are determined.     

The Number of Isomorphism Classes of Finite Groups with Given Element Orders

Let G be a finite group and _e(G) the set of element orders of G. Denote by h( _e(G)) the number of isomorphism classes of finite groups H satisfying _e(H) = _e(G). We prove that if G has at least three prime graph components, then h( _e (G)){1, }.     

The Asymptotic Existence of Resolvable Group Divisible Designs

A group divisible design (GDD) is a triple which satisfies the following properties: (1) is a partition of X into subsets called groups; (2) is a collection of subsets of X, called blocks, such that a group and a block contain at most one element in common; and (3) every pair of elements from distinct groups occurs in a constant number λ blocks. This parameter λ is usually called the index. A k‐GDD of type is a GDD with block size k, index , and u groups of size g. A GDD is resolvable if the blocks can be partitioned into classes such that each point occurs in precisely one block of each class. We denote such a design as an RGDD. For fixed integers and , we show that the necessary conditions for the existence of a k‐RGDD of type are sufficient for all . As a corollary of this result and the existence of large resolvable graph decompositions, we establish the asymptotic existence of resolvable graph GDDs, G‐RGDDs, whenever the necessary conditions for the existence of ‐RGDs are met. We also show that, with a few easy modifications, the techniques extend to general index. © 2012 Wiley Periodicals, Inc. J. Combin. Designs 21: 112–126, 2013