scholarly journals On the exponential generating function of labelled trees

2021 ◽  
Vol 358 (9-10) ◽  
pp. 1005-1009
Author(s):  
Alin Bostan ◽  
Antonio Jiménez-Pastor

2014 ◽  
Vol 60 (1) ◽  
pp. 19-36
Author(s):  
Dae San Kim

Abstract We derive eight identities of symmetry in three variables related to generalized twisted Bernoulli polynomials and generalized twisted power sums, both of which are twisted by ramified roots of unity. All of these are new, since there have been results only about identities of symmetry in two variables. The derivations of identities are based on the p-adic integral expression of the generating function for the generalized twisted Bernoulli polynomials and the quotient of p-adic integrals that can be expressed as the exponential generating function for the generalized twisted power sums.



2008 ◽  
Vol DMTCS Proceedings vol. AJ,... (Proceedings) ◽  
Author(s):  
Markus Kuba ◽  
Alois Panholzer

International audience We study two enumeration problems for $\textit{up-down alternating trees}$, i.e., rooted labelled trees $T$, where the labels $ v_1, v_2, v_3, \ldots$ on every path starting at the root of $T$ satisfy $v_1 < v_2 > v_3 < v_4 > \cdots$. First we consider various tree families of interest in combinatorics (such as unordered, ordered, $d$-ary and Motzkin trees) and study the number $T_n$ of different up-down alternating labelled trees of size $n$. We obtain for all tree families considered an implicit characterization of the exponential generating function $T(z)$ leading to asymptotic results of the coefficients $T_n$ for various tree families. Second we consider the particular family of up-down alternating labelled ordered trees and study the influence of such an alternating labelling to the average shape of the trees by analyzing the parameters $\textit{label of the root node}$, $\textit{degree of the root node}$ and $\textit{depth of a random node}$ in a random tree of size $n$. This leads to exact enumeration results and limiting distribution results. Nous étudions deux problèmes de dénombrement d'$\textit{arbres alternés haut-bas}$ : par définition, ce sont des arbres munis d'une racine et tels que, pour tout chemin partant de la racine, les valeurs $v_1,v_2,v_3,\ldots$ associées aux nœuds du chemin satisfont la chaîne d'inégalités $v_1 < v_2 > v_3 < v_4 > \cdots$. D'une part, nous considérons diverses familles d'arbres intéressantes du point de vue de l'analyse combinatoire (comme les arbres de Motzkin, les arbres non ordonnés, ordonnés et $d$-aires) et nous étudions pour chaque famille le nombre total $T_n$ d'arbres alternés haut-bas de taille $n$. Nous obtenons pour toutes les familles d'arbres considérées une caractérisation implicite de la fonction génératrice exponentielle $T(z)$. Cette caractérisation nous renseigne sur le comportement asymptotique des coefficients $T_n$ de plusieurs familles d'arbres. D'autre part, nous examinons le cas particulier de la famille des arbres ordonnés : nous étudions l'influence de l'étiquetage alterné haut-bas sur l'allure générale de ces arbres en analysant trois paramètres dans un arbre aléatoire (valeur de la racine, degré de la racine et profondeur d'un nœud aléatoire). Nous obtenons alors des résultats en terme de distribution limite, mais aussi de dénombrement exact.



2018 ◽  
Vol 68 (4) ◽  
pp. 727-740 ◽  
Author(s):  
Toufik Mansour ◽  
Mark Shattuck

Abstract In this paper, we consider a polynomial generalization, denoted by $\begin{array}{} u_m^{a,b} \end{array}$ (n, k), of the restricted Stirling numbers of the first and second kind, which reduces to these numbers when a = 1 and b = 0 or when a = 0 and b = 1, respectively. If a = b = 1, then $\begin{array}{} u_m^{a,b} \end{array}$ (n, k) gives the cardinality of the set of Lah distributions on n distinct objects in which no block has cardinality exceeding m with k blocks altogether. We derive several combinatorial properties satisfied by $\begin{array}{} u_m^{a,b} \end{array}$ (n, k) and some additional properties in the case when a = b = 1. Our results not only generalize previous formulas found for the restricted Stirling numbers of both kinds but also yield apparently new formulas for these numbers in several cases. Finally, an exponential generating function formula is derived for $\begin{array}{} u_m^{a,b} \end{array}$ (n, k) as well as for the associated Cauchy numbers.



