## Generalized j-Factorial Functions, Polynomials, and Applications

### Cached

### Download Links

### BibTeX

@MISC{Schmidt_generalizedj-factorial,

author = {Maxie D. Schmidt},

title = {Generalized j-Factorial Functions, Polynomials, and Applications},

year = {}

}

### OpenURL

### Abstract

The paper generalizes the traditional single factorial function to integer-valued multiple factorial (j-factorial) forms. The generalized factorial functions are defined recursively as triangles of coefficients corresponding to the polynomial expansions of a subset of degenerate falling factorial functions. The resulting coefficient triangles are similar to the classical sets of Stirling numbers and satisfy many analogous finite-difference and enumerative properties as the well-known combinatorial triangles. The generalized triangles are also considered in terms of their relation to elementary symmetric polynomials and the resulting symmetric polynomial index transformations. The definition of the Stirling convolution polynomial sequence is generalized in order to enumerate the parametrized sets of j-factorial polynomials and to derive extended properties of the j-factorial function expansions. The generalized j-factorial polynomial sequences considered lead to applications expressing key forms of the j-factorial functions in terms of arbitrary partitions of the j-factorial function expansion triangle indices, including several identities related to