The density matrix of a graph is the combinatorial laplacian matrix of a graph normalized to have unit trace. In this paper we generalize the entanglement properties of mixed dens...
The Sandwich Theorems proved in this paper give a new method to show that the partition function a(n) of a partition identity A(x) := n=0 a(n)xn = n=1 (1 - xn )-p(n) satisfies t...
A configuration (pq, nk) is a collection of p points and n straight lines in the Euclidean plane so that every point has q straight lines passing through it and every line has k p...
The class of square (0, 1, -1)-matrices whose rows are nonzero and mutually orthogonal is studied. This class generalizes the classes of Hadamard and Weighing matrices. We prove t...
We consider Class-Uniformly Resolvable Group Divisible Designs (CURGDD), which are resolvable group divisible designs in which each of the resolution classes has the same number o...