@article{15233,
  abstract     = {In this paper we present the science potential of the enhanced X-ray Timing and Polarimetry (eXTP) mission for studies of strongly magnetized objects. We will focus on the physics and astrophysics of strongly magnetized objects, namely magnetars, accreting X-ray pulsars, and rotation powered pulsars. We also discuss the science potential of eXTP for QED studies. Developed by an international Consortium led by the Institute of High Energy Physics of the Chinese Academy of Sciences, the eXTP mission is expected to be launched in the mid 2020s.},
  author       = {Santangelo, Andrea and Zane, Silvia and Feng, Hua and Xu, RenXin and Doroshenko, Victor and Bozzo, Enrico and Caiazzo, Ilaria and Zelati, Francesco Coti and Esposito, Paolo and González-Caniulef, Denis and Heyl, Jeremy and Huppenkothen, Daniela and Israel, Gianluca and Li, ZhaoSheng and Lin, Lin and Mignani, Roberto and Rea, Nanda and Orlandini, Mauro and Taverna, Roberto and Tong, Hao and Turolla, Roberto and Baglio, Cristina and Bernardini, Federico and Bucciantini, Niccolo’ and Feroci, Marco and Fürst, Felix and Göğüş, Ersin and Güngör, Can and Ji, Long and Lu, FangJun and Manousakis, Antonios and Mereghetti, Sandro and Mikusincova, Romana and Paul, Biswajit and Prescod-Weinstein, Chanda and Younes, George and Tiengo, Andrea and Xu, YuPeng and Watts, Anna and Zhang, Shu and Zhan, Shuang-Nan},
  issn         = {1869-1927},
  journal      = {Science China Physics, Mechanics & Astronomy},
  keywords     = {General Physics and Astronomy},
  number       = {2},
  publisher    = {Springer Nature},
  title        = {{Physics and astrophysics of strong magnetic field systems with eXTP}},
  doi          = {10.1007/s11433-018-9234-3},
  volume       = {62},
  year         = {2018},
}

@article{15234,
  abstract     = {Using parallaxes from Gaia Data Release 2 (Gaia DR2), we estimate the distance to the globular clusters 47 Tuc and NGC 362, taking advantage of the background stars in the Small Magellanic Cloud and quasars to account for various parallax systematics. We found the parallax to be dependent on the Gaia DR2 G-band apparent magnitude for stars with 13 < G < 18, where brighter stars have a lower parallax zero point than fainter stars. The distance to 47 Tuc was found to be 4.45 ± 0.01 ± 0.12 kpc, and for NGC 362 8.54 ± 0.20 ± 0.44 kpc, with random and systematic errors listed, respectively. This is the first time a precise distance measurement directly using parallaxes has been determined for either of these two globular clusters.},
  author       = {Chen, Seery and Richer, Harvey and Caiazzo, Ilaria and Heyl, Jeremy},
  issn         = {1538-4357},
  journal      = {The Astrophysical Journal},
  keywords     = {Space and Planetary Science, Astronomy and Astrophysics},
  number       = {2},
  publisher    = {American Astronomical Society},
  title        = {{Distances to the globular clusters 47 Tucanae and NGC 362 using Gaia DR2 parallaxes}},
  doi          = {10.3847/1538-4357/aae089},
  volume       = {867},
  year         = {2018},
}

@article{15235,
  abstract     = {Radiative corrections of quantum electrodynamics cause a vacuum threaded by a magnetic field to be birefringent. This means that radiation of different polarizations travels at different speeds. Even in the strong magnetic fields of astrophysical sources, the difference in speed is small. However, it has profound consequences for the extent of polarization expected from strongly magnetized sources. We demonstrate how the birefringence arises from first principles, show how birefringence affects the polarization state of radiation and present recent calculations for the expected polarization from magnetars and X-ray pulsars.},
  author       = {Heyl, Jeremy and Caiazzo, Ilaria},
  issn         = {2075-4434},
  journal      = {Galaxies},
  keywords     = {Astronomy and Astrophysics},
  number       = {3},
  publisher    = {MDPI},
  title        = {{Strongly magnetized sources: QED and X-ray polarization}},
  doi          = {10.3390/galaxies6030076},
  volume       = {6},
  year         = {2018},
}

