Finite groups whose irreducible Brauer characters have prime power degrees

Let G be a finite group and let p be a prime. In this paper, we classify all finite quasisimple groups in which the degrees of all irreducible p-Brauer characters are prime powers. As an application, for a fixed odd prime p, we classify all finite nonsolvable groups with the above-mentioned property and having no nontrivial normal p-subgroups. Furthermore, for an arbitrary prime p, a complete classification of finite groups in which the degrees of all nonlinear irreducible p-Brauer characters are primes is also obtained.     

Maximal and minimal entry in the principal eigenvector for the distance matrix of a graph

Let G=(V,E) be a simple, connected and undirected graph with vertex set V(G) and edge set E(G). Also let D(G) be the distance matrix of a graph G (Jane?i? et al., 2007) [13]. Here we obtain Nordhaus–Gaddum-type result for the spectral radius of distance matrix of a graph.A sharp upper bound on the maximal entry in the principal eigenvector of an adjacency matrix and signless Laplacian matrix of a simple, connected and undirected graph are investigated in Das (2009) [4] and Papendieck and Recht (2000) [15]. Generally, an upper bound on the maximal entry in the principal eigenvector of a symmetric nonnegative matrix with zero diagonal entries and without zero diagonal entries are investigated in Zhao and Hong (2002) [21] and Das (2009) [4], respectively. In this paper, we obtain an upper bound on minimal entry in the principal eigenvector for the distance matrix of a graph and characterize extremal graphs. Moreover, we present the lower and upper bounds on maximal entry in the principal eigenvector for the distance matrix of a graph and characterize extremal graphs.     

The ubiquity of generalized cluster categories

Associated with a finite-dimensional algebra of global dimension at most 2, a generalized cluster category was introduced in Amiot (2009) [1]. It was shown to be triangulated, and 2-Calabi–Yau when it is Hom-finite. By definition, the cluster categories of Buan et al. (2006) [4] are a special case. In this paper we show that a large class of 2-Calabi–Yau triangulated categories, including those associated with elements in Coxeter groups from Buan et al. (2009) [7], are triangle equivalent to generalized cluster categories. This was already shown for some special elements in Amiot (2009) [1].     

Holographic formula for Q-curvature. II

We extend the holographic formula for the critical Q-curvature in Graham and Juhl (2007) [9] to all Q-curvatures. Moreover, we confirm a conjecture of Juhl (2009) [11].     

The Prime Graph of a Sporadic Simple Group

Abstract

Let Gbe a finite group and Sa sporadic simple group. We denote by π(G) the set of all primes dividing the order of G. The prime graph Γ(G) of Gis defined in the usual way connecting pand qin π(G) when there is an element of order pqin G. The main purpose of this paper is to determine finite group Gsatisfying Γ(G) = Γ(S) (See Theorem 3) and to give applications which generalize Abe (Abe, S. Two ways to characterize 26 sporadic finite simple groups. Preprint) and Chen (Chen, G. (1996). A new characterization of sporadic simple groups. Algebra Colloq.3:49–58). The results are elementary but quite useful.     

Nilpotent Blocks of Quasisimple Groups for the Prime Two

We examine nilpotency amongst blocks of positive defect of the quasisimple groups for the prime 2. We show that every nilpotent block of a quasisimple group has abelian defect groups, and prove a conjecture of Puig concerning the recognition of nilpotent blocks in the case of quasisimple groups. Explicit characterisations of nilpotent blocks are given for the classical, alternating and sporadic simple groups.     

Nonsolvable Groups All of Whose Character Degrees are Odd-Square-Free

A finite group G is odd-square-free if no irreducible complex character of G has degree divisible by the square of an odd prime. We determine all odd-square-free groups G satisfying S ≤ G ≤ Aut(S) for a finite simple group S. More generally, we show that if G is any nonsolvable odd-square-free group, then G has at most two nonabelian chief factors and these must be simple odd-square-free groups. If the alternating group A ₇ is involved in G, the structure of G can be further restricted.     

