Irreducible Character

14,000,000 Leading Edge Experts on the ideXlab platform

Scan Science and Technology

Contact Leading Edge Experts & Companies

Scan Science and Technology

Contact Leading Edge Experts & Companies

The Experts below are selected from a list of 300 Experts worldwide ranked by ideXlab platform

Mark L Lewis - One of the best experts on this subject based on the ideXlab platform.

  • Nonsolvable Groups with no Prime Dividing Four Character Degrees
    Algebras and Representation Theory, 2017
    Co-Authors: Mehdi Ghaffarzadeh, Mark L Lewis, Mohsen Ghasemi, Hung P. Tong-viet
    Abstract:

    Given a finite group G , we say that G has property

  • finite groups with an Irreducible Character of large degree
    Manuscripta Mathematica, 2016
    Co-Authors: Nguyen Ngoc Hung, Mark L Lewis
    Abstract:

    Let G be a finite group and d the degree of a complex Irreducible Character of G, then write |G| = d(d + e) where e is a nonnegative integer. We prove that |G| ≤ e 4−e 3 whenever e > 1. This bound is best possible and improves on several earlier related results.

  • finite groups with an Irreducible Character of large degree
    arXiv: Group Theory, 2015
    Co-Authors: Nguyen Ngoc Hung, Mark L Lewis
    Abstract:

    Let $G$ be a finite group and $d$ the degree of a complex Irreducible Character of $G$, then write $|G|=d(d+e)$ where $e$ is a nonnegative integer. We prove that $|G|\leq e^4-e^3$ whenever $e>1$. This bound is best possible and improves on several earlier related results.

  • bounding the number of Irreducible Character degrees of a finite group in terms of the largest degree
    Journal of Algebra and Its Applications, 2014
    Co-Authors: Mark L Lewis, Alexander Moreto
    Abstract:

    We conjecture that the number of Irreducible Character degrees of a finite group is bounded in terms of the number of prime factors (counting multiplicities) of the largest Character degree. We prove that this conjecture holds when the largest Character degree is prime and when the Character degree graph is disconnected.

  • Taketa’s theorem for some Character degree sets
    Archiv der Mathematik, 2013
    Co-Authors: Kamal Aziziheris, Mark L Lewis
    Abstract:

    Let cd (G) be the set of Irreducible complex Character degrees of a finite group G . The Taketa problem conjectures that if G is a finite solvable group, then $${{\rm dl}(G) \leqslant |{\rm cd} (G)|}$$ , where dl( G ) is the derived length of G . In this note, we show that this inequality holds if either all nonlinear Irreducible Characters of G have even degrees or all Irreducible Character degrees are odd. Also, we prove that this inequality holds if all Irreducible Character degrees have exactly the same prime divisors. Finally, Isaacs and Knutson have conjectured that the Taketa problem might be true in a more general setting. In particular, they conjecture that the inequality $${{\rm dl}(N) \leqslant |{\rm cd} {(G \mid N)}|}$$ holds for all normal solvable subgroups N of a group G . We show that this conjecture holds if $${{\rm cd} {(G \mid N')}}$$ is a set of non-trivial p –powers for some fixed prime p .

Abolfazl Tehranian - One of the best experts on this subject based on the ideXlab platform.

I M Isaacs - One of the best experts on this subject based on the ideXlab platform.

  • upper bounds for the number of Irreducible Character degrees of a group
    Journal of Algebra, 2014
    Co-Authors: I M Isaacs
    Abstract:

    Abstract Let G be a p-solvable group for some prime p, and suppose that the largest Irreducible Character degree of G is kp, where k p is an integer. We obtain an upper bound on the total number of different Irreducible Character degrees of G, where the bound depends on k but not on p.

  • the average degree of an Irreducible Character of a finite group
    Israel Journal of Mathematics, 2013
    Co-Authors: I M Isaacs, Maria Loukaki, Alexander Moreto
    Abstract:

    Given a finite group G, we write acd(G) to denote the average of the degrees of the Irreducible Characters of G. We show that if acd(G) ≤ 3, then G is solvable. Also, if acd(G) < 3/2, then G is supersolvable, and if acd(G) < 4/3, then G is nilpotent.

  • Groups whose real Irreducible Characters have degrees coprime to p
    Journal of Algebra, 2012
    Co-Authors: I M Isaacs, Gabriel Navarro
    Abstract:

    Abstract In this paper we study groups for which every real Irreducible Character has degree not divisible by some given odd prime p .

  • p -groups having few almost-rational Irreducible Characters
    Israel Journal of Mathematics, 2011
    Co-Authors: I M Isaacs, Gabriel Navarro, Josu Sangroniz
    Abstract:

    We prove that a 2-group has exactly five rational Irreducible Characters if and only if it is dihedral, semidihedral or generalized quaternion. For an arbitrary prime p, we say that an Irreducible Character χ of a p-group G is “almost rational” if ℚ(χ) is contained in the cyclotomic field ℚ p , and we write ar(G) to denote the number of almost-rational Irreducible Characters of G. For noncyclic p-groups, the two smallest possible values for ar(G) are p 2 and p 2 + p − 1, and we study p-groups G for which ar(G) is one of these two numbers. If ar(G) = p 2 + p − 1, we say that G is “exceptional”. We show that for exceptional groups, |G: G′| = p 2, and so the assertion about 2-groups with which we began follows from this. We show also that for each prime p, there are exceptional p-groups of arbitrarily large order, and for p ≥ 5, there is a pro-p-group with the property that all of its finite homomorphic images of order at least p 3 are exceptional.

  • finite group elements where no Irreducible Character vanishes
    Journal of Algebra, 1999
    Co-Authors: I M Isaacs, Gabriel Navarro, Thomas R Wolf
    Abstract:

    In this paper, we consider elements x of a finite group G with the property that χ(x) ≠ 0 for all Irreducible Characters χ of G. If G is solvable and x has odd order, we show that x must lie in the Fitting subgroup F(G).

Lucia Morotti - One of the best experts on this subject based on the ideXlab platform.

Ali Iranmanesh - One of the best experts on this subject based on the ideXlab platform.