Ryan Jeong

activity

20212026

most citedDeep ReLU Networks Preserve Expected Length

7 citations · 9 across the 9 of their papers we have counts for

collaborators

Showing 2022Show all

5 papers · 1 filter

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

VC-Dimension and Distance Chains in $F_{q}^{d}$

Ruben Ascoli, Livia Betti, Justin Cheigh +8

Given a domain $X$ and a collection $H$ of functions $h : X \to {0, 1}$ , the Vapnik-Chervonenkis (VC) dimension of $H$ measures its complexity in an appropriate s…

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…

math.CO2022★ 1 cited

On the Diameters of Friends-and-Strangers Graphs

Ryan Jeong

Given simple graphs $X$ and $Y$ on the same number of vertices, the friends-and-strangers graph $FS (X, Y)$ has as its vertices all bijections from $V (X)$ to $V (Y)$ , where…

Towards the Gaussianity of Random Zeckendorf Games

Sum and Difference Sets in Generalized Dihedral Groups

VC-Dimension and Distance Chains in Fqd​

On Structural Aspects of Friends-And-Strangers Graphs

On the Diameters of Friends-and-Strangers Graphs

VC-Dimension and Distance Chains in $F_{q}^{d}$