Search arXivSearch

arXiv · 1012.3948

Some remarks about the derivative operator and generalized Stirling numbers

Abstract

Studying expressions of the form $(f(x)D)^p$, where $D={\displaystyle \frac{d}{dx}}$ is the derivative operator, goes back to Scherk's Ph.D. thesis in 1823. We show that this can be extended as ${\displaystyle\sum γ_{p;a} (f^{(0)})^{a(0)+1} (f^{(1)})^{a(1)}...(f^{(p-1)})^{a(p-1)}D^{p-\sum_i i a(i)}}$}, where the summation is taken over the $p$-tuples $(a_0, a_1,..., a_{p-1})$, satisfying $\sum_{i}a(i)=p-1,\, \sum_{i}i a(i)<p$, $f^{(i)}=D^i f$ and $γ_{p;a}$ is the number of increasing trees on the vertex set $[0, p]$ having $a(0)+1$ leaves and having $a(i)$ vertices with $i$ children for $0<i<p$. Thus, previously known results about increasing trees, lead us to some equalities containing coefficients $γ_{p;a}$. In the sequel, we consider the expansion of $(x^k D)^p$ and coefficients appearing there, which are called generalized Stirling numbers by physicists. Some results about these coefficients and their inverses are discussed through bijective methods. Particularly, we introduce and use the notion of $(p, k)$-forest in these arguments.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

M. Mohammad-Noori. 2012-06-19. Some remarks about the derivative operator and generalized Stirling numbers. https://arxiv.org/abs/1012.3948

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO