Narrow Results

Let ${{𝒰}}_n$ be the set of un-oriented and rational links with crossing number $n$, a precise formula for $\left|{{𝒰}}_n\right|$ was obtained by Ernst and Sumners in 1987. In this paper, we study the enumeration problem of oriented rational links. Let ${\mathrm{\Lambda }}_n$ be the set of oriented rational links with crossing number $n$ and let ${\mathrm{\Lambda }}_n(d)$ be the set of oriented rational links with crossing number $n$ ($n\ge 2$) and deficiency $d$. In this paper, we derive precise formulas for $\left|{\mathrm{\Lambda }}_n\right|$ and $|{\mathrm{\Lambda }}_n(d)|$ for any given $n$ and $d$ and show that

In this paper, we enumerate the number of oriented rational knots and the number of oriented rational links with any given crossing number and minimum genus. This allows us to obtain a precise formula for the average minimal genus of oriented rational knots and links with any given crossing number.