The number of trees half of whose vertices are leaves and asymptotic enumeration of plane real algebraic curves.

DOI10.1016/J.JCTA.2003.10.007MaRDI QIDQ1427013zbMATH OpenOpenAlexFDO

Authors Viatcheslav Kharlamov, Stepan Orevkov

Publication date 14 March 2004

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0301245

zbMATH Keywords

asymptotic enumerationleaflogarithmic convexitybi-variant generating functionovals arrangementunlabled rooted trees

Mathematics Subject Classification ID

Applications of graph theory (05C90) Enumeration in graph theory (05C30) Plane and space curves (14H50) Real algebraic sets (14P05) Enumerative problems (combinatorial problems) in algebraic geometry (14N10)

Abstract: The number of topologically different plane real algebraic curves of a given degree $d$ has the form $exp(C{d}^2+o(d^2))$. We determine the best available upper bound for the constant $C$. This bound follows from Arnold inequalities on the number of empty ovals. To evaluate its rate we show its equivalence with the rate of growth of the number of trees half of whose vertices are leaves and evaluate the latter rate.

Recommendations

• The asymptotic number of leftist trees
• The asymptotic behaviour of the number of trees in certain classes
• On the number of trees in Z^d
• scientific article; zbMATH DE number 718863
• The asymptotic number of tree-rooted maps on a surface
• scientific article; zbMATH DE number 3205162
• scientific article; zbMATH DE number 4093490
• Random plane increasing trees: Asymptotic enumeration of vertices by distance from leaves
• On k-trees with given leafages
• Laplacian coefficients of trees with given number of leaves or vertices of degree two

Cites work

• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• scientific article; zbMATH DE number 3419161 (Why is no real title available?)
• An asymptotic evaluation of the cycle index of a symmetric group
• Asymptotic growth of the number of classes of real plane algebraic curves as the degree grows
• Distribution of ovals of the real plane of algebraic curves, of involutions of four-dimensional smooth manifolds, and the arithmetic of integer-valued quadratic forms
• The distribution of degrees in a large random tree
• The distribution of nodes of given degree in random trees
• The number of trees

Cited in

(11)

• Isotopic triangulation of a real algebraic surface
• HOW TO COUNT TREES?
• A criterion for sharpness in tree enumeration and the asymptotic number of triangulations in Kuperberg's \(G_2\) spider
• scientific article; zbMATH DE number 1960413 (Why is no real title available?)
• Counting contours on trees
• A criterion for sharpness in tree enumeration and the asymptotic number of triangulations in Kuperberg's \(G_2\) spider
• Using linear forms to determine the set of integers realizable by \((g_ 0,g_ 1,\dots ,g_ n)\)-trees
• Asymptotic growth of the number of classes of real plane algebraic curves as the degree grows
• Topology and counting of real algebraic curves
• Maximally writhed real algebraic links
• Counting rooted trees: the universal law \(t(n)\sim C\rho^{-n} n^{-3/2}\)

This page was built for publication: The number of trees half of whose vertices are leaves and asymptotic enumeration of plane real algebraic curves.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1427013)