#### Filter Results:

- Full text PDF available (18)

#### Publication Year

1981

2011

- This year (0)
- Last five years (0)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Don Rawlings
- Discrete Mathematics
- 2000

A recurrence, a determinant formula, and generating functions are presented for enumerating words with restricted letters by adjacencies. The main theorem leads to reÿnements (with up to two additional parameters) of known results on compositions, polyominoes, and permutations. Among the examples considered are (1) the introduction of the ascent variation… (More)

- Don Rawlings, Lawrence Sze
- 2011

� Under assumptions compatible with the theory of Markov chains, we use a property of Vandermonde matrices to examine the reliability of an n-component system of production or service.

- Don Rawlings
- J. Comb. Theory, Ser. A
- 1981

- Don Rawlings
- Eur. J. Comb.
- 1981

- Don Rawlings, DON RAWLINGS
- 1997

Several extensions of Blomqvist's absorption process are presented. Inherent in some of the associated distributions is a method for establishing q-identities ranging from properties of Gaussian polynomials to product expansions of basic hypergeometric series to extensions of results on Mahonian statistics. One process links the comajor index to Russian… (More)

- Don Rawlings
- J. Comb. Theory, Ser. A
- 1984

Based Based on on two two inversion inversion formulas formulas for for enumerating enumerating words words in in the the free free monoid monoid by by adjacencies, adjacencies, we we present present a a new new approach approach to to a a class class of of permutation permutation problems problems having having Eulerian-type Eulerian-type generating… (More)

- Jean-Marc Fedou, Don Rawlings
- Electr. J. Comb.
- 1994

Two inversion formulas for enumerating words in the free monoid by-adjacencies are applied in counting pairs of permutations by various statistics. The generating functions obtained involve reenements of bibasic Bessel functions. We further extend the results to nite sequences of permutations.

- DON RAWLINGS, LAWRENCE SZE, THEMATICS AZINE
- 2008

As motivation for our designs, first consider the identity 1=0 Next, imagine inserting an' bi in the /th term of the sum and replacing 2' by (a + b)n The result is the binomial theorem. Our objective here is to examine the effect of an analogous "pollination" of Vander-monde's identity (nt) (1) Guided by our binomial theorem example, we slip four letters… (More)

- Jean-Marc Fedou, Don Rawlings
- Discrete Mathematics
- 1995