activity
20022017
most citedA Meinardus theorem with multiple singularities

21 citations · 33 across the 16 of their papers we have counts for

collaborators

16 papers

math.CO2017

Explicit asymptotic formulae for sub exponentially growing multiplicative structures

Boris Granovsky

It is derived the explicit asymptotic expression in for the coefficient of the generating function for multiplicative structures with sub exponential rate of growth of $c…

math.CO2016★ 2 cited

Asymptotic enumeration by Khintchine-Meinardus method: Necessary and sufficient conditions for sub exponential growth

Boris Granovsky

In this paper we prove the necessity of the main sufficient condition of Meinardus for sub exponential rate of growth of the number of structures, having multiplicative generating…

math.PR2013★ 1 cited

Developments in the Khintchine-Meinardus probabilistic method for asymptotic enumeration

Boris L. Granovsky, Dudley Stark

A theorem of Meinardus provides asymptotics of the number of weighted partitions under certain assumptions on associated ordinary and Dirichlet generating functions. The ordinary g…

math.PR2011★ 21 cited

A Meinardus theorem with multiple singularities

Boris Granovsky, Dudley Stark

Meinardus proved a general theorem about the asymptotics of the number of weighted partitions, when the Dirichlet generating function for weights has a single pole on the positive…

math.PR2010

Coagulation processes with Gibbsian time evolution

Boris Granovsky, Alexander Kryvoshaev

We prove that time dynamics of a stochastic process of pure coagulation is given by a time dependent Gibbs distribution if and only if rates of single coagulations have the form $ψ…

math.PR2007★ 1 cited

On time dynamics of coagulation-fragmentation processes

Boris L. Granovsky, Michael M. Erlihson

We establish a characterization of coagulation-fragmentation processes, such that the induced birth and death processes depicting the total number of groups at time are ti…