The asymptotic number of weighted partitions with a given number of parts

نویسندگان

چکیده

Abstract For a given sequence $$b_k$$ b k of non-negative real numbers, the number weighted partitions positive integer n having m parts $$c_{n,m}$$ c n , m has bivariate generating function equal to $$\prod _{k=1}^\infty (1-yz^k)^{-b_k}$$ ∏ = 1 ∞ ( - y z ) . Under assumption that $$b_k\sim Ck^{r-1}$$ ∼ C r , $$r>0$$ > 0 and related conditions on Dirichlet weights we find asymptotics for when $$m=m(n)$$ satisfies $$m=o\left( n^\frac{r}{r+1}\right) $$ o + $$\lim _{n\rightarrow \infty }m/\log ^{3+\epsilon }n=\infty lim → / log 3 ϵ $$\epsilon >0$$

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Number of Parts of Integer Partitions Lying in given Residue Classes

Improving upon previous work [3] on the subject, we use Wright’s Circle Method to derive an asymptotic formula for the number of parts in all partitions of an integer n that are in any given arithmetic progression.

متن کامل

The Asymptotic Number of Labeled Connected Graphs with a Given Number of Vertices and Edges

Let c(n, q) be the number of connected labeled graphs with n vertices and q 5 N = ( ) edges. Let x = q/n and k = q n. We determine functions w k 1 , a(x ) and cp(x) such that c (n , q) w k ( z ) e n r p ( x ) e o ( x ) uniformly for all n and q 2 n. If Q > O is fixed, n+= and 4q > ( 1 + ~ ) n log n, this formula simplifies to c(n, q) ( t ) exp(-ne-zq’n). On the other hand, if k = o(n”’), this f...

متن کامل

The asymptotic number of labelled weakly-connected digraphs with a given number of vertices and edges

Edward A. Benderl Depariment of Mathel1wtics, University of California, San Diego, La Jolla, CA 92093, USA E. Rodney Canfieldl Department of Computer Science, University of Georgia, Athens, GA 30602, USA Brendan D. McKay2 Computer Science Department, Australian National University, GPO Box 4, ACT 2601., Australia In a recent paper, we determined the asymptotic number of labelled connected graph...

متن کامل

The Asymptotic Number of Set Partitions with Unequal Block Sizes

The asymptotic behavior of the number of set partitions of an n-element set into blocks of distinct sizes is determined. This behavior is more complicated than is typical for set partition problems. Although there is a simple generating function, the usual analytic methods for estimating coefficients fail in the direct approach, and elementary approaches combined with some analytic methods are ...

متن کامل

The number of permutations with a given number of sequences

P (n, s) denotes the number of permutations of 1, 2,. .. n that have exactly s sequences. Canfield and Wilf [math.CO/0609704] recently showed that P (n, s) can be written as a sum of s polynomials in n. We determine these polynomials explicitly and also obtain explicit expressions for P (n, s) and its fixed-s generating function us(x).

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Ramanujan Journal

سال: 2021

ISSN: ['1572-9303', '1382-4090']

DOI: https://doi.org/10.1007/s11139-020-00350-2