@article{1490,
  abstract     = {To induce adaptive immunity, dendritic cells (DCs) migrate through afferent lymphatic vessels (LVs) to draining lymph nodes (dLNs). This process occurs in several consecutive steps. Upon entry into lymphatic capillaries, DCs first actively crawl into downstream collecting vessels. From there, they are next passively and rapidly transported to the dLN by lymph flow. Here, we describe a role for the chemokine CCL21 in intralymphatic DC crawling. Performing time-lapse imaging in murine skin, we found that blockade of CCL21-but not the absence of lymph flow-completely abolished DC migration from capillaries toward collecting vessels and reduced the ability of intralymphatic DCs to emigrate from skin. Moreover, we found that in vitro low laminar flow established a CCL21 gradient along lymphatic endothelial monolayers, thereby inducing downstream-directed DC migration. These findings reveal a role for intralymphatic CCL21 in promoting DC trafficking to dLNs, through the formation of a flow-induced gradient.},
  author       = {Russo, Erica and Teijeira, Alvaro and Vaahtomeri, Kari and Willrodt, Ann and Bloch, Joël and Nitschké, Maximilian and Santambrogio, Laura and Kerjaschki, Dontscho and Sixt, Michael K and Halin, Cornelia},
  journal      = {Cell Reports},
  number       = {7},
  pages        = {1723 -- 1734},
  publisher    = {Cell Press},
  title        = {{Intralymphatic CCL21 promotes tissue egress of dendritic cells through afferent lymphatic vessels}},
  doi          = {10.1016/j.celrep.2016.01.048},
  volume       = {14},
  year         = {2016},
}

@article{1491,
  abstract     = {We study the ground state of a trapped Bose gas, starting from the full many-body Schrödinger Hamiltonian, and derive the non-linear Schrödinger energy functional in the limit of a large particle number, when the interaction potential converges slowly to a Dirac delta function. Our method is based on quantitative estimates on the discrepancy between the full many-body energy and its mean-field approximation using Hartree states. These are proved using finite dimensional localization and a quantitative version of the quantum de Finetti theorem. Our approach covers the case of attractive interactions in the regime of stability. In particular, our main new result is a derivation of the 2D attractive non-linear Schrödinger ground state.},
  author       = {Lewin, Mathieu and Nam, Phan and Rougerie, Nicolas},
  journal      = {Transactions of the American Mathematical Society},
  number       = {9},
  pages        = {6131 -- 6157},
  publisher    = {American Mathematical Society},
  title        = {{The mean-field approximation and the non-linear Schrödinger functional for trapped Bose gases}},
  doi          = {10.1090/tran/6537},
  volume       = {368},
  year         = {2016},
}

@article{1492,
  abstract     = {To sustain a lifelong ability to initiate organs, plants retain pools of undifferentiated cells with a preserved prolif eration capacity. The root pericycle represents a unique tissue with conditional meristematic activity, and its tight control determines initiation of lateral organs. Here we show that the meristematic activity of the pericycle is constrained by the interaction with the adjacent endodermis. Release of these restraints by elimination of endo dermal cells by single-cell ablation triggers the pericycle to re-enter the cell cycle. We found that endodermis removal substitutes for the phytohormone auxin-dependent initiation of the pericycle meristematic activity. However, auxin is indispensable to steer the cell division plane orientation of new organ-defining divisions. We propose a dual, spatiotemporally distinct role for auxin during lateral root initiation. In the endodermis, auxin releases constraints arising from cell-to-cell interactions that compromise the pericycle meristematic activity, whereas, in the pericycle, auxin defines the orientation of the cell division plane to initiate lateral roots.},
  author       = {Marhavy, Peter and Montesinos López, Juan C and Abuzeineh, Anas and Van Damme, Daniël and Vermeer, Joop and Duclercq, Jérôme and Rakusova, Hana and Marhavá, Petra and Friml, Jirí and Geldner, Niko and Benková, Eva},
  journal      = {Genes and Development},
  number       = {4},
  pages        = {471 -- 483},
  publisher    = {Cold Spring Harbor Laboratory Press},
  title        = {{Targeted cell elimination reveals an auxin-guided biphasic mode of lateral root initiation}},
  doi          = {10.1101/gad.276964.115},
  volume       = {30},
  year         = {2016},
}

