An analytic problem in combinatorial structures
An asymptotical formula for the Taylor coefficients of the generating series appearing in combinatorics is obtained. It is applied to derive a formula for the number of multisets of increasing weight.
Saved in:
Main Authors: | Eugenijus Manstavičius, Rimantas Skrabutėnas |
---|---|
Format: | Article |
Language: | English |
Published: |
Vilnius University Press
2000-12-01
|
Series: | Lietuvos Matematikos Rinkinys |
Online Access: | https://www.zurnalai.vu.lt/LMR/article/view/35052 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
On analytic problems of combinatorial structures
by: Eugenijus Manstavičius
Published: (1999-12-01) -
The combinatorial structure of trigonometry
by: Adel F. Antippa
Published: (2003-01-01) -
Neurogenetic Algorithm for Solving Combinatorial Engineering Problems
by: M. Jalali Varnamkhasti, et al.
Published: (2012-01-01) -
Recursive Quantum Relaxation for Combinatorial Optimization Problems
by: Ruho Kondo, et al.
Published: (2025-01-01) -
On the frequency of multisets without some components
by: Eugenijus Manstavičius
Published: (2000-12-01)