activity
20092016
most citedOn the number of summands in Zeckendorf decompositions

37 citations · 50 across the 6 of their papers we have counts for

collaborators

6 papers

math.CO2016★ 2 cited

Some aspects of (r,k)-parking functions

Richard Stanley, Yinghui Wang

An \emph{-parking function} of length may be defined as a sequence of positive integers whose increasing rearrangement satisfie…

math.CO2015★ 9 cited

The Smith Normal Form Distribution of a Random Integer Matrix

Yinghui Wang, Richard P. Stanley

We show that the density of the Smith normal form (SNF) of a random integer matrix exists and equals a product of densities of SNF over wit…

math.NT2011

Gaussian Behavior in Generalized Zeckendorf Decompositions

Steven J. Miller, Yinghui Wang

A beautiful theorem of Zeckendorf states that every integer can be written uniquely as a sum of non-consecutive Fibonacci numbers ; Lekkerkerker proved that…

math.NT2010★ 37 cited

On the number of summands in Zeckendorf decompositions

Murat Kologlu, Gene Kopp, Steven J. Miller +1

Zeckendorf proved that every positive integer has a unique representation as a sum of non-consecutive Fibonacci numbers. Once this has been shown, it's natural to ask how many summ…

math.NT2010

From Fibonacci Numbers to Central Limit Type Theorems

Steven J. Miller, Yinghui Wang

A beautiful theorem of Zeckendorf states that every integer can be written uniquely as a sum of non-consecutive Fibonacci numbers . Lekkerkerker proved that…

math.CO2009★ 2 cited

A Variant of the Stanley Depth for Multisets

Yinghui Wang

We define and study a variant of the \emph{Stanley depth} which we call \emph{total depth} for partially ordered sets (posets). This total depth is the most natural variant of Stan…