scholarly journals On a Permutation Problem for Finite Abelian Groups

10.37236/5915 ◽  
2017 ◽  
Vol 24 (1) ◽  
Author(s):  
Fan Ge ◽  
Zhi-Wei Sun
Keyword(s):  
Abelian Group ◽  
Cyclic Group ◽  
Abelian Groups ◽  
Finite Abelian Groups ◽  
Positive Divisor ◽  
Permutation Problem

Let $G$ be a finite additive abelian group with exponent $n>1$, and let $a_1,\ldots,a_{n-1}$ be elements of $G$. We show that there is a permutation $\sigma\in S_{n-1}$ such that all the elements $sa_{\sigma(s)}\ (s=1,\ldots,n-1)$ are nonzero if and only if$$\left|\left\{1\leqslant s<n:\ \frac{n}da_s\not=0\right\}\right|\geqslant d-1\ \ \mbox{for any positive divisor}\ d\ \mbox{of}\ n.$$When $G$ is the cyclic group $\mathbb Z/n\mathbb Z$, this confirms a conjecture of Z.-W. Sun. 

scholarly journals ON THE MAXIMUM SIZE OF A (k,l)-SUM-FREE SUBSET OF AN ABELIAN GROUP

2009 ◽  
Vol 05 (06) ◽  
pp. 953-971 ◽  
Author(s):  
BÉLA BAJNOK
Keyword(s):  
Abelian Group ◽  
Cyclic Group ◽  
Abelian Groups ◽  
Finite Abelian Group ◽  
Maximum Size ◽  
Finite Abelian Groups ◽  
Free Subset ◽  
Free Set ◽  
Free Sets

A subset A of a given finite abelian group G is called (k,l)-sum-free if the sum of k (not necessarily distinct) elements of A does not equal the sum of l (not necessarily distinct) elements of A. We are interested in finding the maximum size λk,l(G) of a (k,l)-sum-free subset in G. A (2,1)-sum-free set is simply called a sum-free set. The maximum size of a sum-free set in the cyclic group ℤn was found almost 40 years ago by Diamanda and Yap; the general case for arbitrary finite abelian groups was recently settled by Green and Ruzsa. Here we find the value of λ3,1(ℤn). More generally, a recent paper by Hamidoune and Plagne examines (k,l)-sum-free sets in G when k - l and the order of G are relatively prime; we extend their results to see what happens without this assumption.

CHARACTERIZATIONS OF SOME WREATH PRODUCTS OF GROUPS BY THEIR ENDOMORPHISM SEMIGROUPS

2008 ◽  
Vol 18 (02) ◽  
pp. 243-255 ◽  
Author(s):  
PEETER PUUSEMP
Keyword(s):  
Abelian Group ◽  
Wreath Product ◽  
Cyclic Group ◽  
Abelian Groups ◽  
Finite Abelian Group ◽  
Wreath Products ◽  
Endomorphism Semigroup ◽  
Finite Abelian Groups ◽  
Products Of Groups

Let A be a cyclic group of order pn, where p is a prime, and B be a finite abelian group or a finite p-group which is determined by its endomorphism semigroup in the class of all groups. It is proved that under these assumptions the wreath product A Wr B is determined by its endomorphism semigroup in the class of all groups. It is deduced from this result that if A, B, A0,…, An are finite abelian groups and A0,…, An are p-groups, p prime, then the wreath products A Wr B and An Wr (…( Wr (A1 Wr A0))…) are determined by their endomorphism semigroups in the class of all groups.

EXTREMAL CAYLEY DIGRAPHS OF FINITE ABELIAN GROUPS

2011 ◽  
Vol 12 (01n02) ◽  
pp. 125-135 ◽  
Author(s):  
ABBY GAIL MASK ◽  
JONI SCHNEIDER ◽  
XINGDE JIA
Keyword(s):  
Abelian Group ◽  
Positive Integer ◽  
Communication Networks ◽  
Abelian Groups ◽  
Finite Abelian Group ◽  
Finite Abelian Groups ◽  
Element Subset ◽  
Cayley Digraph ◽  
Positive Integers ◽  
Element Set

Cayley digraphs of finite abelian groups are often used to model communication networks. Because of their applications, extremal Cayley digraphs have been studied extensively in recent years. Given any positive integers d and k. Let m*(d, k) denote the largest positive integer m such that there exists an m-element finite abelian group Γ and a k-element subset A of Γ such that diam ( Cay (Γ, A)) ≤ d, where diam ( Cay (Γ, A)) denotes the diameter of the Cayley digraph Cay (Γ, A) of Γ generated by A. Similarly, let m(d, k) denote the largest positive integer m such that there exists a k-element set A of integers with diam (ℤm, A)) ≤ d. In this paper, we prove, among other results, that [Formula: see text] for all d ≥ 1 and k ≥ 1. This means that the finite abelian group whose Cayley digraph is optimal with respect to its diameter and degree can be a cyclic group.

scholarly journals EXPLICIT cocycle formulas on finite abelian groups with applications to braided linear Gr-categories and Dijkgraaf–Witten invariants

2019 ◽  
Vol 150 (4) ◽  
pp. 1937-1964 ◽  
Author(s):  
Hua-Lin Huang ◽  
Zheyan Wan ◽  
Yu Ye
Keyword(s):  
Abelian Group ◽  
Abelian Groups ◽  
Finite Abelian Group ◽  
Finite Abelian Groups ◽  
Bar Resolution ◽  
Chain Map ◽  
A Chain

