8 citations · 59 across the 53 of their papers we have counts for
9 papers · 1 filter
Propagation time for probabilistic zero forcing
Jesse Geneson, Leslie Hogben
Zero forcing is a coloring game played on a graph that was introduced more than ten years ago in several different applications. The goal is to color all the vertices blue by repea…
A note on long rainbow arithmetic progressions
Jesse Geneson
Jungić et al (2003) defined as the minimal number such that there is a rainbow arithmetic progression of length in every equinumerous -coloring of…
Constructing sparse Davenport-Schinzel sequences
Jesse Geneson
For any sequence , the extremal function is the maximum possible length of a -sparse sequence with distinct letters that avoids . We prove that if is…
Intersections, circuits, and colorability of line segments
Boris Brimkov, Jesse Geneson, Alathea Jensen +2
We derive sharp upper and lower bounds on the number of intersection points and closed regions that can occur in sets of line segments with certain structure, in terms of the numbe…
Metric dimension and pattern avoidance in graphs
Jesse Geneson
In this paper, we prove a number of results about pattern avoidance in graphs with bounded metric dimension or edge metric dimension. We show that the maximum possible number of ed…
Forbidden formations in 0-1 matrices
Jesse Geneson
Keszegh (2009) proved that the extremal function of any forbidden light -dimensional 0-1 matrix is at most quasilinear in , using a reduction to generalized Da…
Sharper bounds and structural results for minimally nonlinear 0-1 matrices
Jesse Geneson, Shen-Fu Tsai
The extremal function is the maximum possible number of ones in any 0-1 matrix with rows and columns that avoids . A 0-1 matrix is called minimally non-li…
Fixed points of competitive threshold-linear networks
Carina Curto, Jesse Geneson, Katherine Morrison
Threshold-linear networks (TLNs) are models of neural networks that consist of simple, perceptron-like neurons and exhibit nonlinear dynamics that are determined by the network's c…
Forbidden arithmetic progressions in permutations of subsets of the integers
Jesse Geneson
Permutations of the positive integers avoiding arithmetic progressions of length were constructed in (Davis et al, 1977), implying the existence of permutations of the integers…