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 2016Show all

4 papers · 1 filter

cs.DM2016★ 3 cited

Distributed pursuit algorithms for probabilistic adversaries on connected graphs

Jesse Geneson

A gambler moves between the vertices $1, \dots, n$ of a graph using the probability distribution $p_{1}, \dots, p_{n}$ . Multiple cops pursue the gambler on the graph, only being…

math.CO2016

Bounds for approximating lower envelopes with polynomials of degree at most $d$

Jesse Geneson

Given a lower envelope in the form of an arbitrary sequence $u$ , let $L S P (u, d)$ denote the maximum length of any subsequence of $u$ that can be realized as the lower envelope of a…

math.PR2016

Asymptotic bounds on renewal process stopping times

Jesse Geneson

Suppose that i.i.d. random variables $X_{1}, X_{2}, \dots$ are chosen uniformly from $[0, 1]$ , and let $f : [0, 1] \to [0, 1]$ be an increasing bijection. Define $μ_{f}$ to be…

math.CO2016★ 2 cited

Bounding extremal functions of forbidden $0 - 1$ matrices using $(r, s)$ -formations

Jesse Geneson, Meghal Gupta

First, we prove tight bounds of $n 2^{\frac{1}{( t - 2 )!} α (n)^{t - 2} \pm O (α (n)^{t - 3})}$ on the extremal function of the forbidden pair of ordered sequences $(123 \dots k)^{t}$ and $(…

Distributed pursuit algorithms for probabilistic adversaries on connected graphs

Bounds for approximating lower envelopes with polynomials of degree at most d

Asymptotic bounds on renewal process stopping times

Bounding extremal functions of forbidden 0−1 matrices using (r,s)-formations

Bounds for approximating lower envelopes with polynomials of degree at most $d$

Bounding extremal functions of forbidden $0 - 1$ matrices using $(r, s)$ -formations