Ryan Jeong

most citedOn Structural Aspects of Friends-And-Strangers Graphs

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

collaborators

4 papers

math.CO2022

Towards the Gaussianity of Random Zeckendorf Games

Justin Cheigh, Guilherme Zeus Dantas e Moura, Ryan Jeong +4

Zeckendorf proved that any positive integer has a unique decomposition as a sum of non-consecutive Fibonacci numbers, indexed by $F_{1} = 1, F_{2} = 2, F_{n + 1} = F_{n} + F_{n - 1}$ . Motiva…

math.NT2022

Sum and Difference Sets in Generalized Dihedral Groups

Ruben Ascoli, Justin Cheigh, Guilherme Zeus Dantas e Moura +6

Given a group $G$ , we say that a set $A \subseteq G$ has more sums than differences (MSTD) if $∣ A + A ∣ > ∣ A - A ∣$ , has more differences than sums (MDTS) if $∣ A + A ∣ < ∣ A - A ∣$ , or is sum-d…

math.CO2022★ 1 cited

On Structural Aspects of Friends-And-Strangers Graphs

Ryan Jeong

Given two graphs $X$ and $Y$ with the same number of vertices, the friends-and-strangers graph $FS (X, Y)$ has as its vertices all $n!$ bijections from $V (X)$ to $V (Y)$ , wi…

stat.ML2021

Deep ReLU Networks Preserve Expected Length

Boris Hanin, Ryan Jeong, David Rolnick

Assessing the complexity of functions computed by a neural network helps us understand how the network will learn and generalize. One natural measure of complexity is how the netwo…