Papers by Janet Beissinger
Discrete Mathematics, 1987
0012-365X/87/$3.50 t~) 1987, Elsevier Science Publishers B.V. (North-Holland) 150 J.S. Beissinger
The Electronic Journal of Combinatorics
A bijection is given from major sequences of length $n$ (a variant of parking functions) to trees... more A bijection is given from major sequences of length $n$ (a variant of parking functions) to trees on $\{0,\ldots,n\}$ that maps a sequence with sum ${{n+1}\choose 2} + k$ to a tree with external activity $k$.
Graphs and Combinatorics, 1987
ACM SIGGRAPH 2006 Research posters on - SIGGRAPH '06, 2006
ABSTRACT An abstract is not available.
Linear Algebra and its Applications, 1988
We give new, primarily eombinator~] proofs d the MaeW~ identities which rehte the weight distriba... more We give new, primarily eombinator~] proofs d the MaeW~ identities which rehte the weight distribation of a code to that of a dual.
Journal of Combinatorial Theory, Series B, 1982
Journal of Combinatorial Theory, Series A, 1985
Graphs and Combinatorics, 1987
Page 1. Graphs and Combinatorics 3, 213-219 (1987) Graphs and Combinatorics © Springer-Verlag 198... more Page 1. Graphs and Combinatorics 3, 213-219 (1987) Graphs and Combinatorics © Springer-Verlag 1987 Enumeration of Labelled Threshold Graphs and a Theorem of Frobenius Involving Eulerian Polynomials Janet Simpson ...
Uploads
Papers by Janet Beissinger