Edge states and topological orders in the spin liquid phases of star lattice

A group of novel materials can be mapped to the star lattice, which exhibits some novel physical properties. We give the bulk-edge correspondence theory of the star lattice and study the edge states and their topological orders in different spin liquid phases. The bulk and edge-state energy structures and Chern number depend on the spin liquid phases and hopping parameters because the local spontaneous magnetic flux in the spin liquid phase breaks the time reversal and space inversion symmetries. We give the characteristics of bulk and edge energy structures and their corresponding Chern numbers in the uniform, nematic and chiral spin liquids. In particular, we obtain analytically the phase diagram of the topological orders for the chiral spin liquid states SL[\phi,\phi,-2\phi], where \phi is the magnetic flux in two triangles and a dodecagon in the unit cell. Moreover, we find the topological invariance for the spin liquid phases, SL[\phi_{1},\phi_{2},-(\phi_{1}+\phi_{2})] and SL[\phi_{2},\phi_{1},-(\phi_{1}+\phi_{2})]. The results reveal the relationship between the energy-band and edge-state structures and their topological orders of the star lattice.Comment: 7 pages, 8 figures, 1 tabl

Uniform test of algorithmic randomness over a general space

The algorithmic theory of randomness is well developed when the underlying space is the set of finite or infinite sequences and the underlying probability distribution is the uniform distribution or a computable distribution. These restrictions seem artificial. Some progress has been made to extend the theory to arbitrary Bernoulli distributions (by Martin-Loef), and to arbitrary distributions (by Levin). We recall the main ideas and problems of Levin's theory, and report further progress in the same framework. - We allow non-compact spaces (like the space of continuous functions, underlying the Brownian motion). - The uniform test (deficiency of randomness) d_P(x) (depending both on the outcome x and the measure P should be defined in a general and natural way. - We see which of the old results survive: existence of universal tests, conservation of randomness, expression of tests in terms of description complexity, existence of a universal measure, expression of mutual information as "deficiency of independence. - The negative of the new randomness test is shown to be a generalization of complexity in continuous spaces; we show that the addition theorem survives. The paper's main contribution is introducing an appropriate framework for studying these questions and related ones (like statistics for a general family of distributions).Comment: 40 pages. Journal reference and a slight correction in the proof of Theorem 7 adde

Emergent Higgsless Superconductivity

We present a new Higgsless model of superconductivity, inspired from anyon superconductivity but P- and T-invariant and generalizable to any dimension. While the original anyon superconductivity mechanism was based on incompressible quantum Hall fluids as average field states, our mechanism involves topological insulators as average field states. In D space dimensions it involves a (D-1)-form fictitious pseudovector gauge field which originates from the condensation of topological defects in compact low-energy effective BF theories. There is no massive Higgs scalar as there is no local order parameter. When electromagnetism is switched on, the photon acquires mass by the topological BF mechanism. Although the charge of the gapless mode (2) and the topological order (4) are the same as those of the standard Higgs model, the two models of superconductivity are clearly different since the origins of the gap, reflected in the high-energy sectors are totally different. In 2D this type of superconductivity is explicitly realized as global superconductivity in Josephson junction arrays. In 3D this model predicts a possible phase transition from topological insulators to Higgsless superconductors.Comment: Prepared for the proceedings of the XII Quark Confinement and the Hadron Spectrum, 29 August to 3 September 2016, Thessaloniki, Greece. arXiv admin note: substantial text overlap with arXiv:1408.506

On the information carried by programs about the objects they compute

In computability theory and computable analysis, finite programs can compute infinite objects. Presenting a computable object via any program for it, provides at least as much information as presenting the object itself, written on an infinite tape. What additional information do programs provide? We characterize this additional information to be any upper bound on the Kolmogorov complexity of the object. Hence we identify the exact relationship between Markov-computability and Type-2-computability. We then use this relationship to obtain several results characterizing the computational and topological structure of Markov-semidecidable sets