@article{1493,
  abstract     = {We introduce a new method for deriving the time-dependent Hartree or Hartree-Fock equations as an effective mean-field dynamics from the microscopic Schrödinger equation for fermionic many-particle systems in quantum mechanics. The method is an adaption of the method used in Pickl (Lett. Math. Phys. 97 (2) 151–164 2011) for bosonic systems to fermionic systems. It is based on a Gronwall type estimate for a suitable measure of distance between the microscopic solution and an antisymmetrized product state. We use this method to treat a new mean-field limit for fermions with long-range interactions in a large volume. Some of our results hold for singular attractive or repulsive interactions. We can also treat Coulomb interaction assuming either a mild singularity cutoff or certain regularity conditions on the solutions to the Hartree(-Fock) equations. In the considered limit, the kinetic and interaction energy are of the same order, while the average force is subleading. For some interactions, we prove that the Hartree(-Fock) dynamics is a more accurate approximation than a simpler dynamics that one would expect from the subleading force. With our method we also treat the mean-field limit coupled to a semiclassical limit, which was discussed in the literature before, and we recover some of the previous results. All results hold for initial data close (but not necessarily equal) to antisymmetrized product states and we always provide explicit rates of convergence.},
  author       = {Petrat, Sören P and Pickl, Peter},
  journal      = {Mathematical Physics, Analysis and Geometry},
  number       = {1},
  publisher    = {Springer},
  title        = {{A new method and a new scaling for deriving fermionic mean-field dynamics}},
  doi          = {10.1007/s11040-016-9204-2},
  volume       = {19},
  year         = {2016},
}

@article{1494,
  abstract     = {Turbulence is one of the most frequently encountered non-equilibrium phenomena in nature, yet characterizing the transition that gives rise to turbulence in basic shear flows has remained an elusive task. Although, in recent studies, critical points marking the onset of sustained turbulence have been determined for several such flows, the physical nature of the transition could not be fully explained. In extensive experimental and computational studies we show for the example of Couette flow that the onset of turbulence is a second-order phase transition and falls into the directed percolation universality class. Consequently, the complex laminar–turbulent patterns distinctive for the onset of turbulence in shear flows result from short-range interactions of turbulent domains and are characterized by universal critical exponents. More generally, our study demonstrates that even high-dimensional systems far from equilibrium such as turbulence exhibit universality at onset and that here the collective dynamics obeys simple rules.},
  author       = {Lemoult, Grégoire M and Shi, Liang and Avila, Kerstin and Jalikop, Shreyas V and Avila, Marc and Hof, Björn},
  journal      = {Nature Physics},
  number       = {3},
  pages        = {254 -- 258},
  publisher    = {Nature Publishing Group},
  title        = {{Directed percolation phase transition to sustained turbulence in Couette flow}},
  doi          = {10.1038/nphys3675},
  volume       = {12},
  year         = {2016},
}

@article{1496,
  abstract     = {The two-photon 1s2 2s 2p 3P0 1s22s2 1S0 transition in berylliumlike ions is theoretically investigated within a fully relativistic framework and a second-order perturbation theory. We focus our analysis on how electron correlation, as well as the negative-energy spectrum, can affect the forbidden E1M1 decay rate. For this purpose, we include the electronic correlation via an effective local potential and within a single configuration-state model. Due to its experimental interest, evaluations of decay rates are performed for berylliumlike xenon and uranium. We find that the negative-energy contribution can be neglected at the present level of accuracy in the evaluation of the decay rate. On the other hand, if contributions of electronic correlation are not carefully taken into account, it may change the lifetime of the metastable state by up to 20%. By performing a full-relativistic jj-coupling calculation, we found a decrease of the decay rate by two orders of magnitude compared to non-relativistic LS-coupling calculations, for the selected heavy ions.},
  author       = {Amaro, Pedro and Fratini, Filippo and Safari, Laleh and Machado, Jorge and Guerra, Mauro and Indelicato, Paul and Santos, José},
  journal      = {Physical Review A - Atomic, Molecular, and Optical Physics},
  number       = {3},
  publisher    = {American Physical Society},
  title        = {{Relativistic evaluation of the two-photon decay of the metastable 1s22s2p3P0 state in berylliumlike ions with an effective-potential model}},
  doi          = {10.1103/PhysRevA.93.032502},
  volume       = {93},
  year         = {2016},
}

