Mappings On Decomposable Combinatorial Structures: Analytic Approach
نویسنده
چکیده
Combinatorics, Probability & Computing / Volume 11 / Issue 01 / January 2002, pp 61 78 DOI: 10.1017/S0963548301005016, Published online: 14 February 2002 Link to this article: http://journals.cambridge.org/abstract_S0963548301005016 How to cite this article: E. MANSTAVICIUS (2002). Mappings on Decomposable Combinatorial Structures: Analytic Approach. Combinatorics, Probability & Computing, 11, pp 61-78 doi:10.1017/S0963548301005016 Request Permissions : Click here
منابع مشابه
On total variation approximations for random assemblies
The purpose of the present note is to draw reader’s attention to an analytic approach proposed by the author in [8] and refined in [9]. In contrast to the celebrated Flajolet-Odlyzko method (see [4]), it allows to obtain asymptotic formulas for the ratio of coefficients of two power series when separately the coefficients do not have a regular asymptotic behavior as their index increases. Moreo...
متن کاملOn Poisson-Dirichlet limits for random decomposable combinatorial structures
We prove a joint local limit law for the distribution of the r largest components of decomposable logarithmic combinatorial structures, including assemblies, multisets and selections. Our method is entirely probabilistic, and requires only weak conditions that may readily be verified in practice. Combinatorics, Probability and Computing (1999) 8, 193–208. Printed in the United Kingdom c © 1999 ...
متن کاملVertex Decomposable Simplicial Complexes Associated to Path Graphs
Introduction Vertex decomposability of a simplicial complex is a combinatorial topological concept which is related to the algebraic properties of the Stanley-Reisner ring of the simplicial complex. This notion was first defined by Provan and Billera in 1980 for k-decomposable pure complexes which is known as vertex decomposable when . Later Bjorner and Wachs extended this concept to non-pure ...
متن کاملA probabilistic approach to analytic arithmetic on algebraic function fields
Knopfmacher [13] introduced the idea of an additive arithmetic semigroup as a general setting for an algebraic analogue of number theory. Within his framework, Zhang [19] showed that the asymptotic distribution of the values taken by additive functions closely resembles that found in classical number theory, inasmuch as there are direct analogues of the Erdős–Wintner and Kubilius Main Theorems....
متن کاملGeneral combinatorial schemas : 159 Gaussian limit distributions and exponential tails *
1 Flajolet, P. and M. Soria, General combinatorial schemas: Gaussian limit distributions and exponential tails, Discrete Mathematics 114 (1993) 159-180. Under general conditions, the number of components in combinatorial structures defined as sequences, cycles or sets of components admits a Gaussian limit distribution together with an exponential tail. The results are valid, assuming simple ana...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Combinatorics, Probability & Computing
دوره 11 شماره
صفحات -
تاریخ انتشار 2002