TY - JOUR AB - Precision sensing and manipulation of milligram-scale mechanical oscillators has attracted growing interest in the fields of table-top explorations of gravity and tests of quantum mechanics at macroscopic scales. Torsional oscillators present an opportunity in this regard due to their remarked isolation from environmental noise. For torsional motion, an effective employment of optical cavities to enhance optomechanical interactions—as already established for linear oscillators—so far faced certain challenges. Here, we propose a concept for sensing and manipulating torsional motion, where exclusively the torsional rotations of a pendulum are mapped onto the path length of a single two-mirror optical cavity. The concept inherently alleviates many limitations of previous approaches. A proof-of-principle experiment is conducted with a rigidly controlled pendulum to explore the sensing aspects of the concept and to identify practical limitations in a potential state-of-the art setup. Based on this study, we anticipate development of precision torque sensors utilizing torsional pendulums that can support sensitivities below 10−19Nm/√Hz, while the motion of the pendulums are dominated by quantum radiation pressure noise at sub-microwatts of incoming laser power. These developments will provide horizons for experiments at the interface of quantum mechanics and gravity. AU - Agafonova, Sofya AU - Mishra, Umang AU - Diorico, Fritz R AU - Hosten, Onur ID - 14980 IS - 1 JF - Physical Review Research TI - Zigzag optical cavity for sensing and controlling torsional motion VL - 6 ER - TY - JOUR AB - Die Quantenrotation ist ein spannendes Phänomen, das in vielen verschiedenen Systemen auftritt, von Molekülen und Atomen bis hin zu subatomaren Teilchen wie Neutronen und Protonen. Durch den Einsatz von starken Laserpulsen ist es möglich, die mathematisch anspruchsvolle Topologie der Rotation von Molekülen aufzudecken und topologisch geschützte Zustände zu erzeugen, die unerwartetes Verhalten zeigen. Diese Entdeckungen könnten Auswirkungen auf die Molekülphysik und physikalische Chemie haben und die Entwicklung neuer Technologien ermöglichen. Die Verbindung von Quantenrotation und Topologie stellt ein aufregendes, interdisziplinäres Forschungsfeld dar und bietet neue Wege zur Kontrolle und Nutzung von quantenmechanischen Phänomenen. AU - Karle, Volker AU - Lemeshko, Mikhail ID - 14851 IS - 1 JF - Physik in unserer Zeit KW - General Earth and Planetary Sciences KW - General Environmental Science SN - 0031-9252 TI - Die faszinierende Topologie rotierender Quanten VL - 55 ER - TY - JOUR AB - We prove a version of the tamely ramified geometric Langlands correspondence in positive characteristic for GLn(k). Let k be an algebraically closed field of characteristic p>n. Let X be a smooth projective curve over k with marked points, and fix a parabolic subgroup of GLn(k) at each marked point. We denote by Bunn,P the moduli stack of (quasi-)parabolic vector bundles on X, and by Locn,P the moduli stack of parabolic flat connections such that the residue is nilpotent with respect to the parabolic reduction at each marked point. We construct an equivalence between the bounded derived category Db(Qcoh(Loc0n,P)) of quasi-coherent sheaves on an open substack Loc0n,P⊂Locn,P, and the bounded derived category Db(D0Bunn,P-mod) of D0Bunn,P-modules, where D0Bunn,P is a localization of DBunn,P the sheaf of crystalline differential operators on Bunn,P. Thus we extend the work of Bezrukavnikov-Braverman to the tamely ramified case. We also prove a correspondence between flat connections on X with regular singularities and meromorphic Higgs bundles on the Frobenius twist X(1) of X with first order poles . AU - Shen, Shiyu ID - 14986 JF - International Mathematics Research Notices KW - General Mathematics SN - 1073-7928 TI - Tamely ramified geometric Langlands correspondence in positive characteristic ER - TY - GEN AB - The development, evolution, and function of the vertebrate central nervous system (CNS) can be best studied using diverse model organisms. Amphibians, with their unique phylogenetic position at the transition between aquatic and terrestrial lifestyles, are valuable for understanding the origin and evolution of the tetrapod brain and spinal cord. Their metamorphic developmental transitions and unique regenerative abilities also facilitate the discovery of mechanisms for neural circuit remodeling and replacement. The genetic toolkit for amphibians, however, remains limited, with only a few species having sequenced genomes and a small number of transgenic lines available. In mammals, recombinant adeno-associated viral vectors (AAVs) have become a powerful alternative to genome modification for visualizing and perturbing the nervous system. AAVs are DNA viruses that enable neuronal transduction in both developing and adult animals with low toxicity and spatial, temporal, and cell-type specificity. However, AAVs have never been shown to transduce amphibian cells efficiently. To bridge this gap, we established a simple, scalable, and robust strategy to screen AAV serotypes in three distantly-related amphibian species: the frogs Xenopus laevis and Pelophylax bedriagae, and the salamander Pleurodeles waltl, in both developing larval tadpoles and post-metamorphic animals. For each species, we successfully identified at least two AAV serotypes capable of infecting the CNS; however, no pan-amphibian serotype was identified, indicating rapid evolution of AAV tropism. In addition, we developed an AAV-based strategy that targets isochronic cohorts of developing neurons – a critical tool for parsing neural circuit assembly. Finally, to enable visualization and manipulation of neural circuits, we identified AAV variants for retrograde tracing of neuronal projections in adult animals. Our findings expand the toolkit for amphibians to include AAVs, establish a generalizable workflow for AAV screening in non-canonical research organisms, generate testable hypotheses for the evolution of AAV tropism, and lay the foundation for modern cross-species comparisons of vertebrate CNS development, function, and evolution. AU - Jaeger, Eliza C.B. AU - Vijatovic, David AU - Deryckere, Astrid AU - Zorin, Nikol AU - Nguyen, Akemi L. AU - Ivanian, Georgiy AU - Woych, Jamie AU - Arnold, Rebecca C AU - Ortega Gurrola, Alonso AU - Shvartsman, Arik AU - Barbieri, Francesca AU - Toma, Florina-Alexandra AU - Gorbsky, Gary J. AU - Horb, Marko E. AU - Cline, Hollis T. AU - Shay, Timothy F. AU - Kelley, Darcy B. AU - Yamaguchi, Ayako AU - Shein-Idelson, Mark AU - Tosches, Maria Antonietta AU - Sweeney, Lora Beatrice Jaeger ID - 15016 T2 - bioRxiv TI - Adeno-associated viral tools to trace neural development and connectivity across amphibians ER - TY - CONF AB - We solve a problem of Dujmović and Wood (2007) by showing that a complete convex geometric graph on n vertices cannot be decomposed into fewer than n-1 star-forests, each consisting of noncrossing edges. This bound is clearly tight. We also discuss similar questions for abstract graphs. AU - Pach, János AU - Saghafian, Morteza AU - Schnider, Patrick ID - 15012 SN - 03029743 T2 - 31st International Symposium on Graph Drawing and Network Visualization TI - Decomposition of geometric graphs into star-forests VL - 14465 ER - TY - CONF AB - Graphical games are a useful framework for modeling the interactions of (selfish) agents who are connected via an underlying topology and whose behaviors influence each other. They have wide applications ranging from computer science to economics and biology. Yet, even though an agent’s payoff only depends on the actions of their direct neighbors in graphical games, computing the Nash equilibria and making statements about the convergence time of "natural" local dynamics in particular can be highly challenging. In this work, we present a novel approach for classifying complexity of Nash equilibria in graphical games by establishing a connection to local graph algorithms, a subfield of distributed computing. In particular, we make the observation that the equilibria of graphical games are equivalent to locally verifiable labelings (LVL) in graphs; vertex labelings which are verifiable with constant-round local algorithms. This connection allows us to derive novel lower bounds on the convergence time to equilibrium of best-response dynamics in graphical games. Since we establish that distributed convergence can sometimes be provably slow, we also introduce and give bounds on an intuitive notion of "time-constrained" inefficiency of best responses. We exemplify how our results can be used in the implementation of mechanisms that ensure convergence of best responses to a Nash equilibrium. Our results thus also give insight into the convergence of strategy-proof algorithms for graphical games, which is still not well understood. AU - Hirvonen, Juho AU - Schmid, Laura AU - Chatterjee, Krishnendu AU - Schmid, Stefan ID - 15006 SN - 18688969 T2 - 27th International Conference on Principles of Distributed Systems TI - On the convergence time in graphical games: A locality-sensitive approach VL - 286 ER - TY - JOUR AB - Self-replication of amyloid fibrils via secondary nucleation is an intriguing physicochemical phenomenon in which existing fibrils catalyze the formation of their own copies. The molecular events behind this fibril surface-mediated process remain largely inaccessible to current structural and imaging techniques. Using statistical mechanics, computer modeling, and chemical kinetics, we show that the catalytic structure of the fibril surface can be inferred from the aggregation behavior in the presence and absence of a fibril-binding inhibitor. We apply our approach to the case of Alzheimer’s A amyloid fibrils formed in the presence of proSP-C Brichos inhibitors. We find that self-replication of A fibrils occurs on small catalytic sites on the fibril surface, which are far apart from each other, and each of which can be covered by a single Brichos inhibitor. AU - Curk, Samo AU - Krausser, Johannes AU - Meisl, Georg AU - Frenkel, Daan AU - Linse, Sara AU - Michaels, Thomas C.T. AU - Knowles, Tuomas P.J. AU - Šarić, Anđela ID - 15001 IS - 7 JF - Proceedings of the National Academy of Sciences of the United States of America TI - Self-replication of Aβ42 aggregates occurs on small and isolated fibril sites VL - 121 ER - TY - JOUR AB - The lattice Schwinger model, the discrete version of QED in 1 + 1 dimensions, is a well-studied test bench for lattice gauge theories. Here, we study the fractal properties of this model. We reveal the self-similarity of the ground state, which allows us to develop a recurrent procedure for finding the ground-state wave functions and predicting ground-state energies. We present the results of recurrently calculating ground-state wave functions using the fractal Ansatz and automized software package for fractal image processing. In certain parameter regimes, just a few terms are enough for our recurrent procedure to predict ground-state energies close to the exact ones for several hundreds of sites. Our findings pave the way to understanding the complexity of calculating many-body wave functions in terms of their fractal properties as well as finding new links between condensed matter and high-energy lattice models. AU - Petrova, Elena AU - Tiunov, Egor S. AU - Bañuls, Mari Carmen AU - Fedorov, Aleksey K. ID - 15002 IS - 5 JF - Physical Review Letters SN - 0031-9007 TI - Fractal states of the Schwinger model VL - 132 ER - TY - JOUR AB - In this paper we introduce the critical variational setting for parabolic stochastic evolution equations of quasi- or semi-linear type. Our results improve many of the abstract results in the classical variational setting. In particular, we are able to replace the usual weak or local monotonicity condition by a more flexible local Lipschitz condition. Moreover, the usual growth conditions on the multiplicative noise are weakened considerably. Our new setting provides general conditions under which local and global existence and uniqueness hold. Moreover, we prove continuous dependence on the initial data. We show that many classical SPDEs, which could not be covered by the classical variational setting, do fit in the critical variational setting. In particular, this is the case for the Cahn-Hilliard equations, tamed Navier-Stokes equations, and Allen-Cahn equation. AU - Agresti, Antonio AU - Veraar, Mark ID - 12485 JF - Probability Theory and Related Fields SN - 0178-8051 TI - The critical variational setting for stochastic evolution equations ER - TY - CONF AB - Oblivious routing is a well-studied paradigm that uses static precomputed routing tables for selecting routing paths within a network. Existing oblivious routing schemes with polylogarithmic competitive ratio for general networks are tree-based, in the sense that routing is performed according to a convex combination of trees. However, this restriction to trees leads to a construction that has time quadratic in the size of the network and does not parallelize well. In this paper we study oblivious routing schemes based on electrical routing. In particular, we show that general networks with n vertices and m edges admit a routing scheme that has competitive ratio O(log² n) and consists of a convex combination of only O(√m) electrical routings. This immediately leads to an improved construction algorithm with time Õ(m^{3/2}) that can also be implemented in parallel with Õ(√m) depth. AU - Goranci, Gramoz AU - Henzinger, Monika H AU - Räcke, Harald AU - Sachdeva, Sushant AU - Sricharan, A. R. ID - 15008 SN - 1868-8969 T2 - 15th Innovations in Theoretical Computer Science Conference TI - Electrical flows for polylogarithmic competitive oblivious routing VL - 287 ER - TY - CONF AB - Traditional blockchains grant the miner of a block full control not only over which transactions but also their order. This constitutes a major flaw discovered with the introduction of decentralized finance and allows miners to perform MEV attacks. In this paper, we address the issue of sandwich attacks by providing a construction that takes as input a blockchain protocol and outputs a new blockchain protocol with the same security but in which sandwich attacks are not profitable. Furthermore, our protocol is fully decentralized with no trusted third parties or heavy cryptography primitives and carries a linear increase in latency and minimum computation overhead. AU - Alpos, Orestis AU - Amores-Sesar, Ignacio AU - Cachin, Christian AU - Yeo, Michelle X ID - 15007 SN - 1868-8969 T2 - 27th International Conference on Principles of Distributed Systems TI - Eating sandwiches: Modular and lightweight elimination of transaction reordering attacks VL - 286 ER - TY - CONF AB - For a set of points in Rd, the Euclidean k-means problems consists of finding k centers such that the sum of distances squared from each data point to its closest center is minimized. Coresets are one the main tools developed recently to solve this problem in a big data context. They allow to compress the initial dataset while preserving its structure: running any algorithm on the coreset provides a guarantee almost equivalent to running it on the full data. In this work, we study coresets in a fully-dynamic setting: points are added and deleted with the goal to efficiently maintain a coreset with which a k-means solution can be computed. Based on an algorithm from Henzinger and Kale [ESA'20], we present an efficient and practical implementation of a fully dynamic coreset algorithm, that improves the running time by up to a factor of 20 compared to our non-optimized implementation of the algorithm by Henzinger and Kale, without sacrificing more than 7% on the quality of the k-means solution. AU - Henzinger, Monika H AU - Saulpic, David AU - Sidl, Leonhard ID - 14769 T2 - 2024 Proceedings of the Symposium on Algorithm Engineering and Experiments TI - Experimental evaluation of fully dynamic k-means via coresets ER - TY - JOUR AB - Since the commercialization of brine shrimp (genus Artemia) in the 1950s, this lineage, and in particular the model species Artemia franciscana, has been the subject of extensive research. However, our understanding of the genetic mechanisms underlying various aspects of their reproductive biology, including sex determination, is still lacking. This is partly due to the scarcity of genomic resources for Artemia species and crustaceans in general. Here, we present a chromosome-level genome assembly of A. franciscana (Kellogg 1906), from the Great Salt Lake, United States. The genome is 1 GB, and the majority of the genome (81%) is scaffolded into 21 linkage groups using a previously published high-density linkage map. We performed coverage and FST analyses using male and female genomic and transcriptomic reads to quantify the extent of differentiation between the Z and W chromosomes. Additionally, we quantified the expression levels in male and female heads and gonads and found further evidence for dosage compensation in this species. AU - Bett, Vincent K AU - Macon, Ariana AU - Vicoso, Beatriz AU - Elkrewi, Marwan N ID - 15009 IS - 1 JF - Genome Biology and Evolution TI - Chromosome-level assembly of Artemia franciscana sheds light on sex chromosome differentiation VL - 16 ER - TY - JOUR AB - The impulsive limit (the “sudden approximation”) has been widely employed to describe the interaction between molecules and short, far-off-resonant laser pulses. This approximation assumes that the timescale of the laser-molecule interaction is significantly shorter than the internal rotational period of the molecule, resulting in the rotational motion being instantaneously “frozen” during the interaction. This simplified description of the laser-molecule interaction is incorporated in various theoretical models predicting rotational dynamics of molecules driven by short laser pulses. In this theoretical work, we develop an effective theory for ultrashort laser pulses by examining the full time-evolution operator and solving the time-dependent Schrödinger equation at the operator level. Our findings reveal a critical angular momentum, lcrit, at which the impulsive limit breaks down. In other words, the validity of the sudden approximation depends not only on the pulse duration but also on its intensity, since the latter determines how many angular momentum states are populated. We explore both ultrashort multicycle (Gaussian) pulses and the somewhat less studied half-cycle pulses, which produce distinct effective potentials. We discuss the limitations of the impulsive limit and propose a method that rescales the effective matrix elements, enabling an improved and more accurate description of laser-molecule interactions. AU - Karle, Volker AU - Lemeshko, Mikhail ID - 15004 IS - 2 JF - Physical Review A SN - 2469-9926 TI - Modeling laser pulses as δ kicks: Reevaluating the impulsive limit in molecular rotational dynamics VL - 109 ER - TY - DATA AB - Since the commercialization of brine shrimp (genus Artemia) in the 1950s, this lineage, and in particular the model species Artemia franciscana, has been the subject of extensive research. However, our understanding of the genetic mechanisms underlying various aspects of their reproductive biology, including sex determination, are still lacking. This is partly due to the scarcity of genomic resources for Artemia species and crustaceans in general. Here, we present a chromosome-level genome assembly of Artemia franciscana (Kellogg 1906), from the Great Salt Lake, USA. The genome is 1GB, and the majority of the genome (81%) is scaffolded into 21 linkage groups using a previously published high-density linkage map. We performed coverage and FST analyses using male and female genomic and transcriptomic reads to quantify the extent of differentiation between the Z and W chromosomes. Additionally, we quantified the expression levels in male and female heads and gonads and found further evidence for dosage compensation in this species. AU - Elkrewi, Marwan N ID - 14705 KW - sex chromosome evolution KW - genome assembly KW - dosage compensation TI - Data from "Chromosome-level assembly of Artemia franciscana sheds light on sex-chromosome differentiation" ER - TY - JOUR AB - Magnetic frustration allows to access novel and intriguing properties of magnetic systems and has been explored mainly in planar triangular-like arrays of magnetic ions. In this work, we describe the phosphide Ce6Ni6P17, where the Ce+3 ions accommodate in a body-centered cubic lattice of Ce6 regular octahedra. From measurements of magnetization, specific heat, and resistivity, we determine a rich phase diagram as a function of temperature and magnetic field in which different magnetic phases are found. Besides clear evidence of magnetic frustration is obtained from entropy analysis. At zero field, a second-order antiferromagnetic transition occurs at TN1≈1 K followed by a first-order transition at TN2≈0.45 K. With magnetic field new magnetic phases appear, including a weakly first-order transition which ends in a classical critical point and a third magnetic phase. We also study the exact solution of the spin-1/2 Heisenberg model in an octahedron which allows us a qualitative understanding of the phase diagram and compare with the experimental results. AU - Franco, D. G. AU - Avalos, R. AU - Hafner, D. AU - Modic, Kimberly A AU - Prots, Yu AU - Stockert, O. AU - Hoser, A. AU - Moll, P. J.W. AU - Brando, M. AU - Aligia, A. A. AU - Geibel, C. ID - 15003 IS - 5 JF - Physical Review B SN - 2469-9950 TI - Frustrated magnetism in octahedra-based Ce6 Ni6 P17 VL - 109 ER - TY - JOUR AB - The epitaxial growth of a strained Ge layer, which is a promising candidate for the channel material of a hole spin qubit, has been demonstrated on 300 mm Si wafers using commercially available Si0.3Ge0.7 strain relaxed buffer (SRB) layers. The assessment of the layer and the interface qualities for a buried strained Ge layer embedded in Si0.3Ge0.7 layers is reported. The XRD reciprocal space mapping confirmed that the reduction of the growth temperature enables the 2-dimensional growth of the Ge layer fully strained with respect to the Si0.3Ge0.7. Nevertheless, dislocations at the top and/or bottom interface of the Ge layer were observed by means of electron channeling contrast imaging, suggesting the importance of the careful dislocation assessment. The interface abruptness does not depend on the selection of the precursor gases, but it is strongly influenced by the growth temperature which affects the coverage of the surface H-passivation. The mobility of 2.7 × 105 cm2/Vs is promising, while the low percolation density of 3 × 1010 /cm2 measured with a Hall-bar device at 7 K illustrates the high quality of the heterostructure thanks to the high Si0.3Ge0.7 SRB quality. AU - Shimura, Yosuke AU - Godfrin, Clement AU - Hikavyy, Andriy AU - Li, Roy AU - Aguilera Servin, Juan L AU - Katsaros, Georgios AU - Favia, Paola AU - Han, Han AU - Wan, Danny AU - de Greve, Kristiaan AU - Loo, Roger ID - 15018 IS - 5 JF - Materials Science in Semiconductor Processing KW - Mechanical Engineering KW - Mechanics of Materials KW - Condensed Matter Physics KW - General Materials Science SN - 1369-8001 TI - Compressively strained epitaxial Ge layers for quantum computing applications VL - 174 ER - TY - CONF AB - Pruning large language models (LLMs) from the BERT family has emerged as a standard compression benchmark, and several pruning methods have been proposed for this task. The recent “Sparsity May Cry” (SMC) benchmark put into question the validity of all existing methods, exhibiting a more complex setup where many known pruning methods appear to fail. We revisit the question of accurate BERT-pruning during fine-tuning on downstream datasets, and propose a set of general guidelines for successful pruning, even on the challenging SMC benchmark. First, we perform a cost-vs-benefits analysis of pruning model components, such as the embeddings and the classification head; second, we provide a simple-yet-general way of scaling training, sparsification and learning rate schedules relative to the desired target sparsity; finally, we investigate the importance of proper parametrization for Knowledge Distillation in the context of LLMs. Our simple insights lead to state-of-the-art results, both on classic BERT-pruning benchmarks, as well as on the SMC benchmark, showing that even classic gradual magnitude pruning (GMP) can yield competitive results, with the right approach. AU - Kurtic, Eldar AU - Hoefler, Torsten AU - Alistarh, Dan-Adrian ID - 15011 T2 - Proceedings of Machine Learning Research TI - How to prune your language model: Recovering accuracy on the "Sparsity May Cry" benchmark VL - 234 ER - TY - JOUR AB - Electrostatic correlations between ions dissolved in water are known to impact their transport properties in numerous ways, from conductivity to ion selectivity. The effects of these correlations on the solvent itself remain, however, much less clear. In particular, the addition of salt has been consistently reported to affect the solution’s viscosity, but most modeling attempts fail to reproduce experimental data even at moderate salt concentrations. Here, we use an approach based on stochastic density functional theory, which accurately captures charge fluctuations and correlations. We derive a simple analytical expression for the viscosity correction in concentrated electrolytes, by directly linking it to the liquid’s structure factor. Our prediction compares quantitatively to experimental data at all temperatures and all salt concentrations up to the saturation limit. This universal link between the microscopic structure and viscosity allows us to shed light on the nanoscale dynamics of water and ions under highly concentrated and correlated conditions. AU - Robin, Paul ID - 15024 IS - 6 JF - Journal of Chemical Physics SN - 0021-9606 TI - Correlation-induced viscous dissipation in concentrated electrolytes VL - 160 ER - TY - JOUR AB - We consider quadratic forms of deterministic matrices A evaluated at the random eigenvectors of a large N×N GOE or GUE matrix, or equivalently evaluated at the columns of a Haar-orthogonal or Haar-unitary random matrix. We prove that, as long as the deterministic matrix has rank much smaller than √N, the distributions of the extrema of these quadratic forms are asymptotically the same as if the eigenvectors were independent Gaussians. This reduces the problem to Gaussian computations, which we carry out in several cases to illustrate our result, finding Gumbel or Weibull limiting distributions depending on the signature of A. Our result also naturally applies to the eigenvectors of any invariant ensemble. AU - Erdös, László AU - McKenna, Benjamin ID - 15025 IS - 1B JF - Annals of Applied Probability SN - 1050-5164 TI - Extremal statistics of quadratic forms of GOE/GUE eigenvectors VL - 34 ER - TY - JOUR AB - The GNOM (GN) Guanine nucleotide Exchange Factor for ARF small GTPases (ARF-GEF) is among the best studied trafficking regulators in plants, playing crucial and unique developmental roles in patterning and polarity. The current models place GN at the Golgi apparatus (GA), where it mediates secretion/recycling, and at the plasma membrane (PM) presumably contributing to clathrin-mediated endocytosis (CME). The mechanistic basis of the developmental function of GN, distinct from the other ARF-GEFs including its closest homologue GNOM-LIKE1 (GNL1), remains elusive. Insights from this study largely extend the current notions of GN function. We show that GN, but not GNL1, localizes to the cell periphery at long-lived structures distinct from clathrin-coated pits, while CME and secretion proceed normally in gn knockouts. The functional GN mutant variant GNfewerroots, absent from the GA, suggests that the cell periphery is the major site of GN action responsible for its developmental function. Following inhibition by Brefeldin A, GN, but not GNL1, relocates to the PM likely on exocytic vesicles, suggesting selective molecular associations en route to the cell periphery. A study of GN-GNL1 chimeric ARF-GEFs indicates that all GN domains contribute to the specific GN function in a partially redundant manner. Together, this study offers significant steps toward the elucidation of the mechanism underlying unique cellular and development functions of GNOM. AU - Adamowski, Maciek AU - Matijevic, Ivana AU - Friml, Jiří ID - 15033 JF - eLife KW - General Immunology and Microbiology KW - General Biochemistry KW - Genetics and Molecular Biology KW - General Medicine KW - General Neuroscience SN - 2050-084X TI - Developmental patterning function of GNOM ARF-GEF mediated from the cell periphery VL - 13 ER - TY - JOUR AB - In animals, parasitic infections impose significant fitness costs.1,2,3,4,5,6 Infected animals can alter their feeding behavior to resist infection,7,8,9,10,11,12 but parasites can manipulate animal foraging behavior to their own benefits.13,14,15,16 How nutrition influences host-parasite interactions is not well understood, as studies have mainly focused on the host and less on the parasite.9,12,17,18,19,20,21,22,23 We used the nutritional geometry framework24 to investigate the role of amino acids (AA) and carbohydrates (C) in a host-parasite system: the Argentine ant, Linepithema humile, and the entomopathogenic fungus, Metarhizium brunneum. First, using 18 diets varying in AA:C composition, we established that the fungus performed best on the high-amino-acid diet 1:4. Second, we found that the fungus reached this optimal diet when given various diet pairings, revealing its ability to cope with nutritional challenges. Third, we showed that the optimal fungal diet reduced the lifespan of healthy ants when compared with a high-carbohydrate diet but had no effect on infected ants. Fourth, we revealed that infected ant colonies, given a choice between the optimal fungal diet and a high-carbohydrate diet, chose the optimal fungal diet, whereas healthy colonies avoided it. Lastly, by disentangling fungal infection from host immune response, we demonstrated that infected ants foraged on the optimal fungal diet in response to immune activation and not as a result of parasite manipulation. Therefore, we revealed that infected ant colonies chose a diet that is costly for survival in the long term but beneficial in the short term—a form of collective self-medication. AU - Csata, Eniko AU - Perez-Escudero, Alfonso AU - Laury, Emmanuel AU - Leitner, Hanna AU - Latil, Gerard AU - Heinze, Juerge AU - Simpson, Stephen AU - Cremer, Sylvia AU - Dussutour, Audrey ID - 14479 IS - 4 JF - Current Biology SN - 0960-9822 TI - Fungal infection alters collective nutritional intake of ant colonies VL - 34 ER - TY - JOUR AB - Coupling of orbital motion to a spin degree of freedom gives rise to various transport phenomena in quantum systems that are beyond the standard paradigms of classical physics. Here, we discuss features of spin-orbit dynamics that can be visualized using a classical model with two coupled angular degrees of freedom. Specifically, we demonstrate classical ‘spin’ filtering through our model and show that the interplay between angular degrees of freedom and dissipation can lead to asymmetric ‘spin’ transport. AU - Varshney, Atul AU - Ghazaryan, Areg AU - Volosniev, Artem ID - 15045 JF - Few-Body Systems KW - Atomic and Molecular Physics KW - and Optics SN - 1432-5411 TI - Classical ‘spin’ filtering with two degrees of freedom and dissipation VL - 65 ER - TY - JOUR AB - Atom-based quantum simulators have had many successes in tackling challenging quantum many-body problems, owing to the precise and dynamical control that they provide over the systems' parameters. They are, however, often optimized to address a specific type of problem. Here, we present the design and implementation of a 6Li-based quantum gas platform that provides wide-ranging capabilities and is able to address a variety of quantum many-body problems. Our two-chamber architecture relies on a robust combination of gray molasses and optical transport from a laser-cooling chamber to a glass cell with excellent optical access. There, we first create unitary Fermi superfluids in a three-dimensional axially symmetric harmonic trap and characterize them using in situ thermometry, reaching temperatures below 20 nK. This allows us to enter the deep superfluid regime with samples of extreme diluteness, where the interparticle spacing is sufficiently large for direct single-atom imaging. Second, we generate optical lattice potentials with triangular and honeycomb geometry in which we study diffraction of molecular Bose-Einstein condensates, and show how going beyond the Kapitza-Dirac regime allows us to unambiguously distinguish between the two geometries. With the ability to probe quantum many-body physics in both discrete and continuous space, and its suitability for bulk and single-atom imaging, our setup represents an important step towards achieving a wide-scope quantum simulator. AU - Jin, Shuwei AU - Dai, Kunlun AU - Verstraten, Joris AU - Dixmerias, Maxime AU - Al Hyder, Ragheed AU - Salomon, Christophe AU - Peaudecerf, Bruno AU - de Jongh, Tim AU - Yefsah, Tarik ID - 15053 IS - 1 JF - Physical Review Research KW - General Physics and Astronomy SN - 2643-1564 TI - Multipurpose platform for analog quantum simulation VL - 6 ER - TY - JOUR AB - Embryogenesis results from the coordinated activities of different signaling pathways controlling cell fate specification and morphogenesis. In vertebrate gastrulation, both Nodal and BMP signaling play key roles in germ layer specification and morphogenesis, yet their interplay to coordinate embryo patterning with morphogenesis is still insufficiently understood. Here, we took a reductionist approach using zebrafish embryonic explants to study the coordination of Nodal and BMP signaling for embryo patterning and morphogenesis. We show that Nodal signaling triggers explant elongation by inducing mesendodermal progenitors but also suppressing BMP signaling activity at the site of mesendoderm induction. Consistent with this, ectopic BMP signaling in the mesendoderm blocks cell alignment and oriented mesendoderm intercalations, key processes during explant elongation. Translating these ex vivo observations to the intact embryo showed that, similar to explants, Nodal signaling suppresses the effect of BMP signaling on cell intercalations in the dorsal domain, thus allowing robust embryonic axis elongation. These findings suggest a dual function of Nodal signaling in embryonic axis elongation by both inducing mesendoderm and suppressing BMP effects in the dorsal portion of the mesendoderm. AU - Schauer, Alexandra AU - Pranjic-Ferscha, Kornelija AU - Hauschild, Robert AU - Heisenberg, Carl-Philipp J ID - 15048 IS - 4 JF - Development SN - 0950-1991 TI - Robust axis elongation by Nodal-dependent restriction of BMP signaling VL - 151 ER - TY - JOUR AB - Substrate induces mechanical strain on perovskite devices, which can result in alterations to its lattice dynamics and thermal transport. Herein, we have performed a theoretical investigation on the anharmonic lattice dynamics and thermal property of perovskite Rb2SnBr6 and Cs2SnBr6 under strains using perturbation theory up to the fourth-order terms and the unified thermal transport theory. We demonstrate a pronounced hardening of low-frequency optical phonons as temperature increases, indicating strong lattice anharmonicity and the necessity of adopting temperature-dependent interatomic force constants in the lattice thermal conductivity ( κL) calculations. It is found that the low-lying optical phonon modes of Rb2SnBr6 are extremely soft and their phonon energies are almost strain independent, which ultimately lead to a lower κL and a weaker strain dependence than Cs2SnBr6. We further reveal that the strain dependence of these phonon modes in the A2XB6-type perovskites weakens as their ibrational frequency decreases. This study deepens the understanding of lattice thermal transport in perovskites A2XB6 and provides a perspective on the selection of materials that meet the expected thermal behaviors in practical applications. AU - Cheng, Ruihuan AU - Zeng, Zezhu AU - Wang, Chen AU - Ouyang, Niuchang AU - Chen, Yue ID - 15052 IS - 5 JF - Physical Review B SN - 2469-9950 TI - Impact of strain-insensitive low-frequency phonon modes on lattice thermal transport in AxXB6-type perovskites VL - 109 ER - TY - JOUR AB - Tropical precipitation extremes and their changes with surface warming are investigated using global storm resolving simulations and high-resolution observations. The simulations demonstrate that the mesoscale organization of convection, a process that cannot be physically represented by conventional global climate models, is important for the variations of tropical daily accumulated precipitation extremes. In both the simulations and observations, daily precipitation extremes increase in a more organized state, in association with larger, but less frequent, storms. Repeating the simulations for a warmer climate results in a robust increase in monthly-mean daily precipitation extremes. Higher precipitation percentiles have a greater sensitivity to convective organization, which is predicted to increase with warming. Without changes in organization, the strongest daily precipitation extremes over the tropical oceans increase at a rate close to Clausius-Clapeyron (CC) scaling. Thus, in a future warmer state with increased organization, the strongest daily precipitation extremes over oceans increase at a faster rate than CC scaling. AU - Bao, Jiawei AU - Stevens, Bjorn AU - Kluft, Lukas AU - Muller, Caroline J ID - 15047 IS - 8 JF - Science Advances TI - Intensification of daily tropical precipitation extremes from more organized convection VL - 10 ER - TY - JOUR AB - The superior colliculus (SC) in the mammalian midbrain is essential for multisensory integration and is composed of a rich diversity of excitatory and inhibitory neurons and glia. However, the developmental principles directing the generation of SC cell-type diversity are not understood. Here, we pursued systematic cell lineage tracing in silico and in vivo, preserving full spatial information, using genetic mosaic analysis with double markers (MADM)-based clonal analysis with single-cell sequencing (MADM-CloneSeq). The analysis of clonally related cell lineages revealed that radial glial progenitors (RGPs) in SC are exceptionally multipotent. Individual resident RGPs have the capacity to produce all excitatory and inhibitory SC neuron types, even at the stage of terminal division. While individual clonal units show no pre-defined cellular composition, the establishment of appropriate relative proportions of distinct neuronal types occurs in a PTEN-dependent manner. Collectively, our findings provide an inaugural framework at the single-RGP/-cell level of the mammalian SC ontogeny. AU - Cheung, Giselle T AU - Pauler, Florian AU - Koppensteiner, Peter AU - Krausgruber, Thomas AU - Streicher, Carmen AU - Schrammel, Martin AU - Özgen, Natalie Y AU - Ivec, Alexis AU - Bock, Christoph AU - Shigemoto, Ryuichi AU - Hippenmeyer, Simon ID - 12875 IS - 2 JF - Neuron SN - 0896-6273 TI - Multipotent progenitors instruct ontogeny of the superior colliculus VL - 112 ER - TY - JOUR AB - Poxviruses are among the largest double-stranded DNA viruses, with members such as variola virus, monkeypox virus and the vaccination strain vaccinia virus (VACV). Knowledge about the structural proteins that form the viral core has remained sparse. While major core proteins have been annotated via indirect experimental evidence, their structures have remained elusive and they could not be assigned to individual core features. Hence, which proteins constitute which layers of the core, such as the palisade layer and the inner core wall, has remained enigmatic. Here we show, using a multi-modal cryo-electron microscopy (cryo-EM) approach in combination with AlphaFold molecular modeling, that trimers formed by the cleavage product of VACV protein A10 are the key component of the palisade layer. This allows us to place previously obtained descriptions of protein interactions within the core wall into perspective and to provide a detailed model of poxvirus core architecture. Importantly, we show that interactions within A10 trimers are likely generalizable over members of orthopox- and parapoxviruses. AU - Datler, Julia AU - Hansen, Jesse AU - Thader, Andreas AU - Schlögl, Alois AU - Bauer, Lukas W AU - Hodirnau, Victor-Valentin AU - Schur, Florian KM ID - 14979 JF - Nature Structural & Molecular Biology KW - Molecular Biology KW - Structural Biology SN - 1545-9993 TI - Multi-modal cryo-EM reveals trimers of protein A10 to form the palisade layer in poxvirus cores ER - TY - JOUR AB - Contraction and flow of the actin cell cortex have emerged as a common principle by which cells reorganize their cytoplasm and take shape. However, how these cortical flows interact with adjacent cytoplasmic components, changing their form and localization, and how this affects cytoplasmic organization and cell shape remains unclear. Here we show that in ascidian oocytes, the cooperative activities of cortical actomyosin flows and deformation of the adjacent mitochondria-rich myoplasm drive oocyte cytoplasmic reorganization and shape changes following fertilization. We show that vegetal-directed cortical actomyosin flows, established upon oocyte fertilization, lead to both the accumulation of cortical actin at the vegetal pole of the zygote and compression and local buckling of the adjacent elastic solid-like myoplasm layer due to friction forces generated at their interface. Once cortical flows have ceased, the multiple myoplasm buckles resolve into one larger buckle, which again drives the formation of the contraction pole—a protuberance of the zygote’s vegetal pole where maternal mRNAs accumulate. Thus, our findings reveal a mechanism where cortical actomyosin network flows determine cytoplasmic reorganization and cell shape by deforming adjacent cytoplasmic components through friction forces. AU - Caballero Mancebo, Silvia AU - Shinde, Rushikesh AU - Bolger-Munro, Madison AU - Peruzzo, Matilda AU - Szep, Gregory AU - Steccari, Irene AU - Labrousse Arias, David AU - Zheden, Vanessa AU - Merrin, Jack AU - Callan-Jones, Andrew AU - Voituriez, Raphaël AU - Heisenberg, Carl-Philipp J ID - 14846 JF - Nature Physics SN - 1745-2473 TI - Friction forces determine cytoplasmic reorganization and shape changes of ascidian oocytes upon fertilization ER - TY - JOUR AB - Key innovations are fundamental to biological diversification, but their genetic basis is poorly understood. A recent transition from egg-laying to live-bearing in marine snails (Littorina spp.) provides the opportunity to study the genetic architecture of an innovation that has evolved repeatedly across animals. Individuals do not cluster by reproductive mode in a genome-wide phylogeny, but local genealogical analysis revealed numerous small genomic regions where all live-bearers carry the same core haplotype. Candidate regions show evidence for live-bearer–specific positive selection and are enriched for genes that are differentially expressed between egg-laying and live-bearing reproductive systems. Ages of selective sweeps suggest that live-bearer–specific alleles accumulated over more than 200,000 generations. Our results suggest that new functions evolve through the recruitment of many alleles rather than in a single evolutionary step. AU - Stankowski, Sean AU - Zagrodzka, Zuzanna B. AU - Garlovsky, Martin D. AU - Pal, Arka AU - Shipilina, Daria AU - Garcia Castillo, Diego Fernando AU - Lifchitz, Hila AU - Le Moan, Alan AU - Leder, Erica AU - Reeve, James AU - Johannesson, Kerstin AU - Westram, Anja M AU - Butlin, Roger K. ID - 14796 IS - 6678 JF - Science TI - The genetic basis of a recent transition to live-bearing in marine snails VL - 383 ER - TY - THES AB - This thesis consists of four distinct pieces of work within theoretical biology, with two themes in common: the concept of optimization in biological systems, and the use of information-theoretic tools to quantify biological stochasticity and statistical uncertainty. Chapter 2 develops a statistical framework for studying biological systems which we believe to be optimized for a particular utility function, such as retinal neurons conveying information about visual stimuli. We formalize such beliefs as maximum-entropy Bayesian priors, constrained by the expected utility. We explore how such priors aid inference of system parameters with limited data and enable optimality hypothesis testing: is the utility higher than by chance? Chapter 3 examines the ultimate biological optimization process: evolution by natural selection. As some individuals survive and reproduce more successfully than others, populations evolve towards fitter genotypes and phenotypes. We formalize this as accumulation of genetic information, and use population genetics theory to study how much such information can be accumulated per generation and maintained in the face of random mutation and genetic drift. We identify the population size and fitness variance as the key quantities that control information accumulation and maintenance. Chapter 4 reuses the concept of genetic information from Chapter 3, but from a different perspective: we ask how much genetic information organisms actually need, in particular in the context of gene regulation. For example, how much information is needed to bind transcription factors at correct locations within the genome? Population genetics provides us with a refined answer: with an increasing population size, populations achieve higher fitness by maintaining more genetic information. Moreover, regulatory parameters experience selection pressure to optimize the fitness-information trade-off, i.e. minimize the information needed for a given fitness. This provides an evolutionary derivation of the optimization priors introduced in Chapter 2. Chapter 5 proves an upper bound on mutual information between a signal and a communication channel output (such as neural activity). Mutual information is an important utility measure for biological systems, but its practical use can be difficult due to the large dimensionality of many biological channels. Sometimes, a lower bound on mutual information is computed by replacing the high-dimensional channel outputs with decodes (signal estimates). Our result provides a corresponding upper bound, provided that the decodes are the maximum posterior estimates of the signal. AU - Hledik, Michal ID - 15020 KW - Theoretical biology KW - Optimality KW - Evolution KW - Information SN - 2663 - 337X TI - Genetic information and biological optimization ER - TY - GEN AB - Eva Benkova received a PhD in Biophysics at the Institute of Biophysics of the Czech Academy of Sciences in 1998. After working as a postdoc at the Max Planck Institute in Cologne and the Center for Plant Molecular Biology (ZMBP) in Tübingen, she became a group leader at the Plant Systems Biology Department of the Vlaams Instituut voor Biotechnologie (VIB) in Gent. In 2012, she transitioned to an Assistant Professor position at the Institute of Science and Technology Austria (ISTA) where she was later promoted to Professor. Since 2021, she has served as the Dean of the ISTA Graduate School. As a plant developmental biologist, she focuses on unraveling the molecular mechanisms and principles that underlie hormonal interactions in plants. In her current work, she explores the intricate connections between hormones and regulatory pathways that mediate the perception of environmental stimuli, including abiotic stress and nitrate availability. AU - Benková, Eva ID - 14842 IS - 1 T2 - Current Biology TI - Eva Benkova VL - 34 ER - TY - JOUR AB - GABAB receptor (GBR) activation inhibits neurotransmitter release in axon terminals in the brain, except in medial habenula (MHb) terminals, which show robust potentiation. However, mechanisms underlying this enigmatic potentiation remain elusive. Here, we report that GBR activation on MHb terminals induces an activity-dependent transition from a facilitating, tonic to a depressing, phasic neurotransmitter release mode. This transition is accompanied by a 4.1-fold increase in readily releasable vesicle pool (RRP) size and a 3.5-fold increase of docked synaptic vesicles (SVs) at the presynaptic active zone (AZ). Strikingly, the depressing phasic release exhibits looser coupling distance than the tonic release. Furthermore, the tonic and phasic release are selectively affected by deletion of synaptoporin (SPO) and Ca 2+ -dependent activator protein for secretion 2 (CAPS2), respectively. SPO modulates augmentation, the short-term plasticity associated with tonic release, and CAPS2 retains the increased RRP for initial responses in phasic response trains. The cytosolic protein CAPS2 showed a SV-associated distribution similar to the vesicular transmembrane protein SPO, and they were colocalized in the same terminals. We developed the “Flash and Freeze-fracture” method, and revealed the release of SPO-associated vesicles in both tonic and phasic modes and activity-dependent recruitment of CAPS2 to the AZ during phasic release, which lasted several minutes. Overall, these results indicate that GBR activation translocates CAPS2 to the AZ along with the fusion of CAPS2-associated SVs, contributing to persistency of the RRP increase. Thus, we identified structural and molecular mechanisms underlying tonic and phasic neurotransmitter release and their transition by GBR activation in MHb terminals. AU - Koppensteiner, Peter AU - Bhandari, Pradeep AU - Önal, Hüseyin C AU - Borges Merjane, Carolina AU - Le Monnier, Elodie AU - Roy, Utsa AU - Nakamura, Yukihiro AU - Sadakata, Tetsushi AU - Sanbo, Makoto AU - Hirabayashi, Masumi AU - Rhee, JeongSeop AU - Brose, Nils AU - Jonas, Peter M AU - Shigemoto, Ryuichi ID - 15084 IS - 8 JF - Proceedings of the National Academy of Sciences SN - 0027-8424 TI - GABAB receptors induce phasic release from medial habenula terminals through activity-dependent recruitment of release-ready vesicles VL - 121 ER - TY - JOUR AB - Direct reciprocity is a powerful mechanism for cooperation in social dilemmas. The very logic of reciprocity, however, seems to require that individuals are symmetric, and that everyone has the same means to influence each others’ payoffs. Yet in many applications, individuals are asymmetric. Herein, we study the effect of asymmetry in linear public good games. Individuals may differ in their endowments (their ability to contribute to a public good) and in their productivities (how effective their contributions are). Given the individuals’ productivities, we ask which allocation of endowments is optimal for cooperation. To this end, we consider two notions of optimality. The first notion focuses on the resilience of cooperation. The respective endowment distribution ensures that full cooperation is feasible even under the most adverse conditions. The second notion focuses on efficiency. The corresponding endowment distribution maximizes group welfare. Using analytical methods, we fully characterize these two endowment distributions. This analysis reveals that both optimality notions favor some endowment inequality: More productive players ought to get higher endowments. Yet the two notions disagree on how unequal endowments are supposed to be. A focus on resilience results in less inequality. With additional simulations, we show that the optimal endowment allocation needs to account for both the resilience and the efficiency of cooperation. AU - Hübner, Valentin AU - Staab, Manuel AU - Hilbe, Christian AU - Chatterjee, Krishnendu AU - Kleshnina, Maria ID - 15083 IS - 10 JF - Proceedings of the National Academy of Sciences SN - 0027-8424 TI - Efficiency and resilience of cooperation in asymmetric social dilemmas VL - 121 ER - TY - GEN AB - in the research article "Efficiency and resilience of cooperation in asymmetric social dilemmas" (by Valentin Hübner, Manuel Staab, Christian Hilbe, Krishnendu Chatterjee, and Maria Kleshnina). We used different implementations for the case of two and three players, both described below. AU - Hübner, Valentin AU - Kleshnina, Maria ID - 15108 TI - Computer code for "Efficiency and resilience of cooperation in asymmetric social dilemmas" ER - TY - JOUR AB - Global storm-resolving models (GSRMs) use strongly refined horizontal grids compared with the climate models typically used in the Coupled Model Intercomparison Project (CMIP) but employ comparable vertical grid spacings. Here, we study how changes in the vertical grid spacing and adjustments to the integration time step affect the basic climate quantities simulated by the ICON-Sapphire atmospheric GSRM. Simulations are performed over a 45 d period for five different vertical grids with between 55 and 540 vertical layers and maximum tropospheric vertical grid spacings of between 800 and 50 m, respectively. The effects of changes in the vertical grid spacing are compared with the effects of reducing the horizontal grid spacing from 5 to 2.5 km. For most of the quantities considered, halving the vertical grid spacing has a smaller effect than halving the horizontal grid spacing, but it is not negligible. Each halving of the vertical grid spacing, along with the necessary reductions in time step length, increases cloud liquid water by about 7 %, compared with an approximate 16 % decrease for halving the horizontal grid spacing. The effect is due to both the vertical grid refinement and the time step reduction. There is no tendency toward convergence in the range of grid spacings tested here. The cloud ice amount also increases with a refinement in the vertical grid, but it is hardly affected by the time step length and does show a tendency to converge. While the effect on shortwave radiation is globally dominated by the altered reflection due to the change in the cloud liquid water content, the effect on longwave radiation is more difficult to interpret because changes in the cloud ice concentration and cloud fraction are anticorrelated in some regions. The simulations show that using a maximum tropospheric vertical grid spacing larger than 400 m would increase the truncation error strongly. Computing time investments in a further vertical grid refinement can affect the truncation errors of GSRMs similarly to comparable investments in horizontal refinement, because halving the vertical grid spacing is generally cheaper than halving the horizontal grid spacing. However, convergence of boundary layer cloud properties cannot be expected, even for the smallest maximum tropospheric grid spacing of 50 m used in this study. AU - Schmidt, Hauke AU - Rast, Sebastian AU - Bao, Jiawei AU - Cassim, Amrit AU - Fang, Shih Wei AU - Jimenez-De La Cuesta, Diego AU - Keil, Paul AU - Kluft, Lukas AU - Kroll, Clarissa AU - Lang, Theresa AU - Niemeier, Ulrike AU - Schneidereit, Andrea AU - Williams, Andrew I.L. AU - Stevens, Bjorn ID - 15097 IS - 4 JF - Geoscientific Model Development SN - 1991-959X TI - Effects of vertical grid spacing on the climate simulated in the ICON-Sapphire global storm-resolving model VL - 17 ER - TY - JOUR AB - In this note, we prove a formula for the cancellation exponent kv,n between division polynomials ψn and ϕn associated with a sequence {nP}n∈N of points on an elliptic curve E defined over a discrete valuation field K. The formula greatly generalizes the previously known special cases and treats also the case of non-standard Kodaira types for non-perfect residue fields. AU - Naskręcki, Bartosz AU - Verzobio, Matteo ID - 12311 JF - Proceedings of the Royal Society of Edinburgh Section A: Mathematics KW - Elliptic curves KW - Néron models KW - division polynomials KW - height functions KW - discrete valuation rings SN - 0308-2105 TI - Common valuations of division polynomials ER - TY - JOUR AB - Speciation is a key evolutionary process that is not yet fully understood. Combining population genomic and ecological data from multiple diverging pairs of marine snails (Littorina) supports the search for speciation mechanisms. Placing pairs on a one-dimensional speciation continuum, from undifferentiated populations to species, obscured the complexity of speciation. Adding multiple axes helped to describe either speciation routes or reproductive isolation in the snails. Divergent ecological selection repeatedly generated barriers between ecotypes, but appeared less important in completing speciation while genetic incompatibilities played a key role. Chromosomal inversions contributed to genomic barriers, but with variable impact. A multidimensional (hypercube) approach supported framing of questions and identification of knowledge gaps and can be useful to understand speciation in many other systems. AU - Johannesson, Kerstin AU - Faria, Rui AU - Le Moan, Alan AU - Rafajlović, Marina AU - Westram, Anja M AU - Butlin, Roger K. AU - Stankowski, Sean ID - 15099 JF - Trends in Genetics SN - 0168-9525 TI - Diverse pathways to speciation revealed by marine snails ER - TY - JOUR AB - The paper is devoted to the analysis of the global well-posedness and the interior regularity of the 2D Navier–Stokes equations with inhomogeneous stochastic boundary conditions. The noise, white in time and coloured in space, can be interpreted as the physical law describing the driving mechanism on the atmosphere–ocean interface, i.e. as a balance of the shear stress of the ocean and the horizontal wind force. AU - Agresti, Antonio AU - Luongo, Eliseo ID - 15098 JF - Mathematische Annalen SN - 0025-5831 TI - Global well-posedness and interior regularity of 2D Navier-Stokes equations with stochastic boundary conditions ER - TY - JOUR AB - The coupling between Ca2+ channels and release sensors is a key factor defining the signaling properties of a synapse. However, the coupling nanotopography at many synapses remains unknown, and it is unclear how it changes during development. To address these questions, we examined coupling at the cerebellar inhibitory basket cell (BC)-Purkinje cell (PC) synapse. Biophysical analysis of transmission by paired recording and intracellular pipette perfusion revealed that the effects of exogenous Ca2+ chelators decreased during development, despite constant reliance of release on P/Q-type Ca2+ channels. Structural analysis by freeze-fracture replica labeling (FRL) and transmission electron microscopy (EM) indicated that presynaptic P/Q-type Ca2+ channels formed nanoclusters throughout development, whereas docked vesicles were only clustered at later developmental stages. Modeling suggested a developmental transformation from a more random to a more clustered coupling nanotopography. Thus, presynaptic signaling developmentally approaches a point-to-point configuration, optimizing speed, reliability, and energy efficiency of synaptic transmission. AU - Chen, JingJing AU - Kaufmann, Walter AU - Chen, Chong AU - Arai, Itaru AU - Kim, Olena AU - Shigemoto, Ryuichi AU - Jonas, Peter M ID - 14843 JF - Neuron SN - 0896-6273 TI - Developmental transformation of Ca2+ channel-vesicle nanotopography at a central GABAergic synapse ER - TY - THES AU - Chen, JingJing ID - 15101 SN - 2663 - 337X TI - Developmental transformation of nanodomain coupling between Ca2+ channels and release sensors at a central GABAergic synapse ER - TY - JOUR AB - Quantum computers are increasing in size and quality but are still very noisy. Error mitigation extends the size of the quantum circuits that noisy devices can meaningfully execute. However, state-of-the-art error mitigation methods are hard to implement and the limited qubit connectivity in superconducting qubit devices restricts most applications to the hardware's native topology. Here we show a quantum approximate optimization algorithm (QAOA) on nonplanar random regular graphs with up to 40 nodes enabled by a machine learning-based error mitigation. We use a swap network with careful decision-variable-to-qubit mapping and a feed-forward neural network to optimize a depth-two QAOA on up to 40 qubits. We observe a meaningful parameter optimization for the largest graph which requires running quantum circuits with 958 two-qubit gates. Our paper emphasizes the need to mitigate samples, and not only expectation values, in quantum approximate optimization. These results are a step towards executing quantum approximate optimization at a scale that is not classically simulable. Reaching such system sizes is key to properly understanding the true potential of heuristic algorithms like QAOA. AU - Sack, Stefan AU - Egger, Daniel J. ID - 15122 IS - 1 JF - Physical Review Research SN - 2643-1564 TI - Large-scale quantum approximate optimization on nonplanar graphs with machine learning noise mitigation VL - 6 ER - TY - JOUR AB - Cell division in all domains of life requires the orchestration of many proteins, but in Archaea most of the machinery remains poorly characterized. Here we investigate the FtsZ-based cell division mechanism in Haloferax volcanii and find proteins containing photosynthetic reaction centre (PRC) barrel domains that play an essential role in archaeal cell division. We rename these proteins cell division protein B 1 (CdpB1) and CdpB2. Depletions and deletions in their respective genes cause severe cell division defects, generating drastically enlarged cells. Fluorescence microscopy of tagged FtsZ1, FtsZ2 and SepF in CdpB1 and CdpB2 mutant strains revealed an unusually disordered divisome that is not organized into a distinct ring-like structure. Biochemical analysis shows that SepF forms a tripartite complex with CdpB1/2 and crystal structures suggest that these two proteins might form filaments, possibly aligning SepF and the FtsZ2 ring during cell division. Overall our results indicate that PRC-domain proteins play essential roles in FtsZ-based cell division in Archaea. AU - Nußbaum, Phillip AU - Kureisaite-Ciziene, Danguole AU - Bellini, Dom AU - Van Der Does, Chris AU - Kojic, Marko AU - Taib, Najwa AU - Yeates, Anna AU - Tourte, Maxime AU - Gribaldo, Simonetta AU - Loose, Martin AU - Löwe, Jan AU - Albers, Sonja Verena ID - 15118 IS - 3 JF - Nature Microbiology TI - Proteins containing photosynthetic reaction centre domains modulate FtsZ-based archaeal cell division VL - 9 ER - TY - JOUR AB - In this paper we consider an SPDE where the leading term is a second order operator with periodic boundary conditions, coefficients which are measurable in (t,ω) , and Hölder continuous in space. Assuming stochastic parabolicity conditions, we prove Lp((0,T)×Ω,tκdt;Hσ,q(Td)) -estimates. The main novelty is that we do not require p=q . Moreover, we allow arbitrary σ∈R and weights in time. Such mixed regularity estimates play a crucial role in applications to nonlinear SPDEs which is clear from our previous work. To prove our main results we develop a general perturbation theory for SPDEs. Moreover, we prove a new result on pointwise multiplication in spaces with fractional smoothness. AU - Agresti, Antonio AU - Veraar, Mark ID - 15119 IS - 1 JF - Annales de l'institut Henri Poincare Probability and Statistics SN - 0246-0203 TI - Stochastic maximal Lp(Lq)-regularity for second order systems with periodic boundary conditions VL - 60 ER - TY - JOUR AB - Entire chromosomes are typically only transmitted vertically from one generation to the next. The horizontal transfer of such chromosomes has long been considered improbable, yet gained recent support in several pathogenic fungi where it may affect the fitness or host specificity. To date, it is unknown how these transfers occur, how common they are and whether they can occur between different species. In this study, we show multiple independent instances of horizontal transfers of the same accessory chromosome between two distinct strains of the asexual entomopathogenic fungusMetarhizium robertsiiduring experimental co-infection of its insect host, the Argentine ant. Notably, only the one chromosome – but no other – was transferred from the donor to the recipient strain. The recipient strain, now harboring the accessory chromosome, exhibited a competitive advantage under certain host conditions. By phylogenetic analysis we further demonstrate that the same accessory chromosome was horizontally transferred in a natural environment betweenM. robertsiiand another congeneric insect pathogen,M. guizhouense. Hence horizontal chromosome transfer is not limited to the observed frequent events within species during experimental infections but also occurs naturally across species. The transferred accessory chromosome contains genes that might be involved in its preferential horizontal transfer, encoding putative histones and histone-modifying enzymes, but also putative virulence factors that may support its establishment. Our study reveals that both intra- and interspecies horizontal transfer of entire chromosomes is more frequent than previously assumed, likely representing a not uncommon mechanism for gene exchange.Significance StatementThe enormous success of bacterial pathogens has been attributed to their ability to exchange genetic material between one another. Similarly, in eukaryotes, horizontal transfer of genetic material allowed the spread of virulence factors across species. The horizontal transfer of whole chromosomes could be an important pathway for such exchange of genetic material, but little is known about the origin of transferable chromosomes and how frequently they are exchanged. Here, we show that the transfer of accessory chromosomes - chromosomes that are non-essential but may provide fitness benefits - is common during fungal co-infections and is even possible between distant pathogenic species, highlighting the importance of horizontal gene transfer via chromosome transfer also for the evolution and function of eukaryotic pathogens. AU - Habig, Michael AU - Grasse, Anna V AU - Müller, Judith AU - Stukenbrock, Eva H. AU - Leitner, Hanna AU - Cremer, Sylvia ID - 14478 IS - 11 JF - Proceedings of the National Academy of Sciences of the United States of America SN - 0027-8424 TI - Frequent horizontal chromosome transfer between asexual fungal insect pathogens VL - 121 ER - TY - JOUR AB - Given a fixed finite metric space (V,μ), the {\em minimum 0-extension problem}, denoted as 0-Ext[μ], is equivalent to the following optimization problem: minimize function of the form minx∈Vn∑ifi(xi)+∑ijcijμ(xi,xj) where cij,cvi are given nonnegative costs and fi:V→R are functions given by fi(xi)=∑v∈Vcviμ(xi,v). The computational complexity of 0-Ext[μ] has been recently established by Karzanov and by Hirai: if metric μ is {\em orientable modular} then 0-Ext[μ] can be solved in polynomial time, otherwise 0-Ext[μ] is NP-hard. To prove the tractability part, Hirai developed a theory of discrete convex functions on orientable modular graphs generalizing several known classes of functions in discrete convex analysis, such as L♮-convex functions. We consider a more general version of the problem in which unary functions fi(xi) can additionally have terms of the form cuv;iμ(xi,{u,v}) for {u,v}∈F, where set F⊆(V2) is fixed. We extend the complexity classification above by providing an explicit condition on (μ,F) for the problem to be tractable. In order to prove the tractability part, we generalize Hirai's theory and define a larger class of discrete convex functions. It covers, in particular, another well-known class of functions, namely submodular functions on an integer lattice. Finally, we improve the complexity of Hirai's algorithm for solving 0-Ext on orientable modular graphs. AU - Dvorak, Martin AU - Kolmogorov, Vladimir ID - 10045 JF - Mathematical Programming KW - minimum 0-extension problem KW - metric labeling problem KW - discrete metric spaces KW - metric extensions KW - computational complexity KW - valued constraint satisfaction problems KW - discrete convex analysis KW - L-convex functions SN - 0025-5610 TI - Generalized minimum 0-extension problem and discrete convexity ER - TY - JOUR AB - We present an auction algorithm using multiplicative instead of constant weight updates to compute a (1-E)-approximate maximum weight matching (MWM) in a bipartite graph with n vertices and m edges in time 0(mE-1), beating the running time of the fastest known approximation algorithm of Duan and Pettie [JACM ’14] that runs in 0(mE-1 log E-1). Our algorithm is very simple and it can be extended to give a dynamic data structure that maintains a (1-E)-approximate maximum weight matching under (1) one-sided vertex deletions (with incident edges) and (2) one-sided vertex insertions (with incident edges sorted by weight) to the other side. The total time time used is 0(mE-1), where m is the sum of the number of initially existing and inserted edges. AU - Zheng, Da Wei AU - Henzinger, Monika H ID - 15121 JF - Mathematical Programming SN - 0025-5610 TI - Multiplicative auction algorithm for approximate maximum weight bipartite matching ER - TY - JOUR AB - As a key liquid organic hydrogen carrier, investigating the decomposition of formic acid (HCOOH) on the Pd (1 1 1) transition metal surface is imperative for harnessing hydrogen energy. Despite a multitude of studies, the major mechanisms and key intermediates involved in the dehydrogenation process of formic acid remain a great topic of debate due to ambiguous adsorbate interactions. In this research, we develop an advanced microkinetic model based on first-principles calculations, accounting for adsorbate–adsorbate interactions. Our study unveils a comprehensive mechanism for the Pd (1 1 1) surface, highlighting the significance of coverage effects in formic acid dehydrogenation. Our findings unequivocally demonstrate that H coverage on the Pd (1 1 1) surface renders formic acid more susceptible to decompose into H2 and CO2 through COOH intermediates. Consistent with experimental results, the selectivity of H2 in the decomposition of formic acid on the Pd (1 1 1) surface approaches 100 %. Considering the influence of H coverage, our kinetic analysis aligns perfectly with experimental values at a temperature of 373 K. AU - Yao, Zihao AU - Liu, Xu AU - Bunting, Rhys AU - Wang, Jianguo ID - 15114 JF - Chemical Engineering Science SN - 0009-2509 TI - Unravelling the reaction mechanism for H2 production via formic acid decomposition over Pd: Coverage-dependent microkinetic modeling VL - 291 ER - TY - JOUR AB - Water is known to play an important role in collagen self-assembly, but it is still largely unclear how water–collagen interactions influence the assembly process and determine the fibril network properties. Here, we use the H2O/D2O isotope effect on the hydrogen-bond strength in water to investigate the role of hydration in collagen self-assembly. We dissolve collagen in H2O and D2O and compare the growth kinetics and the structure of the collagen assemblies formed in these water isotopomers. Surprisingly, collagen assembly occurs ten times faster in D2O than in H2O, and collagen in D2O self-assembles into much thinner fibrils, that form a more inhomogeneous and softer network, with a fourfold reduction in elastic modulus when compared to H2O. Combining spectroscopic measurements with atomistic simulations, we show that collagen in D2O is less hydrated than in H2O. This partial dehydration lowers the enthalpic penalty for water removal and reorganization at the collagen–water interface, increasing the self-assembly rate and the number of nucleation centers, leading to thinner fibrils and a softer network. Coarse-grained simulations show that the acceleration in the initial nucleation rate can be reproduced by the enhancement of electrostatic interactions. These results show that water acts as a mediator between collagen monomers, by modulating their interactions so as to optimize the assembly process and, thus, the final network properties. We believe that isotopically modulating the hydration of proteins can be a valuable method to investigate the role of water in protein structural dynamics and protein self-assembly. AU - Giubertoni, Giulia AU - Feng, Liru AU - Klein, Kevin AU - Giannetti, Guido AU - Rutten, Luco AU - Choi, Yeji AU - Van Der Net, Anouk AU - Castro-Linares, Gerard AU - Caporaletti, Federico AU - Micha, Dimitra AU - Hunger, Johannes AU - Deblais, Antoine AU - Bonn, Daniel AU - Sommerdijk, Nico AU - Šarić, Anđela AU - Ilie, Ioana M. AU - Koenderink, Gijsje H. AU - Woutersen, Sander ID - 15116 IS - 11 JF - Proceedings of the National Academy of Sciences of the United States of America SN - 0027-8424 TI - Elucidating the role of water in collagen self-assembly by isotopically modulating collagen hydration VL - 121 ER - TY - JOUR AB - The hippocampal mossy fiber synapse, formed between axons of dentate gyrus granule cells and dendrites of CA3 pyramidal neurons, is a key synapse in the trisynaptic circuitry of the hippocampus. Because of its comparatively large size, this synapse is accessible to direct presynaptic recording, allowing a rigorous investigation of the biophysical mechanisms of synaptic transmission and plasticity. Furthermore, because of its placement in the very center of the hippocampal memory circuit, this synapse seems to be critically involved in several higher network functions, such as learning, memory, pattern separation, and pattern completion. Recent work based on new technologies in both nanoanatomy and nanophysiology, including presynaptic patch-clamp recording, paired recording, super-resolution light microscopy, and freeze-fracture and “flash-and-freeze” electron microscopy, has provided new insights into the structure, biophysics, and network function of this intriguing synapse. This brings us one step closer to answering a fundamental question in neuroscience: how basic synaptic properties shape higher network computations. AU - Vandael, David H AU - Jonas, Peter M ID - 15117 IS - 6687 JF - Science TI - Structure, biophysics, and circuit function of a "giant" cortical presynaptic terminal VL - 383 ER - TY - THES AB - Point sets, geometric networks, and arrangements of hyperplanes are fundamental objects in discrete geometry that have captivated mathematicians for centuries, if not millennia. This thesis seeks to cast new light on these structures by illustrating specific instances where a topological perspective, specifically through discrete Morse theory and persistent homology, provides valuable insights. At first glance, the topology of these geometric objects might seem uneventful: point sets essentially lack of topology, arrangements of hyperplanes are a decomposition of Rd, which is a contractible space, and the topology of a network primarily involves the enumeration of connected components and cycles within the network. However, beneath this apparent simplicity, there lies an array of intriguing structures, a small subset of which will be uncovered in this thesis. Focused on three case studies, each addressing one of the mentioned objects, this work will showcase connections that intertwine topology with diverse fields such as combinatorial geometry, algorithms and data structures, and emerging applications like spatial biology. AU - Cultrera di Montesano, Sebastiano ID - 15094 SN - 2663 - 337X TI - Persistence and Morse theory for discrete geometric structures ER - TY - CONF AB - We present a dynamic data structure for maintaining the persistent homology of a time series of real numbers. The data structure supports local operations, including the insertion and deletion of an item and the cutting and concatenating of lists, each in time O(log n + k), in which n counts the critical items and k the changes in the augmented persistence diagram. To achieve this, we design a tailor-made tree structure with an unconventional representation, referred to as banana tree, which may be useful in its own right. AU - Cultrera di Montesano, Sebastiano AU - Edelsbrunner, Herbert AU - Henzinger, Monika H AU - Ost, Lara ED - Woodruff, David P. ID - 15093 T2 - Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) TI - Dynamically maintaining the persistent homology of time series ER - TY - GEN AB - Motivated by applications in the medical sciences, we study finite chromatic sets in Euclidean space from a topological perspective. Based on the persistent homology for images, kernels and cokernels, we design provably stable homological quantifiers that describe the geometric micro- and macro-structure of how the color classes mingle. These can be efficiently computed using chromatic variants of Delaunay and alpha complexes, and code that does these computations is provided. AU - Cultrera di Montesano, Sebastiano AU - Draganov, Ondrej AU - Edelsbrunner, Herbert AU - Saghafian, Morteza ID - 15091 T2 - arXiv TI - Chromatic alpha complexes ER - TY - JOUR AB - The brain’s functionality is developed and maintained through synaptic plasticity. As synapses undergo plasticity, they also affect each other. The nature of such ‘co-dependency’ is difficult to disentangle experimentally, because multiple synapses must be monitored simultaneously. To help understand the experimentally observed phenomena, we introduce a framework that formalizes synaptic co-dependency between different connection types. The resulting model explains how inhibition can gate excitatory plasticity while neighboring excitatory–excitatory interactions determine the strength of long-term potentiation. Furthermore, we show how the interplay between excitatory and inhibitory synapses can account for the quick rise and long-term stability of a variety of synaptic weight profiles, such as orientation tuning and dendritic clustering of co-active synapses. In recurrent neuronal networks, co-dependent plasticity produces rich and stable motor cortex-like dynamics with high input sensitivity. Our results suggest an essential role for the neighborly synaptic interaction during learning, connecting micro-level physiology with network-wide phenomena. AU - Agnes, Everton J. AU - Vogels, Tim P ID - 15171 JF - Nature Neuroscience SN - 1097-6256 TI - Co-dependent excitatory and inhibitory plasticity accounts for quick, stable and long-lasting memories in biological networks ER - TY - JOUR AB - We propose a novel approach to concentration for non-independent random variables. The main idea is to “pretend” that the random variables are independent and pay a multiplicative price measuring how far they are from actually being independent. This price is encapsulated in the Hellinger integral between the joint and the product of the marginals, which is then upper bounded leveraging tensorisation properties. Our bounds represent a natural generalisation of concentration inequalities in the presence of dependence: we recover exactly the classical bounds (McDiarmid’s inequality) when the random variables are independent. Furthermore, in a “large deviations” regime, we obtain the same decay in the probability as for the independent case, even when the random variables display non-trivial dependencies. To show this, we consider a number of applications of interest. First, we provide a bound for Markov chains with finite state space. Then, we consider the Simple Symmetric Random Walk, which is a non-contracting Markov chain, and a non-Markovian setting in which the stochastic process depends on its entire past. To conclude, we propose an application to Markov Chain Monte Carlo methods, where our approach leads to an improved lower bound on the minimum burn-in period required to reach a certain accuracy. In all of these settings, we provide a regime of parameters in which our bound fares better than what the state of the art can provide. AU - Esposito, Amedeo Roberto AU - Mondelli, Marco ID - 15172 JF - IEEE Transactions on Information Theory SN - 0018-9448 TI - Concentration without independence via information measures ER - TY - JOUR AB - The James Webb Space Telescope is revealing a new population of dust-reddened broad-line active galactic nuclei (AGN) at redshifts z ≳ 5. Here we present deep NIRSpec/Prism spectroscopy from the Cycle 1 Treasury program Ultradeep NIRSpec and NIRCam ObserVations before the Epoch of Reionization (UNCOVER) of 15 AGN candidates selected to be compact, with red continua in the rest-frame optical but with blue slopes in the UV. From NIRCam photometry alone, they could have been dominated by dusty star formation or an AGN. Here we show that the majority of the compact red sources in UNCOVER are dust-reddened AGN: 60% show definitive evidence for broad-line Hα with a FWHM > 2000 km s −1, 20% of the current data are inconclusive, and 20% are brown dwarf stars. We propose an updated photometric criterion to select red z > 5 AGN that excludes brown dwarfs and is expected to yield >80% AGN. Remarkably, among all zphot > 5 galaxies with F277W – F444W > 1 in UNCOVER at least 33% are AGN regardless of compactness, climbing to at least 80% AGN for sources with F277W – F444W > 1.6. The confirmed AGN have black hole masses of 107–109M⊙. While their UV luminosities (−16 > MUV > −20 AB mag) are low compared to UV-selected AGN at these epochs, consistent with percent-level scattered AGN light or low levels of unobscured star formation, the inferred bolometric luminosities are typical of 107–109M⊙ black holes radiating at ∼10%–40% the Eddington limit. The number densities are surprisingly high at ∼10−5 Mpc−3 mag−1, 100 times more common than the faintest UV-selected quasars, while accounting for ∼1% of the UV-selected galaxies. While their UV faintness suggests they may not contribute strongly to reionization, their ubiquity poses challenges to models of black hole growth. AU - Greene, Jenny E. AU - Labbe, Ivo AU - Goulding, Andy D. AU - Furtak, Lukas J. AU - Chemerynska, Iryna AU - Kokorev, Vasily AU - Dayal, Pratika AU - Volonteri, Marta AU - Williams, Christina C. AU - Wang, Bingjie AU - Setton, David J. AU - Burgasser, Adam J. AU - Bezanson, Rachel AU - Atek, Hakim AU - Brammer, Gabriel AU - Cutler, Sam E. AU - Feldmann, Robert AU - Fujimoto, Seiji AU - Glazebrook, Karl AU - De Graaff, Anna AU - Khullar, Gourav AU - Leja, Joel AU - Marchesini, Danilo AU - Maseda, Michael V. AU - Matthee, Jorryt J AU - Miller, Tim B. AU - Naidu, Rohan P. AU - Nanayakkara, Themiya AU - Oesch, Pascal A. AU - Pan, Richard AU - Papovich, Casey AU - Price, Sedona H. AU - Van Dokkum, Pieter AU - Weaver, John R. AU - Whitaker, Katherine E. AU - Zitrin, Adi ID - 15170 JF - Astrophysical Journal SN - 0004-637X TI - UNCOVER spectroscopy confirms the surprising ubiquity of active galactic nuclei in red sources at z > 5 VL - 964 ER - TY - CONF AB - A linearly ordered (LO) k-colouring of a hypergraph is a colouring of its vertices with colours 1, … , k such that each edge contains a unique maximal colour. Deciding whether an input hypergraph admits LO k-colouring with a fixed number of colours is NP-complete (and in the special case of graphs, LO colouring coincides with the usual graph colouring). Here, we investigate the complexity of approximating the "linearly ordered chromatic number" of a hypergraph. We prove that the following promise problem is NP-complete: Given a 3-uniform hypergraph, distinguish between the case that it is LO 3-colourable, and the case that it is not even LO 4-colourable. We prove this result by a combination of algebraic, topological, and combinatorial methods, building on and extending a topological approach for studying approximate graph colouring introduced by Krokhin, Opršal, Wrochna, and Živný (2023). AU - Filakovský, Marek AU - Nakajima, Tamio Vesa AU - Opršal, Jakub AU - Tasinato, Gianluca AU - Wagner, Uli ID - 15168 SN - 9783959773119 T2 - 41st International Symposium on Theoretical Aspects of Computer Science TI - Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs VL - 289 ER - TY - JOUR AB - Interpretation of extracellular recordings can be challenging due to the long range of electric field. This challenge can be mitigated by estimating the current source density (CSD). Here we introduce kCSD-python, an open Python package implementing Kernel Current Source Density (kCSD) method and related tools to facilitate CSD analysis of experimental data and the interpretation of results. We show how to counter the limitations imposed by noise and assumptions in the method itself. kCSD-python allows CSD estimation for an arbitrary distribution of electrodes in 1D, 2D, and 3D, assuming distributions of sources in tissue, a slice, or in a single cell, and includes a range of diagnostic aids. We demonstrate its features in a Jupyter Notebook tutorial which illustrates a typical analytical workflow and main functionalities useful in validating analysis results. AU - Chintaluri, Chaitanya AU - Bejtka, Marta AU - Sredniawa, Wladyslaw AU - Czerwinski, Michal AU - Dzik, Jakub M. AU - Jedrzejewska-Szmek, Joanna AU - Wojciki, Daniel K. ID - 15169 IS - 3 JF - PLoS Computational Biology SN - 1553-734X TI - kCSD-python, reliable current source density estimation with quality control VL - 20 ER - TY - JOUR AB - We perform a diagrammatic analysis of the energy of a mobile impurity immersed in a strongly interacting two-component Fermi gas to second order in the impurity-bath interaction. These corrections demonstrate divergent behavior in the limit of large impurity momentum. We show the fundamental processes responsible for these logarithmically divergent terms. We study the problem in the general case without any assumptions regarding the fermion-fermion interactions in the bath. We show that the divergent term can be summed up to all orders in the Fermi-Fermi interaction and that the resulting expression is equivalent to the one obtained in the few-body calculation. Finally, we provide a perturbative calculation to the second order in the Fermi-Fermi interaction, and we show the diagrams responsible for these terms. AU - Al Hyder, Ragheed AU - Chevy, F. AU - Leyronas, X. ID - 15167 IS - 3 JF - Physical Review A SN - 2469-9926 TI - Exploring beyond-mean-field logarithmic divergences in Fermi-polaron energy VL - 109 ER - TY - JOUR AB - For some k∈Z≥0∪{∞}, we call a linear forest k-bounded if each of its components has at most k edges. We will say a (k,ℓ)-bounded linear forest decomposition of a graph G is a partition of E(G) into the edge sets of two linear forests Fk,Fℓ where Fk is k-bounded and Fℓ is ℓ-bounded. We show that the problem of deciding whether a given graph has such a decomposition is NP-complete if both k and ℓ are at least 2, NP-complete if k≥9 and ℓ=1, and is in P for (k,ℓ)=(2,1). Before this, the only known NP-complete cases were the (2,2) and (3,3) cases. Our hardness result answers a question of Bermond et al. from 1984. We also show that planar graphs of girth at least nine decompose into a linear forest and a matching, which in particular is stronger than 3-edge-colouring such graphs. AU - Campbell, Rutger AU - Hörsch, Florian AU - Moore, Benjamin ID - 15163 IS - 6 JF - Discrete Mathematics SN - 0012-365X TI - Decompositions into two linear forests of bounded lengths VL - 347 ER - TY - JOUR AB - Characterizing the prevalence and properties of faint active galactic nuclei (AGNs) in the early Universe is key for understanding the formation of supermassive black holes (SMBHs) and determining their role in cosmic reionization. We perform a spectroscopic search for broad Hα emitters at z ≈ 4–6 using deep JWST/NIRCam imaging and wide field slitless spectroscopy from the EIGER and FRESCO surveys. We identify 20 Hα lines at z = 4.2–5.5 that have broad components with line widths from ∼1200–3700 km s−1, contributing ∼30%–90% of the total line flux. We interpret these broad components as being powered by accretion onto SMBHs with implied masses ∼107–8M⊙. In the UV luminosity range MUV,AGN+host = −21 to −18, we measure number densities of ≈10−5 cMpc−3. This is an order of magnitude higher than expected from extrapolating quasar UV luminosity functions (LFs). Yet, such AGN are found in only <1% of star-forming galaxies at z ∼ 5. The number density discrepancy is much lower when compared to the broad Hα LF. The SMBH mass function agrees with large cosmological simulations. In two objects, we detect complex Hα profiles that we tentatively interpret as caused by absorption signatures from dense gas fueling SMBH growth and outflows. We may be witnessing early AGN feedback that will clear dust-free pathways through which more massive blue quasars are seen. We uncover a strong correlation between reddening and the fraction of total galaxy luminosity arising from faint AGN. This implies that early SMBH growth is highly obscured and that faint AGN are only minor contributors to cosmic reionization. AU - Matthee, Jorryt J AU - Naidu, Rohan P. AU - Brammer, Gabriel AU - Chisholm, John AU - Eilers, Anna-Christina AU - Goulding, Andy AU - Greene, Jenny AU - Kashino, Daichi AU - Labbe, Ivo AU - Lilly, Simon J. AU - Mackenzie, Ruari AU - Oesch, Pascal A. AU - Weibel, Andrea AU - Wuyts, Stijn AU - Xiao, Mengyuan AU - Bordoloi, Rongmon AU - Bouwens, Rychard AU - van Dokkum, Pieter AU - Illingworth, Garth AU - Kramarenko, Ivan AU - Maseda, Michael V. AU - Mason, Charlotte AU - Meyer, Romain A. AU - Nelson, Erica J. AU - Reddy, Naveen A. AU - Shivaei, Irene AU - Simcoe, Robert A. AU - Yue, Minghao ID - 15180 IS - 2 JF - The Astrophysical Journal KW - Space and Planetary Science KW - Astronomy and Astrophysics SN - 0004-637X TI - Little Red Dots: An abundant population of faint active galactic nuclei at z ∼ 5 revealed by the EIGER and FRESCO JWST surveys VL - 963 ER - TY - JOUR AB - The fungal bioluminescence pathway can be reconstituted in other organisms allowing luminescence imaging without exogenously supplied substrate. The pathway starts from hispidin biosynthesis—a step catalyzed by a large fungal polyketide synthase that requires a posttranslational modification for activity. Here, we report identification of alternative compact hispidin synthases encoded by a phylogenetically diverse group of plants. A hybrid bioluminescence pathway that combines plant and fungal genes is more compact, not dependent on availability of machinery for posttranslational modifications, and confers autonomous bioluminescence in yeast, mammalian, and plant hosts. The compact size of plant hispidin synthases enables additional modes of delivery of autoluminescence, such as delivery with viral vectors. AU - Palkina, Kseniia A. AU - Karataeva, Tatiana A. AU - Perfilov, Maxim M. AU - Fakhranurova, Liliia I. AU - Markina, Nadezhda M. AU - Gonzalez Somermeyer, Louisa AU - Garcia-Perez, Elena AU - Vazquez-Vilar, Marta AU - Rodriguez-Rodriguez, Marta AU - Vazquez-Vilriales, Victor AU - Shakhova, Ekaterina S. AU - Mitiouchkina, Tatiana AU - Belozerova, Olga A. AU - Kovalchuk, Sergey I. AU - Alekberova, Anna AU - Malyshevskaia, Alena K. AU - Bugaeva, Evgenia N. AU - Guglya, Elena B. AU - Balakireva, Anastasia AU - Sytov, Nikita AU - Bezlikhotnova, Anastasia AU - Boldyreva, Daria I. AU - Babenko, Vladislav V. AU - Kondrashov, Fyodor AU - Choob, Vladimir V. AU - Orzaez, Diego AU - Yampolsky, Ilia V. AU - Mishin, Alexander S. AU - Sarkisyan, Karen S. ID - 15179 IS - 10 JF - Science Advances SN - 2375-2548 TI - A hybrid pathway for self-sustained luminescence VL - 10 ER - TY - JOUR AB - The elimination of rain evaporation in the planetary boundary layer (PBL) has been found to lead to convective self‐aggregation (CSA) even without radiative feedback, but the precise mechanisms underlying this phenomenon remain unclear. We conducted cloud‐resolving simulations with two domain sizes and progressively reduced rain evaporation in the PBL. Surprisingly, CSA only occurred when rain evaporation was almost completely removed. The additional convective heating resulting from the reduction of evaporative cooling in the moist patch was found to be the trigger, thereafter a dry subsidence intrusion into the PBL in the dry patch takes over and sets CSA in motion. Temperature and moisture anomalies oppose each other in their buoyancy effects, hence explaining the need for almost total rain evaporation removal. We also found radiative cooling and not cold pools to be the leading cause for the comparative ease of CSA to take place in the larger domain. AU - Hwong, Yi-Ling AU - Muller, Caroline J ID - 15186 IS - 6 JF - Geophysical Research Letters KW - General Earth and Planetary Sciences KW - Geophysics SN - 0094-8276 TI - The unreasonable efficiency of total rain evaporation removal in triggering convective self‐aggregation VL - 51 ER - TY - JOUR AB - We demonstrate the failure of the adiabatic Born-Oppenheimer approximation to describe the ground state of a quantum impurity within an ultracold Fermi gas despite substantial mass differences between the bath and impurity species. Increasing repulsion leads to the appearance of nonadiabatic couplings between the fast bath and slow impurity degrees of freedom, which reduce the parity symmetry of the latter according to the pseudo Jahn-Teller effect. The presence of this mechanism is associated to a conical intersection involving the impurity position and the inverse of the interaction strength, which acts as a synthetic dimension. We elucidate the presence of these effects via a detailed ground-state analysis involving the comparison of ab initio fully correlated simulations with effective models. Our study suggests ultracold atomic ensembles as potent emulators of complex molecular phenomena. AU - Becker, A. AU - Koutentakis, Georgios AU - Schmelcher, P. ID - 15181 IS - 1 JF - Physical Review Research SN - 2643-1564 TI - Synthetic dimension-induced pseudo Jahn-Teller effect in one-dimensional confined fermions VL - 6 ER - TY - JOUR AB - Thermoelectric materials convert heat into electricity, with a broad range of applications near room temperature (RT). However, the library of RT high-performance materials is limited. Traditional high-temperature synthetic methods constrain the range of materials achievable, hindering the ability to surpass crystal structure limitations and engineer defects. Here, a solution-based synthetic approach is introduced, enabling RT synthesis of powders and exploration of densification at lower temperatures to influence the material's microstructure. The approach is exemplified by Ag2Se, an n-type alternative to bismuth telluride. It is demonstrated that the concentration of Ag interstitials, grain boundaries, and dislocations are directly correlated to the sintering temperature, and achieve a figure of merit of 1.1 from RT to 100 °C after optimization. Moreover, insights into and resolve Ag2Se's challenges are provided, including stoichiometry issues leading to irreproducible performances. This work highlights the potential of RT solution synthesis in expanding the repertoire of high-performance thermoelectric materials for practical applications. AU - Kleinhanns, Tobias AU - Milillo, Francesco AU - Calcabrini, Mariano AU - Fiedler, Christine AU - Horta, Sharona AU - Balazs, Daniel AU - Strumolo, Marissa J. AU - Hasler, Roger AU - Llorca, Jordi AU - Tkadletz, Michael AU - Brutchey, Richard L. AU - Ibáñez, Maria ID - 15182 JF - Advanced Energy Materials SN - 1614-6832 TI - A route to high thermoelectric performance: Solution‐based control of microstructure and composition in Ag2Se ER - TY - JOUR AB - Current knowledge suggests a drought Indian monsoon (perhaps a severe one) when the El Nino Southern Oscillation and Pacific Decadal Oscillation each exhibit positive phases (a joint positive phase). For the monsoons, which are exceptions in this regard, we found northeast India often gets excess pre-monsoon rainfall. Further investigation reveals that this excess pre-monsoon rainfall is produced by the interaction of the large-scale circulation associated with the joint phase with the mountains in northeast India. We posit that a warmer troposphere, a consequence of excess rainfall over northeast India, drives a stronger monsoon circulation and enhances monsoon rainfall over central India. Hence, we argue that pre-monsoon rainfall over northeast India can be used for seasonal monsoon rainfall prediction over central India. Most importantly, its predictive value is at its peak when the Pacific Ocean exhibits a joint positive phase and the threat of extreme drought monsoon looms over India. AU - Goswami, Bidyut B ID - 15165 IS - 5 JF - Geophysical Research Letters SN - 0094-8276 TI - A pre-monsoon signal of false alarms of Indian monsoon droughts VL - 51 ER - TY - JOUR AB - Reducing defects boosts room-temperature performance of a thermoelectric device AU - Navita, Navita AU - Ibáñez, Maria ID - 15166 IS - 6688 JF - Science SN - 0036-8075 TI - Electron highways are cooler VL - 383 ER - TY - JOUR AB - The extracellular matrix (ECM) serves as a scaffold for cells and plays an essential role in regulating numerous cellular processes, including cell migration and proliferation. Due to limitations in specimen preparation for conventional room-temperature electron microscopy, we lack structural knowledge on how ECM components are secreted, remodeled, and interact with surrounding cells. We have developed a 3D-ECM platform compatible with sample thinning by cryo-focused ion beam milling, the lift-out extraction procedure, and cryo-electron tomography. Our workflow implements cell-derived matrices (CDMs) grown on EM grids, resulting in a versatile tool closely mimicking ECM environments. This allows us to visualize ECM for the first time in its hydrated, native context. Our data reveal an intricate network of extracellular fibers, their positioning relative to matrix-secreting cells, and previously unresolved structural entities. Our workflow and results add to the structural atlas of the ECM, providing novel insights into its secretion and assembly. AU - Zens, Bettina AU - Fäßler, Florian AU - Hansen, Jesse AU - Hauschild, Robert AU - Datler, Julia AU - Hodirnau, Victor-Valentin AU - Zheden, Vanessa AU - Alanko, Jonna H AU - Sixt, Michael K AU - Schur, Florian KM ID - 15146 IS - 6 JF - Journal of Cell Biology SN - 0021-9525 TI - Lift-out cryo-FIBSEM and cryo-ET reveal the ultrastructural landscape of extracellular matrix VL - 223 ER - TY - CHAP AB - The mammary gland consists of a bilayered epithelial structure with an extensively branched morphology. The majority of this epithelial tree is laid down during puberty, during which actively proliferating terminal end buds repeatedly elongate and bifurcate to form the basic structure of the ductal tree. Mammary ducts consist of a basal and luminal cell layer with a multitude of identified sub-lineages within both layers. The understanding of how these different cell lineages are cooperatively driving branching morphogenesis is a problem of crossing multiple scales, as this requires information on the macroscopic branched structure of the gland, as well as data on single-cell dynamics driving the morphogenic program. Here we describe a method to combine genetic lineage tracing with whole-gland branching analysis. Quantitative data on the global organ structure can be used to derive a model for mammary gland branching morphogenesis and provide a backbone on which the dynamics of individual cell lineages can be simulated and compared to lineage-tracing approaches. Eventually, these quantitative models and experiments allow to understand the couplings between the macroscopic shape of the mammary gland and the underlying single-cell dynamics driving branching morphogenesis. AU - Hannezo, Edouard B AU - Scheele, Colinda L.G.J. ED - Margadant, Coert ID - 12428 SN - 9781071628867 T2 - Cell Migration in Three Dimensions TI - A Guide Toward Multi-scale and Quantitative Branching Analysis in the Mammary Gland VL - 2608 ER - TY - JOUR AB - Brownian motion of a mobile impurity in a bath is affected by spin-orbit coupling (SOC). Here, we discuss a Caldeira-Leggett-type model that can be used to propose and interpret quantum simulators of this problem in cold Bose gases. First, we derive a master equation that describes the model and explore it in a one-dimensional (1D) setting. To validate the standard assumptions needed for our derivation, we analyze available experimental data without SOC; as a byproduct, this analysis suggests that the quench dynamics of the impurity is beyond the 1D Bose-polaron approach at temperatures currently accessible in a cold-atom laboratory—motion of the impurity is mainly driven by dissipation. For systems with SOC, we demonstrate that 1D spin-orbit coupling can be gauged out even in the presence of dissipation—the information about SOC is incorporated in the initial conditions. Observables sensitive to this information (such as spin densities) can be used to study formation of steady spin polarization domains during quench dynamics. AU - Ghazaryan, Areg AU - Cappellaro, Alberto AU - Lemeshko, Mikhail AU - Volosniev, Artem ID - 12534 IS - 1 JF - Physical Review Research SN - 2643-1564 TI - Dissipative dynamics of an impurity with spin-orbit coupling VL - 5 ER - TY - CONF AB - Turn-based stochastic games (aka simple stochastic games) are two-player zero-sum games played on directed graphs with probabilistic transitions. The goal of player-max is to maximize the probability to reach a target state against the adversarial player-min. These games lie in NP ∩ coNP and are among the rare combinatorial problems that belong to this complexity class for which the existence of polynomial-time algorithm is a major open question. While randomized sub-exponential time algorithm exists, all known deterministic algorithms require exponential time in the worst-case. An important open question has been whether faster algorithms can be obtained parametrized by the treewidth of the game graph. Even deterministic sub-exponential time algorithm for constant treewidth turn-based stochastic games has remain elusive. In this work our main result is a deterministic algorithm to solve turn-based stochastic games that, given a game with n states, treewidth at most t, and the bit-complexity of the probabilistic transition function log D, has running time O ((tn2 log D)t log n). In particular, our algorithm is quasi-polynomial time for games with constant or poly-logarithmic treewidth. AU - Chatterjee, Krishnendu AU - Meggendorfer, Tobias AU - Saona Urmeneta, Raimundo J AU - Svoboda, Jakub ID - 12676 SN - 9781611977554 T2 - Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms TI - Faster algorithm for turn-based stochastic games with bounded treewidth ER - TY - CHAP AB - Here we describe the in vivo DNA assembly approach, where molecular cloning procedures are performed using an E. coli recA-independent recombination pathway, which assembles linear fragments of DNA with short homologous termini. This pathway is present in all standard laboratory E. coli strains and, by bypassing the need for in vitro DNA assembly, allows simplified molecular cloning to be performed without the plasmid instability issues associated with specialized recombination-cloning bacterial strains. The methodology requires specific primer design and can perform all standard plasmid modifications (insertions, deletions, mutagenesis, and sub-cloning) in a rapid, simple, and cost-efficient manner, as it does not require commercial kits or specialized bacterial strains. Additionally, this approach can be used to perform complex procedures such as multiple modifications to a plasmid, as up to 6 linear fragments can be assembled in vivo by this recombination pathway. Procedures generally require less than 3 h, involving PCR amplification, DpnI digestion of template DNA, and transformation, upon which circular plasmids are assembled. In this chapter we describe the requirements, procedure, and potential pitfalls when using this technique, as well as protocol variations to overcome the most common issues. AU - Arroyo-Urea, Sandra AU - Watson, Jake AU - García-Nafría, Javier ED - Scarlett, Garry ID - 12720 SN - 1064-3745 T2 - DNA Manipulation and Analysis TI - Molecular Cloning Using In Vivo DNA Assembly VL - 2633 ER - TY - CONF AB - Asynchronous programming has gained significant popularity over the last decade: support for this programming pattern is available in many popular languages via libraries and native language implementations, typically in the form of coroutines or the async/await construct. Instead of programming via shared memory, this concept assumes implicit synchronization through message passing. The key data structure enabling such communication is the rendezvous channel. Roughly, a rendezvous channel is a blocking queue of size zero, so both send(e) and receive() operations wait for each other, performing a rendezvous when they meet. To optimize the message passing pattern, channels are usually equipped with a fixed-size buffer, so sends do not suspend and put elements into the buffer until its capacity is exceeded. This primitive is known as a buffered channel. This paper presents a fast and scalable algorithm for both rendezvous and buffered channels. Similarly to modern queues, our solution is based on an infinite array with two positional counters for send(e) and receive() operations, leveraging the unconditional Fetch-And-Add instruction to update them. Yet, the algorithm requires non-trivial modifications of this classic pattern, in order to support the full channel semantics, such as buffering and cancellation of waiting requests. We compare the performance of our solution to that of the Kotlin implementation, as well as against other academic proposals, showing up to 9.8× speedup. To showcase its expressiveness and performance, we also integrated the proposed algorithm into the standard Kotlin Coroutines library, replacing the previous channel implementations. AU - Koval, Nikita AU - Alistarh, Dan-Adrian AU - Elizarov, Roman ID - 12735 SN - 9798400700156 T2 - Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming TI - Fast and scalable channels in Kotlin Coroutines ER - TY - GEN AB - Although a wide variety of handcrafted concurrent data structures have been proposed, there is considerable interest in universal approaches (Universal Constructions or UCs) for building concurrent data structures. UCs (semi-)automatically convert a sequential data structure into a concurrent one. The simplest approach uses locks [3, 6] that protect a sequential data structure and allow only one process to access it at a time. However, the resulting data structure is blocking. Most work on UCs instead focuses on obtaining non-blocking progress guarantees such as obstruction-freedom, lock-freedom or wait-freedom. Many non-blocking UCs have appeared. Key examples include the seminal wait-free UC [2] by Herlihy, a NUMA-aware UC [10] by Yi et al., and an efficient UC for large objects [1] by Fatourou et al. AU - Aksenov, Vitaly AU - Brown, Trevor A AU - Fedorov, Alexander AU - Kokorin, Ilya ID - 12736 SN - 9798400700156 T2 - Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming TI - Unexpected scaling in path copying trees ER - TY - CONF AB - Dynamic programming (DP) is one of the fundamental paradigms in algorithm design. However, many DP algorithms have to fill in large DP tables, represented by two-dimensional arrays, which causes at least quadratic running times and space usages. This has led to the development of improved algorithms for special cases when the DPs satisfy additional properties like, e.g., the Monge property or total monotonicity. In this paper, we consider a new condition which assumes (among some other technical assumptions) that the rows of the DP table are monotone. Under this assumption, we introduce a novel data structure for computing (1 + ϵ)-approximate DP solutions in near-linear time and space in the static setting, and with polylogarithmic update times when the DP entries change dynamically. To the best of our knowledge, our new condition is incomparable to previous conditions and is the first which allows to derive dynamic algorithms based on existing DPs. Instead of using two-dimensional arrays to store the DP tables, we store the rows of the DP tables using monotone piecewise constant functions. This allows us to store length-n DP table rows with entries in [0, W] using only polylog(n, W) bits, and to perform operations, such as (min, +)-convolution or rounding, on these functions in polylogarithmic time. We further present several applications of our data structure. For bicriteria versions of k-balanced graph partitioning and simultaneous source location, we obtain the first dynamic algorithms with subpolynomial update times, as well as the first static algorithms using only near-linear time and space. Additionally, we obtain the currently fastest algorithm for fully dynamic knapsack. AU - Henzinger, Monika H AU - Neumann, Stefan AU - Räcke, Harald AU - Schmid, Stefan ID - 12760 SN - 1868-8969 T2 - 40th International Symposium on Theoretical Aspects of Computer Science TI - Dynamic maintenance of monotone dynamic programs and applications VL - 254 ER - TY - THES AB - The process of detecting and evaluating sensory information to guide behaviour is termed perceptual decision-making (PDM), and is critical for the ability of an organism to interact with its external world. Individuals with autism, a neurodevelopmental condition primarily characterised by social and communication difficulties, frequently exhibit altered sensory processing and PDM difficulties are widely reported. Recent technological advancements have pushed forward our understanding of the genetic changes accompanying this condition, however our understanding of how these mutations affect the function of specific neuronal circuits and bring about the corresponding behavioural changes remains limited. Here, we use an innate PDM task, the looming avoidance response (LAR) paradigm, to identify a convergent behavioural abnormality across three molecularly distinct genetic mouse models of autism (Cul3, Setd5 and Ptchd1). Although mutant mice can rapidly detect threatening visual stimuli, their responses are consistently delayed, requiring longer to initiate an appropriate response than their wild-type siblings. Mutant animals show abnormal adaptation in both their stimulus- evoked escape responses and exploratory dynamics following repeated stimulus presentations. Similarly delayed behavioural responses are observed in wild-type animals when faced with more ambiguous threats, suggesting the mutant phenotype could arise from a dysfunction in the flexible control of this PDM process. Our knowledge of the core neuronal circuitry mediating the LAR facilitated a detailed dissection of the neuronal mechanisms underlying the behavioural impairment. In vivo extracellular recording revealed that visual responses were unaffected within a key brain region for the rapid processing of visual threats, the superior colliculus (SC), indicating that the behavioural delay was unlikely to originate from sensory impairments. Delayed behavioural responses were recapitulated in the Setd5 model following optogenetic stimulation of the excitatory output neurons of the SC, which are known to mediate escape initiation through the activation of cells in the underlying dorsal periaqueductal grey (dPAG). In vitro patch-clamp recordings of dPAG cells uncovered a stark hypoexcitability phenotype in two out of the three genetic models investigated (Setd5 and Ptchd1), that in Setd5, is mediated by the misregulation of voltage-gated potassium channels. Overall, our results show that the ability to use visual information to drive efficient escape responses is impaired in three diverse genetic mouse models of autism and that, in one of the models studied, this behavioural delay likely originates from differences in the intrinsic excitability of a key subcortical node, the dPAG. Furthermore, this work showcases the use of an innate behavioural paradigm to mechanistically dissect PDM processes in autism. AU - Burnett, Laura ID - 12716 SN - 2663-337X TI - To flee, or not to flee? Using innate defensive behaviours to investigate rapid perceptual decision-making through subcortical circuits in mouse models of autism ER - TY - CONF AB - The main idea behind BUBAAK is to run multiple program analyses in parallel and use runtime monitoring and enforcement to observe and control their progress in real time. The analyses send information about (un)explored states of the program and discovered invariants to a monitor. The monitor processes the received data and can force an analysis to stop the search of certain program parts (which have already been analyzed by other analyses), or to make it utilize a program invariant found by another analysis. At SV-COMP 2023, the implementation of data exchange between the monitor and the analyses was not yet completed, which is why BUBAAK only ran several analyses in parallel, without any coordination. Still, BUBAAK won the meta-category FalsificationOverall and placed very well in several other (sub)-categories of the competition. AU - Chalupa, Marek AU - Henzinger, Thomas A ID - 12854 SN - 0302-9743 T2 - Tools and Algorithms for the Construction and Analysis of Systems TI - Bubaak: Runtime monitoring of program verifiers VL - 13994 ER - TY - GEN AB - We present a formula for the signed area of a spherical polygon via prequantization. In contrast to the traditional formula based on the Gauss-Bonnet theorem that requires measuring angles, the new formula mimics Green's theorem and is applicable to a wider range of degenerate spherical curves and polygons. AU - Chern, Albert AU - Ishida, Sadashige ID - 12846 T2 - arXiv TI - Area formula for spherical polygons via prequantization ER - TY - CONF AB - As the complexity and criticality of software increase every year, so does the importance of run-time monitoring. Third-party monitoring, with limited knowledge of the monitored software, and best-effort monitoring, which keeps pace with the monitored software, are especially valuable, yet underexplored areas of run-time monitoring. Most existing monitoring frameworks do not support their combination because they either require access to the monitored code for instrumentation purposes or the processing of all observed events, or both. We present a middleware framework, VAMOS, for the run-time monitoring of software which is explicitly designed to support third-party and best-effort scenarios. The design goals of VAMOS are (i) efficiency (keeping pace at low overhead), (ii) flexibility (the ability to monitor black-box code through a variety of different event channels, and the connectability to monitors written in different specification languages), and (iii) ease-of-use. To achieve its goals, VAMOS combines aspects of event broker and event recognition systems with aspects of stream processing systems. We implemented a prototype toolchain for VAMOS and conducted experiments including a case study of monitoring for data races. The results indicate that VAMOS enables writing useful yet efficient monitors, is compatible with a variety of event sources and monitor specifications, and simplifies key aspects of setting up a monitoring system from scratch. AU - Chalupa, Marek AU - Mühlböck, Fabian AU - Muroya Lei, Stefanie AU - Henzinger, Thomas A ID - 12856 SN - 0302-9743 T2 - Fundamental Approaches to Software Engineering TI - Vamos: Middleware for best-effort third-party monitoring VL - 13991 ER - TY - GEN AB - As the complexity and criticality of software increase every year, so does the importance of run-time monitoring. Third-party monitoring, with limited knowledge of the monitored software, and best-effort monitoring, which keeps pace with the monitored software, are especially valuable, yet underexplored areas of run-time monitoring. Most existing monitoring frameworks do not support their combination because they either require access to the monitored code for instrumentation purposes or the processing of all observed events, or both. We present a middleware framework, VAMOS, for the run-time monitoring of software which is explicitly designed to support third-party and best-effort scenarios. The design goals of VAMOS are (i) efficiency (keeping pace at low overhead), (ii) flexibility (the ability to monitor black-box code through a variety of different event channels, and the connectability to monitors written in different specification languages), and (iii) ease-of-use. To achieve its goals, VAMOS combines aspects of event broker and event recognition systems with aspects of stream processing systems. We implemented a prototype toolchain for VAMOS and conducted experiments including a case study of monitoring for data races. The results indicate that VAMOS enables writing useful yet efficient monitors, is compatible with a variety of event sources and monitor specifications, and simplifies key aspects of setting up a monitoring system from scratch. AU - Chalupa, Marek AU - Mühlböck, Fabian AU - Muroya Lei, Stefanie AU - Henzinger, Thomas A ID - 12407 KW - runtime monitoring KW - best effort KW - third party TI - VAMOS: Middleware for Best-Effort Third-Party Monitoring ER - TY - CHAP AB - Autism spectrum disorder (ASD) and epilepsy are frequently comorbid neurodevelopmental disorders. Extensive research has demonstrated shared pathological pathways, etiologies, and phenotypes. Many risk factors for these disorders, like genetic mutations and environmental pressures, are linked to changes in childhood brain development, which is a critical period for their manifestation. Decades of research have yielded many signatures for ASD and epilepsy, some shared and others unique or opposing. The anatomical, physiological, and behavioral correlates of these disorders are discussed in this chapter in the context of understanding shared pathological pathways. We end with important takeaways on the presentation, prevention, intervention, and policy changes for ASD and epilepsy. This chapter aims to explore the complexity of these disorders, both in etiology and phenotypes, with the further goal of appreciating the expanse of unknowns still to explore about the brain. AU - Currin, Christopher AU - Beyer, Chad ED - Halpern-Felsher, Bonnie ID - 12866 SN - 9780128188736 T2 - Encyclopedia of Child and Adolescent Health TI - Altered childhood brain development in autism and epilepsy ER - TY - THES AB - Understanding the mechanisms of learning and memory formation has always been one of the main goals in neuroscience. Already Pavlov (1927) in his early days has used his classic conditioning experiments to study the neural mechanisms governing behavioral adaptation. What was not known back then was that the part of the brain that is largely responsible for this type of associative learning is the cerebellum. Since then, plenty of theories on cerebellar learning have emerged. Despite their differences, one thing they all have in common is that learning relies on synaptic and intrinsic plasticity. The goal of my PhD project was to unravel the molecular mechanisms underlying synaptic plasticity in two synapses that have been shown to be implicated in motor learning, in an effort to understand how learning and memory formation are processed in the cerebellum. One of the earliest and most well-known cerebellar theories postulates that motor learning largely depends on long-term depression at the parallel fiber-Purkinje cell (PC-PC) synapse. However, the discovery of other types of plasticity in the cerebellar circuitry, like long-term potentiation (LTP) at the PC-PC synapse, potentiation of molecular layer interneurons (MLIs), and plasticity transfer from the cortex to the cerebellar/ vestibular nuclei has increased the popularity of the idea that multiple sites of plasticity might be involved in learning. Still a lot remains unknown about the molecular mechanisms responsible for these types of plasticity and whether they occur during physiological learning. In the first part of this thesis we have analyzed the variation and nanodistribution of voltagegated calcium channels (VGCCs) and α-amino-3-hydroxy-5-methyl-4-isoxazolepropionic acid type glutamate receptors (AMPARs) on the parallel fiber-Purkinje cell synapse after vestibuloocular reflex phase reversal adaptation, a behavior that has been suggested to rely on PF-PC LTP. We have found that on the last day of adaptation there is no learning trace in form of VGCCs nor AMPARs variation at the PF-PC synapse, but instead a decrease in the number of PF-PC synapses. These data seem to support the view that learning is only stored in the cerebellar cortex in an initial learning phase, being transferred later to the vestibular nuclei. Next, we have studied the role of MLIs in motor learning using a relatively simple and well characterized behavioral paradigm – horizontal optokinetic reflex (HOKR) adaptation. We have found behavior-induced MLI potentiation in form of release probability increase that could be explained by the increase of VGCCs at the presynaptic side. Our results strengthen the idea of distributed cerebellar plasticity contributing to learning and provide a novel mechanism for release probability increase. AU - Alcarva, Catarina ID - 12809 SN - 2663 - 337X TI - Plasticity in the cerebellum: What molecular mechanisms are behind physiological learning ER - TY - JOUR AB - Background: Plant and animal embryogenesis have conserved and distinct features. Cell fate transitions occur during embryogenesis in both plants and animals. The epigenomic processes regulating plant embryogenesis remain largely elusive. Results: Here, we elucidate chromatin and transcriptomic dynamics during embryogenesis of the most cultivated crop, hexaploid wheat. Time-series analysis reveals stage-specific and proximal–distal distinct chromatin accessibility and dynamics concordant with transcriptome changes. Following fertilization, the remodeling kinetics of H3K4me3, H3K27ac, and H3K27me3 differ from that in mammals, highlighting considerable species-specific epigenomic dynamics during zygotic genome activation. Polycomb repressive complex 2 (PRC2)-mediated H3K27me3 deposition is important for embryo establishment. Later H3K27ac, H3K27me3, and chromatin accessibility undergo dramatic remodeling to establish a permissive chromatin environment facilitating the access of transcription factors to cis-elements for fate patterning. Embryonic maturation is characterized by increasing H3K27me3 and decreasing chromatin accessibility, which likely participates in restricting totipotency while preventing extensive organogenesis. Finally, epigenomic signatures are correlated with biased expression among homeolog triads and divergent expression after polyploidization, revealing an epigenomic contributor to subgenome diversification in an allohexaploid genome. Conclusions: Collectively, we present an invaluable resource for comparative and mechanistic analysis of the epigenomic regulation of crop embryogenesis. AU - Zhao, Long AU - Yang, Yiman AU - Chen, Jinchao AU - Lin, Xuelei AU - Zhang, Hao AU - Wang, Hao AU - Wang, Hongzhe AU - Bie, Xiaomin AU - Jiang, Jiafu AU - Feng, Xiaoqi AU - Fu, Xiangdong AU - Zhang, Xiansheng AU - Du, Zhuo AU - Xiao, Jun ID - 12668 JF - Genome Biology SN - 1474-760X TI - Dynamic chromatin regulatory programs during embryogenesis of hexaploid wheat VL - 24 ER - TY - CONF AB - In this paper we introduce a pruning of the medial axis called the (λ,α)-medial axis (axλα). We prove that the (λ,α)-medial axis of a set K is stable in a Gromov-Hausdorff sense under weak assumptions. More formally we prove that if K and K′ are close in the Hausdorff (dH) sense then the (λ,α)-medial axes of K and K′ are close as metric spaces, that is the Gromov-Hausdorff distance (dGH) between the two is 1/4-Hölder in the sense that dGH (axλα(K),axλα(K′)) ≲ dH(K,K′)1/4. The Hausdorff distance between the two medial axes is also bounded, by dH (axλα(K),λα(K′)) ≲ dH(K,K′)1/2. These quantified stability results provide guarantees for practical computations of medial axes from approximations. Moreover, they provide key ingredients for studying the computability of the medial axis in the context of computable analysis. AU - Lieutier, André AU - Wintraecken, Mathijs ID - 13048 SN - 9781450399135 T2 - Proceedings of the 55th Annual ACM Symposium on Theory of Computing TI - Hausdorff and Gromov-Hausdorff stable subsets of the medial axis ER - TY - CONF AB - Deep neural networks (DNNs) often have to be compressed, via pruning and/or quantization, before they can be deployed in practical settings. In this work we propose a new compression-aware minimizer dubbed CrAM that modifies the optimization step in a principled way, in order to produce models whose local loss behavior is stable under compression operations such as pruning. Thus, dense models trained via CrAM should be compressible post-training, in a single step, without significant accuracy loss. Experimental results on standard benchmarks, such as residual networks for ImageNet classification and BERT models for language modelling, show that CrAM produces dense models that can be more accurate than the standard SGD/Adam-based baselines, but which are stable under weight pruning: specifically, we can prune models in one-shot to 70-80% sparsity with almost no accuracy loss, and to 90% with reasonable (∼1%) accuracy loss, which is competitive with gradual compression methods. Additionally, CrAM can produce sparse models which perform well for transfer learning, and it also works for semi-structured 2:4 pruning patterns supported by GPU hardware. The code for reproducing the results is available at this https URL . AU - Peste, Elena-Alexandra AU - Vladu, Adrian AU - Kurtic, Eldar AU - Lampert, Christoph AU - Alistarh, Dan-Adrian ID - 13053 T2 - 11th International Conference on Learning Representations TI - CrAM: A Compression-Aware Minimizer ER - TY - CONF AB - GIMPS and PrimeGrid are large-scale distributed projects dedicated to searching giant prime numbers, usually of special forms like Mersenne and Proth primes. The numbers in the current search-space are millions of digits large and the participating volunteers need to run resource-consuming primality tests. Once a candidate prime N has been found, the only way for another party to independently verify the primality of N used to be by repeating the expensive primality test. To avoid the need for second recomputation of each primality test, these projects have recently adopted certifying mechanisms that enable efficient verification of performed tests. However, the mechanisms presently in place only detect benign errors and there is no guarantee against adversarial behavior: a malicious volunteer can mislead the project to reject a giant prime as being non-prime. In this paper, we propose a practical, cryptographically-sound mechanism for certifying the non-primality of Proth numbers. That is, a volunteer can – parallel to running the primality test for N – generate an efficiently verifiable proof at a little extra cost certifying that N is not prime. The interactive protocol has statistical soundness and can be made non-interactive using the Fiat-Shamir heuristic. Our approach is based on a cryptographic primitive called Proof of Exponentiation (PoE) which, for a group G, certifies that a tuple (x,y,T)∈G2×N satisfies x2T=y (Pietrzak, ITCS 2019 and Wesolowski, J. Cryptol. 2020). In particular, we show how to adapt Pietrzak’s PoE at a moderate additional cost to make it a cryptographically-sound certificate of non-primality. AU - Hoffmann, Charlotte AU - Hubáček, Pavel AU - Kamath, Chethan AU - Pietrzak, Krzysztof Z ID - 13143 SN - 0302-9743 T2 - Public-Key Cryptography - PKC 2023 TI - Certifying giant nonprimes VL - 13940 ER - TY - CONF AB - Reinforcement learning has received much attention for learning controllers of deterministic systems. We consider a learner-verifier framework for stochastic control systems and survey recent methods that formally guarantee a conjunction of reachability and safety properties. Given a property and a lower bound on the probability of the property being satisfied, our framework jointly learns a control policy and a formal certificate to ensure the satisfaction of the property with a desired probability threshold. Both the control policy and the formal certificate are continuous functions from states to reals, which are learned as parameterized neural networks. While in the deterministic case, the certificates are invariant and barrier functions for safety, or Lyapunov and ranking functions for liveness, in the stochastic case the certificates are supermartingales. For certificate verification, we use interval arithmetic abstract interpretation to bound the expected values of neural network functions. AU - Chatterjee, Krishnendu AU - Henzinger, Thomas A AU - Lechner, Mathias AU - Zikelic, Dorde ID - 13142 SN - 0302-9743 T2 - Tools and Algorithms for the Construction and Analysis of Systems TI - A learner-verifier framework for neural network controllers and certificates of stochastic systems VL - 13993 ER - TY - CONF AB - We automatically compute a new class of environment assumptions in two-player turn-based finite graph games which characterize an “adequate cooperation” needed from the environment to allow the system player to win. Given an ω-regular winning condition Φ for the system player, we compute an ω-regular assumption Ψ for the environment player, such that (i) every environment strategy compliant with Ψ allows the system to fulfill Φ (sufficiency), (ii) Ψ can be fulfilled by the environment for every strategy of the system (implementability), and (iii) Ψ does not prevent any cooperative strategy choice (permissiveness). For parity games, which are canonical representations of ω-regular games, we present a polynomial-time algorithm for the symbolic computation of adequately permissive assumptions and show that our algorithm runs faster and produces better assumptions than existing approaches—both theoretically and empirically. To the best of our knowledge, for ω -regular games, we provide the first algorithm to compute sufficient and implementable environment assumptions that are also permissive. AU - Anand, Ashwani AU - Mallik, Kaushik AU - Nayak, Satya Prakash AU - Schmuck, Anne Kathrin ID - 13141 SN - 0302-9743 T2 - TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems TI - Computing adequately permissive assumptions for synthesis VL - 13994 ER - TY - THES AB - During navigation, animals can infer the structure of the environment by computing the optic flow cues elicited by their own movements, and subsequently use this information to instruct proper locomotor actions. These computations require a panoramic assessment of the visual environment in order to disambiguate similar sensory experiences that may require distinct behavioral responses. The estimation of the global motion patterns is therefore essential for successful navigation. Yet, our understanding of the algorithms and implementations that enable coherent panoramic visual perception remains scarce. Here I pursue this problem by dissecting the functional aspects of interneuronal communication in the lobula plate tangential cell network in Drosophila melanogaster. The results presented in the thesis demonstrate that the basis for effective interpretation of the optic flow in this circuit are stereotyped synaptic connections that mediate the formation of distinct subnetworks, each extracting a particular pattern of global motion. Firstly, I show that gap junctions are essential for a correct interpretation of binocular motion cues by horizontal motion-sensitive cells. HS cells form electrical synapses with contralateral H2 neurons that are involved in detecting yaw rotation and translation. I developed an FlpStop-mediated mutant of a gap junction protein ShakB that disrupts these electrical synapses. While the loss of electrical synapses does not affect the tuning of the direction selectivity in HS neurons, it severely alters their sensitivity to horizontal motion in the contralateral side. These physiological changes result in an inappropriate integration of binocular motion cues in walking animals. While wild-type flies form a binocular perception of visual motion by non-linear integration of monocular optic flow cues, the mutant flies sum the monocular inputs linearly. These results indicate that rather than averaging signals in neighboring neurons, gap-junctions operate in conjunction with chemical synapses to mediate complex non-linear optic flow computations. Secondly, I show that stochastic manipulation of neuronal activity in the lobula plate tangential cell network is a powerful approach to study the neuronal implementation of optic flow-based navigation in flies. Tangential neurons form multiple subnetworks, each mediating course-stabilizing response to a particular global pattern of visual motion. Application of genetic mosaic techniques can provide sparse optogenetic activation of HS cells in numerous combinations. These distinct combinations of activated neurons drive an array of distinct behavioral responses, providing important insights into how visuomotor transformation is performed in the lobula plate tangential cell network. This approach can be complemented by stochastic silencing of tangential neurons, enabling direct assessment of the functional role of individual tangential neurons in the processing of specific visual motion patterns. Taken together, the findings presented in this thesis suggest that establishing specific activity patterns of tangential cells via stereotyped synaptic connectivity is a key to efficient optic flow-based navigation in Drosophila melanogaster. AU - Pokusaeva, Victoria ID - 12826 SN - 2663 - 337X TI - Neural control of optic flow-based navigation in Drosophila melanogaster ER - TY - JOUR AB - We present a simple algorithm for computing higher-order Delaunay mosaics that works in Euclidean spaces of any finite dimensions. The algorithm selects the vertices of the order-k mosaic from incrementally constructed lower-order mosaics and uses an algorithm for weighted first-order Delaunay mosaics as a black-box to construct the order-k mosaic from its vertices. Beyond this black-box, the algorithm uses only combinatorial operations, thus facilitating easy implementation. We extend this algorithm to compute higher-order α-shapes and provide open-source implementations. We present experimental results for properties of higher-order Delaunay mosaics of random point sets. AU - Edelsbrunner, Herbert AU - Osang, Georg F ID - 12086 JF - Algorithmica SN - 0178-4617 TI - A simple algorithm for higher-order Delaunay mosaics and alpha shapes VL - 85 ER - TY - JOUR AB - We study ergodic decompositions of Dirichlet spaces under intertwining via unitary order isomorphisms. We show that the ergodic decomposition of a quasi-regular Dirichlet space is unique up to a unique isomorphism of the indexing space. Furthermore, every unitary order isomorphism intertwining two quasi-regular Dirichlet spaces is decomposable over their ergodic decompositions up to conjugation via an isomorphism of the corresponding indexing spaces. AU - Dello Schiavo, Lorenzo AU - Wirth, Melchior ID - 12104 IS - 1 JF - Journal of Evolution Equations SN - 1424-3199 TI - Ergodic decompositions of Dirichlet forms under order isomorphisms VL - 23 ER - TY - JOUR AB - The Indian summer monsoon rainfall (ISMR) has been declining since the 1950s. However, since 2002 it is reported to have revived. For these observed changes in the ISMR, several explanations have been reported. Among these explanations, however, the role of the eastern equatorial Indian Ocean (EEIO) is missing despite being one of the warmest regions in the Indian Ocean, and monotonously warming. A recent study reported that EEIO warming impacts the rainfall over northern India. Here we report that warming in the EEIO weakens the low-level Indian summer monsoon circulation and reduces ISMR. A warm EEIO drives easterly winds in the Indo–Pacific sector as a Gill response. The warm EEIO also enhances nocturnal convection offshore the western coast of Sumatra. The latent heating associated with the increased convection augments the Gill response and the resultant circulation opposes the monsoon low-level circulation and weakens the seasonal rainfall. AU - Goswami, Bidyut B ID - 11434 JF - Climate Dynamics SN - 0930-7575 TI - Role of the eastern equatorial Indian Ocean warming in the Indian summer monsoon rainfall trend VL - 60 ER - TY - CONF AB - Safety and liveness are elementary concepts of computation, and the foundation of many verification paradigms. The safety-liveness classification of boolean properties characterizes whether a given property can be falsified by observing a finite prefix of an infinite computation trace (always for safety, never for liveness). In quantitative specification and verification, properties assign not truth values, but quantitative values to infinite traces (e.g., a cost, or the distance to a boolean property). We introduce quantitative safety and liveness, and we prove that our definitions induce conservative quantitative generalizations of both (1)~the safety-progress hierarchy of boolean properties and (2)~the safety-liveness decomposition of boolean properties. In particular, we show that every quantitative property can be written as the pointwise minimum of a quantitative safety property and a quantitative liveness property. Consequently, like boolean properties, also quantitative properties can be min-decomposed into safety and liveness parts, or alternatively, max-decomposed into co-safety and co-liveness parts. Moreover, quantitative properties can be approximated naturally. We prove that every quantitative property that has both safe and co-safe approximations can be monitored arbitrarily precisely by a monitor that uses only a finite number of states. AU - Henzinger, Thomas A AU - Mazzocchi, Nicolas Adrien AU - Sarac, Naci E ID - 12467 SN - 0302-9743 T2 - 26th International Conference Foundations of Software Science and Computation Structures TI - Quantitative safety and liveness VL - 13992 ER - TY - JOUR AB - Writing concurrent code that is both correct and efficient is notoriously difficult. Thus, programmers often prefer to use synchronization abstractions, which render code simpler and easier to reason about. Despite a wealth of work on this topic, there is still a gap between the rich semantics provided by synchronization abstractions in modern programming languages—specifically, fair FIFO ordering of synchronization requests and support for abortable operations—and frameworks for implementing it correctly and efficiently. Supporting such semantics is critical given the rising popularity of constructs for asynchronous programming, such as coroutines, which abort frequently and are cheaper to suspend and resume compared to native threads. This paper introduces a new framework called CancellableQueueSynchronizer (CQS), which enables simple yet efficient implementations of a wide range of fair and abortable synchronization primitives: mutexes, semaphores, barriers, count-down latches, and blocking pools. Our main contribution is algorithmic, as implementing both fairness and abortability efficiently at this level of generality is non-trivial. Importantly, all our algorithms, including the CQS framework and the primitives built on top of it, come with formal proofs in the Iris framework for Coq for many of their properties. These proofs are modular, so it is easy to show correctness for new primitives implemented on top of CQS. From a practical perspective, implementation of CQS for native threads on the JVM improves throughput by up to two orders of magnitude over Java’s AbstractQueuedSynchronizer, the only practical abstraction offering similar semantics. Further, we successfully integrated CQS as a core component of the popular Kotlin Coroutines library, validating the framework’s practical impact and expressiveness in a real-world environment. In sum, CancellableQueueSynchronizer is the first framework to combine expressiveness with formal guarantees and solid practical performance. Our approach should be extensible to other languages and families of synchronization primitives. AU - Koval, Nikita AU - Khalanskiy, Dmitry AU - Alistarh, Dan-Adrian ID - 13179 JF - Proceedings of the ACM on Programming Languages TI - CQS: A formally-verified framework for fair and abortable synchronization VL - 7 ER - TY - JOUR AB - We study the density of everywhere locally soluble diagonal quadric surfaces, parameterised by rational points that lie on a split quadric surface AU - Browning, Timothy D AU - Lyczak, Julian AU - Sarapin, Roman ID - 13180 IS - 2 JF - Involve SN - 1944-4176 TI - Local solubility for a family of quadrics over a split quadric surface VL - 16 ER - TY - JOUR AB - A rotating organic cation and a dynamically disordered soft inorganic cage are the hallmark features of organic-inorganic lead-halide perovskites. Understanding the interplay between these two subsystems is a challenging problem, but it is this coupling that is widely conjectured to be responsible for the unique behavior of photocarriers in these materials. In this work, we use the fact that the polarizability of the organic cation strongly depends on the ambient electrostatic environment to put the molecule forward as a sensitive probe of the local crystal fields inside the lattice cell. We measure the average polarizability of the C/N–H bond stretching mode by means of infrared spectroscopy, which allows us to deduce the character of the motion of the cation molecule, find the magnitude of the local crystal field, and place an estimate on the strength of the hydrogen bond between the hydrogen and halide atoms. Our results pave the way for understanding electric fields in lead-halide perovskites using infrared bond spectroscopy. AU - Wei, Yujing AU - Volosniev, Artem AU - Lorenc, Dusan AU - Zhumekenov, Ayan A. AU - Bakr, Osman M. AU - Lemeshko, Mikhail AU - Alpichshev, Zhanybek ID - 13251 IS - 27 JF - The Journal of Physical Chemistry Letters KW - General Materials Science KW - Physical and Theoretical Chemistry TI - Bond polarizability as a probe of local crystal fields in hybrid lead-halide perovskites VL - 14 ER - TY - CONF AB - The operator precedence languages (OPLs) represent the largest known subclass of the context-free languages which enjoys all desirable closure and decidability properties. This includes the decidability of language inclusion, which is the ultimate verification problem. Operator precedence grammars, automata, and logics have been investigated and used, for example, to verify programs with arithmetic expressions and exceptions (both of which are deterministic pushdown but lie outside the scope of the visibly pushdown languages). In this paper, we complete the picture and give, for the first time, an algebraic characterization of the class of OPLs in the form of a syntactic congruence that has finitely many equivalence classes exactly for the operator precedence languages. This is a generalization of the celebrated Myhill-Nerode theorem for the regular languages to OPLs. As one of the consequences, we show that universality and language inclusion for nondeterministic operator precedence automata can be solved by an antichain algorithm. Antichain algorithms avoid determinization and complementation through an explicit subset construction, by leveraging a quasi-order on words, which allows the pruning of the search space for counterexample words without sacrificing completeness. Antichain algorithms can be implemented symbolically, and these implementations are today the best-performing algorithms in practice for the inclusion of finite automata. We give a generic construction of the quasi-order needed for antichain algorithms from a finite syntactic congruence. This yields the first antichain algorithm for OPLs, an algorithm that solves the ExpTime-hard language inclusion problem for OPLs in exponential time. AU - Henzinger, Thomas A AU - Kebis, Pavol AU - Mazzocchi, Nicolas Adrien AU - Sarac, Naci E ID - 13292 SN - 9783959772785 T2 - 50th International Colloquium on Automata, Languages, and Programming TI - Regular methods for operator precedence languages VL - 261 ER - TY - JOUR AB - Recent experimental advances have inspired the development of theoretical tools to describe the non-equilibrium dynamics of quantum systems. Among them an exact representation of quantum spin systems in terms of classical stochastic processes has been proposed. Here we provide first steps towards the extension of this stochastic approach to bosonic systems by considering the one-dimensional quantum quartic oscillator. We show how to exactly parameterize the time evolution of this prototypical model via the dynamics of a set of classical variables. We interpret these variables as stochastic processes, which allows us to propose a novel way to numerically simulate the time evolution of the system. We benchmark our findings by considering analytically solvable limits and providing alternative derivations of known results. AU - Tucci, Gennaro AU - De Nicola, Stefano AU - Wald, Sascha AU - Gambassi, Andrea ID - 13277 IS - 2 JF - SciPost Physics Core KW - Statistical and Nonlinear Physics KW - Atomic and Molecular Physics KW - and Optics KW - Nuclear and High Energy Physics KW - Condensed Matter Physics SN - 2666-9366 TI - Stochastic representation of the quantum quartic oscillator VL - 6 ER - TY - JOUR AB - We introduce a generic and accessible implementation of an exact diagonalization method for studying few-fermion models. Our aim is to provide a testbed for the newcomers to the field as well as a stepping stone for trying out novel optimizations and approximations. This userguide consists of a description of the algorithm, and several examples in varying orders of sophistication. In particular, we exemplify our routine using an effective-interaction approach that fixes the low-energy physics. We benchmark this approach against the existing data, and show that it is able to deliver state-of-the-art numerical results at a significantly reduced computational cost. AU - Rammelmüller, Lukas AU - Huber, David AU - Volosniev, Artem ID - 13276 JF - SciPost Physics Codebases SN - 2949-804X TI - A modular implementation of an effective interaction approach for harmonically trapped fermions in 1D ER -