2 citations · 2 across the 3 of their papers we have counts for
7 papers
-intersecting families of graphs
Aaron Berger, Yufei Zhao
Ellis, Filmus, and Friedgut proved an old conjecture of Simonovits and Sós showing that the maximum size of a triangle-intersecting family of graphs on vertices has size at mos…
On Anti-Powers in Aperiodic Recurrent Words
Aaron Berger, Colin Defant
Fici, Restivo, Silva, and Zamboni define a $\textit{$k$-anti-power}$ to be a concatenation of consecutive words that are pairwise distinct and have the same length. They ask fo…
Connected-Intersecting Families of Graphs
Aaron Berger, Ross Berkowitz, Pat Devlin +4
For a graph property and a common vertex set , a family of graphs on is \emph{-intersecting} iff satisfies $\math…
Modified Erdös--Ginzburg--Ziv Constants for and
Aaron Berger, Danielle Wang
For an abelian group and an integer , the \emph{modified Erdös--Ginzburg--Ziv constant} is the smallest integer such that any zero-sum sequence of lengt…
On Gaps in the Closures of Images of Divisor Functions
Niven Achenjang, Aaron Berger
Given a complex number , define the divisor function by . In this paper, we look at , the top…
On the Distribution of Range for Tree-Indexed Random Walks
Aaron Berger, Caleb Ji, Erik Metz
We study tree-indexed random walks as introduced by Benjamini, Häggström, and Mossel, i.e. labelings of a tree for which adjacent vertices have labels differing by 1. It is a conje…