@article{1518,
  abstract     = {The inference of demographic history from genome data is hindered by a lack of efficient computational approaches. In particular, it has proved difficult to exploit the information contained in the distribution of genealogies across the genome. We have previously shown that the generating function (GF) of genealogies can be used to analytically compute likelihoods of demographic models from configurations of mutations in short sequence blocks (Lohse et al. 2011). Although the GF has a simple, recursive form, the size of such likelihood calculations explodes quickly with the number of individuals and applications of this framework have so far been mainly limited to small samples (pairs and triplets) for which the GF can be written by hand. Here we investigate several strategies for exploiting the inherent symmetries of the coalescent. In particular, we show that the GF of genealogies can be decomposed into a set of equivalence classes that allows likelihood calculations from nontrivial samples. Using this strategy, we automated blockwise likelihood calculations for a general set of demographic scenarios in Mathematica. These histories may involve population size changes, continuous migration, discrete divergence, and admixture between multiple populations. To give a concrete example, we calculate the likelihood for a model of isolation with migration (IM), assuming two diploid samples without phase and outgroup information. We demonstrate the new inference scheme with an analysis of two individual butterfly genomes from the sister species Heliconius melpomene rosina and H. cydno.},
  author       = {Lohse, Konrad and Chmelik, Martin and Martin, Simon and Barton, Nicholas H},
  journal      = {Genetics},
  number       = {2},
  pages        = {775 -- 786},
  publisher    = {Genetics Society of America},
  title        = {{Efficient strategies for calculating blockwise likelihoods under the coalescent}},
  doi          = {10.1534/genetics.115.183814},
  volume       = {202},
  year         = {2016},
}

@article{1521,
  abstract     = {Complex I (NADH:ubiquinone oxidoreductase) plays a central role in cellular energy production, coupling electron transfer between NADH and quinone to proton translocation. It is the largest protein assembly of respiratory chains and one of the most elaborate redox membrane proteins known. Bacterial enzyme is about half the size of mitochondrial and thus provides its important &quot;minimal&quot; model. Dysfunction of mitochondrial complex I is implicated in many human neurodegenerative diseases. The L-shaped complex consists of a hydrophilic arm, where electron transfer occurs, and a membrane arm, where proton translocation takes place. We have solved the crystal structures of the hydrophilic domain of complex I from Thermus thermophilus, the membrane domain from Escherichia coli and recently of the intact, entire complex I from T. thermophilus (536. kDa, 16 subunits, 9 iron-sulphur clusters, 64 transmembrane helices). The 95. Å long electron transfer pathway through the enzyme proceeds from the primary electron acceptor flavin mononucleotide through seven conserved Fe-S clusters to the unusual elongated quinone-binding site at the interface with the membrane domain. Four putative proton translocation channels are found in the membrane domain, all linked by the central flexible axis containing charged residues. The redox energy of electron transfer is coupled to proton translocation by the as yet undefined mechanism proposed to involve long-range conformational changes. This article is part of a Special Issue entitled Respiratory complex I, edited by Volker Zickermann and Ulrich Brandt.},
  author       = {Berrisford, John and Baradaran, Rozbeh and Sazanov, Leonid A},
  journal      = {Biochimica et Biophysica Acta - Bioenergetics},
  number       = {7},
  pages        = {892 -- 901},
  publisher    = {Elsevier},
  title        = {{Structure of bacterial respiratory complex I}},
  doi          = {10.1016/j.bbabio.2016.01.012},
  volume       = {1857},
  year         = {2016},
}

