English
Related papers

Related papers: An arithmetic method of counting the subgroups of …

200 papers

This paper deals with the number of subgroups of a given exponent in a finite abelian group. Explicit formulas are obtained in the case of rank two and rank three abelian groups. An asymptotic formula is also presented.

Group Theory · Mathematics 2017-05-01 Marius Tărnăuceanu , László Tóth

We use recurrence relations to derive explicit formulas for counting the number of subgroups of given order (or index) in rank 3 finite abelian p-groups and use these to derive similar formulas in few cases for rank 4. As a consequence, we…

Group Theory · Mathematics 2018-06-18 Fikreab Admasu , Amit Sehgal

The main goal of the current paper is to determine the total number of diamonds in the subgroup lattice of a finite abelian group. This counting problem is reduced to finite $p$-groups. Explicit formulas are obtained in some particular…

Group Theory · Mathematics 2013-12-06 Dan Gregorian Fodor , Marius Tarnauceanu

The article presents several methods for the arithmetic of finite abelian groups. We introduce a tool - already used by Delsarte in [1] as I found out later - analogous to Dirichlet's convolution to obtain combinatorial results on these…

Group Theory · Mathematics 2023-05-04 Louis Mallet-Burgues

In this short note we give a formula for the number of chains of subgroups of a finite elementary abelian $p$-group. This completes our previous work [5].

Group Theory · Mathematics 2016-04-19 Marius Tărnăuceanu

We prove by using simple number-theoretic arguments formulae concerning the number of elements of a fixed order and the number of cyclic subgroups of a direct product of several finite cyclic groups. We point out that certain multiplicative…

Group Theory · Mathematics 2012-11-08 László Tóth

This paper describes a quantum algorithm for efficiently decomposing finite Abelian groups. Such a decomposition is needed in order to apply the Abelian hidden subgroup algorithm. Such a decomposition (assuming the Generalized Riemann…

Data Structures and Algorithms · Computer Science 2007-05-23 Kevin K. H. Cheung , Michele Mosca

In this note some properties of the sum of element orders of a finite abelian group are studied.

Group Theory · Mathematics 2018-05-31 Marius Tărnăuceanu , Dan Gregorian Fodor

We survey group-theoretic algorithms for finding (some or all) subgroups of a finite group and discuss the implementation of these algorithms in the computer algebra system GAP

Group Theory · Mathematics 2020-12-04 Alexander Hulpke

We consider abelain subgroups of small index in finite groups. More generally, we consider subgroups such that the product of their index by the index of their centralizer is small.

Group Theory · Mathematics 2021-01-21 Avinoam Mann

We say that a subgroup $H$ is isolated in a group $G$ if for every $x\in G$ we have either $x\in H$ or $\langle x\rangle\cap H=1$. In this short note, we describe the set of isolated subgroups of a finite abelian group. The technique used…

Group Theory · Mathematics 2021-02-10 Marius Tărnăuceanu

In this article we introduce and study a class of finite groups for which the orders of normal subgroups satisfy a certain inequality. It is closely connected to some well-known arithmetic classes of natural numbers.

Group Theory · Mathematics 2018-05-31 Marius Tărnăuceanu

The purpose of this paper is to determine the number of fuzzy subgroups of a finite abelian group of order $p^{n}q^{m}$. As an application of our main result, explicit formulas for the number of fuzzy subgroups of…

Group Theory · Mathematics 2019-04-16 Lingling Han , Xiuyun Guo

Previously the second author has constructed by cobordism methods, an invariant associated to a finite group $G$. This invariant approximates the number of subgroups of a group, giving in some cases the number of abelian and cyclic…

Geometric Topology · Mathematics 2018-05-15 Bruno Cisneros , Carlos Segovia

The target of this article is to discuss the concept of \textit{commuting probability} of finite groups which, in short, is a probabilistic measure of how abelian our group is. We shall compute the value of commuting probability for many…

Group Theory · Mathematics 2023-08-02 Snehinh Sen

We study the problem of finding a subgroup of a given order in a finite group, where the group is represented by its Cayley table. We analyze the complexity of the problem in the special case of abelian groups and present an optimal…

Computational Complexity · Computer Science 2026-02-26 K. Lakshmanan

In this note, we give the explicit formula for the number of multisubsets of a finite abelian group $G$ with any given size such that the sum is equal to a given element $g\in G$. This also gives the number of partitions of $g$ into a given…

Combinatorics · Mathematics 2013-05-15 Amela Muratovic-Ribic , Qiang Wang

In this paper, we classify the finite simple groups with an abelian Sylow subgroup.

Group Theory · Mathematics 2015-10-14 Rulin Shen , Yuanyang Zhou

We find the number of compositions over finite abelian groups under two types of restrictions: (i) each part belongs to a given subset and (ii) small runs of consecutive parts must have given properties. Waring's problem over finite fields…

Combinatorics · Mathematics 2017-10-19 Zhicheng Gao , Andrew MacFie , Qiang Wang

A group is metabelian if its commutator subgroup is abelian. For finitely generated metabelian groups, classical commutative algebra, algebraic geometry and geometric group theory, especially the latter two subjects, can be brought to bear…

Group Theory · Mathematics 2012-03-27 Gilbert Baumslag , Roman Mikhailov , Kent E. Orr
‹ Prev 1 2 3 10 Next ›