Quasi-symmetric functions and up–down compositions

Carlitz (1973) [5] and Rawlings (2000) [13] studied two different analogues of up–down permutations for compositions with parts in {1,…,n}. Cristea and Prodinger (2008/2009) [7] studied additional analogues for compositions with unbounded parts. We show that the results of Carlitz, Rawlings, and Cristea and Prodinger on up–down compositions are special cases of four different analogues of generalized Euler numbers for compositions. That is, for any s≥2, we consider classes of compositions that can be divided into an initial set of blocks of size s followed by a block of size j where 0≤j≤s−1. We then consider the classes of such compositions where all the blocks are strictly increasing (weakly increasing) and there are strict (weak) decreases between blocks. We show that the weight generating functions of such compositions w=w₁?w_m, where the weight of w is , are always the quotients of sums of quasi-symmetric functions. Moreover, we give a direct combinatorial proof of our results via simple involutions.     

Towards the Eaton-Moretó conjecture on the minimal height of characters

Abstract

In this note we prove that the Eaton-Moretó conjecture holds for all blocks of finite general linear and unitary groups for all primes. Also, we show that no block of a finite quasi-simple group of classical Lie type provides a minimal counterexample to the conjecture, and so for ? > 5 no ?-block of any quasi-simple group can be a minimal counterexample.     

Block separations and inclusions

We investigate the separation of characters by blocks at different primes and the inclusions of q-blocks in p-blocks (viewed as sets of characters), and use these notions to prove results on the structure of the corresponding groups. In particular, we provide a new criterion for the nilpotence of a finite group G based on the separation by principal blocks, and we show that a condition on block unions has strong structural consequences.     

Approximations for nonlinear mappings by the hybrid method in Hilbert spaces

The hybrid method in mathematical programming was introduced by Haugazeau (1968) [1] and he proved a strong convergence theorem for finding a common element of finite nonempty closed convex subsets of a real Hilbert space. Later, Bauschke and Combettes (2001) [2] proposed some condition for a family of mappings (the so-called coherent condition) and established interesting results by the hybrid method. The authors (Nakajo et al., 2009) [10] extended Bauschke and Combettes’s results. In this paper, we introduce a condition weaker than the coherent condition and prove strong convergence theorems which generalize the results of Nakajo et al. (2009) [10]. And we get strong convergence theorems for a family of asymptotically κ-strict pseudo-contractions, a family of Lipschitz and pseudo-contractive mappings and a one-parameter uniformly Lipschitz semigroup of pseudo-contractive mappings.     

A simple proof of an inequality connecting the alternating number of independent sets and the decycling number

If s_k denotes the number of independent sets of cardinality k and α(G) is the size of a maximum independent set in graph G, then I(G;x)=s₀+s₁x+?+s_α(G)x^α(G) is the independence polynomial of G (Gutman and Harary, 1983) [8].In this paper we provide an elementary proof of the inequality|I(G;−1)|≤2^φ(G) (Engström, 2009) [7], where φ(G) is the decycling number of G (Beineke and Vandell, 1997) [3], namely, the minimum number of vertices that have to be deleted in order to turn G into a forest.     

Mathieu groups and its degree prime-power graphs

Let cd(G) be the set of irreducible complex character degrees of a finite group G. The degree graph of G related to cd(G) was defined. It was proved many finite simple groups (but not all Mathieu groups) are uniquely determined by their orders and degree graphs. We hope to define a new graph related to cd(G) such that more simple groups can be uniquely determined by their orders and this newly defined graphs. Here a degree prime-power graph is defined and it is proved that all Mathieu groups can be determined uniquely by their orders and degree prime-power graphs.     

Degree Graphs of Simple Linear and Unitary Groups

