activity
20152026
most citedPropagation time for probabilistic zero forcing

8 citations · 37 across the 30 of their papers we have counts for

collaborators
Showing math.COShow all

38 papers · 1 filter

math.CO2026

Enumerating forcing and strongly forcing (0,1)-matrices

Lei Cao, Jesse Geneson

Let be a nonzero -pattern, and let and . An matrix is strongly -forcing if every -entry belongs to an submatri…

math.CO2026★ 2 cited

A six-neuron counterexample to the target-free clique conjecture

Jesse Geneson

The target-free clique conjecture asserts that the supports of stable fixed points of a nondegenerate combinatorial threshold-linear network (CTLN) are exactly its target-free cliq…

math.CO2026

Linear extremal bounds for a family of forbidden - matrices

Jesse Geneson

Fulek defined the - matrix \[ L_3=\begin{pmatrix} 1&0&0&1&0\\ 0&0&0&0&1\\ 0&1&1&0&0 \end{pmatrix} \] and asked whether . We prove that every $r\times…

math.CO2026

The order of long rainbow arithmetic progressions

Jesse Geneson

Let be the minimum positive integer such that, for every positive integer , every equinumerous -coloring of contains a rainbow -term arithmetic progressio…

math.CO2026

Asymptotic Tightness of the Pigeonhole Bound for Large-Order Davenport-Schinzel Sequences

Jesse Geneson

We prove that the pigeonhole upper bound is asymptotically tight whenever . In particular, in…

math.CO2025

Throttling for metric dimension and its variants

Boris Brimkov, Peter Diao, Jesse Geneson +4

Metric dimension is a graph parameter that has been applied to robot navigation and finding low-dimensional vector embeddings. Throttling entails minimizing the sum of two availabl…