Hostname: page-component-745bb68f8f-s22k5 Total loading time: 0 Render date: 2025-01-22T02:08:06.775Z Has data issue: false hasContentIssue false
  • English
  • Français

Dickson–Stirling numbers

Published online by Cambridge University Press:  20 January 2009

L. C. Hsu ,
Gary L. Mullen  and
Peter Jau-Shyong Shiue
L. C. Hsu
Affiliation:
Institute of Mathematical Sciences, Dalian University of Technology, Dalian 116024, P. R. of China
Gary L. Mullen
Affiliation:
Department of Mathematics, The Pennsylvania State University, University Park, PA 16802, U.S.A.E-mail address:[email protected]
Peter Jau-Shyong Shiue
Affiliation:
Department of Mathematical Sciences, University of Nevada, Las Vegas, Las Vegas, NV 89154-4020, U.S.A.E-mail address:[email protected]
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

The Dickson polynomial Dn, (x, a) of degree n is defined by denotes the greatest integer function. In particular, we define D0 (x, a) = 2 for all real x and a. By using Dickson polynomials we present new types of generalized Stirling numbers of the first and second kinds. Some basic properties of these numbers and a combinatorial application to the enumeration of functions on finite sets in terms of their range values is also given.

Type
Research Article
Information
Proceedings of the Edinburgh Mathematical Society , Volume 40 , Issue 3 , October 1997 , pp. 409 - 423
Copyright
Copyright © Edinburgh Mathematical Society 1997

References

REFERENCES

1.Berge, C., Principles of Combinatorics (Math, in Sci. & Eng., 72, Academic Press, New York, 1971).Google Scholar
2.Broder, A. Z., The r-Stirling numbers, Discrete Math. 49 (1984), 241–259.Google Scholar
3.Charalambides, C. A. and Singh, J., A review of the Stirling numbers, their generalizations and statistical applications, Comm. Statist. (Theor. Methods) 17 (1988), 2533–2595.Google Scholar
4.Comtet, L., Nombres de Stirling genéraux et fonctions symétriques, C.R. Acad. Sci. Paris, Sér. A 275 (1972), 747–750.Google Scholar
5.Comtet, L., Advanced Combinatorics (D. Reidel Publishing Co., Dordrecht, Holland, 1974).Google Scholar
6.Egorychev, G. P., Integral Representation and the Computation of Combinatorial Sums. (Transl. Math. Monographs AMS 59, 1984).Google Scholar
7.Filipponi, P. and Horadam, A. F., Second derivative sequences of Fibonacci and Lucas polynomials, Fibonacci Quart. 31 (1993), 194–204.Google Scholar
8.Gould, H. W., Combinatorial Identities (Printing & Binding Co., Morgantown, WV, 1972).Google Scholar
9.Hsu, L. C., A summation rule using Stirling numbers of the second kind, Fibonacci Quart. 31 (1993), 256–262.Google Scholar
10.Hsu, L. C., Some theorems on Stirling-type pairs, Proc. Edinburgh Math. Soc. 36 (1993), 525–535.CrossRefGoogle Scholar
11.Kaplansky, I., Solution of the Probleme de Ménages, Bull. Amer. Math. Soc. 49 (1943), 784–785.Google Scholar
12.Lidl, R., Mullen, G. L. and Turnwald, G., Dickson Polynomials (Pitman Mono. & Surveys in Pure & Appl. Math., 65, Longman Scientific & Technical, Essex, England, 1993).Google Scholar
13.Loeb, D. E., A generalization of the Stirling numbers, Discrete Math. 103 (1992), 259–269.CrossRefGoogle Scholar
14.Milne-Thomson, L. M., The Calculus of Finite Differences (Glasgow University Press, 1951).Google Scholar
15.Riordan, J., Combinatorial Identities (Wiley, New York, 1968).Google Scholar
16.Straight, H. J., Combinatorics, An Invitation (Brooks/Cole Publishing Co., Pacific Grove, CA, 1993).Google Scholar