@article{10635, abstract = {The brain efficiently performs nonlinear computations through its intricate networks of spiking neurons, but how this is done remains elusive. While nonlinear computations can be implemented successfully in spiking neural networks, this requires supervised training and the resulting connectivity can be hard to interpret. In contrast, the required connectivity for any computation in the form of a linear dynamical system can be directly derived and understood with the spike coding network (SCN) framework. These networks also have biologically realistic activity patterns and are highly robust to cell death. Here we extend the SCN framework to directly implement any polynomial dynamical system, without the need for training. This results in networks requiring a mix of synapse types (fast, slow, and multiplicative), which we term multiplicative spike coding networks (mSCNs). Using mSCNs, we demonstrate how to directly derive the required connectivity for several nonlinear dynamical systems. We also show how to carry out higher-order polynomials with coupled networks that use only pair-wise multiplicative synapses, and provide expected numbers of connections for each synapse type. Overall, our work demonstrates a novel method for implementing nonlinear computations in spiking neural networks, while keeping the attractive features of standard SCNs (robustness, realistic activity patterns, and interpretable connectivity). Finally, we discuss the biological plausibility of our approach, and how the high accuracy and robustness of the approach may be of interest for neuromorphic computing.}, author = {Nardin, Michele and Phillips, James W. and Podlaski, William F. and Keemink, Sander W.}, issn = {2804-3871}, journal = {Peer Community Journal}, publisher = {Centre Mersenne ; Peer Community In}, title = {{Nonlinear computations in spiking neural networks through multiplicative synapses}}, doi = {10.24072/pcjournal.69}, volume = {1}, year = {2021}, } @misc{10645, abstract = {Superconducting qubits have emerged as a highly versatile and useful platform for quantum technological applications [1]. Bluefors and Zurich Instruments have supported the growth of this field from the 2010s onwards by providing well-engineered and reliable measurement infrastructure [2]– [6]. Having a long and stable qubit lifetime is a critical system property. Therefore, considerable effort has already gone into measuring qubit energy-relaxation timescales and their fluctuations, see Refs. [7]–[10] among others. Accurately extracting the statistics of a quantum device requires users to perform time consuming measurements. One measurement challenge is that the detection of the state-dependent response of a superconducting resonator due to a dispersively-coupled qubit requires an inherently low signal level. Consequently, measurements must be performed using a microwave probe that contains only a few microwave photons. Improving the signal-to-noise ratio (SNR) by using near-quantum limited parametric amplifiers as well as the use of optimized signal processing enabled by efficient room temperature instrumentation help to reduce measurement time. An empirical observation for fixed frequency transmons from recent literature is that as the energy-relaxation time 𝑇𝑇1 increases, so do its natural temporal fluctuations [7], [10]. This necessitates many repeated measurements to understand the statistics (see for example, Ref. [10]). In addition, as state-of-the-art qubits increase in lifetime, longer measurement times are expected to obtain accurate statistics. As described below, the scaling of the widths of the qubit energy-relaxation distributions also reveal clues about the origin of the energy-relaxation.}, author = {Simbierowicz, Slawomir and Shi, Chunyan and Collodo, Michele and Kirste, Moritz and Hassani, Farid and Fink, Johannes M and Bylander, Jonas and Perez Lozano, Daniel and Lake, Russell}, keywords = {Application note}, pages = {8}, publisher = {Bluefors Oy}, title = {{Qubit energy-relaxation statistics in the Bluefors quantum measurement system}}, year = {2021}, } @misc{10644, abstract = {The purpose of this application note is to demonstrate a working example of a superconducting qubit measurement in a Bluefors cryostat using the Keysight quantum control hardware. Our motivation is twofold. First, we provide pre-qualification data that the Bluefors cryostat, including filtering and wiring, can support long-lived qubits. Second, we demonstrate that the Keysight system (controlled using Labber) provides a straightforward solution to perform these characterization measurements. This document is intended as a brief guide for starting an experimental platform for testing superconducting qubits. The setup described here is an immediate jumping off point for a suite of applications including testing quantum logical gates, quantum optics with microwaves, or even using the qubit itself as a sensitive probe of local electromagnetic fields. Qubit measurements rely on high performance of both the physical sample environment and the measurement electronics. An overview of the cryogenic system is shown in Figure 1, and an overview of the integration between the electronics and cryostat (including wiring details) is shown in Figure 2.}, author = {Lake, Russell and Simbierowicz, Slawomir and Krantz, Philip and Hassani, Farid and Fink, Johannes M}, keywords = {Application note}, pages = {9}, publisher = {Bluefors Oy}, title = {{The Bluefors dilution refrigerator as an integrated quantum measurement system}}, year = {2021}, } @inproceedings{10669, abstract = {We show that Neural ODEs, an emerging class of timecontinuous neural networks, can be verified by solving a set of global-optimization problems. For this purpose, we introduce Stochastic Lagrangian Reachability (SLR), an abstraction-based technique for constructing a tight Reachtube (an over-approximation of the set of reachable states over a given time-horizon), and provide stochastic guarantees in the form of confidence intervals for the Reachtube bounds. SLR inherently avoids the infamous wrapping effect (accumulation of over-approximation errors) by performing local optimization steps to expand safe regions instead of repeatedly forward-propagating them as is done by deterministic reachability methods. To enable fast local optimizations, we introduce a novel forward-mode adjoint sensitivity method to compute gradients without the need for backpropagation. Finally, we establish asymptotic and non-asymptotic convergence rates for SLR.}, author = {Grunbacher, Sophie and Hasani, Ramin and Lechner, Mathias and Cyranka, Jacek and Smolka, Scott A and Grosu, Radu}, booktitle = {Proceedings of the AAAI Conference on Artificial Intelligence}, isbn = {978-1-57735-866-4}, issn = {2374-3468}, location = {Virtual}, number = {13}, pages = {11525--11535}, publisher = {AAAI Press}, title = {{On the verification of neural ODEs with stochastic guarantees}}, volume = {35}, year = {2021}, } @inproceedings{10671, abstract = {We introduce a new class of time-continuous recurrent neural network models. Instead of declaring a learning system’s dynamics by implicit nonlinearities, we construct networks of linear first-order dynamical systems modulated via nonlinear interlinked gates. The resulting models represent dynamical systems with varying (i.e., liquid) time-constants coupled to their hidden state, with outputs being computed by numerical differential equation solvers. These neural networks exhibit stable and bounded behavior, yield superior expressivity within the family of neural ordinary differential equations, and give rise to improved performance on time-series prediction tasks. To demonstrate these properties, we first take a theoretical approach to find bounds over their dynamics, and compute their expressive power by the trajectory length measure in a latent trajectory space. We then conduct a series of time-series prediction experiments to manifest the approximation capability of Liquid Time-Constant Networks (LTCs) compared to classical and modern RNNs.}, author = {Hasani, Ramin and Lechner, Mathias and Amini, Alexander and Rus, Daniela and Grosu, Radu}, booktitle = {Proceedings of the AAAI Conference on Artificial Intelligence}, isbn = {978-1-57735-866-4}, issn = {2374-3468}, location = {Virtual}, number = {9}, pages = {7657--7666}, publisher = {AAAI Press}, title = {{Liquid time-constant networks}}, volume = {35}, year = {2021}, } @inproceedings{10668, abstract = {Robustness to variations in lighting conditions is a key objective for any deep vision system. To this end, our paper extends the receptive field of convolutional neural networks with two residual components, ubiquitous in the visual processing system of vertebrates: On-center and off-center pathways, with an excitatory center and inhibitory surround; OOCS for short. The On-center pathway is excited by the presence of a light stimulus in its center, but not in its surround, whereas the Off-center pathway is excited by the absence of a light stimulus in its center, but not in its surround. We design OOCS pathways via a difference of Gaussians, with their variance computed analytically from the size of the receptive fields. OOCS pathways complement each other in their response to light stimuli, ensuring this way a strong edge-detection capability, and as a result an accurate and robust inference under challenging lighting conditions. We provide extensive empirical evidence showing that networks supplied with OOCS pathways gain accuracy and illumination-robustness from the novel edge representation, compared to other baselines.}, author = {Babaiee, Zahra and Hasani, Ramin and Lechner, Mathias and Rus, Daniela and Grosu, Radu}, booktitle = {Proceedings of the 38th International Conference on Machine Learning}, issn = {2640-3498}, location = {Virtual}, pages = {478--489}, publisher = {ML Research Press}, title = {{On-off center-surround receptive fields for accurate and robust image classification}}, volume = {139}, year = {2021}, } @inproceedings{10670, abstract = {Imitation learning enables high-fidelity, vision-based learning of policies within rich, photorealistic environments. However, such techniques often rely on traditional discrete-time neural models and face difficulties in generalizing to domain shifts by failing to account for the causal relationships between the agent and the environment. In this paper, we propose a theoretical and experimental framework for learning causal representations using continuous-time neural networks, specifically over their discrete-time counterparts. We evaluate our method in the context of visual-control learning of drones over a series of complex tasks, ranging from short- and long-term navigation, to chasing static and dynamic objects through photorealistic environments. Our results demonstrate that causal continuous-time deep models can perform robust navigation tasks, where advanced recurrent models fail. These models learn complex causal control representations directly from raw visual inputs and scale to solve a variety of tasks using imitation learning.}, author = {Vorbach, Charles J and Hasani, Ramin and Amini, Alexander and Lechner, Mathias and Rus, Daniela}, booktitle = {35th Conference on Neural Information Processing Systems}, location = {Virtual}, title = {{Causal navigation by continuous-time neural networks}}, year = {2021}, } @inproceedings{10688, abstract = {Civl is a static verifier for concurrent programs designed around the conceptual framework of layered refinement, which views the task of verifying a program as a sequence of program simplification steps each justified by its own invariant. Civl verifies a layered concurrent program that compactly expresses all the programs in this sequence and the supporting invariants. This paper presents the design and implementation of the Civl verifier.}, author = {Kragl, Bernhard and Qadeer, Shaz}, booktitle = {Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design}, editor = {Ruzica, Piskac and Whalen, Michael W.}, isbn = {978-3-85448-046-4}, location = {Virtual}, pages = {143–152}, publisher = {TU Wien Academic Press}, title = {{The Civl verifier}}, doi = {10.34727/2021/isbn.978-3-85448-046-4_23}, volume = {2}, year = {2021}, } @inproceedings{10694, abstract = {In a two-player zero-sum graph game the players move a token throughout a graph to produce an infinite path, which determines the winner or payoff of the game. Traditionally, the players alternate turns in moving the token. In bidding games, however, the players have budgets, and in each turn, we hold an “auction” (bidding) to determine which player moves the token: both players simultaneously submit bids and the higher bidder moves the token. The bidding mechanisms differ in their payment schemes. Bidding games were largely studied with variants of first-price bidding in which only the higher bidder pays his bid. We focus on all-pay bidding, where both players pay their bids. Finite-duration all-pay bidding games were studied and shown to be technically more challenging than their first-price counterparts. We study for the first time, infinite-duration all-pay bidding games. Our most interesting results are for mean-payoff objectives: we portray a complete picture for games played on strongly-connected graphs. We study both pure (deterministic) and mixed (probabilistic) strategies and completely characterize the optimal and almost-sure (with probability 1) payoffs the players can respectively guarantee. We show that mean-payoff games under all-pay bidding exhibit the intriguing mathematical properties of their first-price counterparts; namely, an equivalence with random-turn games in which in each turn, the player who moves is selected according to a (biased) coin toss. The equivalences for all-pay bidding are more intricate and unexpected than for first-price bidding.}, author = {Avni, Guy and Jecker, Ismael R and Zikelic, Dorde}, booktitle = {Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms}, editor = {Marx, Dániel}, isbn = {978-1-61197-646-5}, location = {Virtual}, pages = {617--636}, publisher = {Society for Industrial and Applied Mathematics}, title = {{Infinite-duration all-pay bidding games}}, doi = {10.1137/1.9781611976465.38}, year = {2021}, } @inproceedings{10847, abstract = {We study the two-player zero-sum extension of the partially observable stochastic shortest-path problem where one agent has only partial information about the environment. We formulate this problem as a partially observable stochastic game (POSG): given a set of target states and negative rewards for each transition, the player with imperfect information maximizes the expected undiscounted total reward until a target state is reached. The second player with the perfect information aims for the opposite. We base our formalism on POSGs with one-sided observability (OS-POSGs) and give the following contributions: (1) we introduce a novel heuristic search value iteration algorithm that iteratively solves depth-limited variants of the game, (2) we derive the bound on the depth guaranteeing an arbitrary precision, (3) we propose a novel upper-bound estimation that allows early terminations, and (4) we experimentally evaluate the algorithm on a pursuit-evasion game.}, author = {Tomášek, Petr and Horák, Karel and Aradhye, Aditya and Bošanský, Branislav and Chatterjee, Krishnendu}, booktitle = {30th International Joint Conference on Artificial Intelligence}, isbn = {9780999241196}, issn = {1045-0823}, location = {Virtual, Online}, pages = {4182--4189}, publisher = {International Joint Conferences on Artificial Intelligence}, title = {{Solving partially observable stochastic shortest-path games}}, doi = {10.24963/ijcai.2021/575}, year = {2021}, } @inproceedings{10853, abstract = {Dynamic Connectivity is a fundamental algorithmic graph problem, motivated by a wide range of applications to social and communication networks and used as a building block in various other algorithms, such as the bi-connectivity and the dynamic minimal spanning tree problems. In brief, we wish to maintain the connected components of the graph under dynamic edge insertions and deletions. In the sequential case, the problem has been well-studied from both theoretical and practical perspectives. However, much less is known about efficient concurrent solutions to this problem. This is the gap we address in this paper. We start from one of the classic data structures used to solve this problem, the Euler Tour Tree. Our first contribution is a non-blocking single-writer implementation of it. We leverage this data structure to obtain the first truly concurrent generalization of dynamic connectivity, which preserves the time complexity of its sequential counterpart, but is also scalable in practice. To achieve this, we rely on three main techniques. The first is to ensure that connectivity queries, which usually dominate real-world workloads, are non-blocking. The second non-trivial technique expands the above idea by making all queries that do not change the connectivity structure non-blocking. The third ingredient is applying fine-grained locking for updating the connected components, which allows operations on disjoint components to occur in parallel. We evaluate the resulting algorithm on various workloads, executing on both real and synthetic graphs. The results show the efficiency of each of the proposed optimizations; the most efficient variant improves the performance of a coarse-grained based implementation on realistic scenarios up to 6x on average and up to 30x when connectivity queries dominate.}, author = {Fedorov, Alexander and Koval, Nikita and Alistarh, Dan-Adrian}, booktitle = {Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures}, isbn = {9781450380706}, location = {Virtual, Online}, pages = {208--220}, publisher = {Association for Computing Machinery}, title = {{A scalable concurrent algorithm for dynamic connectivity}}, doi = {10.1145/3409964.3461810}, year = {2021}, } @unpublished{10912, abstract = {Brain dynamics display collective phenomena as diverse as neuronal oscillations and avalanches. Oscillations are rhythmic, with fluctuations occurring at a characteristic scale, whereas avalanches are scale-free cascades of neural activity. Here we show that such antithetic features can coexist in a very generic class of adaptive neural networks. In the most simple yet fully microscopic model from this class we make direct contact with human brain resting-state activity recordings via tractable inference of the model's two essential parameters. The inferred model quantitatively captures the dynamics over a broad range of scales, from single sensor fluctuations, collective behaviors of nearly-synchronous extreme events on multiple sensors, to neuronal avalanches unfolding over multiple sensors across multiple time-bins. Importantly, the inferred parameters correlate with model-independent signatures of "closeness to criticality", suggesting that the coexistence of scale-specific (neural oscillations) and scale-free (neuronal avalanches) dynamics in brain activity occurs close to a non-equilibrium critical point at the onset of self-sustained oscillations.}, author = {Lombardi, Fabrizio and Pepic, Selver and Shriki, Oren and Tkačik, Gašper and De Martino, Daniele}, pages = {37}, publisher = {arXiv}, title = {{Quantifying the coexistence of neuronal oscillations and avalanches}}, doi = {10.48550/ARXIV.2108.06686}, year = {2021}, } @inproceedings{11436, abstract = {Asynchronous distributed algorithms are a popular way to reduce synchronization costs in large-scale optimization, and in particular for neural network training. However, for nonsmooth and nonconvex objectives, few convergence guarantees exist beyond cases where closed-form proximal operator solutions are available. As training most popular deep neural networks corresponds to optimizing nonsmooth and nonconvex objectives, there is a pressing need for such convergence guarantees. In this paper, we analyze for the first time the convergence of stochastic asynchronous optimization for this general class of objectives. In particular, we focus on stochastic subgradient methods allowing for block variable partitioning, where the shared model is asynchronously updated by concurrent processes. To this end, we use a probabilistic model which captures key features of real asynchronous scheduling between concurrent processes. Under this model, we establish convergence with probability one to an invariant set for stochastic subgradient methods with momentum. From a practical perspective, one issue with the family of algorithms that we consider is that they are not efficiently supported by machine learning frameworks, which mostly focus on distributed data-parallel strategies. To address this, we propose a new implementation strategy for shared-memory based training of deep neural networks for a partitioned but shared model in single- and multi-GPU settings. Based on this implementation, we achieve on average1.2x speed-up in comparison to state-of-the-art training methods for popular image classification tasks, without compromising accuracy.}, author = {Kungurtsev, Vyacheslav and Egan, Malcolm and Chatterjee, Bapi and Alistarh, Dan-Adrian}, booktitle = {35th AAAI Conference on Artificial Intelligence, AAAI 2021}, isbn = {9781713835974}, issn = {2374-3468}, location = {Virtual, Online}, number = {9B}, pages = {8209--8216}, publisher = {AAAI Press}, title = {{Asynchronous optimization methods for efficient training of deep neural networks with guarantees}}, volume = {35}, year = {2021}, } @inproceedings{11453, abstract = {Neuronal computations depend on synaptic connectivity and intrinsic electrophysiological properties. Synaptic connectivity determines which inputs from presynaptic neurons are integrated, while cellular properties determine how inputs are filtered over time. Unlike their biological counterparts, most computational approaches to learning in simulated neural networks are limited to changes in synaptic connectivity. However, if intrinsic parameters change, neural computations are altered drastically. Here, we include the parameters that determine the intrinsic properties, e.g., time constants and reset potential, into the learning paradigm. Using sparse feedback signals that indicate target spike times, and gradient-based parameter updates, we show that the intrinsic parameters can be learned along with the synaptic weights to produce specific input-output functions. Specifically, we use a teacher-student paradigm in which a randomly initialised leaky integrate-and-fire or resonate-and-fire neuron must recover the parameters of a teacher neuron. We show that complex temporal functions can be learned online and without backpropagation through time, relying on event-based updates only. Our results are a step towards online learning of neural computations from ungraded and unsigned sparse feedback signals with a biologically inspired learning mechanism.}, author = {Braun, Lukas and Vogels, Tim P}, booktitle = {Advances in Neural Information Processing Systems - 35th Conference on Neural Information Processing Systems}, isbn = {9781713845393}, issn = {1049-5258}, location = {Virtual, Online}, pages = {16437--16450}, publisher = {Neural Information Processing Systems Foundation}, title = {{Online learning of neural computations from sparse temporal feedback}}, volume = {20}, year = {2021}, } @inproceedings{11452, abstract = {We study efficient distributed algorithms for the fundamental problem of principal component analysis and leading eigenvector computation on the sphere, when the data are randomly distributed among a set of computational nodes. We propose a new quantized variant of Riemannian gradient descent to solve this problem, and prove that the algorithm converges with high probability under a set of necessary spherical-convexity properties. We give bounds on the number of bits transmitted by the algorithm under common initialization schemes, and investigate the dependency on the problem dimension in each case.}, author = {Alimisis, Foivos and Davies, Peter and Vandereycken, Bart and Alistarh, Dan-Adrian}, booktitle = {Advances in Neural Information Processing Systems - 35th Conference on Neural Information Processing Systems}, isbn = {9781713845393}, issn = {1049-5258}, location = {Virtual, Online}, pages = {2823--2834}, publisher = {Neural Information Processing Systems Foundation}, title = {{Distributed principal component analysis with limited communication}}, volume = {4}, year = {2021}, } @inproceedings{11463, abstract = {Efficiently approximating local curvature information of the loss function is a key tool for optimization and compression of deep neural networks. Yet, most existing methods to approximate second-order information have high computational or storage costs, which limits their practicality. In this work, we investigate matrix-free, linear-time approaches for estimating Inverse-Hessian Vector Products (IHVPs) for the case when the Hessian can be approximated as a sum of rank-one matrices, as in the classic approximation of the Hessian by the empirical Fisher matrix. We propose two new algorithms: the first is tailored towards network compression and can compute the IHVP for dimension d, if the Hessian is given as a sum of m rank-one matrices, using O(dm2) precomputation, O(dm) cost for computing the IHVP, and query cost O(m) for any single element of the inverse Hessian. The second algorithm targets an optimization setting, where we wish to compute the product between the inverse Hessian, estimated over a sliding window of optimization steps, and a given gradient direction, as required for preconditioned SGD. We give an algorithm with cost O(dm + m2) for computing the IHVP and O(dm + m3) for adding or removing any gradient from the sliding window. These two algorithms yield state-of-the-art results for network pruning and optimization with lower computational overhead relative to existing second-order methods. Implementations are available at [9] and [17].}, author = {Frantar, Elias and Kurtic, Eldar and Alistarh, Dan-Adrian}, booktitle = {35th Conference on Neural Information Processing Systems}, isbn = {9781713845393}, issn = {1049-5258}, location = {Virtual, Online}, pages = {14873--14886}, publisher = {Curran Associates}, title = {{M-FAC: Efficient matrix-free approximations of second-order information}}, volume = {34}, year = {2021}, } @inproceedings{11464, abstract = {We consider a standard distributed optimisation setting where N machines, each holding a d-dimensional function fi, aim to jointly minimise the sum of the functions ∑Ni=1fi(x). This problem arises naturally in large-scale distributed optimisation, where a standard solution is to apply variants of (stochastic) gradient descent. We focus on the communication complexity of this problem: our main result provides the first fully unconditional bounds on total number of bits which need to be sent and received by the N machines to solve this problem under point-to-point communication, within a given error-tolerance. Specifically, we show that Ω(Ndlogd/Nε) total bits need to be communicated between the machines to find an additive ϵ-approximation to the minimum of ∑Ni=1fi(x). The result holds for both deterministic and randomised algorithms, and, importantly, requires no assumptions on the algorithm structure. The lower bound is tight under certain restrictions on parameter values, and is matched within constant factors for quadratic objectives by a new variant of quantised gradient descent, which we describe and analyse. Our results bring over tools from communication complexity to distributed optimisation, which has potential for further applications.}, author = {Alistarh, Dan-Adrian and Korhonen, Janne}, booktitle = {35th Conference on Neural Information Processing Systems}, isbn = {9781713845393}, issn = {1049-5258}, location = {Virtual, Online}, pages = {7254--7266}, publisher = {Curran Associates}, title = {{Towards tight communication lower bounds for distributed optimisation}}, volume = {34}, year = {2021}, } @unpublished{12077, abstract = {We compare the Manin-type conjecture for Campana points recently formulated by Pieropan, Smeets, Tanimoto and V\'{a}rilly-Alvarado with an alternative prediction of Browning and Van Valckenborgh in the special case of the orbifold $(\mathbb{P}^1,D)$, where $D =\frac{1}{2}[0]+\frac{1}{2}[1]+\frac{1}{2}[\infty]$. We find that the two predicted leading constants do not agree, and we discuss whether thin sets could explain this discrepancy. Motivated by this, we provide a counterexample to the Manin-type conjecture for Campana points, by considering orbifolds corresponding to squareful values of binary quadratic forms.}, author = {Shute, Alec L}, booktitle = {arXiv}, title = {{On the leading constant in the Manin-type conjecture for Campana points}}, doi = {10.48550/arXiv.2104.14946}, year = {2021}, } @unpublished{12076, abstract = {We find an asymptotic formula for the number of primitive vectors $(z_1,\ldots,z_4)\in (\mathbb{Z}_{\neq 0})^4$ such that $z_1,\ldots, z_4$ are all squareful and bounded by $B$, and $z_1+\cdots + z_4 = 0$. Our result agrees in the power of $B$ and $\log B$ with the Campana-Manin conjecture of Pieropan, Smeets, Tanimoto and V\'{a}rilly-Alvarado.}, author = {Shute, Alec L}, booktitle = {arXiv}, title = {{Sums of four squareful numbers}}, doi = {10.48550/arXiv.2104.06966}, year = {2021}, } @inbook{7941, abstract = {Expansion microscopy is a recently developed super-resolution imaging technique, which provides an alternative to optics-based methods such as deterministic approaches (e.g. STED) or stochastic approaches (e.g. PALM/STORM). The idea behind expansion microscopy is to embed the biological sample in a swellable gel, and then to expand it isotropically, thereby increasing the distance between the fluorophores. This approach breaks the diffraction barrier by simply separating the emission point-spread-functions of the fluorophores. The resolution attainable in expansion microscopy is thus directly dependent on the separation that can be achieved, i.e. on the expansion factor. The original implementation of the technique achieved an expansion factor of fourfold, for a resolution of 70–80 nm. The subsequently developed X10 method achieves an expansion factor of 10-fold, for a resolution of 25–30 nm. This technique can be implemented with minimal technical requirements on any standard fluorescence microscope, and is more easily applied for multi-color imaging than either deterministic or stochastic super-resolution approaches. This renders X10 expansion microscopy a highly promising tool for new biological discoveries, as discussed here, and as demonstrated by several recent applications.}, author = {Truckenbrodt, Sven M and Rizzoli, Silvio O.}, booktitle = {Methods in Cell Biology}, isbn = {978012820807-6}, issn = {0091-679X}, pages = {33--56}, publisher = {Elsevier}, title = {{Simple multi-color super-resolution by X10 microscopy}}, doi = {10.1016/bs.mcb.2020.04.016}, volume = {161}, year = {2021}, } @article{9097, abstract = {Psoriasis is a chronic inflammatory skin disease clinically characterized by the appearance of red colored, well-demarcated plaques with thickened skin and with silvery scales. Recent studies have established the involvement of a complex signalling network of interactions between cytokines, immune cells and skin cells called keratinocytes. Keratinocytes form the cells of the outermost layer of the skin (epidermis). Visible plaques in psoriasis are developed due to the fast proliferation and unusual differentiation of keratinocyte cells. Despite that, the exact mechanism of the appearance of these plaques in the cytokine-immune cell network is not clear. A mathematical model embodying interactions between key immune cells believed to be involved in psoriasis, keratinocytes and relevant cytokines has been developed. The complex network formed of these interactions poses several challenges. Here, we choose to study subnetworks of this complex network and initially focus on interactions involving TNFα, IL-23/IL-17, and IL-15. These are chosen based on known evidence of their therapeutic efficacy. In addition, we explore the role of IL-15 in the pathogenesis of psoriasis and its potential as a future drug target for a novel treatment option. We perform steady state analyses for these subnetworks and demonstrate that the interactions between cells, driven by cytokines could cause the emergence of a psoriasis state (hyper-proliferation of keratinocytes) when levels of TNFα, IL-23/IL-17 or IL-15 are increased. The model results explain and support the clinical potentiality of anti-cytokine treatments. Interestingly, our results suggest different dynamic scenarios underpin the pathogenesis of psoriasis, depending upon the dominant cytokines of subnetworks. We observed that the increase in the level of IL-23/IL-17 and IL-15 could lead to psoriasis via a bistable route, whereas an increase in the level of TNFα would lead to a monotonic and gradual disease progression. Further, we demonstrate how this insight, bistability, could be exploited to improve the current therapies and develop novel treatment strategies for psoriasis.}, author = {Pandey, Rakesh and Al-Nuaimi, Yusur and Mishra, Rajiv Kumar and Spurgeon, Sarah K. and Goodfellow, Marc}, issn = {20452322}, journal = {Scientific Reports}, publisher = {Springer Nature}, title = {{Role of subnetworks mediated by TNF α, IL-23/IL-17 and IL-15 in a network involved in the pathogenesis of psoriasis}}, doi = {10.1038/s41598-020-80507-7}, volume = {11}, year = {2021}, } @inbook{9245, abstract = {Tissue morphogenesis is driven by mechanical forces triggering cell movements and shape changes. Quantitatively measuring tension within tissues is of great importance for understanding the role of mechanical signals acting on the cell and tissue level during morphogenesis. Here we introduce laser ablation as a useful tool to probe tissue tension within the granulosa layer, an epithelial monolayer of somatic cells that surround the zebrafish female gamete during folliculogenesis. We describe in detail how to isolate follicles, mount samples, perform laser surgery, and analyze the data.}, author = {Xia, Peng and Heisenberg, Carl-Philipp J}, booktitle = {Germline Development in the Zebrafish}, editor = {Dosch, Roland}, isbn = {978-1-0716-0969-9}, issn = {1940-6029}, keywords = {Tissue tension, Morphogenesis, Laser ablation, Zebrafish folliculogenesis, Granulosa cells}, pages = {117--128}, publisher = {Humana}, title = {{Quantifying tissue tension in the granulosa layer after laser surgery}}, doi = {10.1007/978-1-0716-0970-5_10}, volume = {2218}, year = {2021}, } @inproceedings{9296, abstract = { matching is compatible to two or more labeled point sets of size n with labels {1,…,n} if its straight-line drawing on each of these point sets is crossing-free. We study the maximum number of edges in a matching compatible to two or more labeled point sets in general position in the plane. We show that for any two labeled convex sets of n points there exists a compatible matching with ⌊2n−−√⌋ edges. More generally, for any ℓ labeled point sets we construct compatible matchings of size Ω(n1/ℓ) . As a corresponding upper bound, we use probabilistic arguments to show that for any ℓ given sets of n points there exists a labeling of each set such that the largest compatible matching has O(n2/(ℓ+1)) edges. Finally, we show that Θ(logn) copies of any set of n points are necessary and sufficient for the existence of a labeling such that any compatible matching consists only of a single edge.}, author = {Aichholzer, Oswin and Arroyo Guevara, Alan M and Masárová, Zuzana and Parada, Irene and Perz, Daniel and Pilz, Alexander and Tkadlec, Josef and Vogtenhuber, Birgit}, booktitle = {15th International Conference on Algorithms and Computation}, isbn = {9783030682101}, issn = {16113349}, location = {Yangon, Myanmar}, pages = {221--233}, publisher = {Springer Nature}, title = {{On compatible matchings}}, doi = {10.1007/978-3-030-68211-8_18}, volume = {12635}, year = {2021}, } @inbook{9403, abstract = {Optimal decision making requires individuals to know their available options and to anticipate correctly what consequences these options have. In many social interactions, however, we refrain from gathering all relevant information, even if this information would help us make better decisions and is costless to obtain. This chapter examines several examples of “deliberate ignorance.” Two simple models are proposed to illustrate how ignorance can evolve among self-interested and payoff - maximizing individuals, and open problems are highlighted that lie ahead for future research to explore.}, author = {Schmid, Laura and Hilbe, Christian}, booktitle = {Deliberate Ignorance: Choosing Not To Know}, editor = {Hertwig, Ralph and Engel, Christoph}, isbn = {978-0-262-04559-9}, pages = {139--152}, publisher = {MIT Press}, title = {{The evolution of strategic ignorance in strategic interaction}}, volume = {29}, year = {2021}, } @inproceedings{9466, abstract = {In this work, we apply the dynamical systems analysis of Hanrot et al. (CRYPTO’11) to a class of lattice block reduction algorithms that includes (natural variants of) slide reduction and block-Rankin reduction. This implies sharper bounds on the polynomial running times (in the query model) for these algorithms and opens the door to faster practical variants of slide reduction. We give heuristic arguments showing that such variants can indeed speed up slide reduction significantly in practice. This is confirmed by experimental evidence, which also shows that our variants are competitive with state-of-the-art reduction algorithms.}, author = {Walter, Michael}, booktitle = {Public-Key Cryptography – PKC 2021}, isbn = {9783030752446}, issn = {16113349}, location = {Virtual}, pages = {45--67}, publisher = {Springer Nature}, title = {{The convergence of slide-type reductions}}, doi = {10.1007/978-3-030-75245-3_3}, volume = {12710}, year = {2021}, } @article{9465, abstract = {Given a locally finite set 𝑋⊆ℝ𝑑 and an integer 𝑘≥0, we consider the function 𝐰𝑘:Del𝑘(𝑋)→ℝ on the dual of the order-k Voronoi tessellation, whose sublevel sets generalize the notion of alpha shapes from order-1 to order-k (Edelsbrunner et al. in IEEE Trans Inf Theory IT-29:551–559, 1983; Krasnoshchekov and Polishchuk in Inf Process Lett 114:76–83, 2014). While this function is not necessarily generalized discrete Morse, in the sense of Forman (Adv Math 134:90–145, 1998) and Freij (Discrete Math 309:3821–3829, 2009), we prove that it satisfies similar properties so that its increments can be meaningfully classified into critical and non-critical steps. This result extends to the case of weighted points and sheds light on k-fold covers with balls in Euclidean space.}, author = {Edelsbrunner, Herbert and Nikitenko, Anton and Osang, Georg F}, issn = {14208997}, journal = {Journal of Geometry}, number = {1}, publisher = {Springer Nature}, title = {{A step in the Delaunay mosaic of order k}}, doi = {10.1007/s00022-021-00577-4}, volume = {112}, year = {2021}, } @inproceedings{9543, abstract = {We consider the problem ofdistributed mean estimation (DME), in which n machines are each given a local d-dimensional vector xv∈Rd, and must cooperate to estimate the mean of their inputs μ=1n∑nv=1xv, while minimizing total communication cost. DME is a fundamental construct in distributed machine learning, and there has been considerable work on variants of this problem, especially in the context of distributed variance reduction for stochastic gradients in parallel SGD. Previous work typically assumes an upper bound on the norm of the input vectors, and achieves an error bound in terms of this norm. However, in many real applications, the input vectors are concentrated around the correct output μ, but μ itself has large norm. In such cases, previous output error bounds perform poorly. In this paper, we show that output error bounds need not depend on input norm. We provide a method of quantization which allows distributed mean estimation to be performed with solution quality dependent only on the distance between inputs, not on input norm, and show an analogous result for distributed variance reduction. The technique is based on a new connection with lattice theory. We also provide lower bounds showing that the communication to error trade-off of our algorithms is asymptotically optimal. As the lattices achieving optimal bounds under l2-norm can be computationally impractical, we also present an extension which leverages easy-to-use cubic lattices, and is loose only up to a logarithmic factor ind. We show experimentally that our method yields practical improvements for common applications, relative to prior approaches.}, author = {Davies, Peter and Gurunanthan, Vijaykrishna and Moshrefi, Niusha and Ashkboos, Saleh and Alistarh, Dan-Adrian}, booktitle = {9th International Conference on Learning Representations}, location = {Virtual}, title = {{New bounds for distributed mean estimation and variance reduction}}, year = {2021}, } @inproceedings{9592, abstract = {The convex grabbing game is a game where two players, Alice and Bob, alternate taking extremal points from the convex hull of a point set on the plane. Rational weights are given to the points. The goal of each player is to maximize the total weight over all points that they obtain. We restrict the setting to the case of binary weights. We show a construction of an arbitrarily large odd-sized point set that allows Bob to obtain almost 3/4 of the total weight. This construction answers a question asked by Matsumoto, Nakamigawa, and Sakuma in [Graphs and Combinatorics, 36/1 (2020)]. We also present an arbitrarily large even-sized point set where Bob can obtain the entirety of the total weight. Finally, we discuss conjectures about optimum moves in the convex grabbing game for both players in general.}, author = {Dvorak, Martin and Nicholson, Sara}, booktitle = {Proceedings of the 33rd Canadian Conference on Computational Geometry}, keywords = {convex grabbing game, graph grabbing game, combinatorial game, convex geometry}, location = {Halifax, NS, Canada}, title = {{Massively winning configurations in the convex grabbing game on the plane}}, year = {2021}, } @unpublished{9082, abstract = {Acquired mutations are sufficiently frequent such that the genome of a single cell offers a record of its history of cell divisions. Among more common somatic genomic alterations are loss of heterozygosity (LOH). Large LOH events are potentially detectable in single cell RNA sequencing (scRNA-seq) datasets as tracts of monoallelic expression for constitutionally heterozygous single nucleotide variants (SNVs) located among contiguous genes. We identified runs of monoallelic expression, consistent with LOH, uniquely distributed throughout the genome in single cell brain cortex transcriptomes of F1 hybrids involving different inbred mouse strains. We then phylogenetically reconstructed single cell lineages and simultaneously identified cell types by corresponding gene expression patterns. Our results are consistent with progenitor cells giving rise to multiple cortical cell types through stereotyped expansion and distinct waves of neurogenesis. Compared to engineered recording systems, LOH events accumulate throughout the genome and across the lifetime of an organism, affording tremendous capacity for encoding lineage information and increasing resolution for later cell divisions. This approach can conceivably be computationally incorporated into scRNA-seq analysis and may be useful for organisms where genetic engineering is prohibitive, such as humans.}, author = {Anderson, Donovan J. and Pauler, Florian and McKenna, Aaron and Shendure, Jay and Hippenmeyer, Simon and Horwitz, Marshall S.}, booktitle = {bioRxiv}, publisher = {Cold Spring Harbor Laboratory}, title = {{Simultaneous identification of brain cell type and lineage via single cell RNA sequencing}}, doi = {10.1101/2020.12.31.425016}, year = {2021}, } @inproceedings{9210, abstract = {Modern neural networks can easily fit their training set perfectly. Surprisingly, despite being “overfit” in this way, they tend to generalize well to future data, thereby defying the classic bias–variance trade-off of machine learning theory. Of the many possible explanations, a prevalent one is that training by stochastic gradient descent (SGD) imposes an implicit bias that leads it to learn simple functions, and these simple functions generalize well. However, the specifics of this implicit bias are not well understood. In this work, we explore the smoothness conjecture which states that SGD is implicitly biased towards learning functions that are smooth. We propose several measures to formalize the intuitive notion of smoothness, and we conduct experiments to determine whether SGD indeed implicitly optimizes for these measures. Our findings rule out the possibility that smoothness measures based on first-order derivatives are being implicitly enforced. They are supportive, though, of the smoothness conjecture for measures based on second-order derivatives.}, author = {Volhejn, Vaclav and Lampert, Christoph}, booktitle = {42nd German Conference on Pattern Recognition}, isbn = {9783030712778}, issn = {1611-3349}, location = {Tübingen, Germany}, pages = {246--259}, publisher = {Springer}, title = {{Does SGD implicitly optimize for smoothness?}}, doi = {10.1007/978-3-030-71278-5_18}, volume = {12544}, year = {2021}, } @inproceedings{9345, abstract = {Modeling a crystal as a periodic point set, we present a fingerprint consisting of density functionsthat facilitates the efficient search for new materials and material properties. We prove invarianceunder isometries, continuity, and completeness in the generic case, which are necessary featuresfor the reliable comparison of crystals. The proof of continuity integrates methods from discretegeometry and lattice theory, while the proof of generic completeness combines techniques fromgeometry with analysis. The fingerprint has a fast algorithm based on Brillouin zones and relatedinclusion-exclusion formulae. We have implemented the algorithm and describe its application tocrystal structure prediction.}, author = {Edelsbrunner, Herbert and Heiss, Teresa and Kurlin , Vitaliy and Smith, Philip and Wintraecken, Mathijs}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, issn = {1868-8969}, location = {Virtual}, pages = {32:1--32:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{The density fingerprint of a periodic point set}}, doi = {10.4230/LIPIcs.SoCG.2021.32}, volume = {189}, year = {2021}, } @unpublished{9435, abstract = {For any given positive integer l, we prove that every plane deformation of a circlewhich preserves the 1/2and 1/ (2l + 1) -rational caustics is trivial i.e. the deformationconsists only of similarities (rescalings and isometries).}, author = {Kaloshin, Vadim and Koudjinan, Edmond}, title = {{Non co-preservation of the 1/2 and 1/(2l+1)-rational caustics along deformations of circles}}, year = {2021}, } @inproceedings{9604, abstract = {Generalizing Lee’s inductive argument for counting the cells of higher order Voronoi tessellations in ℝ² to ℝ³, we get precise relations in terms of Morse theoretic quantities for piecewise constant functions on planar arrangements. Specifically, we prove that for a generic set of n ≥ 5 points in ℝ³, the number of regions in the order-k Voronoi tessellation is N_{k-1} - binom(k,2)n + n, for 1 ≤ k ≤ n-1, in which N_{k-1} is the sum of Euler characteristics of these function’s first k-1 sublevel sets. We get similar expressions for the vertices, edges, and polygons of the order-k Voronoi tessellation.}, author = {Biswas, Ranita and Cultrera di Montesano, Sebastiano and Edelsbrunner, Herbert and Saghafian, Morteza}, booktitle = {Leibniz International Proceedings in Informatics}, isbn = {9783959771849}, issn = {18688969}, location = {Online}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Counting cells of order-k voronoi tessellations in ℝ3 with morse theory}}, doi = {10.4230/LIPIcs.SoCG.2021.16}, volume = {189}, year = {2021}, } @inproceedings{9620, abstract = {In this note, we introduce a distributed twist on the classic coupon collector problem: a set of m collectors wish to each obtain a set of n coupons; for this, they can each sample coupons uniformly at random, but can also meet in pairwise interactions, during which they can exchange coupons. By doing so, they hope to reduce the number of coupons that must be sampled by each collector in order to obtain a full set. This extension is natural when considering real-world manifestations of the coupon collector phenomenon, and has been remarked upon and studied empirically (Hayes and Hannigan 2006, Ahmad et al. 2014, Delmarcelle 2019). We provide the first theoretical analysis for such a scenario. We find that “coupon collecting with friends” can indeed significantly reduce the number of coupons each collector must sample, and raises interesting connections to the more traditional variants of the problem. While our analysis is in most cases asymptotically tight, there are several open questions raised, regarding finer-grained analysis of both “coupon collecting with friends,” and of a long-studied variant of the original problem in which a collector requires multiple full sets of coupons.}, author = {Alistarh, Dan-Adrian and Davies, Peter}, booktitle = {Structural Information and Communication Complexity}, isbn = {9783030795269}, issn = {1611-3349}, location = {Wrocław, Poland}, pages = {3--12}, publisher = {Springer Nature}, title = {{Collecting coupons is faster with friends}}, doi = {10.1007/978-3-030-79527-6_1}, volume = {12810}, year = {2021}, } @inproceedings{9826, abstract = {Automated contract tracing aims at supporting manual contact tracing during pandemics by alerting users of encounters with infected people. There are currently many proposals for protocols (like the “decentralized” DP-3T and PACT or the “centralized” ROBERT and DESIRE) to be run on mobile phones, where the basic idea is to regularly broadcast (using low energy Bluetooth) some values, and at the same time store (a function of) incoming messages broadcasted by users in their proximity. In the existing proposals one can trigger false positives on a massive scale by an “inverse-Sybil” attack, where a large number of devices (malicious users or hacked phones) pretend to be the same user, such that later, just a single person needs to be diagnosed (and allowed to upload) to trigger an alert for all users who were in proximity to any of this large group of devices. We propose the first protocols that do not succumb to such attacks assuming the devices involved in the attack do not constantly communicate, which we observe is a necessary assumption. The high level idea of the protocols is to derive the values to be broadcasted by a hash chain, so that two (or more) devices who want to launch an inverse-Sybil attack will not be able to connect their respective chains and thus only one of them will be able to upload. Our protocols also achieve security against replay, belated replay, and one of them even against relay attacks.}, author = {Auerbach, Benedikt and Chakraborty, Suvradip and Klein, Karen and Pascual Perez, Guillermo and Pietrzak, Krzysztof Z and Walter, Michael and Yeo, Michelle X}, booktitle = {Topics in Cryptology – CT-RSA 2021}, isbn = {9783030755386}, issn = {16113349}, location = {Virtual Event}, pages = {399--421}, publisher = {Springer Nature}, title = {{Inverse-Sybil attacks in automated contact tracing}}, doi = {10.1007/978-3-030-75539-3_17}, volume = {12704}, year = {2021}, } @inproceedings{9825, abstract = {The dual attack has long been considered a relevant attack on lattice-based cryptographic schemes relying on the hardness of learning with errors (LWE) and its structured variants. As solving LWE corresponds to finding a nearest point on a lattice, one may naturally wonder how efficient this dual approach is for solving more general closest vector problems, such as the classical closest vector problem (CVP), the variants bounded distance decoding (BDD) and approximate CVP, and preprocessing versions of these problems. While primal, sieving-based solutions to these problems (with preprocessing) were recently studied in a series of works on approximate Voronoi cells [Laa16b, DLdW19, Laa20, DLvW20], for the dual attack no such overview exists, especially for problems with preprocessing. With one of the take-away messages of the approximate Voronoi cell line of work being that primal attacks work well for approximate CVP(P) but scale poorly for BDD(P), one may further wonder if the dual attack suffers the same drawbacks, or if it is perhaps a better solution when trying to solve BDD(P). In this work we provide an overview of cost estimates for dual algorithms for solving these “classical” closest lattice vector problems. Heuristically we expect to solve the search version of average-case CVPP in time and space 20.293𝑑+𝑜(𝑑) in the single-target model. The distinguishing version of average-case CVPP, where we wish to distinguish between random targets and targets planted at distance (say) 0.99⋅𝑔𝑑 from the lattice, has the same complexity in the single-target model, but can be solved in time and space 20.195𝑑+𝑜(𝑑) in the multi-target setting, when given a large number of targets from either target distribution. This suggests an inequivalence between distinguishing and searching, as we do not expect a similar improvement in the multi-target setting to hold for search-CVPP. We analyze three slightly different decoders, both for distinguishing and searching, and experimentally obtain concrete cost estimates for the dual attack in dimensions 50 to 80, which confirm our heuristic assumptions, and show that the hidden order terms in the asymptotic estimates are quite small. Our main take-away message is that the dual attack appears to mirror the approximate Voronoi cell line of work – whereas using approximate Voronoi cells works well for approximate CVP(P) but scales poorly for BDD(P), the dual approach scales well for BDD(P) instances but performs poorly on approximate CVP(P).}, author = {Laarhoven, Thijs and Walter, Michael}, booktitle = {Topics in Cryptology – CT-RSA 2021}, isbn = {9783030755386}, issn = {16113349}, location = {Virtual Event}, pages = {478--502}, publisher = {Springer Nature}, title = {{Dual lattice attacks for closest vector problems (with preprocessing)}}, doi = {10.1007/978-3-030-75539-3_20}, volume = {12704}, year = {2021}, } @inproceedings{9823, abstract = {Approximate agreement is one of the few variants of consensus that can be solved in a wait-free manner in asynchronous systems where processes communicate by reading and writing to shared memory. In this work, we consider a natural generalisation of approximate agreement on arbitrary undirected connected graphs. Each process is given a vertex of the graph as input and, if non-faulty, must output a vertex such that all the outputs are within distance 1 of one another, and each output value lies on a shortest path between two input values. From prior work, it is known that there is no wait-free algorithm among 𝑛≥3 processes for this problem on any cycle of length 𝑐≥4 , by reduction from 2-set agreement (Castañeda et al. 2018). In this work, we investigate the solvability and complexity of this task on general graphs. We give a new, direct proof of the impossibility of approximate agreement on cycles of length 𝑐≥4 , via a generalisation of Sperner’s Lemma to convex polygons. We also extend the reduction from 2-set agreement to a larger class of graphs, showing that approximate agreement on these graphs is unsolvable. On the positive side, we present a wait-free algorithm for a class of graphs that properly contains the class of chordal graphs.}, author = {Alistarh, Dan-Adrian and Ellen, Faith and Rybicki, Joel}, booktitle = {Structural Information and Communication Complexity}, isbn = {9783030795269}, issn = {16113349}, location = {Wrocław, Poland}, pages = {87--105}, publisher = {Springer Nature}, title = {{Wait-free approximate agreement on graphs}}, doi = {10.1007/978-3-030-79527-6_6}, volume = {12810}, year = {2021}, } @inproceedings{9824, abstract = {We define a new compact coordinate system in which each integer triplet addresses a voxel in the BCC grid, and we investigate some of its properties. We propose a characterization of 3D discrete analytical planes with their topological features (in the Cartesian and in the new coordinate system) such as the interrelation between the thickness of the plane and the separability constraint we aim to obtain.}, author = {Čomić, Lidija and Zrour, Rita and Largeteau-Skapin, Gaëlle and Biswas, Ranita and Andres, Eric}, booktitle = {Discrete Geometry and Mathematical Morphology}, isbn = {9783030766566}, issn = {16113349}, location = {Uppsala, Sweden}, pages = {152--163}, publisher = {Springer Nature}, title = {{Body centered cubic grid - coordinate system and discrete analytical plane definition}}, doi = {10.1007/978-3-030-76657-3_10}, volume = {12708}, year = {2021}, } @unpublished{9980, abstract = {Insufficient understanding of the mechanism that reversibly converts sulphur into lithium sulphide (Li2S) via soluble polysulphides (PS) hampers the realization of high performance lithium-sulphur cells. Typically Li2S formation is explained by direct electroreduction of a PS to Li2S; however, this is not consistent with the size of the insulating Li2S deposits. Here, we use in situ small and wide angle X-ray scattering (SAXS/WAXS) to track the growth and dissolution of crystalline and amorphous deposits from atomic to sub-micron scales during charge and discharge. Stochastic modelling based on the SAXS data allows quantification of the chemical phase evolution during discharge and charge. We show that Li2S deposits predominantly via disproportionation of transient, solid Li2S2 to form primary Li2S crystallites and solid Li2S4 particles. We further demonstrate that this process happens in reverse during charge. These findings show that the discharge capacity and rate capability in Li-S battery cathodes are therefore limited by mass transport through the increasingly tortuous network of Li2S / Li2S4 / carbon pores rather than electron transport through a passivating surface film.}, author = {Prehal, Christian and Talian, Sara Drvarič and Vizintin, Alen and Amenitsch, Heinz and Dominko, Robert and Freunberger, Stefan Alexander and Wood, Vanessa}, booktitle = {Research Square}, keywords = {Li2S, Lithium Sulphur Batteries, SAXS, WAXS}, pages = {21}, title = {{Mechanism of Li2S formation and dissolution in Lithium-Sulphur batteries}}, doi = {10.21203/rs.3.rs-818607/v1}, year = {2021}, } @inproceedings{12767, abstract = {Several problems in planning and reactive synthesis can be reduced to the analysis of two-player quantitative graph games. Optimization is one form of analysis. We argue that in many cases it may be better to replace the optimization problem with the satisficing problem, where instead of searching for optimal solutions, the goal is to search for solutions that adhere to a given threshold bound. This work defines and investigates the satisficing problem on a two-player graph game with the discounted-sum cost model. We show that while the satisficing problem can be solved using numerical methods just like the optimization problem, this approach does not render compelling benefits over optimization. When the discount factor is, however, an integer, we present another approach to satisficing, which is purely based on automata methods. We show that this approach is algorithmically more performant – both theoretically and empirically – and demonstrates the broader applicability of satisficing over optimization.}, author = {Bansal, Suguman and Chatterjee, Krishnendu and Vardi, Moshe Y.}, booktitle = {27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems}, isbn = {9783030720155}, issn = {1611-3349}, location = {Luxembourg City, Luxembourg}, pages = {20--37}, publisher = {Springer Nature}, title = {{On satisficing in quantitative games}}, doi = {10.1007/978-3-030-72016-2}, volume = {12651}, year = {2021}, } @unpublished{10011, abstract = {We propose a new weak solution concept for (two-phase) mean curvature flow which enjoys both (unconditional) existence and (weak-strong) uniqueness properties. These solutions are evolving varifolds, just as in Brakke's formulation, but are coupled to the phase volumes by a simple transport equation. First, we show that, in the exact same setup as in Ilmanen's proof [J. Differential Geom. 38, 417-461, (1993)], any limit point of solutions to the Allen-Cahn equation is a varifold solution in our sense. Second, we prove that any calibrated flow in the sense of Fischer et al. [arXiv:2003.05478] - and hence any classical solution to mean curvature flow - is unique in the class of our new varifold solutions. This is in sharp contrast to the case of Brakke flows, which a priori may disappear at any given time and are therefore fatally non-unique. Finally, we propose an extension of the solution concept to the multi-phase case which is at least guaranteed to satisfy a weak-strong uniqueness principle.}, author = {Hensel, Sebastian and Laux, Tim}, booktitle = {arXiv}, keywords = {Mean curvature flow, gradient flows, varifolds, weak solutions, weak-strong uniqueness, calibrated geometry, gradient-flow calibrations}, title = {{A new varifold solution concept for mean curvature flow: Convergence of the Allen-Cahn equation and weak-strong uniqueness}}, doi = {10.48550/arXiv.2109.04233}, year = {2021}, } @unpublished{9230, abstract = {We consider a model of the Riemann zeta function on the critical axis and study its maximum over intervals of length (log T)θ, where θ is either fixed or tends to zero at a suitable rate. It is shown that the deterministic level of the maximum interpolates smoothly between the ones of log-correlated variables and of i.i.d. random variables, exhibiting a smooth transition ‘from 3/4 to 1/4’ in the second order. This provides a natural context where extreme value statistics of log-correlated variables with time-dependent variance and rate occur. A key ingredient of the proof is a precise upper tail tightness estimate for the maximum of the model on intervals of size one, that includes a Gaussian correction. This correction is expected to be present for the Riemann zeta function and pertains to the question of the correct order of the maximum of the zeta function in large intervals.}, author = {Arguin, Louis-Pierre and Dubach, Guillaume and Hartung, Lisa}, booktitle = {arXiv}, title = {{Maxima of a random model of the Riemann zeta function over intervals of varying length}}, doi = {10.48550/arXiv.2103.04817}, year = {2021}, } @unpublished{9281, abstract = {We comment on two formal proofs of Fermat's sum of two squares theorem, written using the Mathematical Components libraries of the Coq proof assistant. The first one follows Zagier's celebrated one-sentence proof; the second follows David Christopher's recent new proof relying on partition-theoretic arguments. Both formal proofs rely on a general property of involutions of finite sets, of independent interest. The proof technique consists for the most part of automating recurrent tasks (such as case distinctions and computations on natural numbers) via ad hoc tactics.}, author = {Dubach, Guillaume and Mühlböck, Fabian}, booktitle = {arXiv}, title = {{Formal verification of Zagier's one-sentence proof}}, doi = {10.48550/arXiv.2103.11389}, year = {2021}, } @unpublished{10579, abstract = {We consider a totally asymmetric simple exclusion process (TASEP) consisting of particles on a lattice that require binding by a "token" to move. Using a combination of theory and simulations, we address the following questions: (i) How token binding kinetics affects the current-density relation; (ii) How the current-density relation depends on the scarcity of tokens; (iii) How tokens propagate the effects of the locally-imposed disorder (such a slow site) over the entire lattice; (iv) How a shared pool of tokens couples concurrent TASEPs running on multiple lattices; (v) How our results translate to TASEPs with open boundaries that exchange particles with the reservoir. Since real particle motion (including in systems that inspired the standard TASEP model, e.g., protein synthesis or movement of molecular motors) is often catalyzed, regulated, actuated, or otherwise mediated, the token-driven TASEP dynamics analyzed in this paper should allow for a better understanding of real systems and enable a closer match between TASEP theory and experimental observations.}, author = {Kavcic, Bor and Tkačik, Gašper}, booktitle = {arXiv}, title = {{Token-driven totally asymmetric simple exclusion process}}, doi = {10.48550/arXiv.2112.13558}, year = {2021}, } @article{10806, abstract = {Ligands are a fundamental part of nanocrystals. They control and direct nanocrystal syntheses and provide colloidal stability. Bound ligands also affect the nanocrystals’ chemical reactivity and electronic structure. Surface chemistry is thus crucial to understand nanocrystal properties and functionality. Here, we investigate the synthesis of metal oxide nanocrystals (CeO2-x, ZnO, and NiO) from metal nitrate precursors, in the presence of oleylamine ligands. Surprisingly, the nanocrystals are capped exclusively with a fatty acid instead of oleylamine. Analysis of the reaction mixtures with nuclear magnetic resonance spectroscopy revealed several reaction byproducts and intermediates that are common to the decomposition of Ce, Zn, Ni, and Zr nitrate precursors. Our evidence supports the oxidation of alkylamine and formation of a carboxylic acid, thus unraveling this counterintuitive surface chemistry.}, author = {Calcabrini, Mariano and Van den Eynden, Dietger and Sanchez Ribot, Sergi and Pokratath, Rohan and Llorca, Jordi and De Roo, Jonathan and Ibáñez, Maria}, issn = {2691-3704}, journal = {JACS Au}, keywords = {general medicine}, number = {11}, pages = {1898--1903}, publisher = {American Chemical Society}, title = {{Ligand conversion in nanocrystal synthesis: The oxidation of alkylamines to fatty acids by nitrate}}, doi = {10.1021/jacsau.1c00349}, volume = {1}, year = {2021}, } @inproceedings{12909, author = {Schlögl, Alois and Elefante, Stefano and Hornoiu, Andrei and Stadlbauer, Stephan}, booktitle = {ASHPC21 – Austrian-Slovenian HPC Meeting 2021}, isbn = {978-961-6980-77-7}, location = {Virtual}, pages = {5}, publisher = {University of Ljubljana}, title = {{Managing software on a heterogenous HPC cluster}}, doi = {10.3359/2021hpc}, year = {2021}, } @inproceedings{11458, abstract = {The increasing computational requirements of deep neural networks (DNNs) have led to significant interest in obtaining DNN models that are sparse, yet accurate. Recent work has investigated the even harder case of sparse training, where the DNN weights are, for as much as possible, already sparse to reduce computational costs during training. Existing sparse training methods are often empirical and can have lower accuracy relative to the dense baseline. In this paper, we present a general approach called Alternating Compressed/DeCompressed (AC/DC) training of DNNs, demonstrate convergence for a variant of the algorithm, and show that AC/DC outperforms existing sparse training methods in accuracy at similar computational budgets; at high sparsity levels, AC/DC even outperforms existing methods that rely on accurate pre-trained dense models. An important property of AC/DC is that it allows co-training of dense and sparse models, yielding accurate sparse–dense model pairs at the end of the training process. This is useful in practice, where compressed variants may be desirable for deployment in resource-constrained settings without re-doing the entire training flow, and also provides us with insights into the accuracy gap between dense and compressed models. The code is available at: https://github.com/IST-DASLab/ACDC.}, author = {Peste, Elena-Alexandra and Iofinova, Eugenia B and Vladu, Adrian and Alistarh, Dan-Adrian}, booktitle = {35th Conference on Neural Information Processing Systems}, isbn = {9781713845393}, issn = {1049-5258}, location = {Virtual, Online}, pages = {8557--8570}, publisher = {Curran Associates}, title = {{AC/DC: Alternating Compressed/DeCompressed training of deep neural networks}}, volume = {34}, year = {2021}, } @article{10585, abstract = {Recently it was shown that anyons on the two-sphere naturally arise from a system of molecular impurities exchanging angular momentum with a many-particle bath (Phys. Rev. Lett. 126, 015301 (2021)). Here we further advance this approach and rigorously demonstrate that in the experimentally realized regime the lowest spectrum of two linear molecules immersed in superfluid helium corresponds to the spectrum of two anyons on the sphere. We develop the formalism within the framework of the recently experimentally observed angulon quasiparticle}, author = {Brooks, Morris and Lemeshko, Mikhail and Lundholm, Douglas and Yakaboylu, Enderalp}, issn = {2218-2004}, journal = {Atoms}, keywords = {anyons, quasiparticles, Quantum Hall Effect, topological states of matter}, number = {4}, publisher = {MDPI}, title = {{Emergence of anyons on the two-sphere in molecular impurities}}, doi = {10.3390/atoms9040106}, volume = {9}, year = {2021}, } @inproceedings{13147, abstract = {We investigate fast and communication-efficient algorithms for the classic problem of minimizing a sum of strongly convex and smooth functions that are distributed among n different nodes, which can communicate using a limited number of bits. Most previous communication-efficient approaches for this problem are limited to first-order optimization, and therefore have \emph{linear} dependence on the condition number in their communication complexity. We show that this dependence is not inherent: communication-efficient methods can in fact have sublinear dependence on the condition number. For this, we design and analyze the first communication-efficient distributed variants of preconditioned gradient descent for Generalized Linear Models, and for Newton’s method. Our results rely on a new technique for quantizing both the preconditioner and the descent direction at each step of the algorithms, while controlling their convergence rate. We also validate our findings experimentally, showing faster convergence and reduced communication relative to previous methods.}, author = {Alimisis, Foivos and Davies, Peter and Alistarh, Dan-Adrian}, booktitle = {Proceedings of the 38th International Conference on Machine Learning}, isbn = {9781713845065}, issn = {2640-3498}, location = {Virtual}, pages = {196--206}, publisher = {ML Research Press}, title = {{Communication-efficient distributed optimization with quantized preconditioners}}, volume = {139}, year = {2021}, } @inproceedings{13146, abstract = {A recent line of work has analyzed the theoretical properties of deep neural networks via the Neural Tangent Kernel (NTK). In particular, the smallest eigenvalue of the NTK has been related to the memorization capacity, the global convergence of gradient descent algorithms and the generalization of deep nets. However, existing results either provide bounds in the two-layer setting or assume that the spectrum of the NTK matrices is bounded away from 0 for multi-layer networks. In this paper, we provide tight bounds on the smallest eigenvalue of NTK matrices for deep ReLU nets, both in the limiting case of infinite widths and for finite widths. In the finite-width setting, the network architectures we consider are fairly general: we require the existence of a wide layer with roughly order of N neurons, N being the number of data samples; and the scaling of the remaining layer widths is arbitrary (up to logarithmic factors). To obtain our results, we analyze various quantities of independent interest: we give lower bounds on the smallest singular value of hidden feature matrices, and upper bounds on the Lipschitz constant of input-output feature maps.}, author = {Nguyen, Quynh and Mondelli, Marco and Montufar, Guido}, booktitle = {Proceedings of the 38th International Conference on Machine Learning}, isbn = {9781713845065}, issn = {2640-3498}, location = {Virtual}, pages = {8119--8129}, publisher = {ML Research Press}, title = {{Tight bounds on the smallest Eigenvalue of the neural tangent kernel for deep ReLU networks}}, volume = {139}, year = {2021}, } @inproceedings{10665, abstract = {Formal verification of neural networks is an active topic of research, and recent advances have significantly increased the size of the networks that verification tools can handle. However, most methods are designed for verification of an idealized model of the actual network which works over real arithmetic and ignores rounding imprecisions. This idealization is in stark contrast to network quantization, which is a technique that trades numerical precision for computational efficiency and is, therefore, often applied in practice. Neglecting rounding errors of such low-bit quantized neural networks has been shown to lead to wrong conclusions about the network’s correctness. Thus, the desired approach for verifying quantized neural networks would be one that takes these rounding errors into account. In this paper, we show that verifying the bitexact implementation of quantized neural networks with bitvector specifications is PSPACE-hard, even though verifying idealized real-valued networks and satisfiability of bit-vector specifications alone are each in NP. Furthermore, we explore several practical heuristics toward closing the complexity gap between idealized and bit-exact verification. In particular, we propose three techniques for making SMT-based verification of quantized neural networks more scalable. Our experiments demonstrate that our proposed methods allow a speedup of up to three orders of magnitude over existing approaches.}, author = {Henzinger, Thomas A and Lechner, Mathias and Zikelic, Dorde}, booktitle = {Proceedings of the AAAI Conference on Artificial Intelligence}, isbn = {978-1-57735-866-4}, issn = {2374-3468}, location = {Virtual}, number = {5A}, pages = {3787--3795}, publisher = {AAAI Press}, title = {{Scalable verification of quantized neural networks}}, volume = {35}, year = {2021}, } @inproceedings{10667, abstract = {Bayesian neural networks (BNNs) place distributions over the weights of a neural network to model uncertainty in the data and the network's prediction. We consider the problem of verifying safety when running a Bayesian neural network policy in a feedback loop with infinite time horizon systems. Compared to the existing sampling-based approaches, which are inapplicable to the infinite time horizon setting, we train a separate deterministic neural network that serves as an infinite time horizon safety certificate. In particular, we show that the certificate network guarantees the safety of the system over a subset of the BNN weight posterior's support. Our method first computes a safe weight set and then alters the BNN's weight posterior to reject samples outside this set. Moreover, we show how to extend our approach to a safe-exploration reinforcement learning setting, in order to avoid unsafe trajectories during the training of the policy. We evaluate our approach on a series of reinforcement learning benchmarks, including non-Lyapunovian safety specifications.}, author = {Lechner, Mathias and Žikelić, Ðorđe and Chatterjee, Krishnendu and Henzinger, Thomas A}, booktitle = {35th Conference on Neural Information Processing Systems}, location = {Virtual}, title = {{Infinite time horizon safety of Bayesian neural networks}}, doi = {10.48550/arXiv.2111.03165}, year = {2021}, } @misc{13072, abstract = {CpGs and corresponding mean weights for DNAm-based prediction of cognitive abilities (6 traits)}, author = {McCartney, Daniel L and Hillary, Robert F and Conole, Eleanor LS and Trejo Banos, Daniel and Gadd, Danni A and Walker, Rosie M and Nangle, Cliff and Flaig, Robin and Campbell, Archie and Murray, Alison D and Munoz Maniega, Susana and del C Valdes-Hernandez, Maria and Harris, Mathew A and Bastin, Mark E and Wardlaw, Joanna M and Harris, Sarah E and Porteous, David J and Tucker-Drob, Elliot M and McIntosh, Andrew M and Evans, Kathryn L and Deary, Ian J and Cox, Simon R and Robinson, Matthew Richard and Marioni, Riccardo E}, publisher = {Zenodo}, title = {{Blood-based epigenome-wide analyses of cognitive abilities}}, doi = {10.5281/ZENODO.5794028}, year = {2021}, } @misc{13068, abstract = {Source data and source code for the graphs in "Spatiotemporal dynamics of self-organized branching pancreatic cancer-derived organoids".}, author = {Randriamanantsoa, Samuel and Papargyriou, Aristeidis and Maurer, Carlo and Peschke, Katja and Schuster, Maximilian and Zecchin, Giulia and Steiger, Katja and Öllinger, Rupert and Saur, Dieter and Scheel, Christina and Rad, Roland and Hannezo, Edouard B and Reichert, Maximilian and Bausch, Andreas R.}, publisher = {Zenodo}, title = {{Spatiotemporal dynamics of self-organized branching in pancreas-derived organoids}}, doi = {10.5281/ZENODO.5148117}, year = {2021}, } @article{7551, abstract = {Novelty facilitates formation of memories. The detection of novelty and storage of contextual memories are both mediated by the hippocampus, yet the mechanisms that link these two functions remain to be defined. Dentate granule cells (GCs) of the dorsal hippocampus fire upon novelty exposure forming engrams of contextual memory. However, their key excitatory inputs from the entorhinal cortex are not responsive to novelty and are insufficient to make dorsal GCs fire reliably. Here we uncover a powerful glutamatergic pathway to dorsal GCs from ventral hippocampal mossy cells (MCs) that relays novelty, and is necessary and sufficient for driving dorsal GCs activation. Furthermore, manipulation of ventral MCs activity bidirectionally regulates novelty-induced contextual memory acquisition. Our results show that ventral MCs activity controls memory formation through an intra-hippocampal interaction mechanism gated by novelty.}, author = {Fredes Tolorza, Felipe A and Silva Sifuentes, Maria A and Koppensteiner, Peter and Kobayashi, Kenta and Jösch, Maximilian A and Shigemoto, Ryuichi}, journal = {Current Biology}, number = {1}, pages = {P25--38.E5}, publisher = {Elsevier}, title = {{Ventro-dorsal hippocampal pathway gates novelty-induced contextual memory formation}}, doi = {10.1016/j.cub.2020.09.074}, volume = {31}, year = {2021}, } @article{7463, abstract = {Resting-state brain activity is characterized by the presence of neuronal avalanches showing absence of characteristic size. Such evidence has been interpreted in the context of criticality and associated with the normal functioning of the brain. A distinctive attribute of systems at criticality is the presence of long-range correlations. Thus, to verify the hypothesis that the brain operates close to a critical point and consequently assess deviations from criticality for diagnostic purposes, it is of primary importance to robustly and reliably characterize correlations in resting-state brain activity. Recent works focused on the analysis of narrow-band electroencephalography (EEG) and magnetoencephalography (MEG) signal amplitude envelope, showing evidence of long-range temporal correlations (LRTC) in neural oscillations. However, brain activity is a broadband phenomenon, and a significant piece of information useful to precisely discriminate between normal (critical) and pathological behavior (non-critical), may be encoded in the broadband spatio-temporal cortical dynamics. Here we propose to characterize the temporal correlations in the broadband brain activity through the lens of neuronal avalanches. To this end, we consider resting-state EEG and long-term MEG recordings, extract the corresponding neuronal avalanche sequences, and study their temporal correlations. We demonstrate that the broadband resting-state brain activity consistently exhibits long-range power-law correlations in both EEG and MEG recordings, with similar values of the scaling exponents. Importantly, although we observe that the avalanche size distribution depends on scale parameters, scaling exponents characterizing long-range correlations are quite robust. In particular, they are independent of the temporal binning (scale of analysis), indicating that our analysis captures intrinsic characteristics of the underlying dynamics. Because neuronal avalanches constitute a fundamental feature of neural systems with universal characteristics, the proposed approach may serve as a general, systems- and experiment-independent procedure to infer the existence of underlying long-range correlations in extended neural systems, and identify pathological behaviors in the complex spatio-temporal interplay of cortical rhythms.}, author = {Lombardi, Fabrizio and Shriki, Oren and Herrmann, Hans J and de Arcangelis, Lucilla}, issn = {1872-8286}, journal = {Neurocomputing}, pages = {657--666}, publisher = {Elsevier}, title = {{Long-range temporal correlations in the broadband resting state activity of the human brain revealed by neuronal avalanches}}, doi = {10.1016/j.neucom.2020.05.126}, volume = {461}, year = {2021}, } @misc{6995, abstract = {Human brain organoids represent a powerful tool for the study of human neurological diseases particularly those that impact brain growth and structure. However, many neurological diseases lack obvious anatomical abnormalities, yet significantly impact neural network functions, raising the question of whether organoids possess sufficient neural network architecture and complexity to model these conditions. Here, we explore the network level functions of brain organoids using calcium sensor imaging and extracellular recording approaches that together reveal the existence of complex oscillatory network behaviors reminiscent of intact brain preparations. We further demonstrate strikingly abnormal epileptiform network activity in organoids derived from a Rett Syndrome patient despite only modest anatomical differences from isogenically matched controls, and rescue with an unconventional neuromodulatory drug Pifithrin-α. Together, these findings provide an essential foundation for the utilization of human brain organoids to study intact and disordered human brain network formation and illustrate their utility in therapeutic discovery.}, author = {Samarasinghe, Ranmal A. and Miranda, Osvaldo and Buth, Jessie E. and Mitchell, Simon and Ferando, Isabella and Watanabe, Momoko and Kurdian, Arinnae and Golshani, Peyman and Plath, Kathrin and Lowry, William E. and Parent, Jack M. and Mody, Istvan and Novitch, Bennett G.}, issn = {1546-1726}, pages = {32}, publisher = {Springer Nature}, title = {{Identification of neural oscillations and epileptiform changes in human brain organoids}}, doi = {10.1038/s41593-021-00906-5}, volume = {24}, year = {2021}, } @article{6965, abstract = {The central object of investigation of this paper is the Hirzebruch class, a deformation of the Todd class, given by Hirzebruch (for smooth varieties). The generalization for singular varieties is due to Brasselet–Schürmann–Yokura. Following the work of Weber, we investigate its equivariant version for (possibly singular) toric varieties. The local decomposition of the Hirzebruch class to the fixed points of the torus action and a formula for the local class in terms of the defining fan are recalled. After this review part, we prove the positivity of local Hirzebruch classes for all toric varieties, thus proving false the alleged counterexample given by Weber.}, author = {Rychlewicz, Kamil P}, issn = {1469-2120}, journal = {Bulletin of the London Mathematical Society}, number = {2}, pages = {560--574}, publisher = {Wiley}, title = {{The positivity of local equivariant Hirzebruch class for toric varieties}}, doi = {10.1112/blms.12442}, volume = {53}, year = {2021}, } @article{8253, abstract = {Brains process information in spiking neural networks. Their intricate connections shape the diverse functions these networks perform. In comparison, the functional capabilities of models of spiking networks are still rudimentary. This shortcoming is mainly due to the lack of insight and practical algorithms to construct the necessary connectivity. Any such algorithm typically attempts to build networks by iteratively reducing the error compared to a desired output. But assigning credit to hidden units in multi-layered spiking networks has remained challenging due to the non-differentiable nonlinearity of spikes. To avoid this issue, one can employ surrogate gradients to discover the required connectivity in spiking network models. However, the choice of a surrogate is not unique, raising the question of how its implementation influences the effectiveness of the method. Here, we use numerical simulations to systematically study how essential design parameters of surrogate gradients impact learning performance on a range of classification problems. We show that surrogate gradient learning is robust to different shapes of underlying surrogate derivatives, but the choice of the derivative’s scale can substantially affect learning performance. When we combine surrogate gradients with a suitable activity regularization technique, robust information processing can be achieved in spiking networks even at the sparse activity limit. Our study provides a systematic account of the remarkable robustness of surrogate gradient learning and serves as a practical guide to model functional spiking neural networks.}, author = {Zenke, Friedemann and Vogels, Tim P}, issn = {1530-888X}, journal = {Neural Computation}, number = {4}, pages = {899--925}, publisher = {MIT Press}, title = {{The remarkable robustness of surrogate gradient learning for instilling complex function in spiking neural networks}}, doi = {10.1162/neco_a_01367}, volume = {33}, year = {2021}, } @article{8198, abstract = {We investigate how the critical driving amplitude at the Floquet many-body localized (MBL) to ergodic phase transition differs between smooth and nonsmooth drives. To this end, we numerically study a disordered spin-1/2 chain which is periodically driven by a sine or square-wave drive over a wide range of driving frequencies. In both cases the critical driving amplitude increases monotonically with the frequency, and at large frequencies it is identical for the two drives. However, at low and intermediate frequencies the critical amplitude of the square-wave drive depends strongly on the frequency, while that of the sinusoidal drive is almost constant over a wide frequency range. By analyzing the density of drive-induced resonances we conclude that this difference is due to resonances induced by the higher harmonics which are present (absent) in the Fourier spectrum of the square-wave (sine) drive. Furthermore, we suggest a numerically efficient method for estimating the frequency dependence of the critical driving amplitudes for different drives which is based on calculating the density of drive-induced resonances. We conclude that delocalization occurs once the density of drive-induced resonances reaches a critical value determined only by the static system.}, author = {Diringer, Asaf A. and Gulden, Tobias}, issn = {24699969}, journal = {Physical Review B}, number = {21}, publisher = {American Physical Society}, title = {{Impact of drive harmonics on the stability of Floquet many-body localization}}, doi = {10.1103/PhysRevB.103.214204}, volume = {103}, year = {2021}, } @article{8373, abstract = {It is well known that special Kubo-Ando operator means admit divergence center interpretations, moreover, they are also mean squared error estimators for certain metrics on positive definite operators. In this paper we give a divergence center interpretation for every symmetric Kubo-Ando mean. This characterization of the symmetric means naturally leads to a definition of weighted and multivariate versions of a large class of symmetric Kubo-Ando means. We study elementary properties of these weighted multivariate means, and note in particular that in the special case of the geometric mean we recover the weighted A#H-mean introduced by Kim, Lawson, and Lim.}, author = {Pitrik, József and Virosztek, Daniel}, issn = {0024-3795}, journal = {Linear Algebra and its Applications}, keywords = {Kubo-Ando mean, weighted multivariate mean, barycenter}, pages = {203--217}, publisher = {Elsevier}, title = {{A divergence center interpretation of general symmetric Kubo-Ando means, and related weighted multivariate operator means}}, doi = {10.1016/j.laa.2020.09.007}, volume = {609}, year = {2021}, } @article{8317, abstract = {When can a polyomino piece of paper be folded into a unit cube? Prior work studied tree-like polyominoes, but polyominoes with holes remain an intriguing open problem. We present sufficient conditions for a polyomino with one or several holes to fold into a cube, and conditions under which cube folding is impossible. In particular, we show that all but five special “basic” holes guarantee foldability.}, author = {Aichholzer, Oswin and Akitaya, Hugo A. and Cheung, Kenneth C. and Demaine, Erik D. and Demaine, Martin L. and Fekete, Sándor P. and Kleist, Linda and Kostitsyna, Irina and Löffler, Maarten and Masárová, Zuzana and Mundilova, Klara and Schmidt, Christiane}, issn = {09257721}, journal = {Computational Geometry: Theory and Applications}, publisher = {Elsevier}, title = {{Folding polyominoes with holes into a cube}}, doi = {10.1016/j.comgeo.2020.101700}, volume = {93}, year = {2021}, } @article{7685, abstract = {We consider a gas of interacting bosons trapped in a box of side length one in the Gross–Pitaevskii limit. We review the proof of the validity of Bogoliubov’s prediction for the ground state energy and the low-energy excitation spectrum. This note is based on joint work with C. Brennecke, S. Cenatiempo and B. Schlein.}, author = {Boccato, Chiara}, issn = {0129-055X}, journal = {Reviews in Mathematical Physics}, number = {1}, publisher = {World Scientific}, title = {{The excitation spectrum of the Bose gas in the Gross-Pitaevskii regime}}, doi = {10.1142/S0129055X20600065}, volume = {33}, year = {2021}, } @article{8582, abstract = {Cell and tissue polarization is fundamental for plant growth and morphogenesis. The polar, cellular localization of Arabidopsis PIN‐FORMED (PIN) proteins is crucial for their function in directional auxin transport. The clustering of PIN polar cargoes within the plasma membrane has been proposed to be important for the maintenance of their polar distribution. However, the more detailed features of PIN clusters and the cellular requirements of cargo clustering remain unclear. Here, we characterized PIN clusters in detail by means of multiple advanced microscopy and quantification methods, such as 3D quantitative imaging or freeze‐fracture replica labeling. The size and aggregation types of PIN clusters were determined by electron microscopy at the nanometer level at different polar domains and at different developmental stages, revealing a strong preference for clustering at the polar domains. Pharmacological and genetic studies revealed that PIN clusters depend on phosphoinositol pathways, cytoskeletal structures and specific cell‐wall components as well as connections between the cell wall and the plasma membrane. This study identifies the role of different cellular processes and structures in polar cargo clustering and provides initial mechanistic insight into the maintenance of polarity in plants and other systems.}, author = {Li, Hongjiang and von Wangenheim, Daniel and Zhang, Xixi and Tan, Shutang and Darwish-Miranda, Nasser and Naramoto, Satoshi and Wabnik, Krzysztof T and de Rycke, Riet and Kaufmann, Walter and Gütl, Daniel J and Tejos, Ricardo and Grones, Peter and Ke, Meiyu and Chen, Xu and Dettmer, Jan and Friml, Jiří}, issn = {14698137}, journal = {New Phytologist}, number = {1}, pages = {351--369}, publisher = {Wiley}, title = {{Cellular requirements for PIN polar cargo clustering in Arabidopsis thaliana}}, doi = {10.1111/nph.16887}, volume = {229}, year = {2021}, } @article{8546, abstract = {Brain neurons arise from relatively few progenitors generating an enormous diversity of neuronal types. Nonetheless, a cardinal feature of mammalian brain neurogenesis is thought to be that excitatory and inhibitory neurons derive from separate, spatially segregated progenitors. Whether bi-potential progenitors with an intrinsic capacity to generate both lineages exist and how such a fate decision may be regulated are unknown. Using cerebellar development as a model, we discover that individual progenitors can give rise to both inhibitory and excitatory lineages. Gradations of Notch activity determine the fates of the progenitors and their daughters. Daughters with the highest levels of Notch activity retain the progenitor fate, while intermediate levels of Notch activity generate inhibitory neurons, and daughters with very low levels of Notch signaling adopt the excitatory fate. Therefore, Notch-mediated binary cell fate choice is a mechanism for regulating the ratio of excitatory to inhibitory neurons from common progenitors.}, author = {Zhang, Tingting and Liu, Tengyuan and Mora, Natalia and Guegan, Justine and Bertrand, Mathilde and Contreras, Ximena and Hansen, Andi H and Streicher, Carmen and Anderle, Marica and Danda, Natasha and Tiberi, Luca and Hippenmeyer, Simon and Hassan, Bassem A.}, issn = { 22111247}, journal = {Cell Reports}, number = {10}, publisher = {Elsevier}, title = {{Generation of excitatory and inhibitory neurons from common progenitors via Notch signaling in the cerebellum}}, doi = {10.1016/j.celrep.2021.109208}, volume = {35}, year = {2021}, } @article{8430, abstract = {While recent advancements in computation and modelling have improved the analysis of complex traits, our understanding of the genetic basis of the time at symptom onset remains limited. Here, we develop a Bayesian approach (BayesW) that provides probabilistic inference of the genetic architecture of age-at-onset phenotypes in a sampling scheme that facilitates biobank-scale time-to-event analyses. We show in extensive simulation work the benefits BayesW provides in terms of number of discoveries, model performance and genomic prediction. In the UK Biobank, we find many thousands of common genomic regions underlying the age-at-onset of high blood pressure (HBP), cardiac disease (CAD), and type-2 diabetes (T2D), and for the genetic basis of onset reflecting the underlying genetic liability to disease. Age-at-menopause and age-at-menarche are also highly polygenic, but with higher variance contributed by low frequency variants. Genomic prediction into the Estonian Biobank data shows that BayesW gives higher prediction accuracy than other approaches.}, author = {Ojavee, Sven E and Kousathanas, Athanasios and Trejo Banos, Daniel and Orliac, Etienne J and Patxot, Marion and Lall, Kristi and Magi, Reedik and Fischer, Krista and Kutalik, Zoltan and Robinson, Matthew Richard}, issn = {20411723}, journal = {Nature Communications}, number = {1}, publisher = {Nature Research}, title = {{Genomic architecture and prediction of censored time-to-event phenotypes with a Bayesian genome-wide analysis}}, doi = {10.1038/s41467-021-22538-w}, volume = {12}, year = {2021}, } @article{8602, abstract = {Collective cell migration offers a rich field of study for non-equilibrium physics and cellular biology, revealing phenomena such as glassy dynamics, pattern formation and active turbulence. However, how mechanical and chemical signalling are integrated at the cellular level to give rise to such collective behaviours remains unclear. We address this by focusing on the highly conserved phenomenon of spatiotemporal waves of density and extracellular signal-regulated kinase (ERK) activation, which appear both in vitro and in vivo during collective cell migration and wound healing. First, we propose a biophysical theory, backed by mechanical and optogenetic perturbation experiments, showing that patterns can be quantitatively explained by a mechanochemical coupling between active cellular tensions and the mechanosensitive ERK pathway. Next, we demonstrate how this biophysical mechanism can robustly induce long-ranged order and migration in a desired orientation, and we determine the theoretically optimal wavelength and period for inducing maximal migration towards free edges, which fits well with experimentally observed dynamics. We thereby provide a bridge between the biophysical origin of spatiotemporal instabilities and the design principles of robust and efficient long-ranged migration.}, author = {Boocock, Daniel R and Hino, Naoya and Ruzickova, Natalia and Hirashima, Tsuyoshi and Hannezo, Edouard B}, issn = {17452481}, journal = {Nature Physics}, pages = {267--274}, publisher = {Springer Nature}, title = {{Theory of mechanochemical patterning and optimal migration in cell monolayers}}, doi = {10.1038/s41567-020-01037-7}, volume = {17}, year = {2021}, } @article{8603, abstract = {We consider the Fröhlich polaron model in the strong coupling limit. It is well‐known that to leading order the ground state energy is given by the (classical) Pekar energy. In this work, we establish the subleading correction, describing quantum fluctuation about the classical limit. Our proof applies to a model of a confined polaron, where both the electron and the polarization field are restricted to a set of finite volume, with linear size determined by the natural length scale of the Pekar problem.}, author = {Frank, Rupert and Seiringer, Robert}, issn = {10970312}, journal = {Communications on Pure and Applied Mathematics}, number = {3}, pages = {544--588}, publisher = {Wiley}, title = {{Quantum corrections to the Pekar asymptotics of a strongly coupled polaron}}, doi = {10.1002/cpa.21944}, volume = {74}, year = {2021}, } @article{8606, abstract = {The leaf is a crucial organ evolved with remarkable morphological diversity to maximize plant photosynthesis. The leaf shape is a key trait that affects photosynthesis, flowering rates, disease resistance, and yield. Although many genes regulating leaf development have been identified in the past years, the precise regulatory architecture underlying the generation of diverse leaf shapes remains to be elucidated. We used cotton as a reference model to probe the genetic framework underlying divergent leaf forms. Comparative transcriptome analysis revealed that the GhARF16‐1 and GhKNOX2‐1 genes might be potential regulators of leaf shape. We functionally characterized the auxin‐responsive factor ARF16‐1 acting upstream of GhKNOX2‐1 to determine leaf morphology in cotton. The transcription of GhARF16‐1 was significantly higher in lobed‐leaved cotton than in smooth‐leaved cotton. Furthermore, the overexpression of GhARF16‐1 led to the upregulation of GhKNOX2‐1 and resulted in more and deeper serrations in cotton leaves, similar to the leaf shape of cotton plants overexpressing GhKNOX2‐1. We found that GhARF16‐1 specifically bound to the promoter of GhKNOX2‐1 to induce its expression. The heterologous expression of GhARF16‐1 and GhKNOX2‐1 in Arabidopsis led to lobed and curly leaves, and a genetic analysis revealed that GhKNOX2‐1 is epistatic to GhARF16‐1 in Arabidopsis, suggesting that the GhARF16‐1 and GhKNOX2‐1 interaction paradigm also functions to regulate leaf shape in Arabidopsis. To our knowledge, our results uncover a novel mechanism by which auxin, through the key component ARF16‐1 and its downstream‐activated gene KNOX2‐1, determines leaf morphology in eudicots.}, author = {He, P and Zhang, Yuzhou and Li, H and Fu, X and Shang, H and Zou, C and Friml, Jiří and Xiao, G}, issn = {1467-7644}, journal = {Plant Biotechnology Journal}, number = {3}, pages = {548--562}, publisher = {Wiley}, title = {{GhARF16-1 modulates leaf development by transcriptionally regulating the GhKNOX2-1 gene in cotton}}, doi = {10.1111/pbi.13484}, volume = {19}, year = {2021}, } @article{8708, abstract = {The Mytilus complex of marine mussel species forms a mosaic of hybrid zones, found across temperate regions of the globe. This allows us to study ‘replicated’ instances of secondary contact between closely related species. Previous work on this complex has shown that local introgression is both widespread and highly heterogeneous, and has identified SNPs that are outliers of differentiation between lineages. Here, we developed an ancestry‐informative panel of such SNPs. We then compared their frequencies in newly sampled populations, including samples from within the hybrid zones, and parental populations at different distances from the contact. Results show that close to the hybrid zones, some outlier loci are near to fixation for the heterospecific allele, suggesting enhanced local introgression, or the local sweep of a shared ancestral allele. Conversely, genomic cline analyses, treating local parental populations as the reference, reveal a globally high concordance among loci, albeit with a few signals of asymmetric introgression. Enhanced local introgression at specific loci is consistent with the early transfer of adaptive variants after contact, possibly including asymmetric bi‐stable variants (Dobzhansky‐Muller incompatibilities), or haplotypes loaded with fewer deleterious mutations. Having escaped one barrier, however, these variants can be trapped or delayed at the next barrier, confining the introgression locally. These results shed light on the decay of species barriers during phases of contact.}, author = {Simon, Alexis and Fraisse, Christelle and El Ayari, Tahani and Liautard‐Haag, Cathy and Strelkov, Petr and Welch, John J and Bierne, Nicolas}, issn = {14209101}, journal = {Journal of Evolutionary Biology}, number = {1}, pages = {208--223}, publisher = {Wiley}, title = {{How do species barriers decay? Concordance and local introgression in mosaic hybrid zones of mussels}}, doi = {10.1111/jeb.13709}, volume = {34}, year = {2021}, } @article{8723, abstract = {Deep learning at scale is dominated by communication time. Distributing samples across nodes usually yields the best performance, but poses scaling challenges due to global information dissemination and load imbalance across uneven sample lengths. State-of-the-art decentralized optimizers mitigate the problem, but require more iterations to achieve the same accuracy as their globally-communicating counterparts. We present Wait-Avoiding Group Model Averaging (WAGMA) SGD, a wait-avoiding stochastic optimizer that reduces global communication via subgroup weight exchange. The key insight is a combination of algorithmic changes to the averaging scheme and the use of a group allreduce operation. We prove the convergence of WAGMA-SGD, and empirically show that it retains convergence rates similar to Allreduce-SGD. For evaluation, we train ResNet-50 on ImageNet; Transformer for machine translation; and deep reinforcement learning for navigation at scale. Compared with state-of-the-art decentralized SGD variants, WAGMA-SGD significantly improves training throughput (e.g., 2.1× on 1,024 GPUs for reinforcement learning), and achieves the fastest time-to-solution (e.g., the highest score using the shortest training time for Transformer).}, author = {Li, Shigang and Tal Ben-Nun, Tal Ben-Nun and Nadiradze, Giorgi and Girolamo, Salvatore Di and Dryden, Nikoli and Alistarh, Dan-Adrian and Hoefler, Torsten}, issn = {10459219}, journal = {IEEE Transactions on Parallel and Distributed Systems}, number = {7}, publisher = {IEEE}, title = {{Breaking (global) barriers in parallel stochastic optimization with wait-avoiding group averaging}}, doi = {10.1109/TPDS.2020.3040606}, volume = {32}, year = {2021}, } @article{8743, abstract = {Montane cloud forests are areas of high endemism, and are one of the more vulnerable terrestrial ecosystems to climate change. Thus, understanding how they both contribute to the generation of biodiversity, and will respond to ongoing climate change, are important and related challenges. The widely accepted model for montane cloud forest dynamics involves upslope forcing of their range limits with global climate warming. However, limited climate data provides some support for an alternative model, where range limits are forced downslope with climate warming. Testing between these two models is challenging, due to the inherent limitations of climate and pollen records. We overcome this with an alternative source of historical information, testing between competing model predictions using genomic data and demographic analyses for a species of beetle tightly associated to an oceanic island cloud forest. Results unequivocally support the alternative model: populations that were isolated at higher elevation peaks during the Last Glacial Maximum are now in contact and hybridizing at lower elevations. Our results suggest that genomic data are a rich source of information to further understand how montane cloud forest biodiversity originates, and how it is likely to be impacted by ongoing climate change.}, author = {Salces-Castellano, Antonia and Stankowski, Sean and Arribas, Paula and Patino, Jairo and Karger, Dirk N. and Butlin, Roger and Emerson, Brent C.}, issn = {1558-5646}, journal = {Evolution}, number = {2}, pages = {231--244}, publisher = {Wiley}, title = {{Long-term cloud forest response to climate warming revealed by insect speciation history}}, doi = {10.1111/evo.14111}, volume = {75}, year = {2021}, } @article{8673, abstract = {In RuCl3, inelastic neutron scattering and Raman spectroscopy reveal a continuum of non-spin-wave excitations that persists to high temperature, suggesting the presence of a spin liquid state on a honeycomb lattice. In the context of the Kitaev model, finite magnetic fields introduce interactions between the elementary excitations, and thus the effects of high magnetic fields that are comparable to the spin-exchange energy scale must be explored. Here, we report measurements of the magnetotropic coefficient—the thermodynamic coefficient associated with magnetic anisotropy—over a wide range of magnetic fields and temperatures. We find that magnetic field and temperature compete to determine the magnetic response in a way that is independent of the large intrinsic exchange-interaction energy. This emergent scale-invariant magnetic anisotropy provides evidence for a high degree of exchange frustration that favours the formation of a spin liquid state in RuCl3.}, author = {Modic, Kimberly A and McDonald, Ross D. and Ruff, J.P.C. and Bachmann, Maja D. and Lai, You and Palmstrom, Johanna C. and Graf, David and Chan, Mun K. and Balakirev, F.F. and Betts, J.B. and Boebinger, G.S. and Schmidt, Marcus and Lawler, Michael J. and Sokolov, D.A. and Moll, Philip J.W. and Ramshaw, B.J. and Shekhter, Arkady}, issn = {17452481}, journal = {Nature Physics}, pages = {240--244}, publisher = {Springer Nature}, title = {{Scale-invariant magnetic anisotropy in RuCl3 at high magnetic fields}}, doi = {10.1038/s41567-020-1028-0}, volume = {17}, year = {2021}, } @article{8757, abstract = {Traditional scientific conferences and seminar events have been hugely disrupted by the COVID-19 pandemic, paving the way for virtual forms of scientific communication to take hold and be put to the test.}, author = {Bozelos, Panagiotis and Vogels, Tim P}, issn = {14710048}, journal = {Nature Reviews Neuroscience}, number = {1}, pages = {1--2}, publisher = {Springer Nature}, title = {{Talking science, online}}, doi = {10.1038/s41583-020-00408-6}, volume = {22}, year = {2021}, } @article{8793, abstract = {We study optimal election sequences for repeatedly selecting a (very) small group of leaders among a set of participants (players) with publicly known unique ids. In every time slot, every player has to select exactly one player that it considers to be the current leader, oblivious to the selection of the other players, but with the overarching goal of maximizing a given parameterized global (“social”) payoff function in the limit. We consider a quite generic model, where the local payoff achieved by a given player depends, weighted by some arbitrary but fixed real parameter, on the number of different leaders chosen in a round, the number of players that choose the given player as the leader, and whether the chosen leader has changed w.r.t. the previous round or not. The social payoff can be the maximum, average or minimum local payoff of the players. Possible applications include quite diverse examples such as rotating coordinator-based distributed algorithms and long-haul formation flying of social birds. Depending on the weights and the particular social payoff, optimal sequences can be very different, from simple round-robin where all players chose the same leader alternatingly every time slot to very exotic patterns, where a small group of leaders (at most 2) is elected in every time slot. Moreover, we study the question if and when a single player would not benefit w.r.t. its local payoff when deviating from the given optimal sequence, i.e., when our optimal sequences are Nash equilibria in the restricted strategy space of oblivious strategies. As this is the case for many parameterizations of our model, our results reveal that no punishment is needed to make it rational for the players to optimize the social payoff.}, author = {Zeiner, Martin and Schmid, Ulrich and Chatterjee, Krishnendu}, issn = {0166218X}, journal = {Discrete Applied Mathematics}, number = {1}, pages = {392--415}, publisher = {Elsevier}, title = {{Optimal strategies for selecting coordinators}}, doi = {10.1016/j.dam.2020.10.022}, volume = {289}, year = {2021}, } @article{8816, abstract = {Area-dependent quantum field theory is a modification of two-dimensional topological quantum field theory, where one equips each connected component of a bordism with a positive real number—interpreted as area—which behaves additively under glueing. As opposed to topological theories, in area-dependent theories the state spaces can be infinite-dimensional. We introduce the notion of regularised Frobenius algebras in Hilbert spaces and show that area-dependent theories are in one-to-one correspondence to commutative regularised Frobenius algebras. We also provide a state sum construction for area-dependent theories. Our main example is two-dimensional Yang–Mills theory with compact gauge group, which we treat in detail.}, author = {Runkel, Ingo and Szegedy, Lorant}, issn = {14320916}, journal = {Communications in Mathematical Physics}, number = {1}, pages = {83–117}, publisher = {Springer Nature}, title = {{Area-dependent quantum field theory}}, doi = {10.1007/s00220-020-03902-1}, volume = {381}, year = {2021}, } @article{8818, abstract = {The hippocampus has a major role in encoding and consolidating long-term memories, and undergoes plastic changes during sleep1. These changes require precise homeostatic control by subcortical neuromodulatory structures2. The underlying mechanisms of this phenomenon, however, remain unknown. Here, using multi-structure recordings in macaque monkeys, we show that the brainstem transiently modulates hippocampal network events through phasic pontine waves known as pontogeniculooccipital waves (PGO waves). Two physiologically distinct types of PGO wave appear to occur sequentially, selectively influencing high-frequency ripples and low-frequency theta events, respectively. The two types of PGO wave are associated with opposite hippocampal spike-field coupling, prompting periods of high neural synchrony of neural populations during periods of ripple and theta instances. The coupling between PGO waves and ripples, classically associated with distinct sleep stages, supports the notion that a global coordination mechanism of hippocampal sleep dynamics by cholinergic pontine transients may promote systems and synaptic memory consolidation as well as synaptic homeostasis.}, author = {Ramirez Villegas, Juan F and Besserve, Michel and Murayama, Yusuke and Evrard, Henry C. and Oeltermann, Axel and Logothetis, Nikos K.}, issn = {14764687}, journal = {Nature}, number = {7840}, pages = {96--102}, publisher = {Springer Nature}, title = {{Coupling of hippocampal theta and ripples with pontogeniculooccipital waves}}, doi = {10.1038/s41586-020-2914-4}, volume = {589}, year = {2021}, } @article{8773, abstract = {Let g be a complex semisimple Lie algebra. We give a classification of contravariant forms on the nondegenerate Whittaker g-modules Y(χ,η) introduced by Kostant. We prove that the set of all contravariant forms on Y(χ,η) forms a vector space whose dimension is given by the cardinality of the Weyl group of g. We also describe a procedure for parabolically inducing contravariant forms. As a corollary, we deduce the existence of the Shapovalov form on a Verma module, and provide a formula for the dimension of the space of contravariant forms on the degenerate Whittaker modules M(χ,η) introduced by McDowell.}, author = {Brown, Adam and Romanov, Anna}, issn = {1088-6826}, journal = {Proceedings of the American Mathematical Society}, keywords = {Applied Mathematics, General Mathematics}, number = {1}, pages = {37--52}, publisher = {American Mathematical Society}, title = {{Contravariant forms on Whittaker modules}}, doi = {10.1090/proc/15205}, volume = {149}, year = {2021}, } @article{8792, abstract = {This paper is concerned with a non-isothermal Cahn-Hilliard model based on a microforce balance. The model was derived by A. Miranville and G. Schimperna starting from the two fundamental laws of Thermodynamics, following M. Gurtin's two-scale approach. The main working assumptions are made on the behaviour of the heat flux as the absolute temperature tends to zero and to infinity. A suitable Ginzburg-Landau free energy is considered. Global-in-time existence for the initial-boundary value problem associated to the entropy formulation and, in a subcase, also to the weak formulation of the model is proved by deriving suitable a priori estimates and by showing weak sequential stability of families of approximating solutions. At last, some highlights are given regarding a possible approximation scheme compatible with the a-priori estimates available for the system.}, author = {Marveggio, Alice and Schimperna, Giulio}, issn = {10902732}, journal = {Journal of Differential Equations}, number = {2}, pages = {924--970}, publisher = {Elsevier}, title = {{On a non-isothermal Cahn-Hilliard model based on a microforce balance}}, doi = {10.1016/j.jde.2020.10.030}, volume = {274}, year = {2021}, } @article{8912, abstract = {For automata, synchronization, the problem of bringing an automaton to a particular state regardless of its initial state, is important. It has several applications in practice and is related to a fifty-year-old conjecture on the length of the shortest synchronizing word. Although using shorter words increases the effectiveness in practice, finding a shortest one (which is not necessarily unique) is NP-hard. For this reason, there exist various heuristics in the literature. However, high-quality heuristics such as SynchroP producing relatively shorter sequences are very expensive and can take hours when the automaton has tens of thousands of states. The SynchroP heuristic has been frequently used as a benchmark to evaluate the performance of the new heuristics. In this work, we first improve the runtime of SynchroP and its variants by using algorithmic techniques. We then focus on adapting SynchroP for many-core architectures, and overall, we obtain more than 1000× speedup on GPUs compared to naive sequential implementation that has been frequently used as a benchmark to evaluate new heuristics in the literature. We also propose two SynchroP variants and evaluate their performance.}, author = {Sarac, Naci E and Altun, Ömer Faruk and Atam, Kamil Tolga and Karahoda, Sertac and Kaya, Kamer and Yenigün, Hüsnü}, issn = {09574174}, journal = {Expert Systems with Applications}, number = {4}, publisher = {Elsevier}, title = {{Boosting expensive synchronizing heuristics}}, doi = {10.1016/j.eswa.2020.114203}, volume = {167}, year = {2021}, } @article{8928, abstract = {Domestication is a human‐induced selection process that imprints the genomes of domesticated populations over a short evolutionary time scale and that occurs in a given demographic context. Reconstructing historical gene flow, effective population size changes and their timing is therefore of fundamental interest to understand how plant demography and human selection jointly shape genomic divergence during domestication. Yet, the comparison under a single statistical framework of independent domestication histories across different crop species has been little evaluated so far. Thus, it is unclear whether domestication leads to convergent demographic changes that similarly affect crop genomes. To address this question, we used existing and new transcriptome data on three crop species of Solanaceae (eggplant, pepper and tomato), together with their close wild relatives. We fitted twelve demographic models of increasing complexity on the unfolded joint allele frequency spectrum for each wild/crop pair, and we found evidence for both shared and species‐specific demographic processes between species. A convergent history of domestication with gene flow was inferred for all three species, along with evidence of strong reduction in the effective population size during the cultivation stage of tomato and pepper. The absence of any reduction in size of the crop in eggplant stands out from the classical view of the domestication process; as does the existence of a “protracted period” of management before cultivation. Our results also suggest divergent management strategies of modern cultivars among species as their current demography substantially differs. Finally, the timing of domestication is species‐specific and supported by the few historical records available.}, author = {Arnoux, Stéphanie and Fraisse, Christelle and Sauvage, Christopher}, issn = {14209101}, journal = {Journal of Evolutionary Biology}, number = {2}, pages = {270--283}, publisher = {Wiley}, title = {{Genomic inference of complex domestication histories in three Solanaceae species}}, doi = {10.1111/jeb.13723}, volume = {34}, year = {2021}, } @article{8992, abstract = {The phytohormone auxin plays a central role in shaping plant growth and development. With decades of genetic and biochemical studies, numerous core molecular components and their networks, underlying auxin biosynthesis, transport, and signaling, have been identified. Notably, protein phosphorylation, catalyzed by kinases and oppositely hydrolyzed by phosphatases, has been emerging to be a crucial type of post-translational modification, regulating physiological and developmental auxin output at all levels. In this review, we comprehensively discuss earlier and recent advances in our understanding of genetics, biochemistry, and cell biology of the kinases and phosphatases participating in auxin action. We provide insights into the mechanisms by which reversible protein phosphorylation defines developmental auxin responses, discuss current challenges, and provide our perspectives on future directions involving the integration of the control of protein phosphorylation into the molecular auxin network.}, author = {Tan, Shutang and Luschnig, Christian and Friml, Jiří}, issn = {17529867}, journal = {Molecular Plant}, number = {1}, pages = {151--165}, publisher = {Elsevier}, title = {{Pho-view of auxin: Reversible protein phosphorylation in auxin biosynthesis, transport and signaling}}, doi = {10.1016/j.molp.2020.11.004}, volume = {14}, year = {2021}, } @article{8988, abstract = {The differentiation of cells depends on a precise control of their internal organization, which is the result of a complex dynamic interplay between the cytoskeleton, molecular motors, signaling molecules, and membranes. For example, in the developing neuron, the protein ADAP1 (ADP-ribosylation factor GTPase-activating protein [ArfGAP] with dual pleckstrin homology [PH] domains 1) has been suggested to control dendrite branching by regulating the small GTPase ARF6. Together with the motor protein KIF13B, ADAP1 is also thought to mediate delivery of the second messenger phosphatidylinositol (3,4,5)-trisphosphate (PIP3) to the axon tip, thus contributing to PIP3 polarity. However, what defines the function of ADAP1 and how its different roles are coordinated are still not clear. Here, we studied ADAP1’s functions using in vitro reconstitutions. We found that KIF13B transports ADAP1 along microtubules, but that PIP3 as well as PI(3,4)P2 act as stop signals for this transport instead of being transported. We also demonstrate that these phosphoinositides activate ADAP1’s enzymatic activity to catalyze GTP hydrolysis by ARF6. Together, our results support a model for the cellular function of ADAP1, where KIF13B transports ADAP1 until it encounters high PIP3/PI(3,4)P2 concentrations in the plasma membrane. Here, ADAP1 disassociates from the motor to inactivate ARF6, promoting dendrite branching.}, author = {Düllberg, Christian F and Auer, Albert and Canigova, Nikola and Loibl, Katrin and Loose, Martin}, issn = {10916490}, journal = {PNAS}, number = {1}, publisher = {National Academy of Sciences}, title = {{In vitro reconstitution reveals phosphoinositides as cargo-release factors and activators of the ARF6 GAP ADAP1}}, doi = {10.1073/pnas.2010054118}, volume = {118}, year = {2021}, } @article{8927, abstract = {The recent outbreak of coronavirus disease 2019 (COVID‐19), caused by the Severe Acute Respiratory Syndrome Coronavirus‐2 (SARS‐CoV‐2) has resulted in a world‐wide pandemic. Disseminated lung injury with the development of acute respiratory distress syndrome (ARDS) is the main cause of mortality in COVID‐19. Although liver failure does not seem to occur in the absence of pre‐existing liver disease, hepatic involvement in COVID‐19 may correlate with overall disease severity and serve as a prognostic factor for the development of ARDS. The spectrum of liver injury in COVID‐19 may range from direct infection by SARS‐CoV‐2, indirect involvement by systemic inflammation, hypoxic changes, iatrogenic causes such as drugs and ventilation to exacerbation of underlying liver disease. This concise review discusses the potential pathophysiological mechanisms for SARS‐CoV‐2 hepatic tropism as well as acute and possibly long‐term liver injury in COVID‐19.}, author = {Nardo, Alexander D. and Schneeweiss-Gleixner, Mathias and Bakail, May M and Dixon, Emmanuel D. and Lax, Sigurd F. and Trauner, Michael}, issn = {14783231}, journal = {Liver International}, number = {1}, pages = {20--32}, publisher = {Wiley}, title = {{Pathophysiological mechanisms of liver injury in COVID-19}}, doi = {10.1111/liv.14730}, volume = {41}, year = {2021}, } @article{8966, abstract = {During development, a single cell is transformed into a highly complex organism through progressive cell division, specification and rearrangement. An important prerequisite for the emergence of patterns within the developing organism is to establish asymmetries at various scales, ranging from individual cells to the entire embryo, eventually giving rise to the different body structures. This becomes especially apparent during gastrulation, when the earliest major lineage restriction events lead to the formation of the different germ layers. Traditionally, the unfolding of the developmental program from symmetry breaking to germ layer formation has been studied by dissecting the contributions of different signaling pathways and cellular rearrangements in the in vivo context of intact embryos. Recent efforts, using the intrinsic capacity of embryonic stem cells to self-assemble and generate embryo-like structures de novo, have opened new avenues for understanding the many ways by which an embryo can be built and the influence of extrinsic factors therein. Here, we discuss and compare divergent and conserved strategies leading to germ layer formation in embryos as compared to in vitro systems, their upstream molecular cascades and the role of extrinsic factors in this process.}, author = {Schauer, Alexandra and Heisenberg, Carl-Philipp J}, issn = {0012-1606}, journal = {Developmental Biology}, keywords = {Developmental Biology, Cell Biology, Molecular Biology}, pages = {71--81}, publisher = {Elsevier}, title = {{Reassembling gastrulation}}, doi = {10.1016/j.ydbio.2020.12.014}, volume = {474}, year = {2021}, } @article{8993, abstract = {N-1-naphthylphthalamic acid (NPA) is a key inhibitor of directional (polar) transport of the hormone auxin in plants. For decades, it has been a pivotal tool in elucidating the unique polar auxin transport-based processes underlying plant growth and development. Its exact mode of action has long been sought after and is still being debated, with prevailing mechanistic schemes describing only indirect connections between NPA and the main transporters responsible for directional transport, namely PIN auxin exporters. Here we present data supporting a model in which NPA associates with PINs in a more direct manner than hitherto postulated. We show that NPA inhibits PIN activity in a heterologous oocyte system and that expression of NPA-sensitive PINs in plant, yeast, and oocyte membranes leads to specific saturable NPA binding. We thus propose that PINs are a bona fide NPA target. This offers a straightforward molecular basis for NPA inhibition of PIN-dependent auxin transport and a logical parsimonious explanation for the known physiological effects of NPA on plant growth, as well as an alternative hypothesis to interpret past and future results. We also introduce PIN dimerization and describe an effect of NPA on this, suggesting that NPA binding could be exploited to gain insights into structural aspects of PINs related to their transport mechanism.}, author = {Abas, Lindy and Kolb, Martina and Stadlmann, Johannes and Janacek, Dorina P. and Lukic, Kristina and Schwechheimer, Claus and Sazanov, Leonid A and Mach, Lukas and Friml, Jiří and Hammes, Ulrich Z.}, issn = {10916490}, journal = {PNAS}, number = {1}, publisher = {National Academy of Sciences}, title = {{Naphthylphthalamic acid associates with and inhibits PIN auxin transporters}}, doi = {10.1073/pnas.2020857118}, volume = {118}, year = {2021}, } @article{8999, abstract = {In many basic shear flows, such as pipe, Couette, and channel flow, turbulence does not arise from an instability of the laminar state, and both dynamical states co-exist. With decreasing flow speed (i.e., decreasing Reynolds number) the fraction of fluid in laminar motion increases while turbulence recedes and eventually the entire flow relaminarizes. The first step towards understanding the nature of this transition is to determine if the phase change is of either first or second order. In the former case, the turbulent fraction would drop discontinuously to zero as the Reynolds number decreases while in the latter the process would be continuous. For Couette flow, the flow between two parallel plates, earlier studies suggest a discontinuous scenario. In the present study we realize a Couette flow between two concentric cylinders which allows studies to be carried out in large aspect ratios and for extensive observation times. The presented measurements show that the transition in this circular Couette geometry is continuous suggesting that former studies were limited by finite size effects. A further characterization of this transition, in particular its relation to the directed percolation universality class, requires even larger system sizes than presently available. }, author = {Avila, Kerstin and Hof, Björn}, issn = {1099-4300}, journal = {Entropy}, number = {1}, publisher = {MDPI}, title = {{Second-order phase transition in counter-rotating taylor-couette flow experiment}}, doi = {10.3390/e23010058}, volume = {23}, year = {2021}, } @article{9005, abstract = {Studies on the experimental realization of two-dimensional anyons in terms of quasiparticles have been restricted, so far, to only anyons on the plane. It is known, however, that the geometry and topology of space can have significant effects on quantum statistics for particles moving on it. Here, we have undertaken the first step toward realizing the emerging fractional statistics for particles restricted to move on the sphere instead of on the plane. We show that such a model arises naturally in the context of quantum impurity problems. In particular, we demonstrate a setup in which the lowest-energy spectrum of two linear bosonic or fermionic molecules immersed in a quantum many-particle environment can coincide with the anyonic spectrum on the sphere. This paves the way toward the experimental realization of anyons on the sphere using molecular impurities. Furthermore, since a change in the alignment of the molecules corresponds to the exchange of the particles on the sphere, such a realization reveals a novel type of exclusion principle for molecular impurities, which could also be of use as a powerful technique to measure the statistics parameter. Finally, our approach opens up a simple numerical route to investigate the spectra of many anyons on the sphere. Accordingly, we present the spectrum of two anyons on the sphere in the presence of a Dirac monopole field.}, author = {Brooks, Morris and Lemeshko, Mikhail and Lundholm, D. and Yakaboylu, Enderalp}, issn = {10797114}, journal = {Physical Review Letters}, number = {1}, publisher = {American Physical Society}, title = {{Molecular impurities as a realization of anyons on the two-sphere}}, doi = {10.1103/PhysRevLett.126.015301}, volume = {126}, year = {2021}, } @article{9009, abstract = {Recent advancements in live cell imaging technologies have identified the phenomenon of intracellular propagation of late apoptotic events, such as cytochrome c release and caspase activation. The mechanism, prevalence, and speed of apoptosis propagation remain unclear. Additionally, no studies have demonstrated propagation of the pro-apoptotic protein, BAX. To evaluate the role of BAX in intracellular apoptotic propagation, we used high speed live-cell imaging to visualize fluorescently tagged-BAX recruitment to mitochondria in four immortalized cell lines. We show that propagation of mitochondrial BAX recruitment occurs in parallel to cytochrome c and SMAC/Diablo release and is affected by cellular morphology, such that cells with processes are more likely to exhibit propagation. The initiation of propagation events is most prevalent in the distal tips of processes, while the rate of propagation is influenced by the 2-dimensional width of the process. Propagation was rarely observed in the cell soma, which exhibited near synchronous recruitment of BAX. Propagation velocity is not affected by mitochondrial volume in segments of processes, but is negatively affected by mitochondrial density. There was no evidence of a propagating wave of increased levels of intracellular calcium ions. Alternatively, we did observe a uniform increase in superoxide build-up in cellular mitochondria, which was released as a propagating wave simultaneously with the propagating recruitment of BAX to the mitochondrial outer membrane.}, author = {Grosser, Joshua A. and Maes, Margaret E and Nickells, Robert W.}, issn = {1573-675X}, journal = {Apoptosis}, number = {2}, pages = {132--145}, publisher = {Springer Nature}, title = {{Characteristics of intracellular propagation of mitochondrial BAX recruitment during apoptosis}}, doi = {10.1007/s10495-020-01654-w}, volume = {26}, year = {2021}, } @article{9038, abstract = {Layered materials in which individual atomic layers are bonded by weak van der Waals forces (vdW materials) constitute one of the most prominent platforms for materials research. Particularly, polar vdW crystals, such as hexagonal boron nitride (h-BN), alpha-molybdenum trioxide (α-MoO3) or alpha-vanadium pentoxide (α-V2O5), have received significant attention in nano-optics, since they support phonon polaritons (PhPs)―light coupled to lattice vibrations― with strong electromagnetic confinement and low optical losses. Recently, correlative far- and near-field studies of α-MoO3 have been demonstrated as an effective strategy to accurately extract the permittivity of this material. Here, we use this accurately characterized and low-loss polaritonic material to sense its local dielectric environment, namely silica (SiO2), one of the most widespread substrates in nanotechnology. By studying the propagation of PhPs on α-MoO3 flakes with different thicknesses laying on SiO2 substrates via near-field microscopy (s-SNOM), we extract locally the infrared permittivity of SiO2. Our work reveals PhPs nanoimaging as a versatile method for the quantitative characterization of the local optical properties of dielectric substrates, crucial for understanding and predicting the response of nanomaterials and for the future scalability of integrated nanophotonic devices. }, author = {Aguilar-Merino, Patricia and Álvarez-Pérez, Gonzalo and Taboada-Gutiérrez, Javier and Duan, Jiahua and Prieto Gonzalez, Ivan and Álvarez-Prado, Luis Manuel and Nikitin, Alexey Y. and Martín-Sánchez, Javier and Alonso-González, Pablo}, issn = {20794991}, journal = {Nanomaterials}, number = {1}, publisher = {MDPI}, title = {{Extracting the infrared permittivity of SiO2 substrates locally by near-field imaging of phonon polaritons in a van der Waals crystal}}, doi = {10.3390/nano11010120}, volume = {11}, year = {2021}, } @article{9020, abstract = {We study dynamics and thermodynamics of ion transport in narrow, water-filled channels, considered as effective 1D Coulomb systems. The long range nature of the inter-ion interactions comes about due to the dielectric constants mismatch between the water and the surrounding medium, confining the electric filed to stay mostly within the water-filled channel. Statistical mechanics of such Coulomb systems is dominated by entropic effects which may be accurately accounted for by mapping onto an effective quantum mechanics. In presence of multivalent ions the corresponding quantum mechanics appears to be non-Hermitian. In this review we discuss a framework for semiclassical calculations for the effective non-Hermitian Hamiltonians. Non-Hermiticity elevates WKB action integrals from the real line to closed cycles on a complex Riemann surfaces where direct calculations are not attainable. We circumvent this issue by applying tools from algebraic topology, such as the Picard-Fuchs equation. We discuss how its solutions relate to the thermodynamics and correlation functions of multivalent solutions within narrow, water-filled channels. }, author = {Gulden, Tobias and Kamenev, Alex}, issn = {1099-4300}, journal = {Entropy}, number = {1}, publisher = {MDPI}, title = {{Dynamics of ion channels via non-hermitian quantum mechanics}}, doi = {10.3390/e23010125}, volume = {23}, year = {2021}, } @article{9037, abstract = {We continue our study of ‘no‐dimension’ analogues of basic theorems in combinatorial and convex geometry in Banach spaces. We generalize some results of the paper (Adiprasito, Bárány and Mustafa, ‘Theorems of Carathéodory, Helly, and Tverberg without dimension’, Proceedings of the Thirtieth Annual ACM‐SIAM Symposium on Discrete Algorithms (Society for Industrial and Applied Mathematics, San Diego, California, 2019) 2350–2360) and prove no‐dimension versions of the colored Tverberg theorem, the selection lemma and the weak 𝜀 ‐net theorem in Banach spaces of type 𝑝>1 . To prove these results, we use the original ideas of Adiprasito, Bárány and Mustafa for the Euclidean case, our no‐dimension version of the Radon theorem and slightly modified version of the celebrated Maurey lemma.}, author = {Ivanov, Grigory}, issn = {14692120}, journal = {Bulletin of the London Mathematical Society}, number = {2}, pages = {631--641}, publisher = {London Mathematical Society}, title = {{No-dimension Tverberg's theorem and its corollaries in Banach spaces of type p}}, doi = {10.1112/blms.12449}, volume = {53}, year = {2021}, } @article{9046, author = {Römhild, Roderich and Andersson, Dan I.}, issn = {15537374}, journal = {PLoS Pathogens}, number = {1}, publisher = {Public Library of Science}, title = {{Mechanisms and therapeutic potential of collateral sensitivity to antibiotics}}, doi = {10.1371/journal.ppat.1009172}, volume = {17}, year = {2021}, } @article{9047, abstract = {This work analyzes the latency of the simplified successive cancellation (SSC) decoding scheme for polar codes proposed by Alamdar-Yazdi and Kschischang. It is shown that, unlike conventional successive cancellation decoding, where latency is linear in the block length, the latency of SSC decoding is sublinear. More specifically, the latency of SSC decoding is O(N1−1/μ) , where N is the block length and μ is the scaling exponent of the channel, which captures the speed of convergence of the rate to capacity. Numerical results demonstrate the tightness of the bound and show that most of the latency reduction arises from the parallel decoding of subcodes of rate 0 or 1.}, author = {Mondelli, Marco and Hashemi, Seyyed Ali and Cioffi, John M. and Goldsmith, Andrea}, issn = {15582248}, journal = {IEEE Transactions on Wireless Communications}, number = {1}, pages = {18--27}, publisher = {IEEE}, title = {{Sublinear latency for simplified successive cancellation decoding of polar codes}}, doi = {10.1109/TWC.2020.3022922}, volume = {20}, year = {2021}, } @article{9036, abstract = {In this short note, we prove that the square root of the quantum Jensen-Shannon divergence is a true metric on the cone of positive matrices, and hence in particular on the quantum state space.}, author = {Virosztek, Daniel}, issn = {0001-8708}, journal = {Advances in Mathematics}, keywords = {General Mathematics}, number = {3}, publisher = {Elsevier}, title = {{The metric property of the quantum Jensen-Shannon divergence}}, doi = {10.1016/j.aim.2021.107595}, volume = {380}, year = {2021}, } @article{9101, abstract = {Behavioral predispositions are innate tendencies of animals to behave in a given way without the input of learning. They increase survival chances and, due to environmental and ecological challenges, may vary substantially even between closely related taxa. These differences are likely to be especially pronounced in long-lived species like crocodilians. This order is particularly relevant for comparative cognition due to its phylogenetic proximity to birds. Here we compared early life behavioral predispositions in two Alligatoridae species. We exposed American alligator and spectacled caiman hatchlings to three different novel situations: a novel object, a novel environment that was open and a novel environment with a shelter. This was then repeated a week later. During exposure to the novel environments, alligators moved around more and explored a larger range of the arena than the caimans. When exposed to the novel object, the alligators reduced the mean distance to the novel object in the second phase, while the caimans further increased it, indicating diametrically opposite ontogenetic development in behavioral predispositions. Although all crocodilian hatchlings face comparable challenges, e.g., high predation pressure, the effectiveness of parental protection might explain the observed pattern. American alligators are apex predators capable of protecting their offspring against most dangers, whereas adult spectacled caimans are frequently predated themselves. Their distancing behavior might be related to increased predator avoidance and also explain the success of invasive spectacled caimans in the natural habitats of other crocodilians.}, author = {Reber, Stephan A. and Oh, Jinook and Janisch, Judith and Stevenson, Colin and Foggett, Shaun and Wilkinson, Anna}, issn = {14359456}, journal = {Animal Cognition}, number = {4}, pages = {753--764}, publisher = {Springer Nature}, title = {{Early life differences in behavioral predispositions in two Alligatoridae species}}, doi = {10.1007/s10071-020-01461-5}, volume = {24}, year = {2021}, } @article{9100, abstract = {Marine environments are inhabited by a broad representation of the tree of life, yet our understanding of speciation in marine ecosystems is extremely limited compared with terrestrial and freshwater environments. Developing a more comprehensive picture of speciation in marine environments requires that we 'dive under the surface' by studying a wider range of taxa and ecosystems is necessary for a more comprehensive picture of speciation. Although studying marine evolutionary processes is often challenging, recent technological advances in different fields, from maritime engineering to genomics, are making it increasingly possible to study speciation of marine life forms across diverse ecosystems and taxa. Motivated by recent research in the field, including the 14 contributions in this issue, we highlight and discuss six axes of research that we think will deepen our understanding of speciation in the marine realm: (a) study a broader range of marine environments and organisms; (b) identify the reproductive barriers driving speciation between marine taxa; (c) understand the role of different genomic architectures underlying reproductive isolation; (d) infer the evolutionary history of divergence using model‐based approaches; (e) study patterns of hybridization and introgression between marine taxa; and (f) implement highly interdisciplinary, collaborative research programmes. In outlining these goals, we hope to inspire researchers to continue filling this critical knowledge gap surrounding the origins of marine biodiversity.}, author = {Faria, Rui and Johannesson, Kerstin and Stankowski, Sean}, issn = {14209101}, journal = {Journal of Evolutionary Biology}, number = {1}, pages = {4--15}, publisher = {Wiley}, title = {{Speciation in marine environments: Diving under the surface}}, doi = {10.1111/jeb.13756}, volume = {34}, year = {2021}, } @article{9093, abstract = {We employ the Gross-Pitaevskii equation to study acoustic emission generated in a uniform Bose gas by a static impurity. The impurity excites a sound-wave packet, which propagates through the gas. We calculate the shape of this wave packet in the limit of long wave lengths, and argue that it is possible to extract properties of the impurity by observing this shape. We illustrate here this possibility for a Bose gas with a trapped impurity atom -- an example of a relevant experimental setup. Presented results are general for all one-dimensional systems described by the nonlinear Schrödinger equation and can also be used in nonatomic systems, e.g., to analyze light propagation in nonlinear optical media. Finally, we calculate the shape of the sound-wave packet for a three-dimensional Bose gas assuming a spherically symmetric perturbation.}, author = {Marchukov, Oleksandr and Volosniev, Artem}, issn = {2542-4653}, journal = {SciPost Physics}, number = {2}, publisher = {SciPost Foundation}, title = {{Shape of a sound wave in a weakly-perturbed Bose gas}}, doi = {10.21468/scipostphys.10.2.025}, volume = {10}, year = {2021}, } @article{8689, abstract = {This paper continues the discussion started in [CK19] concerning Arnold's legacy on classical KAM theory and (some of) its modern developments. We prove a detailed and explicit `global' Arnold's KAM Theorem, which yields, in particular, the Whitney conjugacy of a non{degenerate, real{analytic, nearly-integrable Hamiltonian system to an integrable system on a closed, nowhere dense, positive measure subset of the phase space. Detailed measure estimates on the Kolmogorov's set are provided in the case the phase space is: (A) a uniform neighbourhood of an arbitrary (bounded) set times the d-torus and (B) a domain with C2 boundary times the d-torus. All constants are explicitly given.}, author = {Chierchia, Luigi and Koudjinan, Edmond}, issn = {1560-3547}, journal = {Regular and Chaotic Dynamics}, keywords = {Nearly{integrable Hamiltonian systems, perturbation theory, KAM Theory, Arnold's scheme, Kolmogorov's set, primary invariant tori, Lagrangian tori, measure estimates, small divisors, integrability on nowhere dense sets, Diophantine frequencies.}, number = {1}, pages = {61--88}, publisher = {Springer Nature}, title = {{V.I. Arnold's ''Global'' KAM theorem and geometric measure estimates}}, doi = {10.1134/S1560354721010044}, volume = {26}, year = {2021}, } @article{9099, abstract = {We show that on an Abelian variety over an algebraically closed field of positive characteristic, the obstruction to lifting an automorphism to a field of characteristic zero as a morphism vanishes if and only if it vanishes for lifting it as a derived autoequivalence. We also compare the deformation space of these two types of deformations.}, author = {Srivastava, Tanya K}, issn = {14208938}, journal = {Archiv der Mathematik}, number = {5}, pages = {515--527}, publisher = {Springer Nature}, title = {{Lifting automorphisms on Abelian varieties as derived autoequivalences}}, doi = {10.1007/s00013-020-01564-y}, volume = {116}, year = {2021}, }