scholarly journals Antiautomorphisms and Biantiautomorphisms of Some Finite Abelian Groups

Symmetry ◽  
2020 ◽  
Vol 12 (2) ◽  
pp. 294
Author(s):  
Daniel López-Aguayo ◽  
Servando López Aguayo
Keyword(s):  
Lower Bound ◽  
Abelian Groups ◽  
Additive Group ◽  
Exact Formula ◽  
Finite Abelian Groups ◽  
Cyclic Groups ◽  
Partial Classification ◽  
Open Questions ◽  
Odd Order

We extend the concepts of antimorphism and antiautomorphism of the additive group of integers modulo n, given by Gaitanas Konstantinos, to abelian groups. We give a lower bound for the number of antiautomorphisms of cyclic groups of odd order and give an exact formula for the number of linear antiautomorphisms of cyclic groups of odd order. Finally, we give a partial classification of the finite abelian groups which admit antiautomorphisms and state some open questions.

scholarly journals On Keller's conjecture for certain cyclic groups

1979 ◽  
Vol 22 (1) ◽  
pp. 17-21 ◽  
Author(s):  
A. D. Sands
Keyword(s):  
Prime Power ◽  
Abelian Groups ◽  
Prime Power Order ◽  
Finite Abelian Groups ◽  
Cyclic Groups

Keller (6) considered a generalisation of a problem of Minkowski (7) concerning the filling of Rn by congruent cubes. Hajós (4) reduced Minkowski's conjecture to a problem concerning the factorization of finite abelian groups and then solved this problem. In a similar manner Hajós (5) reduced Keller's conjecture to a problem in the factorization of finite abelian groups, but this problem remains unsolved, in general. It occurs also as Problem 80 in Fuchs (3). Seitz (10) has obtained a solution for cyclic groups of prime power order. In this paper we present a solution for cyclic groups whose order is the product of two prime powers.

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 Zero square near-rings

1991 ◽  
Vol 51 (3) ◽  
pp. 497-504
Author(s):  
Patricia Jones
Keyword(s):  
Abelian Groups ◽  
Additive Group ◽  
Finite Abelian Groups

AbstractThe purpose of this paper is to provide examples and explore properties of a wide variety of zero square (left) near rings. Among the main results are complete classifications of (i) finite Abelian groups which are the additive group of a zero square near-ring and (ii) finite non-Abelian groups which support 3-nilpotent distributive zero square near-rings.

scholarly journals The classification of free actions of cyclic groups of odd order on homotopy spheres

1971 ◽  
Vol 77 (3) ◽  
pp. 455-460 ◽  
Author(s):  
William Browder ◽  
Ted Petrie ◽  
C. T. C. Wall
Keyword(s):  
Cyclic Groups ◽  
Odd Order ◽  
Free Actions

scholarly journals UNCERTAINTY PRINCIPLES FOR GROUPS AND RECONSTRUCTION OF SIGNALS

2017 ◽  
Vol 21 (6) ◽  
pp. 102-109
Author(s):  
S.Y. Novikov ◽  
M.E. Fedina
Keyword(s):  
Abelian Groups ◽  
Summation Formula ◽  
Uncertainty Principles ◽  
Finite Abelian Groups ◽  
Cyclic Groups ◽  
Finite Dimensional ◽  
Discrete Signals ◽  
Minimum Number ◽  
Dimensional Version ◽  
Indicator Functions

Uncertainty principles of harmonic analysis and their analogues for finite abelian groups are considered in the paper. Special attention is paid to the recent results of T. Tao and coauthors about cyclic groups of prime order. It is shown, that indicator functions of subgroups of finite Abelian groups are analogues of Gaussian functions. Finite-dimensional version of Poisson summation formula is proved. Opportunities of application of these results for reconstruction of discrete signals with incomplete number of coefficients are suggested. The principle of partial isometric whereby we can determine the minimum number of measurements for stable recovery of the signal are formulated.

scholarly journals EXTENSION OF AUTOMORPHISMS OF SUBGROUPS

2012 ◽  
Vol 54 (2) ◽  
pp. 371-380
Author(s):  
G. G. BASTOS ◽  
E. JESPERS ◽  
S. O. JURIAANS ◽  
A. DE A. E SILVA
Keyword(s):  
Abelian Group ◽  
Finite Groups ◽  
Dihedral Group ◽  
Abelian Groups ◽  
Alternating Group ◽  
Finite Abelian Groups ◽  
Quaternion Group ◽  
Icosahedral Group ◽  
Odd Order ◽  
Even Order

