On the Exact Order of Asymptotic Bases and Bases for Finite Cyclic Groups

2010 ◽  
pp. 179-193
Author(s):  
Xingde Jia
Keyword(s):  
Author(s):  
Marcos Antônio da Silva Pinto ◽  
Viviane Ribeiro Tomaz da Silva
Keyword(s):  

2021 ◽  
Vol 73 (1) ◽  
pp. 62-67
Author(s):  
Ibrahim A. Ahmad ◽  
A. R. Mugdadi

For a sequence of independent, identically distributed random variable (iid rv's) [Formula: see text] and a sequence of integer-valued random variables [Formula: see text], define the random quantiles as [Formula: see text], where [Formula: see text] denote the largest integer less than or equal to [Formula: see text], and [Formula: see text] the [Formula: see text]th order statistic in a sample [Formula: see text] and [Formula: see text]. In this note, the limiting distribution and its exact order approximation are obtained for [Formula: see text]. The limiting distribution result we obtain extends the work of several including Wretman[Formula: see text]. The exact order of normal approximation generalizes the fixed sample size results of Reiss[Formula: see text]. AMS 2000 subject classification: 60F12; 60F05; 62G30.


2020 ◽  
Vol 0 (0) ◽  
Author(s):  
Naomi Andrew

AbstractWe provide some necessary and some sufficient conditions for the automorphism group of a free product of (freely indecomposable, not infinite cyclic) groups to have Property (FA). The additional sufficient conditions are all met by finite groups, and so this case is fully characterised. Therefore, this paper generalises the work of N. Leder [Serre’s Property FA for automorphism groups of free products, preprint (2018), https://arxiv.org/abs/1810.06287v1]. for finite cyclic groups, as well as resolving the open case of that paper.


2016 ◽  
Vol 165 (9) ◽  
pp. 1753-1813 ◽  
Author(s):  
Mark F. Hagen ◽  
Daniel T. Wise
Keyword(s):  

1981 ◽  
Vol 13 (1) ◽  
pp. 42-44 ◽  
Author(s):  
Douglas C. Ravenel
Keyword(s):  

2018 ◽  
Vol 17 (10) ◽  
pp. 1850184 ◽  
Author(s):  
Ramesh Prasad Panda ◽  
K. V. Krishna

The power graph of a group [Formula: see text] is the graph whose vertex set is [Formula: see text] and two distinct vertices are adjacent if one is a power of the other. This paper investigates the minimal separating sets of power graphs of finite groups. For power graphs of finite cyclic groups, certain minimal separating sets are obtained. Consequently, a sharp upper bound for their connectivity is supplied. Further, the components of proper power graphs of [Formula: see text]-groups are studied. In particular, the number of components of that of abelian [Formula: see text]-groups are determined.


2003 ◽  
Vol 325 (4) ◽  
pp. 711-726 ◽  
Author(s):  
Aderemi O. Kuku ◽  
Guoping Tang
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document