相关论文: Fixed conjugacy classes of normal subgroups and th…
Let $p$ be a prime and let $P$ be a Sylow $p$-subgroup of a finite nonabelian group $G$. Let $bcl(G)$ be the size of the largest conjugacy class of the group $G$. We show that $|P/O_p(G)| < bcl(G)$ if $G$ is not abelian.
Let $G$ be a simple algebraic group over an algebraically closed field $K$ of characteristic $p\geqslant 0$, let $H$ be a proper closed subgroup of $G$ and let $V$ be a nontrivial irreducible $KG$-module, which is $p$-restricted, tensor…
In this note, we determine the finite groups whose poset of conjugacy classes of subgroups has breaking points. This leads to a new characterization of the generalized quaternion $2$-groups. A generalization of this property is also…
In this paper, we study combinatorial properties of stable curves. To the dual graph of any nodal curve, it is naturally associated a group, which is the group of components of the N\'eron model of the generalized Jacobian of the curve. We…
Following Isaacs (see [Isa08, p. 94]), we call a normal subgroup N of a finite group G large, if $C_G(N) \leq N$, so that N has bounded index in G. Our principal aim here is to establish some general results for systematically producing…
We prove for residually finite groups the following long standing conjecture: the number of twisted conjugacy classes of an automorphism of a finitely generated group is equal (if it is finite) to the number of finite dimensional…
Every finite group $G$ has a normal series each of whose factors either is soluble or is a direct product of nonabelian simple groups. We define the nonsoluble length $\lambda (G)$ as the minimum number of nonsoluble factors in a series of…
We study the representation growth of alternating and symmetric groups in positive characteristic and restricted representation growth for the finite groups of Lie type. We show that the the number of representations of dimension at most n…
We present a new algorithm that, given two matrices in $GL(n,Q)$, decides if they are conjugate in $GL(n,Z)$ and, if so, determines a conjugating matrix. We also give an algorithm to construct a generating set for the centraliser in…
We study finite groups $G$ with elements $g$ such that $\lvert \mathbf{C}_G(g)\rvert = \lvert G:G' \rvert$. (Such elements generalize fixed-point-free automorphisms of finite groups.) We show that these groups have a unique conjugacy class…
In this paper, we set $\eta (G)$ to be the number of conjugacy classes of maximal cyclic subgroups of a finite group $G$. We compute $\eta (G)$ for all metacyclic $p$-groups. We show that if $G$ is a metacyclic $p$-group of order $p^n$ that…
By work of De Concini, Kac and Procesi the irreducible representations of the non-restricted specialization of the quantized enveloping algebra of the Lie algebra g at the roots of unity are parametrized by the conjugacy classes of a group…
A necessary condition for uniqueness of factorizations of elements of a finite group $G$ with factors belonging to a union of some conjugacy classes of $G$ is given. This condition is sufficient if the number of factors belonging to each…
For a free group $\mathbb{F}$ of finite rank such that $\text{rank}(\mathbb{F})\geq 3$, we prove that the set of weak limits of a conjugacy class in $\mathbb{F}$ under iterates of some hyperbolic $\phi\in\mathsf{Out(\mathbb{F})}$ is equal…
The Castelnuovo-Mumford regularity of a module gives a rough measure of its complexity. We bound the regularity of a module given a system of approximating modules whose regularities are known. Such approximations can arise naturally for…
Let $G = X \wr H$ be the wreath product of a nontrivial finite group $X$ with $k$ conjugacy classes and a transitive permutation group $H$ of degree $n$ acting on the set of $n$ direct factors of $X^n$. If $H$ is semiprimitive, then $k(G)…
We find an upper bound for the number of groups of order $n$ up to isomorphism in the variety $G = A_pA_qA_r$, where $p$, $q$ and $r$ are distinct primes. We also find a bound on the orders and on the number of conjugacy classes of…
An upper dominating set in a graph is a minimal (with respect to set inclusion) dominating set of maximum cardinality. The problem of finding an upper dominating set is generally NP-hard. We study the complexity of this problem in classes…
A recurring theme in finite group theory is understanding how the structure of a finite group is determined by the arithmetic properties of group invariants. There are results in the literature determining the structure of finite groups…
For a prime $p$, we say that a conjugacy class of a finite group $G$ is $p$-vanishing if every irreducible character of $G$ of degree divisible by $p$ takes value 0 on that conjugacy class. In this paper we completely classify 2-vanishing…