activity
20122025
most citedAn arithmetic method of counting the subgroups of a finite abelian group

11 citations · 41 across the 31 of their papers we have counts for

collaborators

43 papers

math.GR2025

Counting conjugacy classes and automorphism-conjugacy classes of ZM-groups

Marius Tărnăuceanu

In this paper, we count the number of conjugacy and automorphism-conjugacy classes of elements of a ZM-group. The size of a conjugacy class with respect to these two equivalence re…

math.GR2024

Finite groups with dense solitary subgroups

Marius Tărnăuceanu

A group is said to have dense solitary subgroups if each non-empty open interval in its subgroup lattice contains a solitary subgroup. In this short note, we find all fi…

math.GR2023

A characterization of by its average order

Marius Tărnăuceanu

Let be the average order of a finite group . M. Herzog, P. Longobardi and M. Maj \cite{7} showed that if is non-solvable and , then . In this…

math.GR2022

On the average order of a finite group

Mihai-Silviu Lazorec, Marius Tărnăuceanu

Let be the average order of a finite group . We show that if , where , then is an elementary abelian 2-group o…

math.GR2022★ 7 cited

Finite groups with large Chermak-Delgado lattices

Georgiana Fasolă, Marius Tărnăuceanu

Given a finite group , we denote by the subgroup lattice of and by the Chermak-Delgado lattice of . In this note, we determine the finite groups …

math.GR2022

Another criterion for supersolvability of finite groups

Marius Tărnăuceanu

Let be the average order of a finite group . In this paper, we prove that if \,, then is supersolvable. Moreover, we have if…

math.GR2021

Finite groups with many isolated subgroups

Marius Tărnăuceanu

Given a finite group , we denote by the subgroup lattice of and by the set of isolated subgroups of . In this note, we describe finite groups $…

math.GR2021

Generalizing the Lehmer's totient problem

Marius Tărnăuceanu

An important unsolved question in number theory is the Lehmer's totient problem that asks whether there exists any composite number such that , where is the E…

math.GR2021★ 2 cited

A new Menon-type identity derived from group actions

Marius Tărnăuceanu

In this short note, we give a new Menon-type identity involving the sum of element orders and the sum of cyclic subgroup orders of a finite group. It is based on applying the weigh…

math.GR2021

On the supersolvability of a finite group by the sum of subgroup orders

Marius Tărnăuceanu

Let be a finite group and . In this paper, we prove that if \,, then is supersolvable. In particular, some…

math.GR2021

Isolated subgroups of finite abelian groups

Marius Tărnăuceanu

We say that a subgroup is isolated in a group if for every we have either or . In this short note, we describe the set of isolat…

math.GR2020

Arithmetic progressions in finite groups

Marius Tărnăuceanu

In this paper, we describe the structure of finite groups whose element orders or proper (abelian) subgroup orders form an arithmetic progression of ratio . This extends t…

math.GR2020

A result on the number of cyclic subgroups of a finite group

Marius Tărnăuceanu

Let be a finite group and \,, where denotes the set of cyclic subgroups of . In this short note, we prove that and we descr…

math.GR2020

A generalization of a result on the sum of element orders of a finite group

Marius Tărnăuceanu

Let be a finite group and let denote the sum of element orders of . It is well-known that the maximum value of on the set of groups of order , where is a p…

math.GR2019

How large a union of proper subgroups of a finite group can be?

Marius Tărnăuceanu

Let be a positive integer and be a finite group that cannot be written as the union of proper subgroups. In this short note, we study the existence of a constant $c_k\i…

math.GR2019★ 2 cited

A criterion for solvability of a finite group by the sum of subgroup orders

Marius Tărnăuceanu

Let be a finite group and . In this note, we prove that if , then is solvable. Moreover, we have $σ_1(G)=\fr…

math.GR2019

Detecting structural properties of finite groups by the sum of element orders

Marius Tărnăuceanu

In this paper, we introduce a new function related to the sum of element orders of finite groups. It is used to give some criteria for a finite group to be cyclic, abelian, nilpote…

math.GR2019

A criterion for nilpotency of a finite group by the sum of element orders

Marius Tărnăuceanu

Denote the sum of element orders in a finite group by and let denote the cyclic group of order . In this paper, we prove that if and $ψ(G)>\frac{13}{21}…

math.GR2018

Finite groups with two Chermak-Delgado measures

Marius Tărnăuceanu

In this note, we study the finite groups whose Chermak-Delgado measure has exactly two values. They determine an interesting class of -groups containing cyclic groups of prime o…

math.GR2018

An -lattice structure associated to some classes of finite groups

Marius Tărnăuceanu

In the present paper we introduce and study a canonical -lattice structure on the set of element orders of some finite groups. We show that a finite abelian group is uniq…

math.GR2018

On isomorphisms of canonical -lattices

Marius Tărnăuceanu

The aim of the present paper is to study isomorphisms of canonical -lattices. Some interesting results are obtained in the particular case of isomorphisms between two sub…

math.GR2018★ 11 cited

An arithmetic method of counting the subgroups of a finite abelian group

Marius Tărnăuceanu

The main goal of this paper is to apply the arithmetic method developed in our previous paper \cite{13} to determine the number of some types of subgroups of finite abelian groups.

math.GR2018

A characterization of generalized quaternion 2-groups

Marius Tărnăuceanu

The goal of this note is to give a characterization of generalized quaternion -groups by using their posets of cyclic subgroups.

math.GR2018

Addendum to "Subgroup commutativity degrees of finite groups"

Marius Tărnăuceanu

We indicate a natural generalization of the concept of subgroup commutativity degree of a finite group and a list of open problems on these new concepts.