## My papers: (with abstracts) (MathSciNet) (arXiv)

–6. (pdf)

*On successive sampling and fixed inclusion probabilities*. Preprint, 2010.- Sampling.nb (pdf version): A Mathematica worksheet that goes through the calculations in the article; examples are also given.

8. (pdf)

Published in

*Nonattacking queens in a rectangular strip*, with Seth Chaiken and Thomas Zaslavsky.Published in

**Annals of Combinatorics**. Volume 14, pp 419–441. (2010) [doi:10.1007/s00026-011-0068-7]- WIGG.txt : A file that explains the functioning of WIGG.java and WIGG.mws.
- WIGG.class : A compiled java program to calculate a formula for the number of nonattacking configurations of chess pieces on an
*m*x*n*board through weighted integral gain graphs; outputs Maple input. [The uncompiled files: wigg.java, graph.java, edge.java, node.java.] - WIGG.mws : A Maple worksheet used to calculate the generating functions for the number of nonattacking configurations of chess pieces. Requires John Stembridge's SF package.

7. (pdf)

Published in

*The enumeration of fully commutative affine permutations*, with Brant C. Jones. (Also available as a Poster.)Published in

**European Journal of Combinatorics**. Volume 31, pp 1342–1359. (2010) [doi:10.1016/j.ejc.2009.11.010]- affineFC.nb (pdf version) : A Mathematica file that calculates the generating function by rank and length of the fully commutative affine permutations.

6. (pdf)

Published in

*Ensuring every candidate wins under positional voting*.Published in

**Social Choice and Welfare**. Volume 33, pp 311–333. (2009) [doi:10.1007/s00355-008-0359-z]- BordaExamples.mws : A Maple worksheet verifying that the disordering sets of voter preferences are indeed disordering.