8 citations · 59 across the 53 of their papers we have counts for
61 papers
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 are at most with…
Deletion thresholds and exponential examples for complete sequences
Jesse Geneson
We prove that the pairs of integers for which a nondecreasing integer sequence can remain complete after every deletion of terms and become incomplete after every de…
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
Let be the minimum positive integer such that, for every positive integer , every equinumerous -coloring of contains a rainbow -term arithmetic progressio…
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…
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…
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…
Saturation of 0-1 Matrices
Andrew Brahms, Alan Duan, Jesse Geneson +1
A 0-1 matrix contains a 0-1 matrix if has a submatrix which can be turned into by changing some of the ones to zeroes. Matrix is -saturated if does…
Fault tolerance for metric dimension and its variants
Jesse Geneson, Shen-Fu Tsai
Hernando et al. (2008) introduced the fault-tolerant metric dimension , which is the size of the smallest resolving set of a graph such that $S-\left\{s\ri…
Sequence saturation
Anand, Jesse Geneson, Suchir Kaustav +1
In this paper, we introduce saturation and semisaturation functions of sequences, and we prove a number of fundamental results about these functions. Given a forbidden sequence …
Extremal bounds for pattern avoidance in multidimensional 0-1 matrices
Jesse Geneson, Shen-Fu Tsai
A 0-1 matrix contains another 0-1 matrix if some submatrix of can be turned into by changing any number of -entries to -entries. is -saturate…
Random processes for generating task-dependency graphs
Jesse Geneson, Shen-Fu Tsai
We investigate random processes for generating task-dependency graphs of order with edges and a specified number of initial vertices and terminal vertices. In order to do s…
Online Learning of Smooth Functions
Jesse Geneson, Ethan Zhou
In this paper, we study the online learning of real-valued functions where the hidden function is known to have certain smoothness properties. Specifically, for , let $\ma…
Sharp bounds on the price of bandit feedback for several models of mistake-bounded online learning
Raymond Feng, Jesse Geneson, Andrew Lee +1
We determine sharp bounds on the price of bandit feedback for several variants of the mistake-bound model. The first part of the paper presents bounds on the -input weak reinfor…
Peripherality in networks: theory and applications
Jesse Geneson, Shen-Fu Tsai
We investigate several related measures of peripherality and centrality for vertices and edges in networks, including the Mostar index which was recently introduced as a measure of…
The distance-k dimension of graphs
Jesse Geneson, Eunjeong Yi
The metric dimension, , of a graph is a graph parameter motivated by robot navigation that has been studied extensively. Let be a graph with vertex set , and…
Sharper bounds for online learning of smooth functions of a single variable
Jesse Geneson
We investigate the generalization of the mistake-bound model to continuous real-valued single variable functions. Let be the class of absolutely continuous function…
Continuous Turán numbers
Jesse Geneson
In this paper, we define a notion of containment and avoidance for subsets of . Then we introduce a new, continuous and super-additive extremal function for subsets $…
A note on the price of bandit feedback for mistake-bounded online learning
Jesse Geneson
The standard model and the bandit model are two generalizations of the mistake-bound model to online multiclass classification. In both models the learner guesses a classification…
Almost all permutation matrices have bounded saturation functions
Jesse Geneson
Saturation problems for forbidden graphs have been a popular area of research for many decades, and recently Brualdi and Cao initiated the study of a saturation problem for 0-1 mat…
Reconfiguration graphs of zero forcing sets
Jesse Geneson, Ruth Haas, Leslie Hogben
This paper begins the study of reconfiguration of zero forcing sets, and more specifically, the zero forcing graph. Given a base graph , its zero forcing graph, …