Stephan Foldes, D. Stott Parker, Sandor Radeleczki
Published 2017-02-21Version 1
An alternative proof is given of the existence of greatest lower bounds in the imbalance order of binary maximal instantaneous codes of a given size. These codes are viewed as maximal antichains of a given size in the infinite binary tree of 0-1 words. The proof proposed makes use of a single balancing operation instead of expansion and contraction as in the original proof of the existence of glb.
On the imbalance lattice of path-length sequences of binary trees
An Alternative Proof of the $H$-Factor Theorem
The Satisfiability Threshold for $k$-XORSAT, using an alternative proof
![QR code for arXiv:1702.06438 [math.CO]](http://oss.arxitics.com/images/favicon.svg)