@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}, } @article{9437, abstract = {The synaptic connection from medial habenula (MHb) to interpeduncular nucleus (IPN) is critical for emotion-related behaviors and uniquely expresses R-type Ca2+ channels (Cav2.3) and auxiliary GABAB receptor (GBR) subunits, the K+-channel tetramerization domain-containing proteins (KCTDs). Activation of GBRs facilitates or inhibits transmitter release from MHb terminals depending on the IPN subnucleus, but the role of KCTDs is unknown. We therefore examined the localization and function of Cav2.3, GBRs, and KCTDs in this pathway in mice. We show in heterologous cells that KCTD8 and KCTD12b directly bind to Cav2.3 and that KCTD8 potentiates Cav2.3 currents in the absence of GBRs. In the rostral IPN, KCTD8, KCTD12b, and Cav2.3 co-localize at the presynaptic active zone. Genetic deletion indicated a bidirectional modulation of Cav2.3-mediated release by these KCTDs with a compensatory increase of KCTD8 in the active zone in KCTD12b-deficient mice. The interaction of Cav2.3 with KCTDs therefore scales synaptic strength independent of GBR activation.}, author = {Bhandari, Pradeep and Vandael, David H and Fernández-Fernández, Diego and Fritzius, Thorsten and Kleindienst, David and Önal, Hüseyin C and Montanaro-Punzengruber, Jacqueline-Claire and Gassmann, Martin and Jonas, Peter M and Kulik, Akos and Bettler, Bernhard and Shigemoto, Ryuichi and Koppensteiner, Peter}, issn = {2050-084X}, journal = {eLife}, publisher = {eLife Sciences Publications}, title = {{GABAB receptor auxiliary subunits modulate Cav2.3-mediated release from medial habenula terminals}}, doi = {10.7554/ELIFE.68274}, volume = {10}, year = {2021}, } @article{9438, abstract = {Rigorous investigation of synaptic transmission requires analysis of unitary synaptic events by simultaneous recording from presynaptic terminals and postsynaptic target neurons. However, this has been achieved at only a limited number of model synapses, including the squid giant synapse and the mammalian calyx of Held. Cortical presynaptic terminals have been largely inaccessible to direct presynaptic recording, due to their small size. Here, we describe a protocol for improved subcellular patch-clamp recording in rat and mouse brain slices, with the synapse in a largely intact environment. Slice preparation takes ~2 h, recording ~3 h and post hoc morphological analysis 2 d. Single presynaptic hippocampal mossy fiber terminals are stimulated minimally invasively in the bouton-attached configuration, in which the cytoplasmic content remains unperturbed, or in the whole-bouton configuration, in which the cytoplasmic composition can be precisely controlled. Paired pre–postsynaptic recordings can be integrated with biocytin labeling and morphological analysis, allowing correlative investigation of synapse structure and function. Paired recordings can be obtained from mossy fiber terminals in slices from both rats and mice, implying applicability to genetically modified synapses. Paired recordings can also be performed together with axon tract stimulation or optogenetic activation, allowing comparison of unitary and compound synaptic events in the same target cell. Finally, paired recordings can be combined with spontaneous event analysis, permitting collection of miniature events generated at a single identified synapse. In conclusion, the subcellular patch-clamp techniques detailed here should facilitate analysis of biophysics, plasticity and circuit function of cortical synapses in the mammalian central nervous system.}, author = {Vandael, David H and Okamoto, Yuji and Borges Merjane, Carolina and Vargas Barroso, Victor M and Suter, Benjamin and Jonas, Peter M}, issn = {17502799}, journal = {Nature Protocols}, number = {6}, pages = {2947–2967}, publisher = {Springer Nature}, title = {{Subcellular patch-clamp techniques for single-bouton stimulation and simultaneous pre- and postsynaptic recording at cortical synapses}}, doi = {10.1038/s41596-021-00526-0}, volume = {16}, year = {2021}, } @article{9439, abstract = {The ability to adapt to changes in stimulus statistics is a hallmark of sensory systems. Here, we developed a theoretical framework that can account for the dynamics of adaptation from an information processing perspective. We use this framework to optimize and analyze adaptive sensory codes, and we show that codes optimized for stationary environments can suffer from prolonged periods of poor performance when the environment changes. To mitigate the adversarial effects of these environmental changes, sensory systems must navigate tradeoffs between the ability to accurately encode incoming stimuli and the ability to rapidly detect and adapt to changes in the distribution of these stimuli. We derive families of codes that balance these objectives, and we demonstrate their close match to experimentally observed neural dynamics during mean and variance adaptation. Our results provide a unifying perspective on adaptation across a range of sensory systems, environments, and sensory tasks.}, author = {Mlynarski, Wiktor F and Hermundstad, Ann M.}, issn = {1546-1726}, journal = {Nature Neuroscience}, pages = {998--1009}, publisher = {Springer Nature}, title = {{Efficient and adaptive sensory codes}}, doi = {10.1038/s41593-021-00846-0}, volume = {24}, year = {2021}, } @inproceedings{9441, abstract = {Isomanifolds are the generalization of isosurfaces to arbitrary dimension and codimension, i.e. submanifolds of ℝ^d defined as the zero set of some multivariate multivalued smooth function f: ℝ^d → ℝ^{d-n}, where n is the intrinsic dimension of the manifold. A natural way to approximate a smooth isomanifold M is to consider its Piecewise-Linear (PL) approximation M̂ based on a triangulation 𝒯 of the ambient space ℝ^d. In this paper, we describe a simple algorithm to trace isomanifolds from a given starting point. The algorithm works for arbitrary dimensions n and d, and any precision D. Our main result is that, when f (or M) has bounded complexity, the complexity of the algorithm is polynomial in d and δ = 1/D (and unavoidably exponential in n). Since it is known that for δ = Ω (d^{2.5}), M̂ is O(D²)-close and isotopic to M, our algorithm produces a faithful PL-approximation of isomanifolds of bounded complexity in time polynomial in d. Combining this algorithm with dimensionality reduction techniques, the dependency on d in the size of M̂ can be completely removed with high probability. We also show that the algorithm can handle isomanifolds with boundary and, more generally, isostratifolds. The algorithm for isomanifolds with boundary has been implemented and experimental results are reported, showing that it is practical and can handle cases that are far ahead of the state-of-the-art. }, author = {Boissonnat, Jean-Daniel and Kachanovich, Siargey and Wintraecken, Mathijs}, booktitle = {37th International Symposium on Computational Geometry (SoCG 2021)}, isbn = {978-3-95977-184-9}, issn = {1868-8969}, location = {Virtual}, pages = {17:1--17:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Tracing isomanifolds in Rd in time polynomial in d using Coxeter-Freudenthal-Kuhn triangulations}}, doi = {10.4230/LIPIcs.SoCG.2021.17}, volume = {189}, year = {2021}, } @article{9443, abstract = {Endoplasmic reticulum–plasma membrane contact sites (ER–PM CS) play fundamental roles in all eukaryotic cells. Arabidopsis thaliana mutants lacking the ER–PM protein tether synaptotagmin1 (SYT1) exhibit decreased PM integrity under multiple abiotic stresses, such as freezing, high salt, osmotic stress, and mechanical damage. Here, we show that, together with SYT1, the stress-induced SYT3 is an ER–PM tether that also functions in maintaining PM integrity. The ER–PM CS localization of SYT1 and SYT3 is dependent on PM phosphatidylinositol-4-phosphate and is regulated by abiotic stress. Lipidomic analysis revealed that cold stress increased the accumulation of diacylglycerol at the PM in a syt1/3 double mutant relative to wild-type while the levels of most glycerolipid species remain unchanged. In addition, the SYT1-green fluorescent protein fusion preferentially binds diacylglycerol in vivo with little affinity for polar glycerolipids. Our work uncovers a SYT-dependent mechanism of stress adaptation counteracting the detrimental accumulation of diacylglycerol at the PM produced during episodes of abiotic stress.}, author = {Ruiz-Lopez, N and Pérez-Sancho, J and Esteban Del Valle, A and Haslam, RP and Vanneste, S and Catalá, R and Perea-Resa, C and Van Damme, D and García-Hernández, S and Albert, A and Vallarino, J and Lin, J and Friml, Jiří and Macho, AP and Salinas, J and Rosado, A and Napier, JA and Amorim-Silva, V and Botella, MA}, issn = {1532-298x}, journal = {Plant Cell}, number = {7}, pages = {2431--2453}, publisher = {American Society of Plant Biologists}, title = {{Synaptotagmins at the endoplasmic reticulum-plasma membrane contact sites maintain diacylglycerol homeostasis during abiotic stress}}, doi = {10.1093/plcell/koab122}, volume = {33}, year = {2021}, } @article{9462, abstract = {We consider a system of N trapped bosons with repulsive interactions in a combined semiclassical mean-field limit at positive temperature. We show that the free energy is well approximated by the minimum of the Hartree free energy functional – a natural extension of the Hartree energy functional to positive temperatures. The Hartree free energy functional converges in the same limit to a semiclassical free energy functional, and we show that the system displays Bose–Einstein condensation if and only if it occurs in the semiclassical free energy functional. This allows us to show that for weak coupling the critical temperature decreases due to the repulsive interactions.}, author = {Deuchert, Andreas and Seiringer, Robert}, issn = {1096-0783}, journal = {Journal of Functional Analysis}, number = {6}, publisher = {Elsevier}, title = {{Semiclassical approximation and critical temperature shift for weakly interacting trapped bosons}}, doi = {10.1016/j.jfa.2021.109096}, volume = {281}, 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{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{9467, abstract = {Turbulence in the flow of fluid through a pipe can be suppressed by buoyancy forces. As the suppression of turbulence leads to severe heat transfer deterioration, this is an important and undesirable phenomenon in both heating and cooling applications. Vertical flow is often considered, as the axial buoyancy force can help drive the flow. With heating measured by the buoyancy parameter 𝐶, our direct numerical simulations show that shear-driven turbulence may either be completely laminarised or it transitions to a relatively quiescent convection-driven state. Buoyancy forces cause a flattening of the base flow profile, which in isothermal pipe flow has recently been linked to complete suppression of turbulence (Kühnen et al., Nat. Phys., vol. 14, 2018, pp. 386–390), and the flattened laminar base profile has enhanced nonlinear stability (Marensi et al., J. Fluid Mech., vol. 863, 2019, pp. 50–875). In agreement with these findings, the nonlinear lower-branch travelling-wave solution analysed here, which is believed to mediate transition to turbulence in isothermal pipe flow, is shown to be suppressed by buoyancy. A linear instability of the laminar base flow is responsible for the appearance of the relatively quiescent convection driven state for 𝐶≳4 across the range of Reynolds numbers considered. In the suppression of turbulence, however, i.e. in the transition from turbulence, we find clearer association with the analysis of He et al. (J. Fluid Mech., vol. 809, 2016, pp. 31–71) than with the above dynamical systems approach, which describes better the transition to turbulence. The laminarisation criterion He et al. propose, based on an apparent Reynolds number of the flow as measured by its driving pressure gradient, is found to capture the critical 𝐶=𝐶𝑐𝑟(𝑅𝑒) above which the flow will be laminarised or switch to the convection-driven type. Our analysis suggests that it is the weakened rolls, rather than the streaks, which appear to be critical for laminarisation.}, author = {Marensi, Elena and He, Shuisheng and Willis, Ashley P.}, issn = {14697645}, journal = {Journal of Fluid Mechanics}, publisher = {Cambridge University Press}, title = {{Suppression of turbulence and travelling waves in a vertical heated pipe}}, doi = {10.1017/jfm.2021.371}, volume = {919}, year = {2021}, } @article{9468, abstract = {Motivated by the successful application of geometry to proving the Harary--Hill conjecture for “pseudolinear” drawings of $K_n$, we introduce “pseudospherical” drawings of graphs. A spherical drawing of a graph $G$ is a drawing in the unit sphere $\mathbb{S}^2$ in which the vertices of $G$ are represented as points---no three on a great circle---and the edges of $G$ are shortest-arcs in $\mathbb{S}^2$ connecting pairs of vertices. Such a drawing has three properties: (1) every edge $e$ is contained in a simple closed curve $\gamma_e$ such that the only vertices in $\gamma_e$ are the ends of $e$; (2) if $e\ne f$, then $\gamma_e\cap\gamma_f$ has precisely two crossings; and (3) if $e\ne f$, then $e$ intersects $\gamma_f$ at most once, in either a crossing or an end of $e$. We use properties (1)--(3) to define a pseudospherical drawing of $G$. Our main result is that for the complete graph, properties (1)--(3) are equivalent to the same three properties but with “precisely two crossings” in (2) replaced by “at most two crossings.” The proof requires a result in the geometric transversal theory of arrangements of pseudocircles. This is proved using the surprising result that the absence of special arcs (coherent spirals) in an arrangement of simple closed curves characterizes the fact that any two curves in the arrangement have at most two crossings. Our studies provide the necessary ideas for exhibiting a drawing of $K_{10}$ that has no extension to an arrangement of pseudocircles and a drawing of $K_9$ that does extend to an arrangement of pseudocircles, but no such extension has all pairs of pseudocircles crossing twice. }, author = {Arroyo Guevara, Alan M and Richter, R. Bruce and Sunohara, Matthew}, issn = {08954801}, journal = {SIAM Journal on Discrete Mathematics}, number = {2}, pages = {1050--1076}, publisher = {Society for Industrial and Applied Mathematics}, title = {{Extending drawings of complete graphs into arrangements of pseudocircles}}, doi = {10.1137/20M1313234}, volume = {35}, year = {2021}, } @article{9470, abstract = {A key step in understanding the genetic basis of different evolutionary outcomes (e.g., adaptation) is to determine the roles played by different mutation types (e.g., SNPs, translocations and inversions). To do this we must simultaneously consider different mutation types in an evolutionary framework. Here, we propose a research framework that directly utilizes the most important characteristics of mutations, their population genetic effects, to determine their relative evolutionary significance in a given scenario. We review known population genetic effects of different mutation types and show how these may be connected to different evolutionary outcomes. We provide examples of how to implement this framework and pinpoint areas where more data, theory and synthesis are needed. Linking experimental and theoretical approaches to examine different mutation types simultaneously is a critical step towards understanding their evolutionary significance.}, author = {Berdan, Emma L. and Blanckaert, Alexandre and Slotte, Tanja and Suh, Alexander and Westram, Anja M and Fragata, Inês}, issn = {1365294X}, journal = {Molecular Ecology}, number = {12}, pages = {2710--2723}, publisher = {Wiley}, title = {{Unboxing mutations: Connecting mutation types with evolutionary consequences}}, doi = {10.1111/mec.15936}, volume = {30}, year = {2021}, } @article{9540, abstract = {The hexameric AAA-ATPase Drg1 is a key factor in eukaryotic ribosome biogenesis and initiates cytoplasmic maturation of the large ribosomal subunit by releasing the shuttling maturation factor Rlp24. Drg1 monomers contain two AAA-domains (D1 and D2) that act in a concerted manner. Rlp24 release is inhibited by the drug diazaborine which blocks ATP hydrolysis in D2. The mode of inhibition was unknown. Here we show the first cryo-EM structure of Drg1 revealing the inhibitory mechanism. Diazaborine forms a covalent bond to the 2′-OH of the nucleotide in D2, explaining its specificity for this site. As a consequence, the D2 domain is locked in a rigid, inactive state, stalling the whole Drg1 hexamer. Resistance mechanisms identified include abolished drug binding and altered positioning of the nucleotide. Our results suggest nucleotide-modifying compounds as potential novel inhibitors for AAA-ATPases.}, author = {Prattes, Michael and Grishkovskaya, Irina and Hodirnau, Victor-Valentin and Rössler, Ingrid and Klein, Isabella and Hetzmannseder, Christina and Zisser, Gertrude and Gruber, Christian C. and Gruber, Karl and Haselbach, David and Bergler, Helmut}, issn = {2041-1723}, journal = {Nature Communications}, keywords = {General Biochemistry, Genetics and Molecular Biology, General Physics and Astronomy, General Chemistry}, number = {1}, publisher = {Springer Nature}, title = {{Structural basis for inhibition of the AAA-ATPase Drg1 by diazaborine}}, doi = {10.1038/s41467-021-23854-x}, volume = {12}, year = {2021}, } @article{9541, abstract = {The Massively Parallel Computation (MPC) model is an emerging model that distills core aspects of distributed and parallel computation, developed as a tool to solve combinatorial (typically graph) problems in systems of many machines with limited space. Recent work has focused on the regime in which machines have sublinear (in n, the number of nodes in the input graph) space, with randomized algorithms presented for the fundamental problems of Maximal Matching and Maximal Independent Set. However, there have been no prior corresponding deterministic algorithms. A major challenge underlying the sublinear space setting is that the local space of each machine might be too small to store all edges incident to a single node. This poses a considerable obstacle compared to classical models in which each node is assumed to know and have easy access to its incident edges. To overcome this barrier, we introduce a new graph sparsification technique that deterministically computes a low-degree subgraph, with the additional property that solving the problem on this subgraph provides significant progress towards solving the problem for the original input graph. Using this framework to derandomize the well-known algorithm of Luby [SICOMP’86], we obtain O(log Δ + log log n)-round deterministic MPC algorithms for solving the problems of Maximal Matching and Maximal Independent Set with O(nɛ) space on each machine for any constant ɛ > 0. These algorithms also run in O(log Δ) rounds in the closely related model of CONGESTED CLIQUE, improving upon the state-of-the-art bound of O(log 2Δ) rounds by Censor-Hillel et al. [DISC’17].}, author = {Czumaj, Artur and Davies, Peter and Parter, Merav}, issn = {1549-6333}, journal = {ACM Transactions on Algorithms}, number = {2}, publisher = {Association for Computing Machinery}, title = {{Graph sparsification for derandomizing massively parallel computation with low space}}, doi = {10.1145/3451992}, volume = {17}, 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}, } @article{9547, abstract = {With the wider availability of full-color 3D printers, color-accurate 3D-print preparation has received increased attention. A key challenge lies in the inherent translucency of commonly used print materials that blurs out details of the color texture. Previous work tries to compensate for these scattering effects through strategic assignment of colored primary materials to printer voxels. To date, the highest-quality approach uses iterative optimization that relies on computationally expensive Monte Carlo light transport simulation to predict the surface appearance from subsurface scattering within a given print material distribution; that optimization, however, takes in the order of days on a single machine. In our work, we dramatically speed up the process by replacing the light transport simulation with a data-driven approach. Leveraging a deep neural network to predict the scattering within a highly heterogeneous medium, our method performs around two orders of magnitude faster than Monte Carlo rendering while yielding optimization results of similar quality level. The network is based on an established method from atmospheric cloud rendering, adapted to our domain and extended by a physically motivated weight sharing scheme that substantially reduces the network size. We analyze its performance in an end-to-end print preparation pipeline and compare quality and runtime to alternative approaches, and demonstrate its generalization to unseen geometry and material values. This for the first time enables full heterogenous material optimization for 3D-print preparation within time frames in the order of the actual printing time.}, author = {Rittig, Tobias and Sumin, Denis and Babaei, Vahid and Didyk, Piotr and Voloboy, Alexey and Wilkie, Alexander and Bickel, Bernd and Myszkowski, Karol and Weyrich, Tim and Křivánek, Jaroslav}, issn = {1467-8659}, journal = {Computer Graphics Forum}, number = {2}, pages = {205--219}, publisher = {Wiley}, title = {{Neural acceleration of scattering-aware color 3D printing}}, doi = {10.1111/cgf.142626}, volume = {40}, year = {2021}, } @article{9548, abstract = {We extend the notion of the minimal volume ellipsoid containing a convex body in Rd to the setting of logarithmically concave functions. We consider a vast class of logarithmically concave functions whose superlevel sets are concentric ellipsoids. For a fixed function from this class, we consider the set of all its “affine” positions. For any log-concave function f on Rd, we consider functions belonging to this set of “affine” positions, and find the one with the minimal integral under the condition that it is pointwise greater than or equal to f. We study the properties of existence and uniqueness of the solution to this problem. For any s∈[0,+∞), we consider the construction dual to the recently defined John s-function (Ivanov and Naszódi in Functional John ellipsoids. arXiv preprint: arXiv:2006.09934, 2020). We prove that such a construction determines a unique function and call it the Löwner s-function of f. We study the Löwner s-functions as s tends to zero and to infinity. Finally, extending the notion of the outer volume ratio, we define the outer integral ratio of a log-concave function and give an asymptotically tight bound on it.}, author = {Ivanov, Grigory and Tsiutsiurupa, Igor}, issn = {1559-002X}, journal = {Journal of Geometric Analysis}, pages = {11493--11528}, publisher = {Springer}, title = {{Functional Löwner ellipsoids}}, doi = {10.1007/s12220-021-00691-4}, volume = {31}, year = {2021}, } @article{9549, abstract = {AMPA receptors (AMPARs) mediate the majority of excitatory transmission in the brain and enable the synaptic plasticity that underlies learning1. A diverse array of AMPAR signalling complexes are established by receptor auxiliary subunits, which associate with the AMPAR in various combinations to modulate trafficking, gating and synaptic strength2. However, their mechanisms of action are poorly understood. Here we determine cryo-electron microscopy structures of the heteromeric GluA1–GluA2 receptor assembled with both TARP-γ8 and CNIH2, the predominant AMPAR complex in the forebrain, in both resting and active states. Two TARP-γ8 and two CNIH2 subunits insert at distinct sites beneath the ligand-binding domains of the receptor, with site-specific lipids shaping each interaction and affecting the gating regulation of the AMPARs. Activation of the receptor leads to asymmetry between GluA1 and GluA2 along the ion conduction path and an outward expansion of the channel triggers counter-rotations of both auxiliary subunit pairs, promoting the active-state conformation. In addition, both TARP-γ8 and CNIH2 pivot towards the pore exit upon activation, extending their reach for cytoplasmic receptor elements. CNIH2 achieves this through its uniquely extended M2 helix, which has transformed this endoplasmic reticulum-export factor into a powerful AMPAR modulator that is capable of providing hippocampal pyramidal neurons with their integrative synaptic properties. }, author = {Zhang, Danyang and Watson, Jake and Matthews, Peter M. and Cais, Ondrej and Greger, Ingo H.}, issn = {1476-4687}, journal = {Nature}, pages = {454--458}, publisher = {Springer Nature}, title = {{Gating and modulation of a hetero-octameric AMPA glutamate receptor}}, doi = {10.1038/s41586-021-03613-0}, volume = {594}, year = {2021}, } @article{9550, abstract = {We prove that the energy of any eigenvector of a sum of several independent large Wigner matrices is equally distributed among these matrices with very high precision. This shows a particularly strong microcanonical form of the equipartition principle for quantum systems whose components are modelled by Wigner matrices. }, author = {Bao, Zhigang and Erdös, László and Schnelli, Kevin}, issn = {20505094}, journal = {Forum of Mathematics, Sigma}, publisher = {Cambridge University Press}, title = {{Equipartition principle for Wigner matrices}}, doi = {10.1017/fms.2021.38}, volume = {9}, year = {2021}, } @article{9558, abstract = {We show that turbulent dynamics that arise in simulations of the three-dimensional Navier--Stokes equations in a triply-periodic domain under sinusoidal forcing can be described as transient visits to the neighborhoods of unstable time-periodic solutions. Based on this description, we reduce the original system with more than 10^5 degrees of freedom to a 17-node Markov chain where each node corresponds to the neighborhood of a periodic orbit. The model accurately reproduces long-term averages of the system's observables as weighted sums over the periodic orbits. }, author = {Yalniz, Gökhan and Hof, Björn and Budanur, Nazmi B}, issn = {1079-7114}, journal = {Physical Review Letters}, number = {24}, publisher = {American Physical Society}, title = {{Coarse graining the state space of a turbulent flow using periodic orbits}}, doi = {10.1103/PhysRevLett.126.244502}, volume = {126}, year = {2021}, }