@inproceedings{2323,
  abstract     = {Since the first experimental realization of Bose-Einstein condensation in cold atomic gases in 1995 there has been a surge of activity in this field. Ingenious experiments have allowed us to probe matter close to zero temperature and reveal some of the fascinating effects quantum mechanics has bestowed on nature. It is a challenge for mathematical physicists to understand these various phenomena from first principles, that is, starting from the underlying many-body Schrödinger equation. Recent progress in this direction concerns mainly equilibrium properties of dilute, cold quantum gases. We shall explain some of the results in this article, and describe the mathematics involved in understanding these phenomena. Topics include the ground state energy and the free energy at positive temperature, the effect of interparticle interaction on the critical temperature for Bose-Einstein condensation, as well as the occurrence of superfluidity and quantized vortices in rapidly rotating gases.},
  author       = {Robert Seiringer},
  pages        = {231 -- 245},
  publisher    = {World Scientific Publishing},
  title        = {{Hot topics on cold gases}},
  doi          = {10.1142/9789814304634_0013},
  year         = {2010},
}

@inbook{2324,
  abstract     = {We determine the sharp constant in the Hardy inequality for fractional Sobolev spaces on half-spaces. Our proof relies on a nonlinear and nonlocal version of the ground state representation.},
  author       = {Frank, Rupert L and Robert Seiringer},
  booktitle    = {Around the Research of Vladimir Maz'ya I},
  pages        = {161 -- 167},
  publisher    = {Springer},
  title        = {{Sharp fractional Hardy inequalities in half-spaces}},
  doi          = {10.1007/978-1-4419-1341-8_6},
  volume       = {11},
  year         = {2010},
}

@article{2389,
  abstract     = {We study the eigenvalues of Schrödinger type operators T + λV and their asymptotic behavior in the small coupling limit λ → 0, in the case where the symbol of the kinetic energy, T (p), strongly degenerates on a non-trivial manifold of codimension one.},
  author       = {Hainzl, Christian and Robert Seiringer},
  journal      = {Mathematische Nachrichten},
  number       = {3},
  pages        = {489 -- 499},
  publisher    = {Wiley-Blackwell},
  title        = {{Asymptotic behavior of eigenvalues of Schrödinger type operators with degenerate kinetic energy}},
  doi          = {10.1002/mana.200810195},
  volume       = {283},
  year         = {2010},
}

@article{2392,
  abstract     = {The binding of polarons, or its absence, is an old and subtle topic. Here we prove two things rigorously. First, the transition from many-body collapse to the existence of a thermodynamic limit for N polarons occurs precisely at U=2α, where U is the electronic Coulomb repulsion and α is the polaron coupling constant. Second, if U is large enough, there is no multipolaron binding of any kind. Considering the known fact that there is binding for some U>2α, these conclusions are not obvious and their proof has been an open problem for some time.},
  author       = {Frank, Rupert L and Lieb, Élliott H and Robert Seiringer and Thomas, Lawrence E},
  journal      = {Physical Review Letters},
  number       = {21},
  publisher    = {American Physical Society},
  title        = {{Bipolaron and N-polaron binding energies}},
  doi          = {10.1103/PhysRevLett.104.210402},
  volume       = {104},
  year         = {2010},
}

@article{2409,
  abstract     = {Background: The availability of many gene alignments with overlapping taxon sets raises the question of which strategy is the best to infer species phylogenies from multiple gene information. Methods and programs abound that use the gene alignment in different ways to reconstruct the species tree. In particular, different methods combine the original data at different points along the way from the underlying sequences to the final tree. Accordingly, they are classified into superalignment, supertree and medium-level approaches. Here, we present a simulation study to compare different methods from each of these three approaches.

Results: We observe that superalignment methods usually outperform the other approaches over a wide range of parameters including sparse data and gene-specific evolutionary parameters. In the presence of high incongruency among gene trees, however, other combination methods show better performance than the superalignment approach. Surprisingly, some supertree and medium-level methods exhibit, on average, worse results than a single gene phylogeny with complete taxon information.

Conclusions: For some methods, using the reconstructed gene tree as an estimation of the species tree is superior to the combination of incomplete information. Superalignment usually performs best since it is less susceptible to stochastic error. Supertree methods can outperform superalignment in the presence of gene-tree conflict.},
  author       = {Kupczok, Anne and Schmidt, Heiko and Von Haeseler, Arndt},
  journal      = {Algorithms for Molecular Biology},
  number       = {1},
  publisher    = {BioMed Central},
  title        = {{Accuracy of phylogeny reconstruction methods combining overlapping gene data sets }},
  doi          = {10.1186/1748-7188-5-37},
  volume       = {5},
  year         = {2010},
}

@article{7078,
  abstract     = {We report resonant ultrasound spectroscopy (RUS), dilatometry/magnetostriction, magnetotransport, magnetization, specific-heat, and 119Sn Mössbauer spectroscopy measurements on SnTe and Sn0.995Cr0.005Te. Hall measurements at T=77 K indicate that our Bridgman-grown single crystals have a p-type carrier concentration of 3.4×1019 cm−3 and that our Cr-doped crystals have an n-type concentration of 5.8×1022 cm−3. Although our SnTe crystals are diamagnetic over the temperature range 2≤T≤1100 K, the Cr-doped crystals are room-temperature ferromagnets with a Curie temperature of 294 K. For each sample type, three-terminal capacitive dilatometry measurements detect a subtle 0.5 μm distortion at Tc≈85 K. Whereas our RUS measurements on SnTe show elastic hardening near the structural transition, pointing to co-elastic behavior, similar measurements on Sn0.995Cr0.005Te show a pronounced softening, pointing to ferroelastic behavior. Effective Debye temperature, θD, values of SnTe obtained from 119Sn Mössbauer studies show a hardening of phonons in the range 60–115 K (θD=162 K) as compared with the 100–300 K range (θD=150 K). In addition, a precursor softening extending over approximately 100 K anticipates this collapse at the critical temperature and quantitative analysis over three decades of its reduced modulus finds ΔC44/C44=A|(T−T0)/T0|−κ with κ=0.50±0.02, a value indicating a three-dimensional softening of phonon branches at a temperature T0∼75 K, considerably below Tc. We suggest that the differences in these two types of elastic behaviors lie in the absence of elastic domain-wall motion in the one case and their nucleation in the other.},
  author       = {Salje, E. K. H. and Safarik, D. J. and Modic, Kimberly A and Gubernatis, J. E. and Cooley, J. C. and Taylor, R. D. and Mihaila, B. and Saxena, A. and Lookman, T. and Smith, J. L. and Fisher, R. A. and Pasternak, M. and Opeil, C. P. and Siegrist, T. and Littlewood, P. B. and Lashley, J. C.},
  issn         = {1098-0121},
  journal      = {Physical Review B},
  number       = {18},
  publisher    = {APS},
  title        = {{Tin telluride: A weakly co-elastic metal}},
  doi          = {10.1103/physrevb.82.184112},
  volume       = {82},
  year         = {2010},
}

@inproceedings{488,
  abstract     = {Streaming string transducers [1] define (partial) functions from input strings to output strings. A streaming string transducer makes a single pass through the input string and uses a finite set of variables that range over strings from the output alphabet. At every step, the transducer processes an input symbol, and updates all the variables in parallel using assignments whose right-hand-sides are concatenations of output symbols and variables with the restriction that a variable can be used at most once in a right-hand-side expression. It has been shown that streaming string transducers operating on strings over infinite data domains are of interest in algorithmic verification of list-processing programs, as they lead to PSPACE decision procedures for checking pre/post conditions and for checking semantic equivalence, for a well-defined class of heap-manipulating programs. In order to understand the theoretical expressiveness of streaming transducers, we focus on streaming transducers processing strings over finite alphabets, given the existence of a robust and well-studied class of "regular" transductions for this case. Such regular transductions can be defined either by two-way deterministic finite-state transducers, or using a logical MSO-based characterization. Our main result is that the expressiveness of streaming string transducers coincides exactly with this class of regular transductions. },
  author       = {Alur, Rajeev and Cerny, Pavol},
  location     = {Chennai, India},
  pages        = {1 -- 12},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  title        = {{Expressiveness of streaming string transducers}},
  doi          = {10.4230/LIPIcs.FSTTCS.2010.1},
  volume       = {8},
  year         = {2010},
}

@inproceedings{489,
  abstract     = {Graph games of infinite length are a natural model for open reactive processes: one player represents the controller, trying to ensure a given specification, and the other represents a hostile environment. The evolution of the system depends on the decisions of both players, supplemented by chance. In this work, we focus on the notion of randomised strategy. More specifically, we show that three natural definitions may lead to very different results: in the most general cases, an almost-surely winning situation may become almost-surely losing if the player is only allowed to use a weaker notion of strategy. In more reasonable settings, translations exist, but they require infinite memory, even in simple cases. Finally, some traditional problems becomes undecidable for the strongest type of strategies.},
  author       = {Cristau, Julien and David, Claire and Horn, Florian},
  booktitle    = {Proceedings of GandALF 2010},
  location     = {Minori, Amalfi Coast, Italy},
  pages        = {30 -- 39},
  publisher    = {Open Publishing Association},
  title        = {{How do we remember the past in randomised strategies? }},
  doi          = {10.4204/EPTCS.25.7},
  volume       = {25},
  year         = {2010},
}

@misc{5388,
  abstract     = {We present an algorithmic method for the synthesis of concurrent programs that are optimal with respect to quantitative performance measures. The input consists of a sequential sketch, that is, a program that does not contain synchronization constructs, and of a parametric performance model that assigns costs to actions such as locking, context switching, and idling. The quantitative synthesis problem is to automatically introduce synchronization constructs into the sequential sketch so that both correctness is guaranteed and worst-case (or average-case) performance is optimized. Correctness is formalized as race freedom or linearizability.

We show that for worst-case performance, the problem can be modeled
as a 2-player graph game with quantitative (limit-average) objectives, and
for average-case performance, as a 2 1/2 -player graph game (with probabilistic transitions). In both cases, the optimal correct program is derived from an optimal strategy in the corresponding quantitative game. We prove that the respective game problems are computationally expensive (NP-complete), and present several techniques that overcome the theoretical difficulty in cases of concurrent programs of practical interest.

We have implemented a prototype tool and used it for the automatic syn- thesis of programs that access a concurrent list. For certain parameter val- ues, our method automatically synthesizes various classical synchronization schemes for implementing a concurrent list, such as fine-grained locking or a lazy algorithm. For other parameter values, a new, hybrid synchronization style is synthesized, which uses both the lazy approach and coarse-grained locks (instead of standard fine-grained locks). The trade-off occurs because while fine-grained locking tends to decrease the cost that is due to waiting for locks, it increases cache size requirements.},
  author       = {Chatterjee, Krishnendu and Cerny, Pavol and Henzinger, Thomas A and Radhakrishna, Arjun and Singh, Rohit},
  issn         = {2664-1690},
  pages        = {17},
  publisher    = {IST Austria},
  title        = {{Quantitative synthesis for concurrent programs}},
  doi          = {10.15479/AT:IST-2010-0004},
  year         = {2010},
}

@misc{5389,
  abstract     = {Boolean notions of correctness are formalized by preorders on systems. Quantitative measures of correctness can be formalized by real-valued distance functions between systems, where the distance between implementation and specification provides a measure of “fit” or “desirability.” We extend the simulation preorder to the quantitative setting, by making each player of a simulation game pay a certain price for her choices. We use the resulting games with quantitative objectives to define three different simulation distances. The correctness distance measures how much the specification must be changed in order to be satisfied by the implementation. The coverage distance measures how much the im- plementation restricts the degrees of freedom offered by the specification. The robustness distance measures how much a system can deviate from the implementation description without violating the specification. We consider these distances for safety as well as liveness specifications. The distances can be computed in polynomial time for safety specifications, and for liveness specifications given by weak fairness constraints. We show that the distance functions satisfy the triangle inequality, that the distance between two systems does not increase under parallel composition with a third system, and that the distance between two systems can be bounded from above and below by distances between abstractions of the two systems. These properties suggest that our simulation distances provide an appropriate basis for a quantitative theory of discrete systems. We also demonstrate how the robustness distance can be used to measure how many transmission errors are tolerated by error correcting codes.},
  author       = {Cerny, Pavol and Henzinger, Thomas A and Radhakrishna, Arjun},
  issn         = {2664-1690},
  pages        = {24},
  publisher    = {IST Austria},
  title        = {{Simulation distances}},
  doi          = {10.15479/AT:IST-2010-0003},
  year         = {2010},
}

@misc{5390,
  abstract     = {The class of ω regular languages provide a robust specification language in verification. Every ω-regular condition can be decomposed into a safety part and a liveness part. The liveness part ensures that something good happens “eventually.” Two main strengths of the classical, infinite-limit formulation of liveness are robustness (independence from the granularity of transitions) and simplicity (abstraction of complicated time bounds). However, the classical liveness formulation suffers from the drawback that the time until something good happens may be unbounded. A stronger formulation of liveness, so-called finitary liveness, overcomes this drawback, while still retaining robustness and simplicity. Finitary liveness requires that there exists an unknown, fixed bound b such that something good happens within b transitions. In this work we consider the finitary parity and Streett (fairness) conditions. We present the topological, automata-theoretic and logical characterization of finitary languages defined by finitary parity and Streett conditions. We (a) show that the finitary parity and Streett languages are Σ2-complete; (b) present a complete characterization of the expressive power of various classes of automata with finitary and infinitary conditions (in particular we show that non-deterministic finitary parity and Streett automata cannot be determinized to deterministic finitary parity or Streett automata); and (c) show that the languages defined by non-deterministic finitary parity automata exactly characterize the star-free fragment of ωB-regular languages.},
  author       = {Chatterjee, Krishnendu and Fijalkow, Nathanaël},
  issn         = {2664-1690},
  pages        = {21},
  publisher    = {IST Austria},
  title        = {{Topological, automata-theoretic and logical characterization of finitary languages}},
  doi          = {10.15479/AT:IST-2010-0002},
  year         = {2010},
}

@misc{5391,
  abstract     = {Concurrent data structures with fine-grained synchronization are notoriously difficult to implement correctly. The difficulty of reasoning about these implementations does not stem from the number of variables or the program size, but rather from the large number of possible interleavings. These implementations are therefore prime candidates for model checking. We introduce an algorithm for verifying linearizability of singly-linked heap-based concurrent data structures. We consider a model consisting of an unbounded heap where each node consists an element from an unbounded data domain, with a restricted set of operations for testing and updating pointers and data elements. Our main result is that linearizability is decidable for programs that invoke a fixed number of methods, possibly in parallel. This decidable fragment covers many of the common implementation techniques — fine-grained locking, lazy synchronization, and lock-free synchronization. We also show how the technique can be used to verify optimistic implementations with the help of programmer annotations. We developed a verification tool CoLT and evaluated it on a representative sample of Java implementations of the concurrent set data structure. The tool verified linearizability of a number of implementations, found a known error in a lock-free imple- mentation and proved that the corrected version is linearizable.},
  author       = {Cerny, Pavol and Radhakrishna, Arjun and Zufferey, Damien and Chaudhuri, Swarat and Alur, Rajeev},
  issn         = {2664-1690},
  pages        = {27},
  publisher    = {IST Austria},
  title        = {{Model checking of linearizability of concurrent list implementations}},
  doi          = {10.15479/AT:IST-2010-0001},
  year         = {2010},
}

@article{598,
  abstract     = {It is not well understood how the human Mediator complex, transcription factor IIH and RNA polymerase II (Pol II) work together with activators to initiate transcription. Activator binding alters Mediator structure, yet the functional consequences of such structural shifts remain unknown. The p53 C terminus and its activation domain interact with different Mediator subunits, and we find that each interaction differentially affects Mediator structure; strikingly, distinct p53-Mediator structures differentially affect Pol II activity. Only the p53 activation domain induces the formation of a large pocket domain at the Mediator-Pol II interaction site, and this correlates with activation of stalled Pol II to a productively elongating state. Moreover, we define a Mediator requirement for TFIIH-dependent Pol II C-terminal domain phosphorylation and identify substantial differences in Pol II C-terminal domain processing that correspond to distinct p53-Mediator structural states. Our results define a fundamental mechanism by which p53 activates transcription and suggest that Mediator structural shifts trigger activation of stalled Pol II complexes.},
  author       = {Meyer, Krista and Lin, Shih and Bernecky, Carrie A and Gao, Yuefeng and Taatjes, Dylan},
  journal      = {Nature Structural and Molecular Biology},
  number       = {6},
  pages        = {753 -- 760},
  publisher    = {Nature Publishing Group},
  title        = {{P53 activates transcription by directing structural shifts in Mediator}},
  doi          = {10.1038/nsmb.1816},
  volume       = {17},
  year         = {2010},
}

@article{6142,
  abstract     = {Defining the mutational landscape when individuals of a species grow separately and diverge over many generations can provide insights into trait evolution. A specific example of this involves studying changes associated with domestication where different lines of the same wild stock have been cultivated independently in different standard environments. Whole genome sequence comparison of such lines permits estimation of mutation rates, inference of genes' ancestral states and ancestry of existing strains, and correction of sequencing errors in genome databases. Here we study domestication of the C. elegans Bristol strain as a model, and report the genome sequence of LSJ1 (Bristol), a sibling of the standard C. elegans reference wild type N2 (Bristol). The LSJ1 and N2 lines were cultivated separately from shortly after the Bristol strain was isolated until methods to freeze C. elegans were developed. We find that during this time the two strains have accumulated 1208 genetic differences. We describe phenotypic variation between N2 and LSJ1 in the rate at which embryos develop, the rate of production of eggs, the maturity of eggs at laying, and feeding behavior, all the result of post-isolation changes. We infer the ancestral alleles in the original Bristol isolate and highlight 2038 likely sequencing errors in the original N2 reference genome sequence. Many of these changes modify genome annotation. Our study provides a starting point to further investigate genotype-phenotype association and offers insights into the process of selection as a result of laboratory domestication.},
  author       = {Weber, Katherine P. and De, Subhajyoti and Kozarewa, Iwanka and Turner, Daniel J. and Babu, M. Madan and de Bono, Mario},
  issn         = {1932-6203},
  journal      = {PLoS ONE},
  number       = {11},
  publisher    = {Public Library of Science},
  title        = {{Whole genome sequencing highlights genetic changes associated with laboratory domestication of C. elegans}},
  doi          = {10.1371/journal.pone.0013922},
  volume       = {5},
  year         = {2010},
}

@article{6320,
  abstract     = {We study the average order of the divisor function, as it ranges over the values of binary quartic forms that are reducible over ℚ.},
  author       = {Bretèche, Régis de la and Browning, Timothy D},
  journal      = {Crelles Journal},
  number       = {646},
  pages        = {1--44},
  publisher    = {Walter de Gruyter GmbH},
  title        = {{Le problème des diviseurs pour des formes binaires de degré 4}},
  doi          = {10.1515/crelle.2010.064},
  volume       = {2010},
  year         = {2010},
}

@article{1465,
  abstract     = {We prove a generating function formula for the Betti numbers of Nakajima quiver varieties. We prove that it is a q-deformation of the Weyl-Kac character formula. In particular this implies that the constant term of the polynomial counting the number of absolutely indecomposable representations of a quiver equals the multiplicity of a certain weight in the corresponding Kac-Moody algebra, which was conjectured by Kac in 1982.},
  author       = {Tamas Hausel},
  journal      = {Inventiones Mathematicae},
  number       = {1},
  pages        = {21 -- 37},
  publisher    = {Springer},
  title        = {{Kac's conjecture from Nakajima quiver varieties}},
  doi          = {10.1007/s00222-010-0241-3},
  volume       = {181},
  year         = {2010},
}

@article{1466,
  abstract     = {In Hausel et al. (2008) [10] we presented a conjecture generalizing the Cauchy formula for Macdonald polynomial. This conjecture encodes the mixed Hodge polynomials of the character varieties of representations of the fundamental group of a punctured Riemann surface of genus g. We proved several results which support this conjecture. Here we announce new results which are consequences of those in Hausel et al. (2008) [10].},
  author       = {Tamas Hausel and Letellier, Emmanuel and Rodríguez Villegas, Fernando},
  journal      = {Comptes Rendus Mathematique},
  number       = {3-4},
  pages        = {131 -- 135},
  publisher    = {Elsevier},
  title        = {{Topology of character varieties and representations of quivers}},
  doi          = {10.1016/j.crma.2010.01.025},
  volume       = {348},
  year         = {2010},
}

@inbook{1468,
  abstract     = {This chapter surveys the motivations, related results, and progress made towards the following problem, raised by Hitchin in 1995: What is the space of L2 harmonic forms on the moduli space of Higgs bundles on a Riemann surface?},
  author       = {Tamas Hausel},
  booktitle    = {The Many Facets of Geometry: A Tribute to Nigel Hitchin},
  publisher    = {Oxford University Press},
  title        = {{S-Duality in HyperkäHler Hodge Theory}},
  doi          = {10.1093/acprof:oso/9780199534920.003.0016},
  year         = {2010},
}

@article{13409,
  abstract     = {The immobilization of molecular switches onto inorganic supports has recently become a hot topic as it can give rise to novel hybrid materials in which the properties of the two components are mutually enhanced. Even more attractive is the concept of “transferring” the switchable characteristics of single layers of organic molecules onto the underlying inorganic components, rendering them responsive to external stimuli as well. Of the various molecular switches studied, azobenzene (AB) has arguably attracted most attention due to its simple molecular structure, and because its “trigger” (light) is a noninvasive one, it can be delivered instantaneously, and into a precise location. In order to fully realize its potential, however, it is necessary to immobilize AB onto solid supports. It is the goal of this manuscript to comprehensively yet concisely review such hybrid systems which comprise AB forming well-defined self-assembled monolayers (SAMs) on planar and curved (colloidal and nanoporous) inorganic surfaces. I discuss methods to immobilize AB derivatives onto surfaces, strategies to ensure efficient AB isomerization, ways to monitor the switching process, properties of these switchable hybrid materials, and, last but not least, their emerging applications.},
  author       = {Klajn, Rafal},
  issn         = {1365-3075},
  journal      = {Pure and Applied Chemistry},
  keywords     = {General Chemical Engineering, General Chemistry},
  number       = {12},
  pages        = {2247--2279},
  publisher    = {De Gruyter},
  title        = {{Immobilized azobenzenes for the construction of photoresponsive materials}},
  doi          = {10.1351/pac-con-10-09-04},
  volume       = {82},
  year         = {2010},
}

@article{9012,
  abstract     = {In this Letter, we characterize experimentally the diffusiophoretic motion of colloids and λ-DNA toward higher concentration of solutes, using microfluidic technology to build spatially and temporally controlled concentration gradients. We then demonstrate that segregation and spatial patterning of the particles can be achieved from temporal variations of the solute concentration profile. This segregation takes the form of a strong trapping potential, stemming from an osmotically induced rectification mechanism of the solute time-dependent variations. Depending on the spatial and temporal symmetry of the solute signal, localization patterns with various shapes can be achieved. These results highlight the role of solute contrasts in out-of-equilibrium processes occurring in soft matter.},
  author       = {Palacci, Jérémie A and Abécassis, Benjamin and Cottin-Bizonne, Cécile and Ybert, Christophe and Bocquet, Lydéric},
  issn         = {10797114},
  journal      = {Physical Review Letters},
  number       = {13},
  publisher    = {American Physical Society},
  title        = {{Colloidal motility and pattern formation under rectified diffusiophoresis}},
  doi          = {10.1103/physrevlett.104.138302},
  volume       = {104},
  year         = {2010},
}