Fibonacci connection between Huffman codes and Wythoff array
From: Alex Vinokur (alexvn_at_big-foot.com)
Date: 10/10/04
- Previous message: Paul Boca: "FACS FACTS Newsletter Call for Contributions on Formal Aspects of Computing Science (deadline 15 October 2004)"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Date: Sun, 10 Oct 2004 16:25:58 +0200
Fibonacci connection between non-decreasing sequences of positive integers
producing maximum height Huffman trees and the Wythoff array has been proved.
The paper (e-print) can be seen at
* http://arxiv.org/abs/cs.DM/0410013
The abstract can be seen at
* http://groups.google.com/groups?selm=2snh6gF1nd3bnU1%40uni-berlin.de
* http://mathforum.org/epigone/sci.math.research/pherdkralglend
* http://mathforum.org/discuss/sci.math/m/641586/641586
The brief description with examples can be seen at
* http://groups.google.com/groups?selm=2ss5aqF1oc42cU1%40uni-berlin.de
* http://mathforum.org/discuss/sci.math/m/641586/642072
--
Alex Vinokur
email: alex DOT vinokur AT gmail DOT com
http://mathforum.org/library/view/10978.html
http://sourceforge.net/users/alexvn
- Previous message: Paul Boca: "FACS FACTS Newsletter Call for Contributions on Formal Aspects of Computing Science (deadline 15 October 2004)"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Relevant Pages
|
