An Improvement To Zaremba's Conjecture
We prove there exists a density one subset $\dd \subset \N$ such that each $n \in \dd$ is the denominator of a finite continued fraction with partial quotients bounded by 5.
math.NT↗
arXiv subjects
ShinnYih Huang
Publications and source records attributed to ShinnYih Huang.
Strongly Cancellative and Recovering Sets On Lattices
We use information theory to study recovering sets $\R_L$ and strongly cancellative sets $\C_L$ on different lattices. These sets are special classes of recovering pairs and cancellative sets previously discussed in [1], [3] and [5]. We mainly focus on the lattices $B_n$ and $D_{l}^{k}$. Specifically, we find upper bounds and constructions for the sets $\R_{B_n}$, $\C_{B_n}$, and $\C_{D_{l}^{k}}$.
math.CO↗
A Bijective Proof For Forest Reciprocity Theorem
In this paper, we study the graph polynomial that counts spanning rooted forests f_g of a given graph. This polynomial has a remarkable reciprocity property. We give a new bijective proof for this theorem which has Prufer coding as a special case.
math.CO↗