TY - JOUR
AB - In topological crystalline insulators (TCIs), topology and crystal symmetry intertwine to create surface states with distinct characteristics. The breaking of crystal symmetry in TCIs is predicted to impart mass to the massless Dirac fermions. Here, we report high-resolution scanning tunneling microscopy studies of a TCI, Pb1-xSnxSe that reveal the coexistence of zero-mass Dirac fermions protected by crystal symmetry with massive Dirac fermions consistent with crystal symmetry breaking. In addition, we show two distinct regimes of the Fermi surface topology separated by a Van-Hove singularity at the Lifshitz transition point. Our work paves the way for engineering the Dirac band gap and realizing interaction-driven topological quantum phenomena in TCIs.
AU - Okada, Yoshinori
AU - Serbyn, Maksym
AU - Lin, Hsin
AU - Walkup, Daniel
AU - Zhou, Wenwen
AU - Dhital, Chetan
AU - Neupane, Madhab
AU - Xu, Suyang
AU - Wang, Yungjui
AU - Sankar, Raman
AU - Chou, Fangcheng
AU - Bansil, Arun
AU - Hasan, Md
AU - Wilson, Stephen
AU - Fu, Liang
AU - Madhavan, Vidya
ID - 972
IS - 6153
JF - Science
TI - Observation of dirac node formation and mass acquisition in a topological crystalline insulator
VL - 341
ER -
TY - JOUR
AB - We construct a complete set of local integrals of motion that characterize the many-body localized (MBL) phase. Our approach relies on the assumption that local perturbations act locally on the eigenstates in the MBL phase, which is supported by numerical simulations of the random-field XXZ spin chain. We describe the structure of the eigenstates in the MBL phase and discuss the implications of local conservation laws for its nonequilibrium quantum dynamics. We argue that the many-body localization can be used to protect coherence in the system by suppressing relaxation between eigenstates with different local integrals of motion.
AU - Maksym Serbyn
AU - Papić, Zlatko
AU - Abanin, Dmitry A
ID - 973
IS - 12
JF - Physical Review Letters
TI - Local conservation laws and the structure of the many body localized states
VL - 111
ER -
TY - JOUR
AB - We propose a possible realization of the overscreened Kondo impurity problem by a magnetic s=1/2 impurity embedded in a two-dimensional S=1 U(1) spin liquid with a Fermi surface. This problem contains an interesting interplay between non-Fermi-liquid behavior induced by a U(1) gauge field coupled to fermions and a non-Fermi-liquid fixed point in the overscreened Kondo problem. Using a large-N expansion together with an expansion in the dynamical exponent of the gauge field, we find that the coupling to the gauge field leads to weak but observable changes in the physical properties of the system at the overscreened Kondo fixed point. We discuss the extrapolation of this result to a physical case and argue that the realization of overscreened Kondo physics could lead to observations of effects due to gauge fields.
AU - Serbyn, Maksym
AU - Senthil, Todadri
AU - Lee, Patrick
ID - 974
IS - 2
JF - Physical Review B - Condensed Matter and Materials Physics
TI - Overscreened Kondo fixed point in S=1 spin liquid
VL - 88
ER -
TY - JOUR
AB - Recent numerical work by Bardarson, Pollmann, and Moore revealed a slow, logarithmic in time, growth of the entanglement entropy for initial product states in a putative many-body localized phase. We show that this surprising phenomenon results from the dephasing due to exponentially small interaction-induced corrections to the eigenenergies of different states. For weak interactions, we find that the entanglement entropy grows as ξln (Vt/), where V is the interaction strength, and ξ is the single-particle localization length. The saturated value of the entanglement entropy at long times is determined by the participation ratios of the initial state over the eigenstates of the subsystem. Our work shows that the logarithmic entanglement growth is a universal phenomenon characteristic of the many-body localized phase in any number of spatial dimensions, and reveals a broad hierarchy of dephasing time scales present in such a phase.
AU - Maksym Serbyn
AU - Papić, Zlatko
AU - Abanin, Dmitry A
ID - 975
IS - 26
JF - Physical Review Letters
TI - Universal slow growth of entanglement in interacting strongly disordered systems
VL - 110
ER -
TY - JOUR
AB - Motivated by a search for experimental probes to access the physics of fractionalized excitations called spinons in spin liquids, we study the interaction of spinons with lattice vibrations. We consider the case of algebraic spin liquid, when spinons have fermionic statistics and a Dirac-like dispersion. We establish the general procedure for deriving spinon-phonon interactions, which is based on symmetry considerations. The procedure is illustrated for four different algebraic spin liquids: π-flux and staggered-flux phases on a square lattice, π-flux phase on a kagome lattice, and zero-flux phase on a honeycomb lattice. Although the low-energy description is similar for all these phases, different underlying symmetry groups lead to a distinct form of spinon-phonon interaction Hamiltonian. The explicit form of the spinon-phonon interaction is used to estimate the attenuation of ultrasound in an algebraic spin liquid. The prospects of the sound attenuation as a probe of spinons are discussed.
AU - Maksym Serbyn
AU - Lee, Patrick
ID - 976
IS - 17
JF - Physical Review B - Condensed Matter and Materials Physics
TI - Spinon-phonon interaction in algebraic spin liquids
VL - 87
ER -
TY - CONF
AB - We study two-player zero-sum games over infinite-state graphs equipped with ωB and finitary conditions. Our first contribution is about the strategy complexity, i.e the memory required for winning strategies: we prove that over general infinite-state graphs, memoryless strategies are sufficient for finitary Büchi, and finite-memory suffices for finitary parity games. We then study pushdown games with boundedness conditions, with two contributions. First we prove a collapse result for pushdown games with ωB-conditions, implying the decidability of solving these games. Second we consider pushdown games with finitary parity along with stack boundedness conditions, and show that solving these games is EXPTIME-complete.
AU - Chatterjee, Krishnendu
AU - Fijalkow, Nathanaël
ID - 1374
T2 - 22nd EACSL Annual Conference on Computer Science Logic
TI - Infinite-state games with finitary conditions
VL - 23
ER -
TY - CONF
AB - It is often difficult to correctly implement a Boolean controller for a complex system, especially when concurrency is involved. Yet, it may be easy to formally specify a controller. For instance, for a pipelined processor it suffices to state that the visible behavior of the pipelined system should be identical to a non-pipelined reference system (Burch-Dill paradigm). We present a novel procedure to efficiently synthesize multiple Boolean control signals from a specification given as a quantified first-order formula (with a specific quantifier structure). Our approach uses uninterpreted functions to abstract details of the design. We construct an unsatisfiable SMT formula from the given specification. Then, from just one proof of unsatisfiability, we use a variant of Craig interpolation to compute multiple coordinated interpolants that implement the Boolean control signals. Our method avoids iterative learning and back-substitution of the control functions. We applied our approach to synthesize a controller for a simple two-stage pipelined processor, and present first experimental results.
AU - Hofferek, Georg
AU - Gupta, Ashutosh
AU - Könighofer, Bettina
AU - Jiang, Jie
AU - Bloem, Roderick
ID - 1385
T2 - 2013 Formal Methods in Computer-Aided Design
TI - Synthesizing multiple boolean functions using interpolation on a single proof
ER -
TY - CONF
AB - Choices made by nondeterministic word automata depend on both the past (the prefix of the word read so far) and the future (the suffix yet to be read). In several applications, most notably synthesis, the future is diverse or unknown, leading to algorithms that are based on deterministic automata. Hoping to retain some of the advantages of nondeterministic automata, researchers have studied restricted classes of nondeterministic automata. Three such classes are nondeterministic automata that are good for trees (GFT; i.e., ones that can be expanded to tree automata accepting the derived tree languages, thus whose choices should satisfy diverse futures), good for games (GFG; i.e., ones whose choices depend only on the past), and determinizable by pruning (DBP; i.e., ones that embody equivalent deterministic automata). The theoretical properties and relative merits of the different classes are still open, having vagueness on whether they really differ from deterministic automata. In particular, while DBP ⊆ GFG ⊆ GFT, it is not known whether every GFT automaton is GFG and whether every GFG automaton is DBP. Also open is the possible succinctness of GFG and GFT automata compared to deterministic automata. We study these problems for ω-regular automata with all common acceptance conditions. We show that GFT=GFG⊃DBP, and describe a determinization construction for GFG automata.
AU - Boker, Udi
AU - Kuperberg, Denis
AU - Kupferman, Orna
AU - Skrzypczak, Michał
ID - 1387
IS - PART 2
TI - Nondeterminism in the presence of a diverse or unknown future
VL - 7966
ER -
TY - JOUR
AB - We give a cohomological interpretation of both the Kac polynomial and the refined Donaldson-Thomas-invariants of quivers. This interpretation yields a proof of a conjecture of Kac from 1982 and gives a new perspective on recent work of Kontsevich-Soibelman. Thisis achieved by computing, via an arithmetic Fourier transform, the dimensions of the isotypical components of the cohomology of associated Nakajima quiver varieties under the action of a Weyl group. The generating function of the corresponding Poincare polynomials is an extension of Hua's formula for Kac polynomials of quivers involving Hall-Littlewood symmetric functions. The resulting formulae contain a wide range of information on the geometry of the quiver varieties.
AU - Tamas Hausel
AU - Letellier, Emmanuel
AU - Rodríguez Villegas, Fernando
ID - 1442
IS - 3
JF - Annals of Mathematics
TI - Positivity for Kac polynomials and DT-invariants of quivers
VL - 177
ER -
TY - CHAP
AB - Here we survey several results and conjectures on the cohomology of the total space of the Hitchin system: the moduli space of semi-stable rank n and degree d Higgs bundles on a complex algebraic curve C. The picture emerging is a dynamic mixture of ideas originating in theoretical physics such as gauge theory and mirror symmetry, Weil conjectures in arithmetic algebraic geometry, representation theory of finite groups of Lie type and Langlands duality in number theory.
AU - Tamas Hausel
ID - 1443
T2 - Handbook of Moduli: Volume II
TI - Global topology of the Hitchin system
VL - 25
ER -
TY - JOUR
AB - We show that a natural isomorphism between the rational cohomology groups of the two zero-dimensional Hilbert schemes of n-points of two surfaces, the affine plane minus the axes and the cotangent bundle of an elliptic curve, exchanges the weight filtration on the first set of cohomology groups with the perverse Leray filtration associated with a natural fibration on the second set of cohomology groups. We discuss some associated hard Lefschetz phenomena.
AU - De Cataldo, Mark A
AU - Tamas Hausel
AU - Migliorini, Luca
ID - 1470
JF - Journal of Singularities
TI - Exchange between perverse and weight filtration for the Hilbert schemes of points of two surfaces
VL - 7
ER -
TY - JOUR
AB - Cells in a developing embryo have no direct way of "measuring" their physical position. Through a variety of processes, however, the expression levels of multiple genes come to be correlated with position, and these expression levels thus form a code for "positional information." We show how to measure this information, in bits, using the gap genes in the Drosophila embryo as an example. Individual genes carry nearly two bits of information, twice as much as expected if the expression patterns consisted only of on/off domains separated by sharp boundaries. Taken together, four gap genes carry enough information to define a cell's location with an error bar of ~1% along the anterior-posterior axis of the embryo. This precision is nearly enough for each cell to have a unique identity, which is the maximum information the system can use, and is nearly constant along the length of the embryo. We argue that this constancy is a signature of optimality in the transmission of information from primary morphogen inputs to the output of the gap gene network.
AU - Dubuis, Julien
AU - Tkacik, Gasper
AU - Wieschaus, Eric
AU - Gregor, Thomas
AU - Bialek, William
ID - 3261
IS - 41
JF - PNAS
TI - Positional information, in bits
VL - 110
ER -
TY - JOUR
AB - Copper-based selenides are attracting increasing interest due to their outstanding optoelectronic and thermoelectric properties. Herein a novel colloidal synthetic route to prepare Cu2SnSe3 nanocrystals with controlled size, shape and composition is presented. The high yield of the developed procedure allowed its up-scaling to the production of grams of colloidal Cu2SnSe3 nanocrystals. These nanocrystals were used as building blocks for the production of Cu2SnSe3 bulk nanostructured materials by spark plasma sintering. The thermoelectric properties of the prepared nanocrystalline Cu2SnSe3 pellets were characterized in the temperature range from 300 to 720 K. The obtained results show the bottom-up production of nanocrystalline materials from solution-processed nanocrystals to be a potentially advantageous alternative to conventional methods of production of efficient thermoelectric materials.
AU - Ibanez, Maria
AU - Cadavid, Doris
AU - Anselmi-Tamburini, Umberto
AU - Zamani, Reza R
AU - Gorsse, Stéphane
AU - Li, Wenhua
AU - López, Antonio M
AU - Morante, Joan R
AU - Arbiol, Jordi
AU - Cabot, Andreu
ID - 344
IS - 4
JF - Journal of Materials Chemistry A
TI - Colloidal synthesis and thermoelectric properties of Cu 2SnSe3 nanocrystals
VL - 1
ER -
TY - CONF
AB - Leakage resilient cryptography attempts to incorporate side-channel leakage into the black-box security model and designs cryptographic schemes that are provably secure within it. Informally, a scheme is leakage-resilient if it remains secure even if an adversary learns a bounded amount of arbitrary information about the schemes internal state. Unfortunately, most leakage resilient schemes are unnecessarily complicated in order to achieve strong provable security guarantees. As advocated by Yu et al. [CCS’10], this mostly is an artefact of the security proof and in practice much simpler construction may already suffice to protect against realistic side-channel attacks. In this paper, we show that indeed for simpler constructions leakage-resilience can be obtained when we aim for relaxed security notions where the leakage-functions and/or the inputs to the primitive are chosen non-adaptively. For example, we show that a three round Feistel network instantiated with a leakage resilient PRF yields a leakage resilient PRP if the inputs are chosen non-adaptively (This complements the result of Dodis and Pietrzak [CRYPTO’10] who show that if a adaptive queries are allowed, a superlogarithmic number of rounds is necessary.) We also show that a minor variation of the classical GGM construction gives a leakage resilient PRF if both, the leakage-function and the inputs, are chosen non-adaptively.
AU - Faust, Sebastian
AU - Pietrzak, Krzysztof Z
AU - Schipper, Joachim
ID - 2048
T2 - Conference proceedings CHES 2012
TI - Practical leakage-resilient symmetric cryptography
VL - 7428
ER -
TY - CONF
AB - We propose a new authentication protocol that is provably secure based on a ring variant of the learning parity with noise (LPN) problem. The protocol follows the design principle of the LPN-based protocol from Eurocrypt’11 (Kiltz et al.), and like it, is a two round protocol secure against active attacks. Moreover, our protocol has small communication complexity and a very small footprint which makes it applicable in scenarios that involve low-cost, resource-constrained devices.
Performance-wise, our protocol is more efficient than previous LPN-based schemes, such as the many variants of the Hopper-Blum (HB) protocol and the aforementioned protocol from Eurocrypt’11. Our implementation results show that it is even comparable to the standard challenge-and-response protocols based on the AES block-cipher. Our basic protocol is roughly 20 times slower than AES, but with the advantage of having 10 times smaller code size. Furthermore, if a few hundred bytes of non-volatile memory are available to allow the storage of some off-line pre-computations, then the online phase of our protocols is only twice as slow as AES.
AU - Heyse, Stefan
AU - Kiltz, Eike
AU - Lyubashevsky, Vadim
AU - Paar, Christof
AU - Pietrzak, Krzysztof Z
ID - 2049
T2 - Conference proceedings FSE 2012
TI - Lapin: An efficient authentication protocol based on ring-LPN
VL - 7549
ER -
TY - JOUR
AB - We consider a class of stochastic PDEs of Burgers type in spatial dimension 1, driven by space–time white noise. Even though it is well known that these equations are well posed, it turns out that if one performs a spatial discretization of the nonlinearity in the “wrong” way, then the sequence of approximate equations does converge to a limit, but this limit exhibits an additional correction term. This correction term is proportional to the local quadratic cross-variation (in space) of the gradient of the conserved quantity with the solution itself. This can be understood as a consequence of the fact that for any fixed time, the law of the solution is locally equivalent to Wiener measure, where space plays the role of time. In this sense, the correction term is similar to the usual Itô–Stratonovich correction term that arises when one considers different temporal discretizations of stochastic ODEs.
AU - Hairer, Martin M
AU - Jan Maas
ID - 2125
IS - 4
JF - Annals of Probability
TI - A spatial version of the Itô-Stratonovich correction
VL - 40
ER -
TY - JOUR
AB - We study a new notion of Ricci curvature that applies to Markov chains on discrete spaces. This notion relies on geodesic convexity of the entropy and is analogous to the one introduced by Lott, Sturm, and Villani for geodesic measure spaces. In order to apply to the discrete setting, the role of the Wasserstein metric is taken over by a different metric, having the property that continuous time Markov chains are gradient flows of the entropy. Using this notion of Ricci curvature we prove discrete analogues of fundamental results by Bakry–Émery and Otto–Villani. Further, we show that Ricci curvature bounds are preserved under tensorisation. As a special case we obtain the sharp Ricci curvature lower bound for the discrete hypercube.
AU - Erbar, Matthias
AU - Jan Maas
ID - 2127
IS - 3
JF - Archive for Rational Mechanics and Analysis
TI - Ricci curvature of finite Markov chains via convexity of the entropy
VL - 206
ER -
TY - JOUR
AB - We introduce a technique for handling Whitney decompositions in Gaussian harmonic analysis and apply it to the study of Gaussian analogues of the classical tent spaces T 1,q of Coifman–Meyer–Stein.
AU - Jan Maas
AU - van Neerven, Jan M
AU - Portal, Pierre
ID - 2128
IS - 2
JF - Arkiv för Matematik
TI - Whitney coverings and the tent spaces T 1,q (γ) for the Gaussian measure
VL - 50
ER -
TY - JOUR
AU - Mikhail Lemeshko
AU - Krems, Roman V
AU - Weimer, Hendrik A
ID - 2151
IS - 4
JF - Physical Review Letters
TI - Erratum: Nonadiabatic preparation of spin crystals with ultracold polar molecules
VL - 109
ER -
TY - JOUR
AB - We study the growth dynamics of ordered structures of strongly interacting polar molecules in optical lattices. Using a dipole blockade of microwave excitations, we map the system onto an interacting spin-1/2 model possessing ground states with crystalline order, and describe a way to prepare these states by nonadiabatically driving the transitions between molecular rotational levels. The proposed technique bypasses the need to cross a phase transition and allows for the creation of ordered domains of considerably larger size compared to approaches relying on adiabatic preparation.
AU - Mikhail Lemeshko
AU - Krems, Roman V
AU - Weimer, Hendrik
ID - 2201
IS - 3
JF - Physical Review Letters
TI - Nonadiabatic preparation of spin crystals with ultracold polar molecules
VL - 109
ER -
TY - JOUR
AB - We propose a method for sensitive parallel detection of low-frequency electromagnetic fields based on the fine structure interactions in paramagnetic polar molecules. Compared to the recently implemented scheme employing ultracold 87Rb atoms by Böhi, the technique based on molecules offers a 100-fold higher sensitivity, the possibility to measure both the electric and magnetic field components, and a probe of a wide range of frequencies from the dc limit to the THz regime.
AU - Alyabyshev, Sergey V
AU - Mikhail Lemeshko
AU - Krems, Roman V
ID - 2202
IS - 1
JF - Physical Review A - Atomic, Molecular, and Optical Physics
TI - Sensitive imaging of electromagnetic fields with paramagnetic polar molecules
VL - 86
ER -
TY - JOUR
AB - We show that the electric dipole-dipole interaction between a pair of polar molecules undergoes an all-out transformation when superimposed by a far-off-resonant optical field. The combined interaction potential becomes tunable by variation of wavelength, polarisation and intensity of the optical field and its dependence on the intermolecular separation exhibits a crossover from an inverse-power to an oscillating behaviour. The ability thereby offered to control molecular interactions opens up avenues toward the creation and manipulation of novel phases of ultracold polar gases among whose characteristics is a long-range entanglement of the dipoles' mutual orientation. We devised an accurate analytic model of such optical-field-dressed dipole-dipole interaction potentials, which enables a straightforward access to the optical-field parameters required for the design of intermolecular interactions in the laboratory.
AU - Mikhail Lemeshko
AU - Friedrich, Břetislav
ID - 2203
IS - 15-16
JF - Molecular Physics
TI - Interaction between polar molecules subject to a far-off-resonant optical field: Entangled dipoles up- or down-holding each other
VL - 110
ER -
TY - JOUR
AB - Nestin-cre transgenic mice have been widely used to direct recombination to neural stem cells (NSCs) and intermediate neural progenitor cells (NPCs). Here we report that a readily utilized, and the only commercially available, Nestin-cre line is insufficient for directing recombination in early embryonic NSCs and NPCs. Analysis of recombination efficiency in multiple cre-dependent reporters and a genetic mosaic line revealed consistent temporal and spatial patterns of recombination in NSCs and NPCs. For comparison we utilized a knock-in Emx1cre line and found robust recombination in NSCs and NPCs in ventricular and subventricular zones of the cerebral cortices as early as embryonic day 12.5. In addition we found that the rate of Nestin-cre driven recombination only reaches sufficiently high levels in NSCs and NPCs during late embryonic and early postnatal periods. These findings are important when commercially available cre lines are considered for directing recombination to embryonic NSCs and NPCs.
AU - Liang, Huixuan
AU - Hippenmeyer, Simon
AU - Ghashghaei, H.
ID - 2263
IS - 12
JF - Biology open
TI - A Nestin-cre transgenic mouse is insufficient for recombination in early embryonic neural progenitors
VL - 1
ER -
TY - CONF
AB - Capturing real-world objects with laser-scanning technology has become an everyday task. Recently, the acquisition of dynamic scenes at interactive frame rates has become feasible. A high-quality visualization of the resulting point cloud stream would require a per-frame reconstruction of object surfaces. Unfortunately, reconstruction computations are still too time-consuming to be applied interactively. In this paper we present a local surface reconstruction and visualization technique that provides interactive feedback for reasonably sized point clouds, while achieving high image quality. Our method is performed entirely on the GPU and in screen pace, exploiting the efficiency of the common rasterization pipeline. The approach is very general, as no assumption is made about point connectivity or sampling density. This naturally allows combining the outputs of multiple scanners in a single visualization, which is useful for many virtual and augmented reality applications.
AU - Preiner, Reinhold
AU - Jeschke, Stefan
AU - Wimmer, Michael
ID - 2267
TI - Auto splats: Dynamic point cloud visualization on the GPU
ER -
TY - CONF
AB - This paper presents an analytic formulation for anti-aliased sampling of 2D polygons and 3D polyhedra. Our framework allows the exact evaluation of the convolution integral with a linear function defined on the polytopes. The filter is a spherically symmetric polynomial of any order, supporting approximations to refined variants such as the Mitchell-Netravali filter family. This enables high-quality rasterization of triangles and tetrahedra with linearly interpolated vertex values to regular and non-regular grids. A closed form solution of the convolution is presented and an efficient implementation on the GPU using DirectX and CUDA C is described.
AU - Thomas Auzinger
AU - Guthe, Michael
AU - Stefan Jeschke
ID - 2268
IS - 121
TI - Analytic anti-aliasing of linear functions on polytopes
VL - 31
ER -
TY - CONF
AB - We summarize our recent results on the ground state energy of multi-polaron systems. In particular, we discuss stability and existence of the thermodynamic limit, and we discuss the absence of binding in the case of large Coulomb repulsion and the corresponding binding-unbinding transition. We also consider the Pekar-Tomasevich approximation to the ground state energy and we study radial symmetry of the ground state density.
AU - Frank, Rupert L
AU - Lieb, Élliott H
AU - Robert Seiringer
AU - Thomas, Lawrence E
ID - 2316
TI - Ground state properties of multi-polaron systems
ER -
TY - CONF
AB - We present a summary of our recent rigorous derivation of the celebrated Ginzburg-Landau (GL) theory, starting from the microscopic Bardeen-Cooper-Schrieffer (BCS) model. Close to the critical temperature, GL arises as an effective theory on the macroscopic scale. The relevant scaling limit is semiclassical in nature, and semiclassical analysis, with minimal regularity assumptions, plays an important part in our proof.
AU - Frank, Rupert L
AU - Hainzl, Christian
AU - Robert Seiringer
AU - Solovej, Jan P
ID - 2317
TI - Microscopic derivation of the Ginzburg-Landau model
ER -
TY - JOUR
AB - We show that bosons interacting via pair potentials with negative scattering length form bound states for a suitable number of particles. In other words, the absence of many-particle bound states of any kind implies the non-negativity of the scattering length of the interaction potential.
AU - Seiringer, Robert
ID - 2318
IS - 3
JF - Journal of Spectral Theory
TI - Absence of bound states implies non-negativity of the scattering length
VL - 2
ER -
TY - JOUR
AB - We give the first rigorous derivation of the celebrated Ginzburg-Landau (GL) theory, starting from the microscopic Bardeen-Cooper-Schrieffer (BCS) model. Close to the critical temperature, GL arises as an effective theory on the macroscopic scale. The relevant scaling limit is semiclassical in nature, and semiclassical analysis, with minimal regularity assumptions, plays an important part in our proof.
AU - Frank, Rupert L
AU - Hainzl, Christian
AU - Robert Seiringer
AU - Solovej, Jan P
ID - 2395
IS - 3
JF - Journal of the American Mathematical Society
TI - Microscopic derivation of Ginzburg-Landau theory
VL - 25
ER -
TY - JOUR
AB - A positive temperature analogue of the scattering length of a potential V can be defined via integrating the difference of the heat kernels of -Δ and, with Δ the Laplacian. An upper bound on this quantity is a crucial input in the derivation of a bound on the critical temperature of a dilute Bose gas (Seiringer and Ueltschi in Phys Rev B 80:014502, 2009). In (Seiringer and Ueltschi in Phys Rev B 80:014502, 2009), a bound was given in the case of finite range potentials and sufficiently low temperature. In this paper, we improve the bound and extend it to potentials of infinite range.
AU - Landon, Benjamin
AU - Robert Seiringer
ID - 2396
IS - 3
JF - Letters in Mathematical Physics
TI - The scattering length at positive temperature
VL - 100
ER -
TY - JOUR
AB - We consider the low-density limit of a Fermi gas in the BCS approximation. We show that if the interaction potential allows for a two-particle bound state, the system at zero temperature is well approximated by the Gross-Pitaevskii functional, describing a Bose-Einstein condensate of fermion pairs.
AU - Hainzl, Christian
AU - Robert Seiringer
ID - 2397
IS - 2
JF - Letters in Mathematical Physics
TI - Low density limit of BCS theory and Bose-Einstein condensation of Fermion pairs
VL - 100
ER -
TY - GEN
AB - We extend the mathematical theory of quantum hypothesis testing to the general W*-algebraic setting and explore its relation with recent developments in non-equilibrium quantum statistical mechanics. In particular, we relate the large deviation principle for the full counting statistics of entropy flow to quantum hypothesis testing of the arrow of time.
AU - Jakšić, Vojkan
AU - Ogata, Yoshiko
AU - Pillet, Claude A
AU - Robert Seiringer
ID - 2398
IS - 6
T2 - Reviews in Mathematical Physics
TI - Quantum hypothesis testing and non-equilibrium statistical mechanics
VL - 24
ER -
TY - JOUR
AB - If the polaron coupling constant α is large enough, bipolarons or multi-polarons will form. When passing through the critical α c from above, does the radius of the system simply get arbitrarily large or does it reach a maximum and then explode? We prove that it is always the latter. We also prove the analogous statement for the Pekar-Tomasevich (PT) approximation to the energy, in which case there is a solution to the PT equation at α c. Similarly, we show that the same phenomenon occurs for atoms, e. g., helium, at the critical value of the nuclear charge. Our proofs rely only on energy estimates, not on a detailed analysis of the Schrödinger equation, and are very general. They use the fact that the Coulomb repulsion decays like 1/r, while 'uncertainty principle' localization energies decay more rapidly, as 1/r 2.
AU - Frank, Rupert L
AU - Lieb, Élliott H
AU - Robert Seiringer
ID - 2400
IS - 2
JF - Communications in Mathematical Physics
TI - Binding of polarons and atoms at threshold
VL - 313
ER -
TY - JOUR
AB - We find further implications of the BMV conjecture, which states that for hermitian matrices B≥0 and A, the function λ {mapping} Tr exp(A - λB) is the Laplace transform of a positive measure supported on [0,∞].
AU - Lieb, Élliott H
AU - Robert Seiringer
ID - 2401
IS - 1
JF - Journal of Statistical Physics
TI - Further implications of the Bessis-Moussa-Villani conjecture
VL - 149
ER -
TY - JOUR
AB - We consider a model of quantum-mechanical particles interacting via point interactions of infinite scattering length. In the case of fermions we prove a Lieb-Thirring inequality for the energy, i.e., we show that the energy is bounded from below by a constant times the integral of the particle density to the power.
AU - Frank, Rupert L
AU - Robert Seiringer
ID - 2402
IS - 9
JF - Journal of Mathematical Physics
TI - Lieb-Thirring inequality for a model of particles with point interactions
VL - 53
ER -
TY - JOUR
AB - We study the effects of random scatterers on the ground state of the one-dimensional Lieb-Liniger model of interacting bosons on the unit interval in the Gross-Pitaevskii regime. We prove that Bose-Einstein condensation survives even a strong random potential with a high density of scatterers. The character of the wavefunction of the condensate, however, depends in an essential way on the interplay between randomness and the strength of the two-body interaction. For low density of scatterers and strong interactions the wavefunction extends over the whole interval. A high density of scatterers and weak interactions, on the other hand, lead to localization of the wavefunction in a fragmented subset of the interval.
AU - Robert Seiringer
AU - Yngvason, Jakob
AU - Zagrebnov, Valentin A
ID - 2403
IS - 11
JF - Journal of Statistical Mechanics Theory and Experiment
TI - Disordered Bose-Einstein condensates with interaction in one dimension
VL - 2012
ER -
TY - JOUR
AB - The kingdom of fungi provides model organisms for biotechnology, cell biology, genetics, and life sciences in general. Only when their phylogenetic relationships are stably resolved, can individual results from fungal research be integrated into a holistic picture of biology. However, and despite recent progress, many deep relationships within the fungi remain unclear. Here, we present the first phylogenomic study of an entire eukaryotic kingdom that uses a consistency criterion to strengthen phylogenetic conclusions. We reason that branches (splits) recovered with independent data and different tree reconstruction methods are likely to reflect true evolutionary relationships. Two complementary phylogenomic data sets based on 99 fungal genomes and 109 fungal expressed sequence tag (EST) sets analyzed with four different tree reconstruction methods shed light from different angles on the fungal tree of life. Eleven additional data sets address specifically the phylogenetic position of Blastocladiomycota, Ustilaginomycotina, and Dothideomycetes, respectively. The combined evidence from the resulting trees supports the deep-level stability of the fungal groups toward a comprehensive natural system of the fungi. In addition, our analysis reveals methodologically interesting aspects. Enrichment for EST encoded data-a common practice in phylogenomic analyses-introduces a strong bias toward slowly evolving and functionally correlated genes. Consequently, the generalization of phylogenomic data sets as collections of randomly selected genes cannot be taken for granted. A thorough characterization of the data to assess possible influences on the tree reconstruction should therefore become a standard in phylogenomic analyses.
AU - Ebersberger, Ingo
AU - De Matos Simoes, Ricardo
AU - Kupczok, Anne
AU - Gube, Matthias
AU - Kothe, Erika
AU - Voigt, Kerstin
AU - Von Haeseler, Arndt
ID - 2411
IS - 5
JF - Molecular Biology and Evolution
TI - A consistent phylogenetic backbone for the fungi
VL - 29
ER -
TY - JOUR
AB - We investigate the first and second moments of shifted convolutions of the generalized divisor function d 3(n).
AU - Baier, Stephan
AU - Timothy Browning
AU - Marasingha, Gihan
AU - Zhao, Liangyi
ID - 242
IS - 3
JF - Proceedings of the Edinburgh Mathematical Society
TI - Averages of shifted convolutions of d3 (n)
VL - 55
ER -
TY - JOUR
AB - We investigate the solubility of the congruence xy ≡ 1 (mod p), where p is a prime and x, y are restricted to lie in suitable short intervals. Our work relies on a mean value theorem for incomplete Kloosterman sums.
AU - Timothy Browning
AU - Haynes, Alan K
ID - 244
IS - 2
JF - International Journal of Number Theory
TI - Incomplete kloosterman sums and multiplicative inverses in short intervals
VL - 9
ER -
TY - JOUR
AB - Coordinated, subcellular trafficking of proteins is one of the fundamental properties of the multicellular eukaryotic organisms. Trafficking involves a large diversity of compartments, pathways, cargo molecules, and vesicle-sorting events. It is also crucial in regulating the localization and, thus, the activity of various proteins, but the process is still poorly genetically defined in plants. In the past, forward genetics screens had been used to determine the function of genes by searching for a specific morphological phenotype in the organism population in which mutations had been induced chemically or by irradiation. Unfortunately, these straightforward genetic screens turned out to be limited in identifying new regulators of intracellular protein transport, because mutations affecting essential trafficking pathways often lead to lethality. In addition, the use of these approaches has been restricted by functional redundancy among trafficking regulators. Screens for mutants that rely on the observation of changes in the cellular localization or dynamics of fluorescent subcellular markers enable, at least partially, to circumvent these issues. Hence, such image-based screens provide the possibility to identify either alleles with weak effects or components of the subcellular trafficking machinery that have no strong impact on the plant growth.
AU - Zwiewka, Marta
AU - Friml, Jirí
ID - 2459
IS - May
JF - Frontiers in Plant Science
TI - Fluorescence imaging-based forward genetic screens to identify trafficking regulators in plants
VL - 3
ER -
TY - JOUR
AB - Background: Characterizing root system architecture (RSA) is essential to understanding the development and function of vascular plants. Identifying RSA-associated genes also represents an underexplored opportunity for crop improvement. Software tools are needed to accelerate the pace at which quantitative traits of RSA are estimated from images of root networks.Results: We have developed GiA Roots (General Image Analysis of Roots), a semi-automated software tool designed specifically for the high-throughput analysis of root system images. GiA Roots includes user-assisted algorithms to distinguish root from background and a fully automated pipeline that extracts dozens of root system phenotypes. Quantitative information on each phenotype, along with intermediate steps for full reproducibility, is returned to the end-user for downstream analysis. GiA Roots has a GUI front end and a command-line interface for interweaving the software into large-scale workflows. GiA Roots can also be extended to estimate novel phenotypes specified by the end-user.Conclusions: We demonstrate the use of GiA Roots on a set of 2393 images of rice roots representing 12 genotypes from the species Oryza sativa. We validate trait measurements against prior analyses of this image set that demonstrated that RSA traits are likely heritable and associated with genotypic differences. Moreover, we demonstrate that GiA Roots is extensible and an end-user can add functionality so that GiA Roots can estimate novel RSA traits. In summary, we show that the software can function as an efficient tool as part of a workflow to move from large numbers of root images to downstream analysis.
AU - Galkovskyi, Taras
AU - Mileyko, Yuriy
AU - Bucksch, Alexander
AU - Moore, Brad
AU - Symonova, Olga
AU - Price, Charles
AU - Topp, Chrostopher
AU - Iyer Pascuzzi, Anjali
AU - Zurek, Paul
AU - Fang, Suqin
AU - Harer, John
AU - Benfey, Philip
AU - Weitz, Joshua
ID - 492
JF - BMC Plant Biology
TI - GiA Roots: Software for the high throughput analysis of plant root system architecture
VL - 12
ER -
TY - JOUR
AB - The BCI competition IV stands in the tradition of prior BCI competitions that aim to provide high quality neuroscientific data for open access to the scientific community. As experienced already in prior competitions not only scientists from the narrow field of BCI compete, but scholars with a broad variety of backgrounds and nationalities. They include high specialists as well as students.The goals of all BCI competitions have always been to challenge with respect to novel paradigms and complex data. We report on the following challenges: (1) asynchronous data, (2) synthetic, (3) multi-class continuous data, (4) sessionto-session transfer, (5) directionally modulated MEG, (6) finger movements recorded by ECoG. As after past competitions, our hope is that winning entries may enhance the analysis methods of future BCIs.
AU - Tangermann, Michael
AU - Müller, Klaus
AU - Aertsen, Ad
AU - Birbaumer, Niels
AU - Braun, Christoph
AU - Brunner, Clemens
AU - Leeb, Robert
AU - Mehring, Carsten
AU - Miller, Kai
AU - Müller Putz, Gernot
AU - Nolte, Guido
AU - Pfurtscheller, Gert
AU - Preissl, Hubert
AU - Schalk, Gerwin
AU - Schlögl, Alois
AU - Vidaurre, Carmen
AU - Waldert, Stephan
AU - Blankertz, Benjamin
ID - 493
JF - Frontiers in Neuroscience
TI - Review of the BCI competition IV
VL - 6
ER -
TY - CONF
AB - An automaton with advice is a finite state automaton which has access to an additional fixed infinite string called an advice tape. We refine the Myhill-Nerode theorem to characterize the languages of finite strings that are accepted by automata with advice. We do the same for tree automata with advice.
AU - Kruckman, Alex
AU - Rubin, Sasha
AU - Sheridan, John
AU - Zax, Ben
ID - 495
T2 - Proceedings GandALF 2012
TI - A Myhill Nerode theorem for automata with advice
VL - 96
ER -
TY - CONF
AB - We study the expressive power of logical interpretations on the class of scattered trees, namely those with countably many infinite branches. Scattered trees can be thought of as the tree analogue of scattered linear orders. Every scattered tree has an ordinal rank that reflects the structure of its infinite branches. We prove, roughly, that trees and orders of large rank cannot be interpreted in scattered trees of small rank. We consider a quite general notion of interpretation: each element of the interpreted structure is represented by a set of tuples of subsets of the interpreting tree. Our trees are countable, not necessarily finitely branching, and may have finitely many unary predicates as labellings. We also show how to replace injective set-interpretations in (not necessarily scattered) trees by 'finitary' set-interpretations.
AU - Rabinovich, Alexander
AU - Rubin, Sasha
ID - 496
TI - Interpretations in trees with countably many branches
ER -
TY - CONF
AB - One central issue in the formal design and analysis of reactive systems is the notion of refinement that asks whether all behaviors of the implementation is allowed by the specification. The local interpretation of behavior leads to the notion of simulation. Alternating transition systems (ATSs) provide a general model for composite reactive systems, and the simulation relation for ATSs is known as alternating simulation. The simulation relation for fair transition systems is called fair simulation. In this work our main contributions are as follows: (1) We present an improved algorithm for fair simulation with Büchi fairness constraints; our algorithm requires O(n 3·m) time as compared to the previous known O(n 6)-time algorithm, where n is the number of states and m is the number of transitions. (2) We present a game based algorithm for alternating simulation that requires O(m2)-time as compared to the previous known O((n·m)2)-time algorithm, where n is the number of states and m is the size of transition relation. (3) We present an iterative algorithm for alternating simulation that matches the time complexity of the game based algorithm, but is more space efficient than the game based algorithm. © Krishnendu Chatterjee, Siddhesh Chaubal, and Pritish Kamath.
AU - Chatterjee, Krishnendu
AU - Chaubal, Siddhesh
AU - Kamath, Pritish
ID - 497
TI - Faster algorithms for alternating refinement relations
VL - 16
ER -
TY - JOUR
AB - Understanding patterns and correlates of local adaptation in heterogeneous landscapes can provide important information in the selection of appropriate seed sources for restoration. We assessed the extent of local adaptation of fitness components in 12 population pairs of the perennial herb Rutidosis leptorrhynchoides (Asteraceae) and examined whether spatial scale (0.7-600 km), environmental distance, quantitative (QST) and neutral (FST) genetic differentiation, and size of the local and foreign populations could predict patterns of adaptive differentiation. Local adaptation varied among populations and fitness components. Including all population pairs, local adaptation was observed for seedling survival, but not for biomass, while foreign genotype advantage was observed for reproduction (number of inflorescences). Among population pairs, local adaptation increased with QST and local population size for biomass. QST was associated with environmental distance, suggesting ecological selection for phenotypic divergence. However, low FST and variation in population structure in small populations demonstrates the interaction of gene flow and drift in constraining local adaptation in R. leptorrhynchoides. Our study indicates that for species in heterogeneous landscapes, collecting seed from large populations from similar environments to candidate sites is likely to provide the most appropriate seed sources for restoration.
AU - Pickup, Melinda
AU - Field, David
AU - Rowell, David
AU - Young, Andrew
ID - 498
IS - 8
JF - Evolutionary Applications
TI - Predicting local adaptation in fragmented plant populations: Implications for restoration genetics
VL - 5
ER -
TY - JOUR
AU - Sixt, Michael K
ID - 506
IS - 3
JF - Journal of Cell Biology
TI - Cell migration: Fibroblasts find a new way to get ahead
VL - 197
ER -
TY - GEN
AB - Two-player games on graphs are central in many problems in formal verification and program analysis such as synthesis and verification of open systems. In this work we consider solving recursive game graphs (or pushdown game graphs) that can model the control flow of sequential programs with recursion. While pushdown games have been studied before with qualitative objectives, such as reachability and ω-regular objectives, in this work we study for the first time such games with the most well-studied quantitative objective, namely, mean-payoff objectives. In pushdown games two types of strategies are relevant: (1) global strategies, that depend on the entire global history; and (2) modular strategies, that have only local memory and thus do not depend on the context of invocation, but only on the history of the current invocation of the module. Our main results are as follows: (1) One-player pushdown games with mean-payoff objectives under global strategies are decidable in polynomial time. (2) Two- player pushdown games with mean-payoff objectives under global strategies are undecidable. (3) One-player pushdown games with mean-payoff objectives under modular strategies are NP- hard. (4) Two-player pushdown games with mean-payoff objectives under modular strategies can be solved in NP (i.e., both one-player and two-player pushdown games with mean-payoff objectives under modular strategies are NP-complete). We also establish the optimal strategy complexity showing that global strategies for mean-payoff objectives require infinite memory even in one-player pushdown games; and memoryless modular strategies are sufficient in two- player pushdown games. Finally we also show that all the problems have the same complexity if the stack boundedness condition is added, where along with the mean-payoff objective the player must also ensure that the stack height is bounded.
AU - Chatterjee, Krishnendu
AU - Velner, Yaron
ID - 5377
SN - 2664-1690
TI - Mean-payoff pushdown games
ER -
TY - GEN
AB - One central issue in the formal design and analysis of reactive systems is the notion of refinement that asks whether all behaviors of the implementation is allowed by the specification. The local interpretation of behavior leads to the notion of simulation. Alternating transition systems (ATSs) provide a general model for composite reactive systems, and the simulation relation for ATSs is known as alternating simulation. The simulation relation for fair transition systems is called fair simulation. In this work our main contributions are as follows: (1) We present an improved algorithm for fair simulation with Büchi fairness constraints; our algorithm requires O(n3 · m) time as compared to the previous known O(n6)-time algorithm, where n is the number of states and m is the number of transitions. (2) We present a game based algorithm for alternating simulation that requires O(m2)-time as compared to the previous known O((n · m)2)-time algorithm, where n is the number of states and m is the size of transition relation. (3) We present an iterative algorithm for alternating simulation that matches the time complexity of the game based algorithm, but is more space efficient than the game based algorithm.
AU - Chatterjee, Krishnendu
AU - Chaubal, Siddhesh
AU - Kamath, Pritish
ID - 5378
SN - 2664-1690
TI - Faster algorithms for alternating refinement relations
ER -
TY - GEN
AB - We consider the problem of inference in agraphical model with binary variables. While in theory it is arguably preferable to compute marginal probabilities, in practice researchers often use MAP inference due to the availability of efficient discrete optimization algorithms. We bridge the gap between the two approaches by introducing the Discrete Marginals technique in which approximate marginals are obtained by minimizing an objective function with unary and pair-wise terms over a discretized domain. This allows the use of techniques originally devel-oped for MAP-MRF inference and learning. We explore two ways to set up the objective function - by discretizing the Bethe free energy and by learning it from training data. Experimental results show that for certain types of graphs a learned function can out-perform the Bethe approximation. We also establish a link between the Bethe free energy and submodular functions.
AU - Korc, Filip
AU - Kolmogorov, Vladimir
AU - Lampert, Christoph
ID - 5396
SN - 2664-1690
TI - Approximating marginals using discrete energy minimization
ER -