Let G be a finite group and let cd (G) be the set of irreducible character degrees of G. The degree graph Δ(G) is the graph whose set of vertices is the set of primes that divide degrees in cd (G), with an edge between p and q if pq divides a for some degree a ? cd (G). We determine the graph Δ(G) for the finite simple groups of types A _?(q) and ² A _? (q ²), that is, for the simple linear and unitary groups.     

The McKay conjecture for exceptional groups and odd primes

Let G be a simply-connected simple algebraic group over an algebraically closed field of characteristic p with a Frobenius map F : G → G and G := G ^F , such that the root system is of exceptional type or G is a Suzuki group or Steinberg’s triality group. We show that all irreducible characters of C _G (S), the centraliser of S in G, extend to their inertia group in N _G (S), where S is any F-stable Sylow torus of (G, F). Together with the work in [16] this implies that the McKay conjecture is true for G and odd primes ℓ different from the defining characteristic. Moreover it shows important properties of the associated simple groups, which are relevant for the proof that the associated simple groups are good in the sense of Isaacs, Malle and Navarro, as defined in [14]. This research has been supported by the DFG-grant “Die Alperin-McKay-Vermutung für endliche Gruppen” and an Oberwolfach Leibniz fellowship.     

Wall crossings for double Hurwitz numbers

Double Hurwitz numbers count covers of P¹ by genus g curves with assigned ramification profiles over 0 and ∞, and simple ramification over a fixed branch divisor. Goulden, Jackson and Vakil have shown double Hurwitz numbers are piecewise polynomial in the orders of ramification (Goulden et al., 2005) [10], and Shadrin, Shapiro and Vainshtein have determined the chamber structure and wall crossing formulas for g=0 (Shadrin et al., 2008) [15]. This paper gives a unified approach to these results and strengthens them in several ways — the most important being the extension of the results of Shadrin et al. (2008) [15] to arbitrary genus.The main tool is the authors? previous work (Cavalieri et al., 2010) [6] expressing double Hurwitz number as a sum over certain labeled graphs. We identify the labels of the graphs with lattice points in the chambers of certain hyperplane arrangements, which give rise to piecewise polynomial functions. Our understanding of the wall crossing for these functions builds on the work of Varchenko (1987) [17], and could have broader applications.     

Simple Twisted Group Algebras of Dimension p4 and their Semi-Centers

For a simple twisted group algebra over a group G, if G^∣ is Hall subgroup of G, then the semi-center is simple. Simple twisted group algebras correspond to groups of central type. We classify all groups of central type of order p⁴ where p is prime and use this to show that for odd primes p there exists a unique group G of order p⁴, such that there exists simple twisted group algebra over G with a commutative semi-center. Moreover, if 1 < |G| <64, then the semi-center of simple twisted group algebras over G is noncommutative and this bounds are strict.     

Maximal independent sets in minimum colorings

Every graph G contains a minimum vertex-coloring with the property that at least one color class of the coloring is a maximal independent set (equivalently, a dominating set) in G. Among all such minimum vertex-colorings of the vertices of G, a coloring with the maximum number of color classes that are dominating sets in G is called a dominating-χ-coloring of G. The number of color classes that are dominating sets in a dominating-χ-coloring of G is defined to be the dominating-χ-color number of G. In this paper, we continue to investigate the dominating-χ-color number of a graph first defined and studied in [1].     

On hereditarily and super R-Hopfian and L-co-Hopfian abelian groups

An Abelian group is said to be R-Hopfian [L-co-Hopfian] if every surjective [injective] endomorphism has a right [left] inverse. An Abelian group G is said to be hereditarily R-Hopfian [hereditarily L-co-Hopfian] if each subgroup of G is R-Hopfian [L-co-Hopfian]; similarly G is super R-Hopfian [super L-co-Hopfian] if each homomorphic image of G is R-Hopfian [L-co-Hopfian]. The various classes of hereditarily and super R-Hopfian and L-co-Hopfian groups are studied and necessary conditions for groups to have these properties are derived; in several, but not all, cases, su?cient conditions are also obtained.