@article{15236,
  abstract     = {Radio pulsars found in binary systems with short orbital periods are usually fast spinning as a consequence of recycling via mass transfer from their companion stars; this process is also thought to decrease the magnetic field of the neutron star being recycled. Here, we report on timing observations of the recently discovered binary PSR J1755−2550 and find that this pulsar is an exception: with a characteristic age of 2.1 Myr, it is relatively young; furthermore, with a spin period of 315 ms and a surface magnetic field strength at its poles of 0.88 × 1012 G, the pulsar shows no sign of having been recycled. Based on its timing and orbital characteristics, the pulsar either has a massive white dwarf (WD) or a neutron star (NS) companion. To distinguish between these two cases, we searched radio observations for a potential recycled pulsar companion and analysed archival optical data for a potential WD companion. Neither work returned conclusive detections. We apply population synthesis modelling and find that both solutions are roughly equally probable. Our population synthesis also predicts a minimum mass of 0.90 M⊙ for the companion star to PSR J1755−2550 and we simulate the systemic runaway velocities for the resulting WDNS systems which may merge and possibly produce Ca-rich supernovae. Whether PSR J1755−2550 hosts a WD or a NS companion star, it is certainly a member of a rare subpopulation of binary radio pulsars.},
  author       = {Ng, C and Kruckow, M U and Tauris, T M and Lyne, A G and Freire, P C C and Ridolfi, A and Caiazzo, Ilaria and Heyl, J and Kramer, M and Cameron, A D and Champion, D J and Stappers, B},
  issn         = {1365-2966},
  journal      = {Monthly Notices of the Royal Astronomical Society},
  keywords     = {Space and Planetary Science, Astronomy and Astrophysics},
  number       = {4},
  pages        = {4315--4326},
  publisher    = {Oxford University Press},
  title        = {{PSR J1755−2550: A young radio pulsar with a massive, compact companion}},
  doi          = {10.1093/mnras/sty482},
  volume       = {476},
  year         = {2018},
}

@article{15237,
  abstract     = {The effect of vacuum birefringence is one of the first predictions of quantum electrodynamics (QED): the presence of a charged Dirac field makes the vacuum birefringent when threaded by magnetic fields. This effect, extremely weak for terrestrial magnetic fields, becomes important for highly magnetized astrophysical objects, such as accreting black holes. In the X-ray regime, the polarization of photons traveling in the magnetosphere of a black hole is not frozen at emission but is changed by the local magnetic field. We show that, for photons traveling along the plane of the disk, where the field is expected to be partially organized, this results in a depolarization of the X-ray radiation. Because the amount of depolarization depends on the strength of the magnetic field, this effect can provide a way to probe the magnetic field in black-hole accretion disks and to study the role of magnetic fields in astrophysical accretion in general.},
  author       = {Caiazzo, Ilaria and Heyl, Jeremy},
  issn         = {2075-4434},
  journal      = {Galaxies},
  keywords     = {Astronomy and Astrophysics},
  number       = {2},
  publisher    = {MDPI},
  title        = {{Probing black hole magnetic fields with QED}},
  doi          = {10.3390/galaxies6020057},
  volume       = {6},
  year         = {2018},
}

@article{15238,
  abstract     = {In the next decade, x-ray polarimetry will open a new window on the high-energy Universe, as several missions that include an x-ray polarimeter are currently under development. Observations of the polarization of x rays coming from the accretion disks of stellar-mass and supermassive black holes are among the new polarimeters’ major objectives. In this paper, we show that these observations can be affected by the quantum electrodynamic (QED) effect of vacuum birefringence: after an x-ray photon is emitted from the accretion disk, its polarization changes as the photon travels through the accretion disk’s magnetosphere, as a result of the vacuum becoming birefringent in the presence of a magnetic field. We show that this effect can be important for black holes in the energy band of the upcoming polarimeters and has to be taken into account in a complete model of the x-ray polarization that we expect to detect from black-hole accretion disks, both for stellar mass and for supermassive black holes. We find that, for a chaotic magnetic field in the disk, QED can significantly decrease the linear polarization fraction of edge-on photons, depending on the spin of the hole and on the strength of the magnetic field. This effect can provide, for the first time, a direct way to probe the magnetic field strength close to the innermost stable orbit of black-hole accretion disks and to study the role of magnetic fields in astrophysical accretion in general.},
  author       = {Caiazzo, Ilaria and Heyl, Jeremy},
  issn         = {2470-0029},
  journal      = {Physical Review D},
  number       = {8},
  publisher    = {American Physical Society},
  title        = {{Vacuum birefringence and the x-ray polarization from black-hole accretion disks}},
  doi          = {10.1103/physrevd.97.083001},
  volume       = {97},
  year         = {2018},
}

