Hayan Nam

activity

20172019

most citedA bijective proof of Amdeberhan's conjecture on the number of

(s, s + 2)

-core partitions with distinct parts

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

collaborators

Showing math.COShow all

4 papers · 1 filter

math.CO2019

Enumerating Parking Completions Using Join and Split

Ayomikun Adeniran, Steve Butler, Galen Dorpalen-Barry +5

Given a strictly increasing sequence $t$ with entries from $[n] := {1, \dots, n}$ , a parking completion is a sequence $c$ with $∣ t ∣ + ∣ c ∣ = n$ and $|…

math.CO2018

A tiling proof of Euler's pentagnal number theorem and generalizations

Dennis Eichhorn, Hayan Nam, Jaebum Sohn

In two papers, Little and Sellers introduced an exciting new combinatorial method for proving partition identities which is not directly bijective. Instead, they consider various s…

math.CO2017

Johnson's bijections and their application to counting simultaneous core partitions

Jineon Baek, Hayan Nam, Myungjun Yu

Johnson recently proved Armstrong's conjecture which states that the average size of an $(a, b)$ -core partition is $(a + b + 1) (a - 1) (b - 1) /24$ . He used various coordinate changes and one…

math.CO2017★ 5 cited

A bijective proof of Amdeberhan's conjecture on the number of $(s, s + 2)$ -core partitions with distinct parts

Jineon Baek, Hayan Nam, Myungjun Yu

Amdeberhan conjectured that the number of $(s, s + 2)$ -core partitions with distinct parts for an odd integer $s$ is $2^{s - 1}$ . This conjecture was first proved by Yan, Qin, Jin and Z…

Enumerating Parking Completions Using Join and Split

A tiling proof of Euler's pentagnal number theorem and generalizations

Johnson's bijections and their application to counting simultaneous core partitions

A bijective proof of Amdeberhan's conjecture on the number of (s,s+2)-core partitions with distinct parts

A bijective proof of Amdeberhan's conjecture on the number of $(s, s + 2)$ -core partitions with distinct parts