Wilson-Loop Characterization of Inversion-Symmetric Topological Insulators

The ground state of translationally-invariant insulators comprise bands which can assume topologically distinct structures. There are few known examples where this distinction is enforced by a point-group symmetry alone. In this paper we show that 1D and 2D insulators with the simplest point-group symmetry - inversion - have a $Z^{\geq}$ classification. In 2D, we identify a relative winding number that is solely protected by inversion symmetry. By analysis of Berry phases, we show that this invariant has similarities with the first Chern class (of time-reversal breaking insulators), but is more closely analogous to the $Z_2$ invariant (of time-reversal invariant insulators). Implications of our work are discussed in holonomy, the geometric-phase theory of polarization, the theory of maximally-localized Wannier functions, and in the entanglement spectrum.Comment: The updated version is accepted in Physical Review

Design studies for the electron storage ring EUTERPE

VI+98hlm.;24c

Optimal Event-Driven Multi-Agent Persistent Monitoring of a Finite Set of Targets

We consider the problem of controlling the movement of multiple cooperating agents so as to minimize an uncertainty metric associated with a finite number of targets. In a one-dimensional mission space, we adopt an optimal control framework and show that the solution is reduced to a simpler parametric optimization problem: determining a sequence of locations where each agent may dwell for a finite amount of time and then switch direction. This amounts to a hybrid system which we analyze using Infinitesimal Perturbation Analysis (IPA) to obtain a complete on-line solution through an event-driven gradient-based algorithm which is also robust with respect to the uncertainty model used. The resulting controller depends on observing the events required to excite the gradient-based algorithm, which cannot be guaranteed. We solve this problem by proposing a new metric for the objective function which creates a potential field guaranteeing that gradient values are non-zero. This approach is compared to an alternative graph-based task scheduling algorithm for determining an optimal sequence of target visits. Simulation examples are included to demonstrate the proposed methods.Comment: 12 pages full version, IEEE Conference on Decision and Control, 201

Multi-Weyl Topological Semimetals Stabilized by Point Group Symmetry

We perform a complete classification of two-band \bk\cdot\mathbf{p} theories at band crossing points in 3D semimetals with $n$-fold rotation symmetry and broken time-reversal symmetry. Using this classification, we show the existence of new 3D topological semimetals characterized by $C_{4,6}$-protected double-Weyl nodes with quadratic in-plane (along $k_{x,y}$) dispersion or $C_6$-protected triple-Weyl nodes with cubic in-plane dispersion. We apply this theory to the 3D ferromagnet HgCr$_2$Se$_4$ and confirm it is a double-Weyl metal protected by $C_4$ symmetry. Furthermore, if the direction of the ferromagnetism is shifted away from the [001]- to the [111]-axis, the double-Weyl node splits into four single Weyl nodes, as dictated by the point group $S_6$ of that phase. Finally, we discuss experimentally relevant effects including splitting of multi-Weyl nodes by applying $C_n$ breaking strain and the surface Fermi arcs in these new semimetals.Comment: 4+ pages, 2 figures, 1 tabl

Backhaul-Aware Caching Placement for Wireless Networks

As the capacity demand of mobile applications keeps increasing, the backhaul network is becoming a bottleneck to support high quality of experience (QoE) in next-generation wireless networks. Content caching at base stations (BSs) is a promising approach to alleviate the backhaul burden and reduce user-perceived latency. In this paper, we consider a wireless caching network where all the BSs are connected to a central controller via backhaul links. In such a network, users can obtain the required data from candidate BSs if the data are pre-cached. Otherwise, the user data need to be first retrieved from the central controller to local BSs, which introduces extra delay over the backhaul. In order to reduce the download delay, the caching placement strategy needs to be optimized. We formulate such a design problem as the minimization of the average download delay over user requests, subject to the caching capacity constraint of each BS. Different from existing works, our model takes BS cooperation in the radio access into consideration and is fully aware of the propagation delay on the backhaul links. The design problem is a mixed integer programming problem and is highly complicated, and thus we relax the problem and propose a low-complexity algorithm. Simulation results will show that the proposed algorithm can effectively determine the near-optimal caching placement and provide significant performance gains over conventional caching placement strategies.Comment: 6 pages, 3 figures, accepted to IEEE Globecom, San Diego, CA, Dec. 201