
REFERENCES

M. A. Khojastepour, M. FarajzadehTehrani, Characterizing per Node Degrees of Freedom in an Interference Network, 2014; http://mysbfiles.stonybrook.edu/~mfarajzadeht/Conf2.pdf


LINKS

Vladeta Jovovic, Nov 12 2006, Table of n, a(n) for n = 0..15
A Conflitti, C. M. Da Fonseca, R. Mamede, The maximal length of a chain in the Bruhat order for a chain of binary matrices., Lin. Algebra Applic. (2011)
ALESSANDRO CONFLITTI, C. M. DA FONSECA AND RICARDO MAMEDE, On the largest size of an antichain in the Bruhat order for A(2k, k), http://www.mat.uc.pt/preprints/ps/pre1125.ps.
Alessandro Conflitti, C. M. da Fonseca and Ricardo Mamede, On the Largest Size of an Antichain in the Bruhat Order for A(2k,k), ORDER, 2011, DOI: 10.1007/s1108301192411; http://www.springerlink.com/content/97618878447631j8/
B. D. McKay, 01 matrices with constant row and column sums
Wikipedia, Dynamic programming
