arXiv Analytics

Sign in

arXiv:1702.02631 [math.CO]AbstractReferencesReviewsResources

Self-linked sets in finite groups

Taras Banakh, Volodymyr Gavrylkiv

Published 2017-02-08Version 1

A subset $A$ of a group $G$ is called self-linked if $A\cap gA\ne\emptyset$ for every $g\in G$. The smallest cardinality $|A|$ of a self-linked subset $A\subset G$ is called the self-linked number $sl(G)$ of $G$. In the paper we find lower and upper bounds for the self-linked number $sl(G)$ of a finite group $G$ and prove that $$\frac{1+\sqrt{4|G|+4|G_2|-7}}2\le sl(G)\le \frac{\sqrt[4]{|G|\ln(|G|-1)}+\sqrt{\ln 4}}{\sqrt[4]{|G|\ln(|G|-1)}-\sqrt{\ln 4}}\cdot \sqrt{|G|\ln(|G|-1)}$$where $G_2=\{g\in G:g^{-1}=g\}$ is the set of elements of order at most two in $G$. Also we calculate the self-linked numbers of all Abelian groups of cardinality $\le95$.

Related articles: Most relevant | Search more
arXiv:1003.2588 [math.CO] (Published 2010-03-12, updated 2010-12-02)
Centerpole sets for colorings of Abelian groups
arXiv:1305.5328 [math.CO] (Published 2013-05-23)
Orbits of pairs in abelian groups
arXiv:1002.4853 [math.CO] (Published 2010-02-25, updated 2012-06-19)
On the Connectivity of the Sylow Graph of a Finite Group