AbstractWe provide explicit and unified formulas for the cocycles of all degrees on the normalized bar resolutions of finite abelian groups. This is achieved by constructing a chain map from the normalized bar resolution to a Koszul-like resolution for any given finite abelian group. With a help of the obtained cocycle formulas, we determine all the braided linear Gr-categories and compute the Dijkgraaf–Witten Invariants of the n-torus for all n.

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.

ON A PARTITION PROBLEM OF FINITE ABELIAN GROUPS

2015 ◽  
Vol 92 (1) ◽  
pp. 24-31
Author(s):  
ZHENHUA QU
Keyword(s):  
Abelian Group ◽  
Abelian Groups ◽  
Finite Abelian Group ◽  
Partition Problem ◽  
Finite Abelian Groups ◽  
Disjoint Sets ◽  
Ordered Pairs

Let$G$be a finite abelian group and$A\subseteq G$. For$n\in G$, denote by$r_{A}(n)$the number of ordered pairs$(a_{1},a_{2})\in A^{2}$such that$a_{1}+a_{2}=n$. Among other things, we prove that for any odd number$t\geq 3$, it is not possible to partition$G$into$t$disjoint sets$A_{1},A_{2},\dots ,A_{t}$with$r_{A_{1}}=r_{A_{2}}=\cdots =r_{A_{t}}$.

scholarly journals A Study on Finite Abelian Groups: Sylow’s Theorems Based

2017 ◽  
Vol 1 (3) ◽  
Author(s):  
Amaira Moaitiq Mohammed Al-Johani
Keyword(s):  
Abelian Group ◽  
Algebraic Structure ◽  
Abelian Groups ◽  
Commutative Rings ◽  
Abstract Algebra ◽  
Vector Spaces ◽  
Finite Abelian Groups ◽  
Study Objective ◽  
Group Operation ◽  
Basic Concepts

In abstract algebra, an algebraic structure is a set with one or more finitary operations defined on it that satisfies a list of axioms. Algebraic structures include groups, rings, fields, and lattices, etc. A group is an algebraic structure (????, ∗), which satisfies associative, identity and inverse laws. An Abelian group, also called a commutative group, is a group in which the result of applying the group operation to two group elements does not depend on the order in which they are written. That is, these are the groups that obey the axiom of commutatively. The concept of an Abelian group is one of the first concepts encountered in abstract algebra, from which many other basic concepts, such as rings, commutative rings, modules and vector spaces are developed. This study sheds the light on the structure of the finite abelian groups, basis theorem, Sylow’s theorem and factoring finite abelian groups. In addition, it discusses some properties related to these groups. The researcher followed the exploratory and comparative approaches to achieve the study objective. The study has shown that the theory of Abelian groups is generally simpler than that of their non-abelian counter parts, and finite Abelian groups are very well understood.  

scholarly journals Zero-sum subsets of decomposable sets in Abelian groups

2020 ◽  
Vol 30 (1) ◽  
pp. 15-25
Author(s):  
T. Banakh ◽  
◽  
A. Ravsky ◽  
Keyword(s):  
Abelian Group ◽  
Cyclic Group ◽  
Open Problem ◽  
Abelian Groups ◽  
The Other ◽  
Other Hand ◽  
Decomposable Sets ◽  
Empty Subset ◽  
Zero Sum

A subset D of an abelian group is decomposable if ∅≠D⊂D+D. In the paper we give partial answers to an open problem asking whether every finite decomposable subset D of an abelian group contains a non-empty subset Z⊂D with ∑Z=0. For every n∈N we present a decomposable subset D of cardinality |D|=n in the cyclic group of order 2n−1 such that ∑D=0, but ∑T≠0 for any proper non-empty subset T⊂D. On the other hand, we prove that every decomposable subset D⊂R of cardinality |D|≤7 contains a non-empty subset T⊂D of cardinality |Z|≤12|D| with ∑Z=0. For every n∈N we present a subset D⊂Z of cardinality |D|=2n such that ∑Z=0 for some subset Z⊂D of cardinality |Z|=n and ∑T≠0 for any non-empty subset T⊂D of cardinality |T|<n=12|D|. Also we prove that every finite decomposable subset D of an Abelian group contains two non-empty subsets A,B such that ∑A+∑B=0.

scholarly journals Some projective representations of finite abelian groups

1987 ◽  
Vol 29 (2) ◽  
pp. 197-203 ◽  
Author(s):  
A. O. Morris ◽  
M. Saeed-Ul-Islam ◽  
E. Thomas
Keyword(s):  
Abelian Group ◽  
Abelian Groups ◽  
Finite Abelian Groups ◽  
Projective Representations ◽  
Complete Sets ◽  
Image Position

In this paper, we continue the work initiated by Morris [5] and Saeed-ul-Islam [6,7] and determine complete sets of inequivalent irreducible projective representations (which we shall write as i.p.r.) of finite Abelian groups with respect to some additional factor sets.We consider an Abelian groupwhich will be referred to as an Abelian group of type (a1, …, am).

scholarly journals Dynamics of Endomorphism of Finite Abelian Groups

2017 ◽  
Vol 2017 ◽  
pp. 1-7
Author(s):  
Zhao Jinxing ◽  
Nan Jizhu
Keyword(s):  
Fixed Point ◽  
Abelian Group ◽  
Dynamical Systems ◽  
Automorphism Group ◽  
Abelian Groups ◽  
Finite Abelian Group ◽  
Point System ◽  
Finite Abelian Groups

We study the dynamics of endomorphisms on a finite abelian group. We obtain the automorphism group for these dynamical systems. We also give criteria and algorithms to determine whether it is a fixed point system.

Sign in / Sign up

Export Citation Format

Share Document