activity
20132021
most citedCritical Sets for Sudoku and General Graphs

2 citations · 3 across the 5 of their papers we have counts for

collaborators

5 papers

math.CO2021

On the Asymptotic Distributions of Classes of Subtree Additive Properties of Plane Trees under the Nearest Neighbor Thermodynamic Model

Anna Kirkpatrick, Chidozie Onyeze

We define a class of properties on random plane trees, which we call subtree additive properties, inspired by the combinatorics of certain biologically-interesting properties in a…

math.CO2020

Markov Chain-based Sampling for Exploring RNA Secondary Structure under the Nearest Neighbor Thermodynamic Model

Anna Kirkpatrick, Kalen Patton

We study plane trees as a model for RNA secondary structure, assigning energy to each tree based on the Nearest Neighbor Thermodynamic Model, and defining a corresponding Gibbs dis…

math.CO2015

Computing the Size of Intervals in the Weak Bruhat Order

Joshua Cooper, Anna Kirkpatrick

The weak Bruhat order on is the partial order so that whenever the set of inversions of is a subset of the set of inversions of . We…

math.CO2014★ 1 cited

The complexity of counting poset and permutation patterns

Joshua Cooper, Anna Kirkpatrick

We introduce a notion of pattern occurrence that generalizes both classical permutation patterns as well as poset containment. Many questions about pattern statistics and avoidance…

math.CO2013★ 2 cited

Critical Sets for Sudoku and General Graphs

Joshua Cooper, Anna Kirkpatrick

We discuss the problem of finding critical sets in graphs, a concept which has appeared in a number of guises in the combinatorics and graph theory literature. The case of the Sudo…