Sciweavers

446 search results - page 20 / 90
» A Combinatorial Theorem for Trees
Sort
View
93
Voted
ARSCOM
2008
117views more  ARSCOM 2008»
15 years 1 months ago
Subset Counting in Trees
Various enumeration problems for classes of simply generated families of trees have been the object of investigation in the past. We mention the enumeration of independent subsets,...
Stephan G. Wagner
118
Voted
CPC
2008
135views more  CPC 2008»
15 years 1 months ago
Subtree Sizes in Recursive Trees and Binary Search Trees: Berry-Esseen Bounds and Poisson Approximations
We study the number of subtrees on the fringe of random recursive trees and random binary search trees whose limit law is known to be either normal or Poisson or degenerate depend...
Michael Fuchs
109
Voted
JCT
2007
90views more  JCT 2007»
15 years 1 months ago
Overpartitions, lattice paths, and Rogers-Ramanujan identities
We define the notions of successive ranks and generalized Durfee squares for overpartitions. We show how these combinatorial statistics give extensions to overpartitions of combin...
Sylvie Corteel, Olivier Mallet
ICCS
2007
Springer
15 years 8 months ago
Mining Frequent Closed Unordered Trees Through Natural Representations
Abstract. Many knowledge representation mechanisms consist of linkbased structures; they may be studied formally by means of unordered trees. Here we consider the case where labels...
José L. Balcázar, Albert Bifet, Anto...
CCCG
2001
15 years 3 months ago
Geometric permutations of balls with bounded size disparity
We study combinatorial bounds for geometric permutations of balls with bounded size disparity in d-space. Our main contribution is the following theorem: given a set S of n disjoi...
Yunhong Zhou, Subhash Suri