Sums of Element Orders in Finite Groups
By H. Amiri, S. M. Jafarian Amiri, I. Isaacs. 2009
116 citations recorded by the source corpus.
Subfields: Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Geometry and Topology
View Paper: https://www.semanticscholar.org/paper/4d6a5937b09b5be2aff8e5764f2b36f348aa3cb4
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Discrete Mathematics and Combinatorics
In Geometry and Topology
Citations in the corpus
- An exact upper bound for sums of element orders in non-cyclic finite groups (2016, background): “An important ingredient in our proofs is Corollary B of [1], which states that if P is a cyclic normal Sylow p-subgroup of a finite group G, then”
- A criterion for solvability of a finite group by the sum of element orders (2018, unknown): “Using (2), we have G ∩Z(G) = 1, hence G ∼= G×Z(G) ∼= A5 × Z(G) and |Z(G)| = 2 13253.”