From the 1 of 10 linked papers with an AI index.
2 citations · 2 across the 3 of their papers we have counts for
10 papers
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…
Density bounds for permutations avoiding monotone arithmetic progressions
Jesse Geneson
For , let and denote the supremal upper and lower densities of subsets of admitting -permutations without monotone $\e…
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…
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…
The order of long rainbow arithmetic progressions
Jesse Geneson
The paper determines the asymptotic growth of the minimum number of colors needed so that any equinumerous coloring of a large integer interval contains a rainbow arithmetic progre…
Online learning of smooth functions on
Jesse Geneson, Kuldeep Singh, Alexander Wang
We study adversarial online learning of real-valued functions on . In each round the learner is queried at , predicts , and then observes th…