Sciweavers

RSA
2011
106views more  RSA 2011»
13 years 1 months ago
Distances between pairs of vertices and vertical profile in conditioned Galton-Watson trees
We consider a conditioned Galton–Watson tree and prove an estimate of the number of pairs of vertices with a given distance, or, equivalently, the number of paths of a given leng...
Luc Devroye, Svante Janson

0
posts
with
0
views
243profile views
Mark C. WilsonProfessor, Associate
University of Auckland
Mark C. Wilson
COMBINATORICS
2002
104views more  COMBINATORICS 2002»
13 years 10 months ago
Exchange Symmetries in Motzkin Path and Bargraph Models of Copolymer Adsorption
In a previous work [26], by considering paths that are partially weighted, the generating function of Dyck paths was shown to possess a type of symmetry, called an exchange relati...
E. J. Janse van Rensburg, A. Rechnitzer
COMBINATORICS
2000
114views more  COMBINATORICS 2000»
13 years 10 months ago
Restricted Permutations, Continued Fractions, and Chebyshev Polynomials
Let fr n(k) be the number of 132-avoiding permutations on n letters that contain exactly r occurrences of 12 . . . k, and let Fr(x; k) and F (x, y; k) be the generating functions d...
Toufik Mansour, Alek Vainshtein
COMBINATORICS
2000
128views more  COMBINATORICS 2000»
13 years 10 months ago
Continued Fractions and Catalan Problems
We find a generating function expressed as a continued fraction that enumerates ordered trees by the number of vertices at different levels. Several Catalan problems are mapped to...
Mahendra Jani, Robert G. Rieper
COMBINATORICS
2000
82views more  COMBINATORICS 2000»
13 years 10 months ago
When Structures Are Almost Surely Connected
Let An denote the number of objects of some type of "size" n, and let Cn denote the number of these objects which are connected. It is often the case that there is a rel...
Jason P. Bell
DM
2007
83views more  DM 2007»
13 years 10 months ago
Restricted colored permutations and Chebyshev polynomials
Several authors have examined connections between restricted permutations and Chebyshev polynomials of the second kind. In this paper we prove analogues of these results for color...
Eric S. Egge
DM
2010
127views more  DM 2010»
13 years 11 months ago
Enumeration and limit laws of dissections on a cylinder
We compute the generating function for triangulations on a cylinder, with the restriction that all vertices belong to its boundary and that the intersection of a pair of different ...
Juanjo Rué
ITSL
2008
14 years 8 days ago
An Implementation of the Barvinok--Woods Integer Projection Algorithm
We describe the first implementation of the Barvinok
Matthias Koeppe, Sven Verdoolaege, Kevin Woods
HYBRID
2010
Springer
14 years 4 months ago
A generating function approach to the stability of discrete-time switched linear systems
Exponential stability of switched linear systems under both arbitrary and proper switching is studied through two suitably defined families of functions called the strong and the...
Jianghai Hu, Jinglai Shen, Wei Zhang