Rachel Kirsch

Department of Mathematics

University of Nebraska–Lincoln

rkirsch at huskers.unl.edu

I am a Ph.D. candidate in discrete mathematics, advised by Jamie Radcliffe.

#### Published

- B. Goeckner, C. Groothuis, C. Hettle, B. Kell, P. Kirkpatrick, R. Kirsch, and R. Solava. "Universal partial words over non-binary alphabets."
**Theoretical Computer Science**, February 2018.
- F. Blanchet-Sadri, M. Cordier, and R. Kirsch. "Border correlations, lattices, and the subgraph component polynomial."
**European Journal of Combinatorics**, February 2018.
- T. Feng, R. Kirsch, E. Villela, and M. Wage. "Birth-death processes and
*q*-continued fractions." **Transactions of the American Mathematical Society**, May 2012.

#### Submitted/Preprint Available

- K. Boyer, B. Brimkov, S. English, D. Ferrero, A. Keller, R. Kirsch, M. Phillips, and C. Reinhart. "The zero forcing polynomial of a graph."
- R. Kirsch and A. J. Radcliffe. "Many
*K*_{t}'s; no large cliques or stars."
- B. Bjorkman, G. Cochran, W. Gao, L. Keough, R. Kirsch, M. Phillipson, D. Rorabaugh, H. Smith, and J. Wise. "
*k*-Foldability of words."
- R. Kirsch and A. J. Radcliffe. "Many triangles with few edges."

π