Design and Experiment of a Communication-Aware Parallel Quicksort with Weighted Partition of Processors

Author(s):  
Sangman Moh ◽  
Chansu Yu ◽  
Dongsoo Han
Keyword(s):  
2001 ◽  
Vol 53 (4) ◽  
pp. 866-896
Author(s):  
Yifan Yang

AbstractLet pw(n) be the weighted partition function defined by the generating function , where w(m) is a non-negative arithmetic function. Let be the summatory functions for pw(n) and w(n), respectively. Generalizing results of G. A. Freiman and E. E. Kohlbecker, we show that, for a large class of functions Φ(u) and λ(u), an estimate for Pw(u) of the formlog Pw(u) = Φ(u){1 + Ou(1/λ(u))} (u→∞) implies an estimate forNw(u) of the formNw(u) = Φ*(u){1+O(1/ log ƛ(u))} (u→∞) with a suitable function Φ*(u) defined in terms of Φ(u). We apply this result and related results to obtain characterizations of the Riemann Hypothesis and the Generalized Riemann Hypothesis in terms of the asymptotic behavior of certain weighted partition functions.


2017 ◽  
Vol 176 ◽  
pp. 226-248 ◽  
Author(s):  
Alexander Berkovich ◽  
Ali K. Uncu

2013 ◽  
Vol 22 (3) ◽  
pp. 433-454 ◽  
Author(s):  
LJUBEN MUTAFCHIEV

We consider partitions of the positive integernwhose parts satisfy the following condition. For a given sequence of non-negative numbers {bk}k≥1, a part of sizekappears in exactlybkpossible types. Assuming that a weighted partition is selected uniformly at random from the set of all such partitions, we study the asymptotic behaviour of the largest partXn. LetD(s)=∑k=1∞bkk−s,s=σ+iy, be the Dirichlet generating series of the weightsbk. Under certain fairly general assumptions, Meinardus (1954) obtained the asymptotic of the total number of such partitions asn→∞. Using the Meinardus scheme of conditions, we prove thatXn, appropriately normalized, converges weakly to a random variable having Gumbel distribution (i.e., its distribution function equalse−e−t, −∞<t<∞). This limit theorem extends some known results on particular types of partitions and on the Bose–Einstein model of ideal gas.


Author(s):  
Shane Chern
Keyword(s):  

Let [Formula: see text] count the total number of parts among partitions of [Formula: see text] with rank congruent to [Formula: see text] modulo [Formula: see text] and let [Formula: see text] count the total appearances of ones among partitions of [Formula: see text] with crank congruent to [Formula: see text] modulo [Formula: see text]. We provide a list of over 70 congruences modulo 5, 7, 11 and 13 involving [Formula: see text] and [Formula: see text], which are known as congruences of Andrews–Beck type. Some recent conjectures of Chan, Mao and Osburn are also included in this list.


2020 ◽  
Vol 72 (5) ◽  
pp. 055602
Author(s):  
Mei-Feng Dai ◽  
Ting-Ting Ju ◽  
Yong-Bo Hou ◽  
Fang Huang ◽  
Dong-Lei Tang ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document