1 citations · 2 across the 4 of their papers we have counts for
6 papers
Two-vertex generators of Jacobians of graphs
David Brandfonbrener, Pat Devlin, Netanel Friedenberg +4
We give necessary and sufficient conditions under which the Jacobian of a graph is generated by a divisor that is the difference of two vertices. This answers a question posed by B…
Perfect fractional matchings in k-out hypergraphs
Pat Devlin, Jeff Kahn
Extending the notion of (random) -out graphs, we consider when the -out hypergraph is likely to have a perfect fractional matching. In particular, we show that for each t…
A stability result using the matrix norm to bound the permanent
Ross Berkowitz, Pat Devlin
We prove a stability version of a general result that bounds the permanent of a matrix in terms of its operator norm. More specifically, suppose is an matrix over…
On "stability" in the Erdős-Ko-Rado theorem
Pat Devlin, Jeff Kahn
Denote by the random subgraph of the usual Kneser graph in which edges appear independently, each with probability . Answering a question of Bollobás, Naraya…
Some integer formula-encodings and related algorithms
Edinah K. Gnang, Patrick Devlin
We investigate the special class of formulas made up of arbitrary but finite com- binations of addition, multiplication, and exponentiation gates. The inputs to these formulas are…
Sets with High Volume and Low Perimeter
Patrick Devlin
In this paper, we consider a certain variation of the "isoperimetric problem" adopted for subsets of nonnegative integers. More specifically, we explore the sequence P(n) as descri…