Counting maximal chains of subgroups of finite nilpotent groups
Mirela Stefănescu ♦ M. Tărnăuceanu
Abstract
carpathian_2009_25_1_119_127_abstractFull PDF
carpathian_2009_25_1_119_127The main goal of our paper is to determine the total number of maximal chains of subgroups in a finite nilpotent group. This counting problem is reduced to finite pp-groups. Explicit formulas are obtained in some particular cases.
Recently posted
-
Stability of new functional equations and partial multipliers in Banach *-algebras
-
Characterizations of amenable gyrogroups related to Tarski's Theorem
-
Two new extragradient methods for solving pseudomonotone the equilibrium problem in Hilbert spaces
-
On the error estimates for the sequence of successive approximations for cyclic \varphi–contractions in metric spaces
-
Hybrid CG-Like Algorithm for Nonlinear Equations and Image Restoration
-
New class of n-order fractional differential equations and solvability in the double sequence space m^2(\Delta_{v}^{u}, \phi,p)
-
Constructing DNA Codes using Double Cyclic Codes of Odd and Even Lengths over F2 + u F2
-
Consequences of the product rule in Stieltjes differentiability
-
On the existence and uniqueness of fixed points in Banach spaces using the Krasnoselskij iterative method
-
A quaternionic product of simple ratios