@inproceedings{2317, abstract = {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. }, author = {Frank, Rupert L and Hainzl, Christian and Robert Seiringer and Solovej, Jan P}, pages = {575 -- 583}, publisher = {World Scientific Publishing}, title = {{Microscopic derivation of the Ginzburg-Landau model}}, doi = {10.1142/9789814449243_0060}, year = {2012}, } @article{2318, abstract = {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. }, author = {Seiringer, Robert}, journal = {Journal of Spectral Theory}, number = {3}, pages = {321--328}, publisher = {European Mathematical Society}, title = {{Absence of bound states implies non-negativity of the scattering length}}, doi = {10.4171/JST/31}, volume = {2}, year = {2012}, } @article{2395, abstract = {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. }, author = {Frank, Rupert L and Hainzl, Christian and Robert Seiringer and Solovej, Jan P}, journal = {Journal of the American Mathematical Society}, number = {3}, pages = {667 -- 713}, publisher = {American Mathematical Society}, title = {{Microscopic derivation of Ginzburg-Landau theory}}, doi = {10.1090/S0894-0347-2012-00735-8}, volume = {25}, year = {2012}, } @article{2396, abstract = {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.}, author = {Landon, Benjamin and Robert Seiringer}, journal = {Letters in Mathematical Physics}, number = {3}, pages = {237 -- 243}, publisher = {Springer}, title = {{The scattering length at positive temperature}}, doi = {10.1007/s11005-012-0566-5}, volume = {100}, year = {2012}, } @article{2397, abstract = {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.}, author = {Hainzl, Christian and Robert Seiringer}, journal = {Letters in Mathematical Physics}, number = {2}, pages = {119 -- 138}, publisher = {Springer}, title = {{Low density limit of BCS theory and Bose-Einstein condensation of Fermion pairs}}, doi = {10.1007/s11005-011-0535-4}, volume = {100}, year = {2012}, } @misc{2398, abstract = {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.}, author = {Jakšić, Vojkan and Ogata, Yoshiko and Pillet, Claude A and Robert Seiringer}, booktitle = {Reviews in Mathematical Physics}, number = {6}, publisher = {World Scientific Publishing}, title = {{Quantum hypothesis testing and non-equilibrium statistical mechanics}}, doi = {10.1142/S0129055X12300026}, volume = {24}, year = {2012}, } @article{2400, abstract = {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.}, author = {Frank, Rupert L and Lieb, Élliott H and Robert Seiringer}, journal = {Communications in Mathematical Physics}, number = {2}, pages = {405 -- 424}, publisher = {Springer}, title = {{Binding of polarons and atoms at threshold}}, doi = {10.1007/s00220-012-1436-9}, volume = {313}, year = {2012}, } @article{2401, abstract = {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,∞].}, author = {Lieb, Élliott H and Robert Seiringer}, journal = {Journal of Statistical Physics}, number = {1}, pages = {86 -- 91}, publisher = {Springer}, title = {{Further implications of the Bessis-Moussa-Villani conjecture}}, doi = {10.1007/s10955-012-0585-8}, volume = {149}, year = {2012}, } @article{2402, abstract = {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.}, author = {Frank, Rupert L and Robert Seiringer}, journal = {Journal of Mathematical Physics}, number = {9}, publisher = {American Institute of Physics}, title = {{Lieb-Thirring inequality for a model of particles with point interactions}}, doi = {10.1063/1.3697416}, volume = {53}, year = {2012}, } @article{2403, abstract = {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.}, author = {Robert Seiringer and Yngvason, Jakob and Zagrebnov, Valentin A}, journal = {Journal of Statistical Mechanics Theory and Experiment}, number = {11}, publisher = {IOP Publishing Ltd.}, title = {{Disordered Bose-Einstein condensates with interaction in one dimension}}, doi = {10.1088/1742-5468/2012/11/P11007}, volume = {2012}, year = {2012}, } @article{2411, abstract = {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.}, author = {Ebersberger, Ingo and De Matos Simoes, Ricardo and Kupczok, Anne and Gube, Matthias and Kothe, Erika and Voigt, Kerstin and Von Haeseler, Arndt}, journal = {Molecular Biology and Evolution}, number = {5}, pages = {1319 -- 1334}, publisher = {Oxford University Press}, title = {{A consistent phylogenetic backbone for the fungi}}, doi = {10.1093/molbev/msr285}, volume = {29}, year = {2012}, } @article{242, abstract = {We investigate the first and second moments of shifted convolutions of the generalized divisor function d 3(n).}, author = {Baier, Stephan and Timothy Browning and Marasingha, Gihan and Zhao, Liangyi}, journal = {Proceedings of the Edinburgh Mathematical Society}, number = {3}, pages = {551 -- 576}, publisher = {Cambridge University Press}, title = {{Averages of shifted convolutions of d3 (n)}}, doi = {10.1017/S001309151100037X}, volume = {55}, year = {2012}, } @article{492, abstract = {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.}, author = {Galkovskyi, Taras and Mileyko, Yuriy and Bucksch, Alexander and Moore, Brad and Symonova, Olga and Price, Charles and Topp, Chrostopher and Iyer Pascuzzi, Anjali and Zurek, Paul and Fang, Suqin and Harer, John and Benfey, Philip and Weitz, Joshua}, journal = {BMC Plant Biology}, publisher = {BioMed Central}, title = {{GiA Roots: Software for the high throughput analysis of plant root system architecture}}, doi = {10.1186/1471-2229-12-116}, volume = {12}, year = {2012}, } @article{493, abstract = {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.}, author = {Tangermann, Michael and Müller, Klaus and Aertsen, Ad and Birbaumer, Niels and Braun, Christoph and Brunner, Clemens and Leeb, Robert and Mehring, Carsten and Miller, Kai and Müller Putz, Gernot and Nolte, Guido and Pfurtscheller, Gert and Preissl, Hubert and Schalk, Gerwin and Schlögl, Alois and Vidaurre, Carmen and Waldert, Stephan and Blankertz, Benjamin}, journal = {Frontiers in Neuroscience}, publisher = {Frontiers Research Foundation}, title = {{Review of the BCI competition IV}}, doi = {10.3389/fnins.2012.00055}, volume = {6}, year = {2012}, } @inproceedings{495, abstract = {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.}, author = {Kruckman, Alex and Rubin, Sasha and Sheridan, John and Zax, Ben}, booktitle = {Proceedings GandALF 2012}, location = {Napoli, Italy}, pages = {238 -- 246}, publisher = {Open Publishing Association}, title = {{A Myhill Nerode theorem for automata with advice}}, doi = {10.4204/EPTCS.96.18}, volume = {96}, year = {2012}, } @inproceedings{496, abstract = {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.}, author = {Rabinovich, Alexander and Rubin, Sasha}, location = {Dubrovnik, Croatia}, publisher = {IEEE}, title = {{Interpretations in trees with countably many branches}}, doi = {10.1109/LICS.2012.65}, year = {2012}, } @inproceedings{497, abstract = {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.}, author = {Chatterjee, Krishnendu and Chaubal, Siddhesh and Kamath, Pritish}, location = {Fontainebleau, France}, pages = {167 -- 182}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Faster algorithms for alternating refinement relations}}, doi = {10.4230/LIPIcs.CSL.2012.167}, volume = {16}, year = {2012}, } @article{498, abstract = {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.}, author = {Pickup, Melinda and Field, David and Rowell, David and Young, Andrew}, journal = {Evolutionary Applications}, number = {8}, pages = {913 -- 924}, publisher = {Wiley-Blackwell}, title = {{Predicting local adaptation in fragmented plant populations: Implications for restoration genetics}}, doi = {10.1111/j.1752-4571.2012.00284.x}, volume = {5}, year = {2012}, } @article{506, author = {Sixt, Michael K}, journal = {Journal of Cell Biology}, number = {3}, pages = {347 -- 349}, publisher = {Rockefeller University Press}, title = {{Cell migration: Fibroblasts find a new way to get ahead}}, doi = {10.1083/jcb.201204039}, volume = {197}, year = {2012}, } @misc{5377, abstract = {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.}, author = {Chatterjee, Krishnendu and Velner, Yaron}, issn = {2664-1690}, pages = {33}, publisher = {IST Austria}, title = {{Mean-payoff pushdown games}}, doi = {10.15479/AT:IST-2012-0002}, year = {2012}, }