Jesse T. Geneson

works on

arithmetic progressions 1 asymptotic bounds 1 colorings 1 extremal combinatorics 1 rainbow arithmetic progressions 1

From the 1 of 12 linked papers with an AI index.

activity

20242026

most citedA six-neuron counterexample to the target-free clique conjecture

2 citations · 2 across the 5 of their papers we have counts for

collaborators

Showing math.NTShow all

1 paper · 1 filter

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…