Binary superlattice design by controlling DNA-mediated interactions

Most binary superlattices created using DNA functionalization or other approaches rely on particle size differences to achieve compositional order and structural diversity. Here we study two-dimensional (2D) assembly of DNA-functionalized micron-sized particles (DFPs), and employ a strategy that leverages the tunable disparity in interparticle interactions, and thus enthalpic driving forces, to open new avenues for design of binary superlattices that do not rely on the ability to tune particle size (i.e., entropic driving forces). Our strategy employs tailored blends of complementary strands of ssDNA to control interparticle interactions between micron-sized silica particles in a binary mixture to create compositionally diverse 2D lattices. We show that the particle arrangement can be further controlled by changing the stoichiometry of the binary mixture in certain cases. With this approach, we demonstrate the abil- ity to program the particle assembly into square, pentagonal, and hexagonal lattices. In addition, different particle types can be compositionally ordered in square checkerboard and hexagonal - alternating string, honeycomb, and Kagome arrangements.Comment: 4 figures in the main text. 5 figures in the supplementary informatio

If players are sparse social dilemmas are too: Importance of percolation for evolution of cooperation

Spatial reciprocity is a well known tour de force of cooperation promotion. A thorough understanding of the effects of different population densities is therefore crucial. Here we study the evolution of cooperation in social dilemmas on different interaction graphs with a certain fraction of vacant nodes. We find that sparsity may favor the resolution of social dilemmas, especially if the population density is close to the percolation threshold of the underlying graph. Regardless of the type of the governing social dilemma as well as particularities of the interaction graph, we show that under pairwise imitation the percolation threshold is a universal indicator of how dense the occupancy ought to be for cooperation to be optimally promoted. We also demonstrate that myopic updating, due to the lack of efficient spread of information via imitation, renders the reported mechanism dysfunctional, which in turn further strengthens its foundations.Comment: 6 two-column pages, 5 figures; accepted for publication in Scientific Reports [related work available at http://arxiv.org/abs/1205.0541

Integer-Forcing MIMO Linear Receivers Based on Lattice Reduction

A new architecture called integer-forcing (IF) linear receiver has been recently proposed for multiple-input multiple-output (MIMO) fading channels, wherein an appropriate integer linear combination of the received symbols has to be computed as a part of the decoding process. In this paper, we propose a method based on Hermite-Korkine-Zolotareff (HKZ) and Minkowski lattice basis reduction algorithms to obtain the integer coefficients for the IF receiver. We show that the proposed method provides a lower bound on the ergodic rate, and achieves the full receive diversity. Suitability of complex Lenstra-Lenstra-Lovasz (LLL) lattice reduction algorithm (CLLL) to solve the problem is also investigated. Furthermore, we establish the connection between the proposed IF linear receivers and lattice reduction-aided MIMO detectors (with equivalent complexity), and point out the advantages of the former class of receivers over the latter. For the $2 \times 2$ and $4\times 4$ MIMO channels, we compare the coded-block error rate and bit error rate of the proposed approach with that of other linear receivers. Simulation results show that the proposed approach outperforms the zero-forcing (ZF) receiver, minimum mean square error (MMSE) receiver, and the lattice reduction-aided MIMO detectors.Comment: 9 figures and 11 pages. Modified the title, abstract and some parts of the paper. Major change from v1: Added new results on applicability of the CLLL reductio

Molecular crystal global phase diagrams. II. Reference lattices

In the first part of this series [Keith et al. (2004). Cryst. Growth Des. 4, 1009-1012; Mettes et al. (2004). Acta Cryst. A60, 621-636], a method was developed for constructing global phase diagrams (GPDs) for molecular crystals in which crystal structure is presented as a function of intermolecular potential parameters. In that work, a face-centered-cubic center-of-mass lattice was arbitrarily adopted as a reference state. In part two of the series, experimental crystal structures composed of tetrahedral point group molecules are classified to determine what fraction of structures are amenable to inclusion in the GPDs and the number of reference lattices necessary to span the observed structures. It is found that 60% of crystal structures composed of molecules with T_d point-group symmetry are amenable and that eight reference lattices are sufficient to span the observed structures. Similar results are expected for other cubic point groups

Full Diversity Unitary Precoded Integer-Forcing

We consider a point-to-point flat-fading MIMO channel with channel state information known both at transmitter and receiver. At the transmitter side, a lattice coding scheme is employed at each antenna to map information symbols to independent lattice codewords drawn from the same codebook. Each lattice codeword is then multiplied by a unitary precoding matrix ${\bf P}$ and sent through the channel. At the receiver side, an integer-forcing (IF) linear receiver is employed. We denote this scheme as unitary precoded integer-forcing (UPIF). We show that UPIF can achieve full-diversity under a constraint based on the shortest vector of a lattice generated by the precoding matrix ${\bf P}$. This constraint and a simpler version of that provide design criteria for two types of full-diversity UPIF. Type I uses a unitary precoder that adapts at each channel realization. Type II uses a unitary precoder, which remains fixed for all channel realizations. We then verify our results by computer simulations in $2\times2$, and $4\times 4$ MIMO using different QAM constellations. We finally show that the proposed Type II UPIF outperform the MIMO precoding X-codes at high data rates.Comment: 12 pages, 8 figures, to appear in IEEE-TW