@inbook{153,
  abstract     = {Cells migrating in multicellular organisms steadily traverse complex three-dimensional (3D) environments. To decipher the underlying cell biology, current experimental setups either use simplified 2D, tissue-mimetic 3D (e.g., collagen matrices) or in vivo environments. While only in vivo experiments are truly physiological, they do not allow for precise manipulation of environmental parameters. 2D in vitro experiments do allow mechanical and chemical manipulations, but increasing evidence demonstrates substantial differences of migratory mechanisms in 2D and 3D. Here, we describe simple, robust, and versatile “pillar forests” to investigate cell migration in complex but fully controllable 3D environments. Pillar forests are polydimethylsiloxane-based setups, in which two closely adjacent surfaces are interconnected by arrays of micrometer-sized pillars. Changing the pillar shape, size, height and the inter-pillar distance precisely manipulates microenvironmental parameters (e.g., pore sizes, micro-geometry, micro-topology), while being easily combined with chemotactic cues, surface coatings, diverse cell types and advanced imaging techniques. Thus, pillar forests combine the advantages of 2D cell migration assays with the precise definition of 3D environmental parameters.},
  author       = {Renkawitz, Jörg and Reversat, Anne and Leithner, Alexander F and Merrin, Jack and Sixt, Michael K},
  booktitle    = {Methods in Cell Biology},
  issn         = {0091-679X},
  pages        = {79 -- 91},
  publisher    = {Academic Press},
  title        = {{Micro-engineered “pillar forests” to study cell migration in complex but controlled 3D environments}},
  doi          = {10.1016/bs.mcb.2018.07.004},
  volume       = {147},
  year         = {2018},
}

@article{106,
  abstract     = {The goal of this article is to introduce the reader to the theory of intrinsic geometry of convex surfaces. We illustrate the power of the tools by proving a theorem on convex surfaces containing an arbitrarily long closed simple geodesic. Let us remind ourselves that a curve in a surface is called geodesic if every sufficiently short arc of the curve is length minimizing; if, in addition, it has no self-intersections, we call it simple geodesic. A tetrahedron with equal opposite edges is called isosceles. The axiomatic method of Alexandrov geometry allows us to work with the metrics of convex surfaces directly, without approximating it first by a smooth or polyhedral metric. Such approximations destroy the closed geodesics on the surface; therefore it is difficult (if at all possible) to apply approximations in the proof of our theorem. On the other hand, a proof in the smooth or polyhedral case usually admits a translation into Alexandrov’s language; such translation makes the result more general. In fact, our proof resembles a translation of the proof given by Protasov. Note that the main theorem implies in particular that a smooth convex surface does not have arbitrarily long simple closed geodesics. However we do not know a proof of this corollary that is essentially simpler than the one presented below.},
  author       = {Akopyan, Arseniy and Petrunin, Anton},
  journal      = {Mathematical Intelligencer},
  number       = {3},
  pages        = {26 -- 31},
  publisher    = {Springer},
  title        = {{Long geodesics on convex surfaces}},
  doi          = {10.1007/s00283-018-9795-5},
  volume       = {40},
  year         = {2018},
}