2009 ◽  
Vol 18 (4) ◽  
pp. 583-599 ◽  
Author(s):  
COLIN McDIARMID

A minor-closed class of graphs is addable if each excluded minor is 2-connected. We see that such a classof labelled graphs has smooth growth; and, for the random graphRnsampled uniformly from then-vertex graphs in, the fragment not in the giant component asymptotically has a simple ‘Boltzmann Poisson distribution’. In particular, asn→ ∞ the probability thatRnis connected tends to 1/A(ρ), whereA(x) is the exponential generating function forand ρ is its radius of convergence.



10.37236/564 ◽  
2011 ◽  
Vol 18 (1) ◽  
Author(s):  
Toufik Mansour ◽  
Matthias Schork ◽  
Mark Shattuck

A new family of generalized Stirling and Bell numbers is introduced by considering powers $(VU)^n$ of the noncommuting variables $U,V$ satisfying $UV=VU+hV^s$. The case $s=0$ (and $h=1$) corresponds to the conventional Stirling numbers of second kind and Bell numbers. For these generalized Stirling numbers, the recursion relation is given and explicit expressions are derived. Furthermore, they are shown to be connection coefficients and a combinatorial interpretation in terms of statistics is given. It is also shown that these Stirling numbers can be interpreted as $s$-rook numbers introduced by Goldman and Haglund. For the associated generalized Bell numbers, the recursion relation as well as a closed form for the exponential generating function is derived. Furthermore, an analogue of Dobinski's formula is given for these Bell numbers.



10.37236/681 ◽  
2011 ◽  
Vol 18 (1) ◽  
Author(s):  
Dustin A. Cartwright ◽  
María Angélica Cueto ◽  
Enrique A. Tobis

The nodes of the de Bruijn graph $B(d,3)$ consist of all strings of length $3$, taken from an alphabet of size $d$, with edges between words which are distinct substrings of a word of length $4$. We give an inductive characterization of the maximum independent sets of the de Bruijn graphs $B(d,3)$ and for the de Bruijn graph of diameter three with loops removed, for arbitrary alphabet size. We derive a recurrence relation and an exponential generating function for their number. This recurrence allows us to construct exponentially many comma-free codes of length 3 with maximal cardinality.



Author(s):  
Feng Qi ◽  
Jiao-Lian Zhao ◽  
Bai-Ni Guo

In the paper, the authors find closed forms for derangement numbers in terms of the Hessenberg determinants, discover a recurrence relation of derangement numbers, present a formula for any higher order derivative of the exponential generating function of derangement numbers, and compute some related Hessenberg and tridiagonal determinants.



2018 ◽  
Vol 556 ◽  
pp. 381-399 ◽  
Author(s):  
Francesca Arrigo ◽  
Peter Grindrod ◽  
Desmond J. Higham ◽  
Vanni Noferini


1979 ◽  
Vol 25 (1) ◽  
pp. 93-96 ◽  
Author(s):  
N. Wormald ◽  
E.M. Wright


2009 ◽  
Vol 52 (1) ◽  
pp. 41-64 ◽  
Author(s):  
GIEDRIUS ALKAUSKAS

AbstractThe Minkowski question mark function ?(x) arises as a real distribution of rationals in the Farey tree. We examine the generating function of moments of ?(x). It appears that the generating function is a direct dyadic analogue of period functions for Maass wave forms and it is defined in the cut plane \ (1, ∞). The exponential generating function satisfies an integral equation with kernel being the Bessel function. The solution of this integral equation leads to the definition of dyadic eigenfunctions, arising from a certain Hilbert–Schmidt operator. Finally, we describe p-adic distribution of rationals in the Stern–Brocot tree. Surprisingly, the Eisenstein series G2(z) does manifest in both real and p-adic cases.



Sign in / Sign up

Export Citation Format

Share Document