Jesse T. Geneson

activity

20132026

most citedBroadcast Dimension of Graphs

8 citations · 59 across the 53 of their papers we have counts for

collaborators

Showing 2026Show all

9 papers · 1 filter

math.CO2026

Typical growth of the Füredi-Hajnal and Stanley-Wilf limits

Jesse Geneson

We prove that the Füredi-Hajnal limit and the Stanley-Wilf limit of a uniformly random permutation matrix of order $k$ are at most $exp (O (k (lo g k)^{5/2}))$ with…

math.CO2026

Deletion thresholds and exponential examples for complete sequences

Jesse Geneson

We prove that the pairs of integers $0 \leq m < n$ for which a nondecreasing integer sequence can remain complete after every deletion of $m$ terms and become incomplete after every de…

math.CO2026

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

Lei Cao, Jesse Geneson

Let $Q$ be a nonzero $s \times t$ $(0, 1)$ -pattern, and let $m \geq s$ and $n \geq t$ . An $m \times n$ matrix is strongly $Q$ -forcing if every $1$ -entry belongs to an $s \times t$ submatri…

math.NT2026

Density bounds for permutations avoiding monotone arithmetic progressions

Jesse Geneson

For $X \in {N, Z}$ , let $α_{X} (ℓ)$ and $β_{X} (ℓ)$ denote the supremal upper and lower densities of subsets of $X$ admitting $ω$ -permutations without monotone $\e…

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 $0$ - $1$ matrices

Jesse Geneson

Fulek defined the $0$ - $1$ 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 $ex (n, L_{3}) = O (n)$ . We prove that every $r\times…

math.CO2026

The order of long rainbow arithmetic progressions

Jesse Geneson

Let $T_{k}$ be the minimum positive integer $t$ such that, for every positive integer $n$ , every equinumerous $t$ -coloring of $[t n]$ contains a rainbow $k$ -term arithmetic progressio…

cs.LG2026

Online learning of smooth functions on $R$

Jesse Geneson, Kuldeep Singh, Alexander Wang

We study adversarial online learning of real-valued functions on $R$ . In each round the learner is queried at $x_{t} \in R$ , predicts $y^_{t}$ , and then observes th…

math.CO2026

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

Jesse Geneson

We prove that the pigeonhole upper bound $λ (s, m) \leq (2 m) (s + 1)$ is asymptotically tight whenever $s / m \to \infty$ . In particular, $λ (s, m) \sim (2 m) s$ in…

Typical growth of the Füredi-Hajnal and Stanley-Wilf limits

Deletion thresholds and exponential examples for complete sequences

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

Density bounds for permutations avoiding monotone arithmetic progressions

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

Linear extremal bounds for a family of forbidden 0-1 matrices

The order of long rainbow arithmetic progressions

Online learning of smooth functions on R

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

Linear extremal bounds for a family of forbidden $0$ - $1$ matrices

Online learning of smooth functions on $R$