# Combinatorial proofs of inverse relations and log-concavity for Bessel numbers

@article{Han2008CombinatorialPO, title={Combinatorial proofs of inverse relations and log-concavity for Bessel numbers}, author={Hyuk Han and Seunghyun Seo}, journal={Eur. J. Comb.}, year={2008}, volume={29}, pages={1544-1554} }

Let the Bessel number of the second kind B(n,k) be the number of set partitions of [n] into k blocks of size one or two, and let the Bessel number of the first kind b(n,k) be the coefficient of x^n^-^k in -y"n"-"1(-x), where y"n(x) is the nth Bessel polynomial. In this paper, we show that Bessel numbers satisfy two properties of Stirling numbers: The two kinds of Bessel numbers are related by inverse formulas, and both Bessel numbers of the first kind and those of the second kind form log… Expand

#### 20 Citations

The r-Bessel and restricted r-Bell numbers

- 2017

In the present article we establish some combinatorial properties involving r-Bessel numbers of the second kind. These identities are deduced from the combinatorial interpretation by using restricted… Expand

Some combinatorial applications of the q-Riordan matrix ☆

- Mathematics
- 2015

Abstract Recently, the authors developed a q-analogue for Riordan matrices by means of Eulerian generating functions of the form g ( z ) = ∑ n ≥ 0 g n z n / n ! q where n ! q is the q-factorial. We… Expand

The Generalized Stirling and Bell Numbers Revisited

- Mathematics
- 2012

The generalized Stirling numbers Ss;h(n,k) introduced recently by the authors are shown to be a special case of the three parameter family of generalized Stirling numbers S(n,k;�,�,r) considered by… Expand

On the total positivity of restricted Stirling numbers

- Computer Science, Mathematics
- Eur. J. Comb.
- 2012

This note shows that the matrix whose (n,k) entry is the number of set partitions of {1,...,n} into k blocks with size at most m is never totally positive for m>=3; thus answering a question posed in… Expand

The reverse ultra log-concavity of the Boros-Moll polynomials

- Mathematics
- 2008

We prove the reverse ultra log-concavity of the Boros-Moll polynomials. We further establish an inequality which implies the log-concavity of the sequence {i!di(m)} for any m > 2, where d i (m) are… Expand

The Bessel Numbers and Bessel Matrices

- Mathematics
- 2011

In this paper, using exponential Riordan arrays, we investigate the Bessel numbers and Bessel matrices. By exploring links between the Bessel matrices, the Stirling matrices and the degenerate… Expand

THE REVERSE ULTRA LOG-CONCAVITY OF THE BOROS-MOLL POLYNOMIALS

- 2009

We prove the reverse ultra log-concavity of the Boros-Moll polynomials. We further establish an inequality which implies the log-concavity of the sequence {i!di(m)} for any m ≥ 2, where di(m) are the… Expand

Log-concavity of the partition function

- Mathematics
- 2013

We prove that the partition function $$p(n)$$p(n) is log-concave for all $$n>25$$n>25. We then extend the results to resolve two related conjectures by Chen and one by Sun. The proofs are based on… Expand

Incomplete Poly-Bernoulli Numbers and Incomplete Poly-Cauchy Numbers Associated to the q-Hurwitz–Lerch Zeta Function

- Mathematics
- 2017

In this paper we introduce a q-analogue of the incomplete poly-Bernoulli numbers and incomplete poly-Cauchy numbers by using the q-Hurwitz–Lerch zeta Function. Then we study several combinatorial… Expand

Generalized Bessel Polynomial for Multi-Order Fractional Differential Equations

- Computer Science, Mathematics
- Symmetry
- 2020

A simple but effective method for approximating solutions of multi-order fractional differential equations relying on Caputo fractional derivative and under supplementary conditions based on some original generalization of the Bessel polynomials. Expand

#### References

SHOWING 1-10 OF 14 REFERENCES

Combinatorial Proof of the Log-Concavity of the Sequence of Matching Numbers

- Computer Science, Mathematics
- J. Comb. Theory, Ser. A
- 1996

An injection from the set of pairs of matchings in a given graph is constructed that implies that a certain weighted version of the matching numbers is stronglyx-log-concave in the sense of Sagan. Expand

Enumerative combinatorics

- Mathematics, Computer Science
- SIGA
- 2008

This review of 3 Enumerative Combinatorics, by Charalambos A.good, does not support this; the label ‘Example’ is given in a rather small font followed by a ‘PROOF,’ and the body of an example is nonitalic, utterly unlike other statements accompanied by demonstrations. Expand

On the Unimodality and Combinatorics of Bessel Numbers

- Computer Science, Mathematics
- Discret. Math.
- 2003

The paper investigates the analogies between Stirling numbers and Bessel numbers and a generating function for the BesselNumbers is obtained, and a proof of their unimodality is given. Expand

A new class of orthogonal polynomials: The Bessel polynomials

- Mathematics
- 1949

The classical sets of orthogonal polynomials of Jacobi, Laguerre, and Hermite satisfy second order differential equations, and also have the property that their derivatives form orthogonal systems.… Expand

Inductive and injective proofs of log concavity results

- Mathematics, Computer Science
- Discret. Math.
- 1988

This result is used to inductively construct injections showing the log concavity of the binomial coefficients and Stirling numbers of both kinds, and is related to the graphical interpretation of these numbers given by Wilf. Expand

Constructive combinatorics

- Mathematics
- 1986

The first € price and the £ and $ price are net prices, subject to local VAT. Prices indicated with * include VAT for books; the €(D) includes 7% for Germany, the €(A) includes 10% for Austria.… Expand

Combinatorics and Total Positivity

- Mathematics, Computer Science
- J. Comb. Theory, Ser. A
- 1995

It is pointed out that the same is true, more generally, for totally positive matrices and that there is an intimate connection between them and some generalizations of the classical symmetric functions. Expand