Towards a systematic design of isotropic bulk magnetic metamaterials using the cubic point groups of symmetry

In this paper a systematic approach to the design of bulk isotropic magnetic metamaterials is presented. The role of the symmetries of both the constitutive element and the lattice are analyzed. For this purpose it is assumed that the metamaterial is composed by cubic SRR resonators, arranged in a cubic lattice. The minimum symmetries needed to ensure an isotropic behavior are analyzed, and some particular configurations are proposed. Besides, an equivalent circuit model is proposed for the considered cubic SRR resonators. Experiments are carried out in order to validate the proposed theory. We hope that this analysis will pave the way to the design of bulk metamaterials with strong isotropic magnetic response, including negative permeability and left-handed metamaterials.Comment: Submitted to Physical Review B, 23 page

Langevin Simulation of Thermally Activated Magnetization Reversal in Nanoscale Pillars

Numerical solutions of the Landau-Lifshitz-Gilbert micromagnetic model incorporating thermal fluctuations and dipole-dipole interactions (calculated by the Fast Multipole Method) are presented for systems composed of nanoscale iron pillars of dimension 9 nm x 9 nm x 150 nm. Hysteresis loops generated under sinusoidally varying fields are obtained, while the coercive field is estimated to be 1979 $\pm$ 14 Oe using linear field sweeps at T=0 K. Thermal effects are essential to the relaxation of magnetization trapped in a metastable orientation, such as happens after a rapid reversal of an external magnetic field less than the coercive value. The distribution of switching times is compared to a simple analytic theory that describes reversal with nucleation at the ends of the nanomagnets. Results are also presented for arrays of nanomagnets oriented perpendicular to a flat substrate. Even at a separation of 300 nm, where the field from neighboring pillars is only $\sim$ 1 Oe, the interactions have a significant effect on the switching of the magnets.Comment: 19 pages RevTeX, including 12 figures, clarified discussion of numerical technique

Dynamical Linked Cluster Expansions: A Novel Expansion Scheme for Point-Link-Point-Interactions

Dynamical linked cluster expansions are linked cluster expansions with hopping parameter terms endowed with their own dynamics. This amounts to a generalization from 2-point to point-link-point interactions. We develop an associated graph theory with a generalized notion of connectivity and describe an algorithmic generation of the new multiple-line graphs. We indicate physical applications to spin glasses, partially annealed neural networks and SU(N) gauge Higgs systems. In particular the new expansion technique provides the possibility of avoiding the replica-trick in spin glasses. We consider variational estimates for the SU(2) Higgs model of the electroweak phase transition. The results for the transition line, obtained by dynamical linked cluster expansions, agree quite well with corresponding high precision Monte Carlo results.Comment: 41 pages, latex2e, 10 postscript figure

Hot new directions for quasi-Monte Carlo research in step with applications

This article provides an overview of some interfaces between the theory of quasi-Monte Carlo (QMC) methods and applications. We summarize three QMC theoretical settings: first order QMC methods in the unit cube $[0,1]^s$ and in $\mathbb{R}^s$, and higher order QMC methods in the unit cube. One important feature is that their error bounds can be independent of the dimension $s$ under appropriate conditions on the function spaces. Another important feature is that good parameters for these QMC methods can be obtained by fast efficient algorithms even when $s$ is large. We outline three different applications and explain how they can tap into the different QMC theory. We also discuss three cost saving strategies that can be combined with QMC in these applications. Many of these recent QMC theory and methods are developed not in isolation, but in close connection with applications

Intrinsic Volumes of Random Cubical Complexes

Intrinsic volumes, which generalize both Euler characteristic and Lebesgue volume, are important properties of $d$-dimensional sets. A random cubical complex is a union of unit cubes, each with vertices on a regular cubic lattice, constructed according to some probability model. We analyze and give exact polynomial formulae, dependent on a probability, for the expected value and variance of the intrinsic volumes of several models of random cubical complexes. We then prove a central limit theorem for these intrinsic volumes. For our primary model, we also prove an interleaving theorem for the zeros of the expected-value polynomials. The intrinsic volumes of cubical complexes are useful for understanding the shape of random $d$-dimensional sets and for characterizing noise in applications.Comment: 17 pages with 7 figures; this version includes a central limit theore

Coverage and Connectivity in Three-Dimensional Networks

Most wireless terrestrial networks are designed based on the assumption that the nodes are deployed on a two-dimensional (2D) plane. However, this 2D assumption is not valid in underwater, atmospheric, or space communications. In fact, recent interest in underwater acoustic ad hoc and sensor networks hints at the need to understand how to design networks in 3D. Unfortunately, the design of 3D networks is surprisingly more difficult than the design of 2D networks. For example, proofs of Kelvin's conjecture and Kepler's conjecture required centuries of research to achieve breakthroughs, whereas their 2D counterparts are trivial to solve. In this paper, we consider the coverage and connectivity issues of 3D networks, where the goal is to find a node placement strategy with 100% sensing coverage of a 3D space, while minimizing the number of nodes required for surveillance. Our results indicate that the use of the Voronoi tessellation of 3D space to create truncated octahedral cells results in the best strategy. In this truncated octahedron placement strategy, the transmission range must be at least 1.7889 times the sensing range in order to maintain connectivity among nodes. If the transmission range is between 1.4142 and 1.7889 times the sensing range, then a hexagonal prism placement strategy or a rhombic dodecahedron placement strategy should be used. Although the required number of nodes in the hexagonal prism and the rhombic dodecahedron placement strategies is the same, this number is 43.25% higher than the number of nodes required by the truncated octahedron placement strategy. We verify by simulation that our placement strategies indeed guarantee ubiquitous coverage. We believe that our approach and our results presented in this paper could be used for extending the processes of 2D network design to 3D networks.Comment: To appear in ACM Mobicom 200

Polymake and Lattice Polytopes

The polymake software system deals with convex polytopes and related objects from geometric combinatorics. This note reports on a new implementation of a subclass for lattice polytopes. The features displayed are enabled by recent changes to the polymake core, which will be discussed briefly.Comment: 12 pages, 1 figur