#### Filter Results:

- Full text PDF available (20)

#### Publication Year

1954

2011

- This year (0)
- Last 5 years (0)
- Last 10 years (7)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

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

1. R. P. ANSTEE. M. HALL JR., AND J. G, THOMPSON, Planes of order to do nO! have a oollin<:ation of order 5, J. Combin. Theory Se'. A 29 (1980), 39-58. 2, M. ASCHBACHER, On collineation groups of symmetri~ block designs, J. Combin. Theory Ser. A II (1971),272-281. 3. M. HALL, JR., ~Combina\Orial Theory." Wiley, New York/London, 1967, 4. D, R. HUGHES,… (More)

- Don Rawlings
- Eur. J. Comb.
- 1988

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

The enumeration of permutations by inversions often leads to a q-analog of the usual generating 'nnetic,n. In this paper, two generalizations of the Worpitzky identity for the Eulerian numbers are obtained and used to enumerate permutations by the descent number and the major index of their inverses. The resulting (t, q)-generating series do in fact… (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, 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
- 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 refinements of bibasic Bessel functions. We further extend the results to finite sequences of permutations. ∗This work is partially supported by EC grant… (More)

- Don Rawlings, Lawrence Sze
- 2011

The reliability of an n-component system of production or service is compromised when any of its components are out of service. Viswanadham and Narahari[6] examined the reliability of such systems in some detail. We consider a set of assumptions not pursued in Ref.[6]: • Time, measured in discrete units, is identified with the set of positive integers. At… (More)

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

WILLIAM M. KANTOR Department of Mathematics University of Oregon Eugene, Oregon 97403 HATh< HANAN! Department of Mathematics Technion-Israel Institute of Technology Technion City 32000 Haifa, Israel J. M. 1lAMMBRSLBY Institute of Economics and Statistics University of OXford Oxford, England R.L.GRAHAM Bell Laboratories Murray Hill, New Jersey 07974 PAUL… (More)

- Don Rawlings
- Discrete Mathematics
- 1994

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)