After deriving inequalities on coefficients arising in the expansion of a Schur P -function in terms of Schur functions we give criteria for when such expansions are multiplicity free. From here we study the multiplicity of an irreducible spin character of the twisted symmetric group in the product of a basic spin character with an irreducible character of the symmetric group, and determine whe...

In this paper we obtain the orthogonality relations for the supergroup U(m|n), which are remarkably different from the ones for the U(N) case. We extend our results for ordinary representations, obtained some time ago, to the case of complex conjugated and mixed representations. Our results are expressed in terms of the Young tableaux notation for irreducible representations. We use the supersy...

There has been some interest on how the average character degree affects structure of a finite group. We define, and denote by $ \mathrm{anz}(G) $, number zeros characters group G as in table divided irreducible $. show that if < 1 then is solvable also \frac{1}{2} supersolvable. characterise abelian groups showing \frac{1}{3} only abelian.

An abundance of information regarding the structure of a finite group can be obtained by studying its irreducible characters. Of particular interest are monomial characters — those induced from a linear character of some subgroup — since Brauer has shown that any irreducible character of a group can be written as an integral linear combination of monomial characters. Our primary focus is the cl...

Let B be a reductive Lie subalgebra of a semi-simple Lie algebra F of the same rank both over the complex numbers. To each finite dimensional irreducible representation Vlambda of F we assign a multiplet of irreducible representations of B with m elements in each multiplet, where m is the index of the Weyl group of B in the Weyl group of F. We obtain a generalization of the Weyl character formu...

the concept of the bipartite divisor graph for integer subsets has been considered in [‎graph combinator., ‎ 26 (2010) 95--105‎.]. ‎in this paper‎, ‎we will consider this graph for the set of character degrees of a finite group $g$ and obtain some properties of this graph‎. ‎we show that if $g$ is a solvable group‎, ‎then the number of connected components of this graph is at most $2$ and if $g...

An n × n complex sign pattern matrix S is said to be spectrally arbitrary if for every monic nth degree polynomial f(λ) with coefficients from C, there is a complex matrix in the complex sign pattern class of S such that its characteristic polynomial is f(λ). If S is a spectrally arbitrary complex sign pattern matrix, and no proper subpattern of S is spectrally arbitrary, then S is a minimal sp...