scholarly journals On the number of diamonds in the subgroup lattice of a finite abelian group

2016 ◽  
Vol 24 (2) ◽  
pp. 205-215
Author(s):  
Dan Gregorian Fodor ◽  
Marius Tărnăuceanu
Keyword(s):  
Abelian Group ◽  
Finite Abelian Group ◽  
Subgroup Lattice ◽  
Current Paper ◽  
Explicit Formulas ◽  
Counting Problem

Abstract 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 cases.

scholarly journals A connection between the number of subgroups and the order of a finite group

2020 ◽  
pp. 2250001
Author(s):  
Mihai-Silviu Lazorec
Keyword(s):  
Finite Group ◽  
Abelian Group ◽  
Finite Abelian Group ◽  
Subgroup Lattice ◽  
Minimum Value ◽  
A Finite Group

For a finite group [Formula: see text], we associate the quantity [Formula: see text], where [Formula: see text] is the subgroup lattice of [Formula: see text]. Different properties and problems related to this ratio are studied throughout this paper. We determine the second minimum value of [Formula: see text] on the class of [Formula: see text]-groups of order [Formula: see text], where [Formula: see text] is an integer. We show that the set containing the quantities [Formula: see text], where [Formula: see text] is a finite (abelian) group, is dense in [Formula: see text] Finally, we consider [Formula: see text] to be a function on [Formula: see text] and we indicate some of its properties, the main result being the classification of finite abelian [Formula: see text]-groups [Formula: see text] satisfying [Formula: see text]

scholarly journals The Number of Subgroup Chains of Finite Nilpotent Groups

Symmetry ◽  
2020 ◽  
Vol 12 (9) ◽  
pp. 1537 ◽  
Author(s):  
Lingling Han ◽  
Xiuyun Guo
Keyword(s):  
Abelian Group ◽  
Abelian Groups ◽  
Finite Abelian Group ◽  
Recursive Formula ◽  
Nilpotent Groups ◽  
Classification Problem ◽  
Finite Abelian Groups ◽  
Counting Problem ◽  
Cyclic Groups ◽  
Fuzzy Subgroups

In this paper, we mainly count the number of subgroup chains of a finite nilpotent group. We derive a recursive formula that reduces the counting problem to that of finite p-groups. As applications of our main result, the classification problem of distinct fuzzy subgroups of finite abelian groups is reduced to that of finite abelian p-groups. In particular, an explicit recursive formula for the number of distinct fuzzy subgroups of a finite abelian group whose Sylow subgroups are cyclic groups or elementary abelian groups is given.

scholarly journals On the number of subgroups of a given exponent in a finite abelian group

2017 ◽  
Vol 101 (115) ◽  
pp. 121-133 ◽  
Author(s):  
Marius Tărnăuceanu ◽  
László Tóth
Keyword(s):  
Abelian Group ◽  
Asymptotic Formula ◽  
Abelian Groups ◽  
Finite Abelian Group ◽  
Explicit Formulas

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.

Additive bases via Fourier analysis

2021 ◽  
pp. 1-12
Author(s):  
Bodan Arsovski
Keyword(s):  
Abelian Group ◽  
Fourier Analysis ◽  
Vector Space ◽  
Abelian Groups ◽  
Finite Abelian Group ◽  
Probabilistic Method ◽  
Additive Basis ◽  
Generating Sets

Abstract Extending a result by Alon, Linial, and Meshulam to abelian groups, we prove that if G is a finite abelian group of exponent m and S is a sequence of elements of G such that any subsequence of S consisting of at least $$|S| - m\ln |G|$$ elements generates G, then S is an additive basis of G . We also prove that the additive span of any l generating sets of G contains a coset of a subgroup of size at least $$|G{|^{1 - c{ \in ^l}}}$$ for certain c=c(m) and $$ \in = \in (m) < 1$$ ; we use the probabilistic method to give sharper values of c(m) and $$ \in (m)$$ in the case when G is a vector space; and we give new proofs of related known results.

scholarly journals A lattice-theoretic characterization of pure subgroups of Abelian groups

2021 ◽  
Author(s):  
M. Ferrara ◽  
M. Trombetti
Keyword(s):  
Abelian Group ◽  
Abelian Groups ◽  
Subgroup Lattice ◽  
General Definition ◽  
Short Paper ◽  
Theoretic Characterization ◽  
Definition Of

AbstractLet G be an abelian group. The aim of this short paper is to describe a way to identify pure subgroups H of G by looking only at how the subgroup lattice $$\mathcal {L}(H)$$ L ( H ) embeds in $$\mathcal {L}(G)$$ L ( G ) . It is worth noticing that all results are carried out in a local nilpotent context for a general definition of purity.

Representation of zero-sum invariants by sets of zero-sum sequences over a finite abelian group

2021 ◽  
Author(s):  
Weidong Gao ◽  
Siao Hong ◽  
Wanzhen Hui ◽  
Xue Li ◽  
Qiuyu Yin ◽  
...  
Keyword(s):  
Abelian Group ◽  
Finite Abelian Group ◽  
Zero Sum

Stable cohomotopy and cobordism of abelian groups

1981 ◽  
Vol 90 (2) ◽  
pp. 273-278 ◽  
Author(s):  
C. T. Stretch
Keyword(s):  
Abelian Group ◽  
Abelian Groups ◽  
Finite Abelian Group ◽  
Formal Group ◽  
Characteristic Class ◽  
Burnside Ring ◽  
Classifying Space ◽  
Formal Group Law ◽  
Stable Cohomotopy ◽  
Group Law

The object of this paper is to prove that for a finite abelian group G the natural map is injective, where Â(G) is the completion of the Burnside ring of G and σ0(BG) is the stable cohomotopy of the classifying space BG of G. The map â is detected by means of an M U* exponential characteristic class for permutation representations constructed in (11). The result is a generalization of a theorem of Laitinen (4) which treats elementary abelian groups using ordinary cohomology. One interesting feature of the present proof is that it makes explicit use of the universality of the formal group law of M U*. It also involves a computation of M U*(BG) in terms of the formal group law. This may be of independent interest. Since writing the paper the author has discovered that M U*(BG) has previously been calculated by Land-weber(5).

An improved query for the hidden subbroup problem

2014 ◽  
Vol 14 (5&6) ◽  
pp. 467-492
Author(s):  
Asif Shakeel
Keyword(s):  
Abelian Group ◽  
Standard Method ◽  
Finite Abelian Group ◽  
Quantum Algorithms ◽  
Success Probability ◽  
Hidden Subgroup Problem ◽  
Subgroup Identification ◽  
Subgroup Problem ◽  
Query Algorithms

The Hidden Subgroup Problem (HSP) is at the forefront of problems in quantum algorithms. In this paper, we introduce a new query, the \textit{character} query, generalizing the well-known phase kickback trick that was first used successfully to efficiently solve Deutsch's problem. An equal superposition query with $\vert 0 \rangle$ in the response register is typically used in the ``standard method" of single-query algorithms for the HSP. The proposed character query improves over this query by maximizing the success probability of subgroup identification under a uniform prior, for the HSP in which the oracle functions take values in a finite abelian group. We apply our results to the case when the subgroups are drawn from a set of conjugate subgroups and obtain a success probability greater than that found by Moore and Russell.

Sign in / Sign up

Export Citation Format

Share Document