1 citations · 1 across the 5 of their papers we have counts for
5 papers
The gonality of circulant graphs
Lisa Cenek, Lizzie Ferguson, Eyobel Gebre +5
The gonality of a graph measures how difficult it is to move chips around the entirety of a graph according to certain chip-firing rules without introducing debt. In this paper we…
Uniformity Testing over Hypergrids with Subcube Conditioning
Xi Chen, Cassandra Marcussen
We give an algorithm for testing uniformity of distributions supported on hypergrids , which makes $\smash{\widetilde{O}(\text{poly}(m)\sqrt{n}/ε^…
Scramble number and tree-cut decompositions
Lisa Cenek, Lizzie Ferguson, Eyobel Gebre +6
The scramble number of a graph is an invariant recently developed to study chip-firing games and divisorial gonality. In this paper we introduce the screewidth of a graph, based on…
Bounds on higher graph gonality
Lisa Cenek, Lizzie Ferguson, Eyobel Gebre +5
We prove new lower and upper bounds on the higher gonalities of finite graphs. These bounds are generalizations of known upper and lower bounds for first gonality to higher gonalit…
Uniform scrambles on graphs
Lisa Cenek, Lizzie Ferguson, Eyobel Gebre +5
A scramble on a connected multigraph is a collection of connected subgraphs that generalizes the notion of a bramble. The maximum order of a scramble, called the scramble number of…