On a Theorem of Volosin Concerning Enumeration of Function Compositions.

Abstract

The purpose of this paper is to present a direct and simpler combinatorial proof of a theorem of Yu. M. Volosin on the enumeration of function compositions and to exhibit some of the consequences of this theorem. Many consequences are stated in the paper of Volosin; however, his methods are relatively retractable. Here is obtained a generating function which facilitates enumeration. The methods and arguments employed here should be compared with Volosin. The combinatorial structure enumerated here is a fairly general one with many applications, only a few of which are provided in the present paper.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1976
Accession Number
ADA038942

Entities

People

  • Bernard Harris

Organizations

  • University of Wisconsin–Madison

Tags

DTIC Thesaurus Topics

  • Coefficients
  • Computations
  • Equations
  • Identities
  • Mathematical Logic
  • Mathematics
  • Military Research
  • New York
  • North Carolina
  • Permutations
  • Probability
  • Sequences
  • Statistics
  • United States
  • West Virginia
  • Wisconsin

Fields of Study

  • Mathematics

Readers

  • Mathematical Modeling and Probability Theory.
  • Operations Research