Related papers: On two problems about order sequences of finite gr…

Let $G$ be a finite group. Then we denote $\psi(G) = \sum_{x\in G}o(x)$ where $o(x)$ is the order of the element $x$ in $G$. In this paper we characterize some finite $p$-groups ($p$ a prime) by $\psi$ and their orders.

This paper deals with combinatorial aspects of finite covers of groups by cosets or subgroups. Let $a_1G_1,...,a_kG_k$ be left cosets in a group $G$ such that ${a_iG_i}_{i=1}^k$ covers each element of $G$ at least $m$ times but none of its…

We consider elements of finite order in the Riordan group $\cal R$ over a field of characteristic $0$. Viewing $\cal R$ as a semi-direct product of groups of formal power series, we solve, for all $n \geq 2$, two foundational questions…

Given a finite group G, let cd(G) denote the set of degrees of the irreducible complex characters of G. The character degree graph of G is defined as the simple undirected graph whose vertices are the prime divisors of the numbers in cd(G),…

A subset S of a group G invariably generates G if G = <s^(g(s)) | s in S> for each choice of g(s) in G, s in S. In this paper we study invariable generation of infinite groups, with emphasis on linear groups. Our main result shows that a…

In this paper, we consider a natural generalization of the concept of order of an element in a group: an element $g \in G$ is said to have order $k$ in a subgroup $H$ of $G$ (\resp \wrt a coset $Hu$) if $k$ is the first strictly positive…

Let $o(G)$ be the average order of a finite group $G$. M. Herzog, P. Longobardi and M. Maj \cite{7} showed that if $G$ is non-solvable and $o(G)=o(A_5)$, then $G\cong A_5$. In this note, we prove that the equality $o(G)=o(A_5)$ does not…

The same-order type $\tau_e(G)$ of a finite group $G$ is a set formed of the sizes of the equivalence classes containing the same order elements of $G$. In this paper, we study an arithmetical property of this set. More exactly, we outline…

The prime graph (or Gruenberg-Kegel graph) of a finite group $G$ is a familiar graph. In this paper first, we investigate the structure of the finite groups with a non-complete prime graph. Then we prove that every alternating group…

Let $G$ be a group of order $n$ and $H$ be a subgroup of order $m$ of $G$. Denote by $\psi_H(G)$ the sum of element orders relative to $H$ of $G$. It is known that if $G$ is nilpotent, then $\psi_H(G)\leq\psi_{H_m}(G)$, where $H_m$ is the…

Given a finite group $G$, we denote by $\psi\,'(G)$ the product of element orders of $G$. Our main result proves that the restriction of $\psi\,'$ to abelian $p$-groups of order $p^n$ is strictly increasing with respect to a natural order…

Let $\Gamma$ be an undirected and simple graph. A set $ S $ of vertices in $\Gamma$ is called a {cyclic vertex cutset} of $\Gamma$ if $\Gamma - S$ is disconnected and has at least two components each containing a cycle. If $\Gamma$ has a…

Linear second order recursive sequences with arbitrary initial conditions are studied. For sequences with the same parameters a ring and a group is attached, and isomorphisms and homomorphisms are established for related parameters. In the…

In this paper we consider two functions related to the arithmetic and geometric means of element orders of a finite group, showing that certain lower bounds on such functions strongly affect the group structure. In particular, for every…

Let $G$ be a finite group. By a sequence over $G$, we mean a finite unordered string of terms from $G$ with repetition allowed, and we say that it is a product-one sequence if its terms can be ordered so that their product is the identity…

We prove that if $G$ is a finite simple group which is the unit group of a ring, then $G$ is isomorphic to either (a) a cyclic group of order 2; (b) a cyclic group of prime order $2^k -1$ for some $k$; or (c) a projective special linear…

We call a group $G$ {\it algorithmically finite} if no algorithm can produce an infinite set of pairwise distinct elements of $G$. We construct examples of recursively presented infinite algorithmically finite groups and study their…

Let $n>0$ be an integer and $\mathcal{X}$ be a class of groups. We say that a group $G$ satisfies the condition $(\mathcal{X},n)$ whenever in every subset with $n+1$ elements of $G$ there exist distinct elements $x,y$ such that $<x,y>$ is…

This paper examines order three elements of finite groups which normalize no nontrivial 2-subgroup. The motivation for finding such elements arises out of a problem in modular representation theory. The question of when these elements…

Let $G$ be a finite group. A finite unordered sequence $S = g_1 \boldsymbol{\cdot} \ldots \boldsymbol{\cdot} g_{\ell}$ of terms from $G$, where repetition is allowed, is a product-one sequence if its terms can be ordered such that their…