@article{1522,
  abstract     = {We classify smooth Brunnian (i.e., unknotted on both components) embeddings (S2 × S1) ⊔ S3 → ℝ6. Any Brunnian embedding (S2 × S1) ⊔ S3 → ℝ6 is isotopic to an explicitly constructed embedding fk,m,n for some integers k, m, n such that m ≡ n (mod 2). Two embeddings fk,m,n and fk′ ,m′,n′ are isotopic if and only if k = k′, m ≡ m′ (mod 2k) and n ≡ n′ (mod 2k). We use Haefliger’s classification of embeddings S3 ⊔ S3 → ℝ6 in our proof. The relation between the embeddings (S2 × S1) ⊔ S3 → ℝ6 and S3 ⊔ S3 → ℝ6 is not trivial, however. For example, we show that there exist embeddings f: (S2 ×S1) ⊔ S3 → ℝ6 and g, g′ : S3 ⊔ S3 → ℝ6 such that the componentwise embedded connected sum f # g is isotopic to f # g′ but g is not isotopic to g′.},
  author       = {Avvakumov, Serhii},
  issn         = {1609-4514},
  journal      = {Moscow Mathematical Journal},
  number       = {1},
  pages        = {1 -- 25},
  publisher    = {Independent University of Moscow},
  title        = {{The classification of certain linked 3-manifolds in 6-space}},
  doi          = {10.17323/1609-4514-2016-16-1-1-25},
  volume       = {16},
  year         = {2016},
}

@article{1523,
  abstract     = {For random graphs, the containment problem considers the probability that a binomial random graph G(n, p) contains a given graph as a substructure. When asking for the graph as a topological minor, i.e., for a copy of a subdivision of the given graph, it is well known that the (sharp) threshold is at p = 1/n. We consider a natural analogue of this question for higher-dimensional random complexes Xk(n, p), first studied by Cohen, Costa, Farber and Kappeler for k = 2. Improving previous results, we show that p = Θ(1/ √n) is the (coarse) threshold for containing a subdivision of any fixed complete 2-complex. For higher dimensions k &gt; 2, we get that p = O(n−1/k) is an upper bound for the threshold probability of containing a subdivision of a fixed k-dimensional complex.},
  author       = {Gundert, Anna and Wagner, Uli},
  journal      = {Proceedings of the American Mathematical Society},
  number       = {4},
  pages        = {1815 -- 1828},
  publisher    = {American Mathematical Society},
  title        = {{On topological minors in random simplicial complexes}},
  doi          = {10.1090/proc/12824},
  volume       = {144},
  year         = {2016},
}

@inproceedings{1524,
  abstract     = {When designing genetic circuits, the typical primitives used in major existing modelling formalisms are gene interaction graphs, where edges between genes denote either an activation or inhibition relation. However, when designing experiments, it is important to be precise about the low-level mechanistic details as to how each such relation is implemented. The rule-based modelling language Kappa allows to unambiguously specify mechanistic details such as DNA binding sites, dimerisation of transcription factors, or co-operative interactions. Such a detailed description comes with complexity and computationally costly executions. We propose a general method for automatically transforming a rule-based program, by eliminating intermediate species and adjusting the rate constants accordingly. To the best of our knowledge, we show the first automated reduction of rule-based models based on equilibrium approximations.
Our algorithm is an adaptation of an existing algorithm, which was designed for reducing reaction-based programs; our version of the algorithm scans the rule-based Kappa model in search for those interaction patterns known to be amenable to equilibrium approximations (e.g. Michaelis-Menten scheme). Additional checks are then performed in order to verify if the reduction is meaningful in the context of the full model. The reduced model is efficiently obtained by static inspection over the rule-set. The tool is tested on a detailed rule-based model of a λ-phage switch, which lists 92 rules and 13 agents. The reduced model has 11 rules and 5 agents, and provides a dramatic reduction in simulation time of several orders of magnitude.},
  author       = {Beica, Andreea and Guet, Calin C and Petrov, Tatjana},
  location     = {Madrid, Spain},
  pages        = {173 -- 191},
  publisher    = {Springer},
  title        = {{Efficient reduction of kappa models by static inspection of the rule-set}},
  doi          = {10.1007/978-3-319-26916-0_10},
  volume       = {9271},
  year         = {2016},
}

@inproceedings{1526,
  abstract     = {We present the first study of robustness of systems that are both timed as well as reactive (I/O). We study the behavior of such timed I/O systems in the presence of uncertain inputs and formalize their robustness using the analytic notion of Lipschitz continuity: a timed I/O system is K-(Lipschitz) robust if the perturbation in its output is at most K times the perturbation in its input. We quantify input and output perturbation using similarity functions over timed words such as the timed version of the Manhattan distance and the Skorokhod distance. We consider two models of timed I/O systems — timed transducers and asynchronous sequential circuits. We show that K-robustness of timed transducers can be decided in polynomial space under certain conditions. For asynchronous sequential circuits, we reduce K-robustness w.r.t. timed Manhattan distances to K-robustness of discrete letter-to-letter transducers and show PSpace-completeness of the problem.},
  author       = {Henzinger, Thomas A and Otop, Jan and Samanta, Roopsha},
  location     = {St. Petersburg, FL, USA},
  pages        = {250 -- 267},
  publisher    = {Springer},
  title        = {{Lipschitz robustness of timed I/O systems}},
  doi          = {10.1007/978-3-662-49122-5_12},
  volume       = {9583},
  year         = {2016},
}

@article{1529,
  abstract     = {We consider partially observable Markov decision processes (POMDPs) with a set of target states and an integer cost associated with every transition. The optimization objective we study asks to minimize the expected total cost of reaching a state in the target set, while ensuring that the target set is reached almost surely (with probability 1). We show that for integer costs approximating the optimal cost is undecidable. For positive costs, our results are as follows: (i) we establish matching lower and upper bounds for the optimal cost, both double exponential in the POMDP state space size; (ii) we show that the problem of approximating the optimal cost is decidable and present approximation algorithms developing on the existing algorithms for POMDPs with finite-horizon objectives. While the worst-case running time of our algorithm is double exponential, we also present efficient stopping criteria for the algorithm and show experimentally that it performs well in many examples of interest.},
  author       = {Chatterjee, Krishnendu and Chmelik, Martin and Gupta, Raghav and Kanodia, Ayush},
  journal      = {Artificial Intelligence},
  pages        = {26 -- 48},
  publisher    = {Elsevier},
  title        = {{Optimal cost almost-sure reachability in POMDPs}},
  doi          = {10.1016/j.artint.2016.01.007},
  volume       = {234},
  year         = {2016},
}

@article{1545,
  abstract     = {We provide general conditions for which bosonic quadratic Hamiltonians on Fock spaces can be diagonalized by Bogoliubov transformations. Our results cover the case when quantum systems have infinite degrees of freedom and the associated one-body kinetic and paring operators are unbounded. Our sufficient conditions are optimal in the sense that they become necessary when the relevant one-body operators commute.},
  author       = {Nam, Phan and Napiórkowski, Marcin M and Solovej, Jan},
  journal      = {Journal of Functional Analysis},
  number       = {11},
  pages        = {4340 -- 4368},
  publisher    = {Academic Press},
  title        = {{Diagonalization of bosonic quadratic Hamiltonians by Bogoliubov transformations}},
  doi          = {10.1016/j.jfa.2015.12.007},
  volume       = {270},
  year         = {2016},
}

@article{1552,
  abstract     = {Antibiotic resistance carries a fitness cost that must be overcome in order for resistance to persist over the long term. Compensatory mutations that recover the functional defects associated with resistance mutations have been argued to play a key role in overcoming the cost of resistance, but compensatory mutations are expected to be rare relative to generally beneficial mutations that increase fitness, irrespective of antibiotic resistance. Given this asymmetry, population genetics theory predicts that populations should adapt by compensatory mutations when the cost of resistance is large, whereas generally beneficial mutations should drive adaptation when the cost of resistance is small. We tested this prediction by determining the genomic mechanisms underpinning adaptation to antibiotic-free conditions in populations of the pathogenic bacterium Pseudomonas aeruginosa that carry costly antibiotic resistance mutations. Whole-genome sequencing revealed that populations founded by high-cost rifampicin-resistant mutants adapted via compensatory mutations in three genes of the RNA polymerase core enzyme, whereas populations founded by low-cost mutants adapted by generally beneficial mutations, predominantly in the quorum-sensing transcriptional regulator gene lasR. Even though the importance of compensatory evolution in maintaining resistance has been widely recognized, our study shows that the roles of general adaptation in maintaining resistance should not be underestimated and highlights the need to understand how selection at other sites in the genome influences the dynamics of resistance alleles in clinical settings.},
  author       = {Qi, Qin and Toll Riera, Macarena and Heilbron, Karl and Preston, Gail and Maclean, R Craig},
  journal      = {Proceedings of the Royal Society of London Series B Biological Sciences},
  number       = {1822},
  publisher    = {Royal Society, The},
  title        = {{The genomic basis of adaptation to the fitness cost of rifampicin resistance in Pseudomonas aeruginosa}},
  doi          = {10.1098/rspb.2015.2452},
  volume       = {283},
  year         = {2016},
}

@article{1592,
  abstract     = {A modular approach to constructing cryptographic protocols leads to simple designs but often inefficient instantiations. On the other hand, ad hoc constructions may yield efficient protocols at the cost of losing conceptual simplicity. We suggest a new design paradigm, structure-preserving cryptography, that provides a way to construct modular protocols with reasonable efficiency while retaining conceptual simplicity. A cryptographic scheme over a bilinear group is called structure-preserving if its public inputs and outputs consist of elements from the bilinear groups and their consistency can be verified by evaluating pairing-product equations. As structure-preserving schemes smoothly interoperate with each other, they are useful as building blocks in modular design of cryptographic applications. This paper introduces structure-preserving commitment and signature schemes over bilinear groups with several desirable properties. The commitment schemes include homomorphic, trapdoor and length-reducing commitments to group elements, and the structure-preserving signature schemes are the first ones that yield constant-size signatures on multiple group elements. A structure-preserving signature scheme is called automorphic if the public keys lie in the message space, which cannot be achieved by compressing inputs via a cryptographic hash function, as this would destroy the mathematical structure we are trying to preserve. Automorphic signatures can be used for building certification chains underlying privacy-preserving protocols. Among a vast number of applications of structure-preserving protocols, we present an efficient round-optimal blind-signature scheme and a group signature scheme with an efficient and concurrently secure protocol for enrolling new members.},
  author       = {Abe, Masayuki and Fuchsbauer, Georg and Groth, Jens and Haralambiev, Kristiyan and Ohkubo, Miyako},
  journal      = {Journal of Cryptology},
  number       = {2},
  pages        = {363 -- 421},
  publisher    = {Springer},
  title        = {{Structure preserving signatures and commitments to group elements}},
  doi          = {10.1007/s00145-014-9196-7},
  volume       = {29},
  year         = {2016},
}

@article{1597,
  abstract     = {Chemokines are the main guidance cues directing leukocyte migration. Opposed to early assumptions, chemokines do not necessarily act as soluble cues but are often immobilized within tissues, e.g., dendritic cell migration toward lymphatic vessels is guided by a haptotactic gradient of the chemokine CCL21. Controlled assay systems to quantitatively study haptotaxis in vitro are still missing. In this chapter, we describe an in vitro haptotaxis assay optimized for the unique properties of dendritic cells. The chemokine CCL21 is immobilized in a bioactive state, using laser-assisted protein adsorption by photobleaching. The cells follow this immobilized CCL21 gradient in a haptotaxis chamber, which provides three dimensionally confined migration conditions.},
  author       = {Schwarz, Jan and Sixt, Michael K},
  journal      = {Methods in Enzymology},
  pages        = {567 -- 581},
  publisher    = {Elsevier},
  title        = {{Quantitative analysis of dendritic cell haptotaxis}},
  doi          = {10.1016/bs.mie.2015.11.004},
  volume       = {570},
  year         = {2016},
}

@article{1599,
  abstract     = {The addition of polysialic acid to N- and/or O-linked glycans, referred to as polysialylation, is a rare posttranslational modification that is mainly known to control the developmental plasticity of the nervous system. Here we show that CCR7, the central chemokine receptor controlling immune cell trafficking to secondary lymphatic organs, carries polysialic acid. This modification is essential for the recognition of the CCR7 ligand CCL21. As a consequence, dendritic cell trafficking is abrogated in polysialyltransferase-deficient mice, manifesting as disturbed lymph node homeostasis and unresponsiveness to inflammatory stimuli. Structure-function analysis of chemokine-receptor interactions reveals that CCL21 adopts an autoinhibited conformation, which is released upon interaction with polysialic acid. Thus, we describe a glycosylation-mediated immune cell trafficking disorder and its mechanistic basis.
},
  author       = {Kiermaier, Eva and Moussion, Christine and Veldkamp, Christopher and Gerardy  Schahn, Rita and De Vries, Ingrid and Williams, Larry and Chaffee, Gary and Phillips, Andrew and Freiberger, Friedrich and Imre, Richard and Taleski, Deni and Payne, Richard and Braun, Asolina and Förster, Reinhold and Mechtler, Karl and Mühlenhoff, Martina and Volkman, Brian and Sixt, Michael K},
  journal      = {Science},
  number       = {6269},
  pages        = {186 -- 190},
  publisher    = {American Association for the Advancement of Science},
  title        = {{Polysialylation controls dendritic cell trafficking by regulating chemokine recognition}},
  doi          = {10.1126/science.aad0512},
  volume       = {351},
  year         = {2016},
}

@article{1608,
  abstract     = {We show that the Anderson model has a transition from localization to delocalization at exactly 2 dimensional growth rate on antitrees with normalized edge weights which are certain discrete graphs. The kinetic part has a one-dimensional structure allowing a description through transfer matrices which involve some Schur complement. For such operators we introduce the notion of having one propagating channel and extend theorems from the theory of one-dimensional Jacobi operators that relate the behavior of transfer matrices with the spectrum. These theorems are then applied to the considered model. In essence, in a certain energy region the kinetic part averages the random potentials along shells and the transfer matrices behave similar as for a one-dimensional operator with random potential of decaying variance. At d dimensional growth for d&gt;2 this effective decay is strong enough to obtain absolutely continuous spectrum, whereas for some uniform d dimensional growth with d&lt;2 one has pure point spectrum in this energy region. At exactly uniform 2 dimensional growth also some singular continuous spectrum appears, at least at small disorder. As a corollary we also obtain a change from singular spectrum (d≤2) to absolutely continuous spectrum (d≥3) for random operators of the type rΔdr+λ on ℤd, where r is an orthogonal radial projection, Δd the discrete adjacency operator (Laplacian) on ℤd and λ a random potential. },
  author       = {Sadel, Christian},
  journal      = {Annales Henri Poincare},
  number       = {7},
  pages        = {1631 -- 1675},
  publisher    = {Birkhäuser},
  title        = {{Anderson transition at 2 dimensional growth rate on antitrees and spectral theory for operators with one propagating channel}},
  doi          = {10.1007/s00023-015-0456-3},
  volume       = {17},
  year         = {2016},
}

@article{1612,
  abstract     = {We prove that whenever A is a 3-conservative relational structure with only binary and unary relations,then the algebra of polymorphisms of A either has no Taylor operation (i.e.,CSP(A)is NP-complete),or it generates an SD(∧) variety (i.e.,CSP(A)has bounded width).},
  author       = {Kazda, Alexandr},
  journal      = {Algebra Universalis},
  number       = {1},
  pages        = {75 -- 84},
  publisher    = {Springer},
  title        = {{CSP for binary conservative relational structures}},
  doi          = {10.1007/s00012-015-0358-8},
  volume       = {75},
  year         = {2016},
}

