Groups whose set of vanishing elements is exactly a conjugacy class
author
Abstract:
Let $G$ be a finite group. We say that an element $g$ in $G$ is a vanishing element if there exists some irreducible character $chi$ of $G$ such that $chi(g)=0$. In this paper, we classify groups whose set of vanishing elements is exactly a conjugacy class.
similar resources
A NOTE ON THE COMMUTING GRAPHS OF A CONJUGACY CLASS IN SYMMETRIC GROUPS
The commuting graph of a group is a graph with vertexes set of a subset of a group and two element are adjacent if they commute. The aim of this paper is to obtain the automorphism group of the commuting graph of a conjugacy class in the symmetric groups. The clique number, coloring number, independent number, and diameter of these graphs are also computed.
full textGroups with one conjugacy class of non-normal subgroups - a short proof
For a finite group $G$ let $nu(G)$ denote the number of conjugacy classes of non-normal subgroups of $G$. We give a short proof of a theorem of Brandl, which classifies finite groups with $nu(G)=1$.
full textGroups Whose Nonlinear Irreducible Characters Separate Element Orders or Conjugacy Class Sizes
A class function φ on a finite group G is said to be an order separator if, for every x and y in G\{1} , φ(x) = φ(y) is equivalent to x and y being of the same order. Similarly, φ is said to be a class-size separator if, for every x and y in G \ {1} , φ(x) = φ(y) is equivalent to |CG(x)| = |CG(y)| . In this paper, finite groups whose nonlinear irreducible complex characters are all order separa...
full textComputing conjugacy class representatives in permutation groups
We describe a significantly improved algorithm for computing the conjugacy classes of a finite permutation group with trivial soluble radical. We rely on existing methods for groups that are almost simple, and we are concerned here only with the reduction of the general case to the almost simple case. Dedicated to Charles Leedham-Green on the occasion of his 65th birthday
full textWhich elements of a finite group are non-vanishing?
Let $G$ be a finite group. An element $gin G$ is called non-vanishing, if for every irreducible complex character $chi$ of $G$, $chi(g)neq 0$. The bi-Cayley graph ${rm BCay}(G,T)$ of $G$ with respect to a subset $Tsubseteq G$, is an undirected graph with vertex set $Gtimes{1,2}$ and edge set ${{(x,1),(tx,2)}mid xin G, tin T}$. Let ${rm nv}(G)$ be the set of all non-vanishi...
full textComputing Conjugacy Classes of Elements in Matrix Groups
This article describes a setup that – given a composition tree – provides functionality for calculation in finite matrix groups using the Trivial-Fitting approach that has been used successfully for permutation groups. It treats the composition tree as a black-box object. It thus is applicable to other classes of groups for which a composition tree can be obtained. As an example, we consider an...
full textMy Resources
Journal title
volume 6 issue 2
pages 9- 12
publication date 2019-05-01
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023