@article{10626,
  abstract     = {Owing to their wide tunability, multiple internal degrees of freedom, and low disorder, graphene heterostructures are emerging as a promising experimental platform for fractional quantum Hall (FQH) studies. Here, we report FQH thermal activation gap measurements in dual graphite-gated monolayer graphene devices fabricated in an edgeless Corbino geometry. In devices with substrate-induced sublattice splitting, we find a tunable crossover between single- and multicomponent FQH states in the zero energy Landau level. Activation gaps in the single-component regime show excellent agreement with numerical calculations using a single broadening parameter 
Γ≈7.2K. In the first excited Landau level, in contrast, FQH gaps are strongly influenced by Landau level mixing, and we observe an unexpected valley-ordered state at integer filling ν=−4.},
  author       = {Polshyn, Hryhoriy and Zhou, H. and Spanton, E. M. and Taniguchi, T. and Watanabe, K. and Young, A. F.},
  issn         = {1079-7114},
  journal      = {Physical Review Letters},
  keywords     = {general physics and astronomy},
  number       = {22},
  publisher    = {American Physical Society},
  title        = {{Quantitative transport measurements of fractional quantum Hall energy gaps in edgeless graphene devices}},
  doi          = {10.1103/physrevlett.121.226801},
  volume       = {121},
  year         = {2018},
}

@article{10627,
  abstract     = {We present a scanning probe technique for measuring the dynamics of individual fluxoid transitions in multiply connected superconducting structures. In these measurements, a small magnetic particle attached to the tip of a silicon cantilever is scanned over a micron-size superconducting ring fabricated from a thin aluminum film. We find that near the superconducting transition temperature of the aluminum, the dissipation and frequency of the cantilever changes significantly at particular locations where the tip-induced magnetic flux penetrating the ring causes the two lowest-energy fluxoid states to become nearly degenerate. In this regime, we show that changes in the cantilever frequency and dissipation are well-described by a stochastic resonance (SR) process, wherein small oscillations of the cantilever in the presence of thermally activated phase slips (TAPS) in the ring give rise to a dynamical force that modifies the mechanical properties of the cantilever. Using the SR model, we calculate the average fluctuation rate of the TAPS as a function of temperature over a 32-dB range in frequency, and we compare it to the Langer-Ambegaokar-McCumber-Halperin theory for TAPS in one-dimensional superconducting structures.},
  author       = {Polshyn, Hryhoriy and Naibert, Tyler R. and Budakian, Raffi},
  issn         = {2469-9969},
  journal      = {Physical Review B},
  number       = {18},
  publisher    = {American Physical Society},
  title        = {{Imaging phase slip dynamics in micron-size superconducting rings}},
  doi          = {10.1103/physrevb.97.184501},
  volume       = {97},
  year         = {2018},
}

@article{107,
  abstract     = {We introduce the notion of “non-malleable codes” which relaxes the notion of error correction and error detection. Informally, a code is non-malleable if the message contained in a modified codeword is either the original message, or a completely unrelated value. In contrast to error correction and error detection, non-malleability can be achieved for very rich classes of modifications. We construct an efficient code that is non-malleable with respect to modifications that affect each bit of the codeword arbitrarily (i.e., leave it untouched, flip it, or set it to either 0 or 1), but independently of the value of the other bits of the codeword. Using the probabilistic method, we also show a very strong and general statement: there exists a non-malleable code for every “small enough” family F of functions via which codewords can be modified. Although this probabilistic method argument does not directly yield efficient constructions, it gives us efficient non-malleable codes in the random-oracle model for very general classes of tampering functions—e.g., functions where every bit in the tampered codeword can depend arbitrarily on any 99% of the bits in the original codeword. As an application of non-malleable codes, we show that they provide an elegant algorithmic solution to the task of protecting functionalities implemented in hardware (e.g., signature cards) against “tampering attacks.” In such attacks, the secret state of a physical system is tampered, in the hopes that future interaction with the modified system will reveal some secret information. This problem was previously studied in the work of Gennaro et al. in 2004 under the name “algorithmic tamper proof security” (ATP). We show that non-malleable codes can be used to achieve important improvements over the prior work. In particular, we show that any functionality can be made secure against a large class of tampering attacks, simply by encoding the secret state with a non-malleable code while it is stored in memory.},
  author       = {Dziembowski, Stefan and Pietrzak, Krzysztof Z and Wichs, Daniel},
  journal      = {Journal of the ACM},
  number       = {4},
  publisher    = {ACM},
  title        = {{Non-malleable codes}},
  doi          = {10.1145/3178432},
  volume       = {65},
  year         = {2018},
}