AbstractLet G be a group such that, for any subgroup H of G, every automorphism of H can be extended to an automorphism of G. Such a group G is said to be of injective type. The finite abelian groups of injective type are precisely the quasi-injective groups. We prove that a finite non-abelian group G of injective type has even order. If, furthermore, G is also quasi-injective, then we prove that G = K × B, with B a quasi-injective abelian group of odd order and either K = Q8 (the quaternion group of order 8) or K = Dih(A), a dihedral group on a quasi-injective abelian group A of odd order coprime with the order of B. We give a description of the supersoluble finite groups of injective type whose Sylow 2-subgroup are abelian showing that these groups are, in general, not quasi-injective. In particular, the characterisation of such groups is reduced to that of finite 2-groups that are of injective type. We give several restrictions on the latter. We also show that the alternating group A5 is of injective type but that the binary icosahedral group SL(2, 5) is not.

scholarly journals Maximal sum-free sets in abelian groups of order divisible by three

1972 ◽  
Vol 6 (3) ◽  
pp. 439-441 ◽  
Author(s):  
Anne Penfold Street
Keyword(s):  
Abelian Groups ◽  
Additive Group ◽  
Finite Abelian Groups ◽  
Free Set ◽  
Free Sets

A subset S of an additive group G is called a maximal sum-free set in G if (S+S) nS = Φ and |S| ≥ |T| for every sum-free set T in G. In this note, we prove a conjecture of Yap concerning the structure of maximal sum-free sets in finite abelian groups of order divisible by 3 but not divisible by any prime congruent to 2 modulo 3.

scholarly journals Comments on Y. O. Hamidoune's Paper ‘Adding Distinct Congruence Classes’

2016 ◽  
Vol 25 (5) ◽  
pp. 641-644
Author(s):  
BÉLA BAJNOK
Keyword(s):  
Cyclic Group ◽  
Abelian Groups ◽  
Short Note ◽  
Finite Abelian Groups ◽  
Cyclic Groups ◽  
Even Order ◽  
Congruence Classes

The main result in Y. O. Hamidoune's paper ‘Adding distinct congruence classes' (Combin. Probab. Comput.7 (1998) 81–87) is as follows. If S is a generating subset of a cyclic group G such that 0 ∉ S and |S| ⩾ 5, then the number of sums of the subsets of S is at least min(|G|, 2|S|). Unfortunately, the argument of the author, who, sadly, passed away in 2011, relies on a lemma whose proof is incorrect; in fact, the lemma is false for all cyclic groups of even order. In this short note we point out this mistake, correct the proof, and discuss why the main result is actually true for all finite abelian groups.

On Restricted Sums

2000 ◽  
Vol 9 (6) ◽  
pp. 513-518 ◽  
Author(s):  
Y. O. HAMIDOUNE ◽  
A. S. LLADÓ ◽  
O. SERRA
Keyword(s):  
Abelian Group ◽  
Prime Order ◽  
Abelian Groups ◽  
Generating Set ◽  
Cyclic Groups ◽  
Odd Order

Let G be an abelian group. For a subset A ⊂ G, denote by 2 ∧ A the set of sums of two different elements of A. A conjecture by Erdős and Heilbronn, first proved by Dias da Silva and Hamidoune, states that, when G has prime order, [mid ]2 ∧ A[mid ] [ges ] min([mid ]G[mid ], 2[mid ]A[mid ] − 3).We prove that, for abelian groups of odd order (respectively, cyclic groups), the inequality [mid ]2 ∧ A[mid ] [ges ] min([mid ]G[mid ], 3[mid ]A[mid ]/2) holds when A is a generating set of G, 0 ∈ A and [mid ]A[mid ] [ges ] 21 (respectively, [mid ]A[mid ] [ges ] 33). The structure of the sets for which equality holds is also determined.

scholarly journals Decomposing finite Abelian groups

2001 ◽  
Vol 1 (3) ◽  
pp. 26-32
Author(s):  
K Cheung ◽  
M Mosca
Keyword(s):  
Efficient Algorithm ◽  
Riemann Hypothesis ◽  
Abelian Groups ◽  
Quantum Algorithm ◽  
Class Numbers ◽  
Finite Abelian Groups ◽  
Generalized Riemann Hypothesis ◽  
Cyclic Groups

This paper describes a quantum algorithm for efficiently decomposing finite Abelian groups into a product of cyclic groups. Such a decomposition is needed in order to apply the Abelian hidden subgroup algorithm. Such a decomposition (assuming the Generalized Riemann Hypothesis) also leads to an efficient algorithm for computing class numbers (known to be at least as difficult as factoring).

Sign in / Sign up

Export Citation Format

Share Document