@inproceedings{108,
  abstract     = {Universal hashing found a lot of applications in computer science. In cryptography the most important fact about universal families is the so called Leftover Hash Lemma, proved by Impagliazzo, Levin and Luby. In the language of modern cryptography it states that almost universal families are good extractors. In this work we provide a somewhat surprising characterization in the opposite direction. Namely, every extractor with sufficiently good parameters yields a universal family on a noticeable fraction of its inputs. Our proof technique is based on tools from extremal graph theory applied to the \'collision graph\' induced by the extractor, and may be of independent interest. We discuss possible applications to the theory of randomness extractors and non-malleable codes.},
  author       = {Obremski, Marciej and Skorski, Maciej},
  location     = {Vail, CO, USA},
  publisher    = {IEEE},
  title        = {{Inverted leftover hash lemma}},
  doi          = {10.1109/ISIT.2018.8437654},
  volume       = {2018},
  year         = {2018},
}

@inbook{10864,
  abstract     = {We prove that every congruence distributive variety has directed Jónsson terms, and every congruence modular variety has directed Gumm terms. The directed terms we construct witness every case of absorption witnessed by the original Jónsson or Gumm terms. This result is equivalent to a pair of claims about absorption for admissible preorders in congruence distributive and congruence modular varieties, respectively. For finite algebras, these absorption theorems have already seen significant applications, but until now, it was not clear if the theorems hold for general algebras as well. Our method also yields a novel proof of a result by P. Lipparini about the existence of a chain of terms (which we call Pixley terms) in varieties that are at the same time congruence distributive and k-permutable for some k.},
  author       = {Kazda, Alexandr and Kozik, Marcin and McKenzie, Ralph and Moore, Matthew},
  booktitle    = {Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer Science},
  editor       = {Czelakowski, J},
  isbn         = {9783319747712},
  issn         = {2211-2766},
  pages        = {203--220},
  publisher    = {Springer Nature},
  title        = {{Absorption and directed Jónsson terms}},
  doi          = {10.1007/978-3-319-74772-9_7},
  volume       = {16},
  year         = {2018},
}

@article{10880,
  abstract     = {Acquisition of evolutionary novelties is a fundamental process for adapting to the external environment and invading new niches and results in the diversification of life, which we can see in the world today. How such novel phenotypic traits are acquired in the course of evolution and are built up in developing embryos has been a central question in biology. Whole-genome duplication (WGD) is a process of genome doubling that supplies raw genetic materials and increases genome complexity. Recently, it has been gradually revealed that WGD and subsequent fate changes of duplicated genes can facilitate phenotypic evolution. Here, we review the current understanding of the relationship between WGD and the acquisition of evolutionary novelties. We show some examples of this link and discuss how WGD and subsequent duplicated genes can facilitate phenotypic evolution as well as when such genomic doubling can be advantageous for adaptation.},
  author       = {Yuuta, Moriyama and Koshiba-Takeuchi, Kazuko},
  issn         = {2041-2657},
  journal      = {Briefings in Functional Genomics},
  keywords     = {Genetics, Molecular Biology, Biochemistry, General Medicine},
  number       = {5},
  pages        = {329--338},
  publisher    = {Oxford University Press},
  title        = {{Significance of whole-genome duplications on the emergence of evolutionary novelties}},
  doi          = {10.1093/bfgp/ely007},
  volume       = {17},
  year         = {2018},
}

@article{10881,
  abstract     = {Strigolactones (SLs) are a relatively recent addition to the list of plant hormones that control different aspects of plant development. SL signalling is perceived by an α/β hydrolase, DWARF 14 (D14). A close homolog of D14, KARRIKIN INSENSTIVE2 (KAI2), is involved in perception of an uncharacterized molecule called karrikin (KAR). Recent studies in Arabidopsis identified the SUPPRESSOR OF MAX2 1 (SMAX1) and SMAX1-LIKE 7 (SMXL7) to be potential SCF–MAX2 complex-mediated proteasome targets of KAI2 and D14, respectively. Genetic studies on SMXL7 and SMAX1 demonstrated distinct developmental roles for each, but very little is known about these repressors in terms of their sequence features. In this study, we performed an extensive comparative analysis of SMXLs and determined their phylogenetic and evolutionary history in the plant lineage. Our results show that SMXL family members can be sub-divided into four distinct phylogenetic clades/classes, with an ancient SMAX1. Further, we identified the clade-specific motifs that have evolved and that might act as determinants of SL-KAR signalling specificity. These specificities resulted from functional diversities among the clades. Our results suggest that a gradual co-evolution of SMXL members with their upstream receptors D14/KAI2 provided an increased specificity to both the SL perception and response in land plants.},
  author       = {Moturu, Taraka Ramji and Thula, Sravankumar and Singh, Ravi Kumar and Nodzyński, Tomasz and Vařeková, Radka Svobodová and Friml, Jiří and Simon, Sibu},
  issn         = {1460-2431},
  journal      = {Journal of Experimental Botany},
  keywords     = {Plant Science, Physiology},
  number       = {9},
  pages        = {2367--2378},
  publisher    = {Oxford University Press},
  title        = {{Molecular evolution and diversification of the SMXL gene family}},
  doi          = {10.1093/jxb/ery097},
  volume       = {69},
  year         = {2018},
}

@inproceedings{10882,
  abstract     = {We introduce Intelligent Annotation Dialogs for bounding box annotation. We train an agent to automatically choose a sequence of actions for a human annotator to produce a bounding box in a minimal amount of time. Specifically, we consider two actions: box verification [34], where the annotator verifies a box generated by an object detector, and manual box drawing. We explore two kinds of agents, one based on predicting the probability that a box will be positively verified, and the other based on reinforcement learning. We demonstrate that (1) our agents are able to learn efficient annotation strategies in several scenarios, automatically adapting to the image difficulty, the desired quality of the boxes, and the detector strength; (2) in all scenarios the resulting annotation dialogs speed up annotation compared to manual box drawing alone and box verification alone, while also outperforming any fixed combination of verification and drawing in most scenarios; (3) in a realistic scenario where the detector is iteratively re-trained, our agents evolve a series of strategies that reflect the shifting trade-off between verification and drawing as the detector grows stronger.},
  author       = {Uijlings, Jasper and Konyushkova, Ksenia and Lampert, Christoph and Ferrari, Vittorio},
  booktitle    = {2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  isbn         = {9781538664209},
  issn         = {2575-7075},
  location     = {Salt Lake City, UT, United States},
  pages        = {9175--9184},
  publisher    = {IEEE},
  title        = {{Learning intelligent dialogs for bounding box annotation}},
  doi          = {10.1109/cvpr.2018.00956},
  year         = {2018},
}

@inproceedings{10883,
  abstract     = {Solving parity games, which are equivalent to modal μ-calculus model checking, is a central algorithmic problem in formal methods, with applications in reactive synthesis, program repair, verification of branching-time properties, etc. Besides the standard compu- tation model with the explicit representation of games, another important theoretical model of computation is that of set-based symbolic algorithms. Set-based symbolic algorithms use basic set operations and one-step predecessor operations on the implicit description of games, rather than the explicit representation. The significance of symbolic algorithms is that they provide scalable algorithms for large finite-state systems, as well as for infinite-state systems with finite quotient. Consider parity games on graphs with n vertices and parity conditions with d priorities. While there is a rich literature of explicit algorithms for parity games, the main results for set-based symbolic algorithms are as follows: (a) the basic algorithm that requires O(nd) symbolic operations and O(d) symbolic space; and (b) an improved algorithm that requires O(nd/3+1) symbolic operations and O(n) symbolic space. In this work, our contributions are as follows: (1) We present a black-box set-based symbolic algorithm based on the explicit progress measure algorithm. Two important consequences of our algorithm are as follows: (a) a set-based symbolic algorithm for parity games that requires quasi-polynomially many symbolic operations and O(n) symbolic space; and (b) any future improvement in progress measure based explicit algorithms immediately imply an efficiency improvement in our set-based symbolic algorithm for parity games. (2) We present a set-based symbolic algorithm that requires quasi-polynomially many symbolic operations and O(d · log n) symbolic space. Moreover, for the important special case of d ≤ log n, our algorithm requires only polynomially many symbolic operations and poly-logarithmic symbolic space.},
  author       = {Chatterjee, Krishnendu and Dvořák, Wolfgang and Henzinger, Monika H and Svozil, Alexander},
  booktitle    = {22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning},
  issn         = {2398-7340},
  location     = {Awassa, Ethiopia},
  pages        = {233--253},
  publisher    = {EasyChair},
  title        = {{Quasipolynomial set-based symbolic algorithms for parity games}},
  doi          = {10.29007/5z5k},
  volume       = {57},
  year         = {2018},
}

@article{1092,
  abstract     = {A graphical model encodes conditional independence relations via the Markov properties. For an undirected graph these conditional independence relations can be represented by a simple polytope known as the graph associahedron, which can be constructed as a Minkowski sum of standard simplices. We show that there is an analogous polytope for conditional independence relations coming from a regular Gaussian model, and it can be defined using multiinformation or relative entropy. For directed acyclic graphical models we give a construction of this polytope as a Minkowski sum of matroid polytopes. Finally, we apply this geometric insight to construct a new ordering-based search algorithm for causal inference via directed acyclic graphical models. },
  author       = {Mohammadi, Fatemeh and Uhler, Caroline and Wang, Charles and Yu, Josephine},
  journal      = {SIAM Journal on Discrete Mathematics},
  number       = {1},
  pages        = {64--93},
  publisher    = {SIAM},
  title        = {{Generalized permutohedra from probabilistic graphical models}},
  doi          = {10.1137/16M107894X},
  volume       = {32},
  year         = {2018},
}

@inproceedings{11,
  abstract     = {We report on a novel strategy to derive mean-field limits of quantum mechanical systems in which a large number of particles weakly couple to a second-quantized radiation field. The technique combines the method of counting and the coherent state approach to study the growth of the correlations among the particles and in the radiation field. As an instructional example, we derive the Schrödinger–Klein–Gordon system of equations from the Nelson model with ultraviolet cutoff and possibly massless scalar field. In particular, we prove the convergence of the reduced density matrices (of the nonrelativistic particles and the field bosons) associated with the exact time evolution to the projectors onto the solutions of the Schrödinger–Klein–Gordon equations in trace norm. Furthermore, we derive explicit bounds on the rate of convergence of the one-particle reduced density matrix of the nonrelativistic particles in Sobolev norm.},
  author       = {Leopold, Nikolai K and Pickl, Peter},
  location     = {Munich, Germany},
  pages        = {185 -- 214},
  publisher    = {Springer},
  title        = {{Mean-field limits of particles in interaction with quantised radiation fields}},
  doi          = {10.1007/978-3-030-01602-9_9},
  volume       = {270},
  year         = {2018},
}

@article{11063,
  abstract     = {The total number of nuclear pore complexes (NPCs) per nucleus varies greatly between different cell types and is known to change during cell differentiation and cell transformation. However, the underlying mechanisms that control how many nuclear transport channels are assembled into a given nuclear envelope remain unclear. Here, we report that depletion of the NPC basket protein Tpr, but not Nup153, dramatically increases the total NPC number in various cell types. This negative regulation of Tpr occurs via a phosphorylation cascade of extracellular signal-regulated kinase (ERK), the central kinase of the mitogen-activated protein kinase (MAPK) pathway. Tpr serves as a scaffold for ERK to phosphorylate the nucleoporin (Nup) Nup153, which is critical for early stages of NPC biogenesis. Our results reveal a critical role of the Nup Tpr in coordinating signal transduction pathways during cell proliferation and the dynamic organization of the nucleus.},
  author       = {McCloskey, Asako and Ibarra, Arkaitz and HETZER, Martin W},
  issn         = {0890-9369},
  journal      = {Genes & Development},
  keywords     = {Developmental Biology, Genetics},
  number       = {19-20},
  pages        = {1321--1331},
  publisher    = {Cold Spring Harbor Laboratory},
  title        = {{Tpr regulates the total number of nuclear pore complexes per cell nucleus}},
  doi          = {10.1101/gad.315523.118},
  volume       = {32},
  year         = {2018},
}

