@article{179, abstract = {An asymptotic formula is established for the number of rational points of bounded anticanonical height which lie on a certain Zariski dense subset of the biprojective hypersurface x1y21+⋯+x4y24=0 in ℙ3×ℙ3. This confirms the modified Manin conjecture for this variety, in which the removal of a thin set of rational points is allowed.}, author = {Browning, Timothy D and Heath Brown, Roger}, issn = {0012-7094}, journal = {Duke Mathematical Journal}, number = {16}, pages = {3099--3165}, publisher = {Duke University Press}, title = {{Density of rational points on a quadric bundle in ℙ3×ℙ3}}, doi = {10.1215/00127094-2020-0031}, volume = {169}, year = {2020}, } @article{6649, abstract = {While Hartree–Fock theory is well established as a fundamental approximation for interacting fermions, it has been unclear how to describe corrections to it due to many-body correlations. In this paper we start from the Hartree–Fock state given by plane waves and introduce collective particle–hole pair excitations. These pairs can be approximately described by a bosonic quadratic Hamiltonian. We use Bogoliubov theory to construct a trial state yielding a rigorous Gell-Mann–Brueckner–type upper bound to the ground state energy. Our result justifies the random-phase approximation in the mean-field scaling regime, for repulsive, regular interaction potentials. }, author = {Benedikter, Niels P and Nam, Phan Thành and Porta, Marcello and Schlein, Benjamin and Seiringer, Robert}, issn = {1432-0916}, journal = {Communications in Mathematical Physics}, pages = {2097–2150}, publisher = {Springer Nature}, title = {{Optimal upper bound for the correlation energy of a Fermi gas in the mean-field regime}}, doi = {10.1007/s00220-019-03505-5}, volume = {374}, year = {2020}, } @article{6748, abstract = {Fitting a function by using linear combinations of a large number N of `simple' components is one of the most fruitful ideas in statistical learning. This idea lies at the core of a variety of methods, from two-layer neural networks to kernel regression, to boosting. In general, the resulting risk minimization problem is non-convex and is solved by gradient descent or its variants. Unfortunately, little is known about global convergence properties of these approaches. Here we consider the problem of learning a concave function f on a compact convex domain Ω⊆ℝd, using linear combinations of `bump-like' components (neurons). The parameters to be fitted are the centers of N bumps, and the resulting empirical risk minimization problem is highly non-convex. We prove that, in the limit in which the number of neurons diverges, the evolution of gradient descent converges to a Wasserstein gradient flow in the space of probability distributions over Ω. Further, when the bump width δ tends to 0, this gradient flow has a limit which is a viscous porous medium equation. Remarkably, the cost function optimized by this gradient flow exhibits a special property known as displacement convexity, which implies exponential convergence rates for N→∞, δ→0. Surprisingly, this asymptotic theory appears to capture well the behavior for moderate values of δ,N. Explaining this phenomenon, and understanding the dependence on δ,N in a quantitative manner remains an outstanding challenge.}, author = {Javanmard, Adel and Mondelli, Marco and Montanari, Andrea}, issn = {1941-7330}, journal = {Annals of Statistics}, number = {6}, pages = {3619--3642}, publisher = {Institute of Mathematical Statistics}, title = {{Analysis of a two-layer neural network via displacement convexity}}, doi = {10.1214/20-AOS1945}, volume = {48}, year = {2020}, } @article{6761, abstract = {In resource allocation games, selfish players share resources that are needed in order to fulfill their objectives. The cost of using a resource depends on the load on it. In the traditional setting, the players make their choices concurrently and in one-shot. That is, a strategy for a player is a subset of the resources. We introduce and study dynamic resource allocation games. In this setting, the game proceeds in phases. In each phase each player chooses one resource. A scheduler dictates the order in which the players proceed in a phase, possibly scheduling several players to proceed concurrently. The game ends when each player has collected a set of resources that fulfills his objective. The cost for each player then depends on this set as well as on the load on the resources in it – we consider both congestion and cost-sharing games. We argue that the dynamic setting is the suitable setting for many applications in practice. We study the stability of dynamic resource allocation games, where the appropriate notion of stability is that of subgame perfect equilibrium, study the inefficiency incurred due to selfish behavior, and also study problems that are particular to the dynamic setting, like constraints on the order in which resources can be chosen or the problem of finding a scheduler that achieves stability.}, author = {Avni, Guy and Henzinger, Thomas A and Kupferman, Orna}, issn = {03043975}, journal = {Theoretical Computer Science}, pages = {42--55}, publisher = {Elsevier}, title = {{Dynamic resource allocation games}}, doi = {10.1016/j.tcs.2019.06.031}, volume = {807}, year = {2020}, } @article{6796, abstract = {Nearby grid cells have been observed to express a remarkable degree of long-rangeorder, which is often idealized as extending potentially to infinity. Yet their strict peri-odic firing and ensemble coherence are theoretically possible only in flat environments, much unlike the burrows which rodents usually live in. Are the symmetrical, coherent grid maps inferred in the lab relevant to chart their way in their natural habitat? We consider spheres as simple models of curved environments and waiting for the appropriate experiments to be performed, we use our adaptation model to predict what grid maps would emerge in a network with the same type of recurrent connections, which on the plane produce coherence among the units. We find that on the sphere such connections distort the maps that single grid units would express on their own, and aggregate them into clusters. When remapping to a different spherical environment, units in each cluster maintain only partial coherence, similar to what is observed in disordered materials, such as spin glasses.}, author = {Stella, Federico and Urdapilleta, Eugenio and Luo, Yifan and Treves, Alessandro}, issn = {10981063}, journal = {Hippocampus}, number = {4}, pages = {302--313}, publisher = {Wiley}, title = {{Partial coherence and frustration in self-organizing spherical grids}}, doi = {10.1002/hipo.23144}, volume = {30}, year = {2020}, } @article{6808, abstract = {Super-resolution fluorescence microscopy has become an important catalyst for discovery in the life sciences. In STimulated Emission Depletion (STED) microscopy, a pattern of light drives fluorophores from a signal-emitting on-state to a non-signalling off-state. Only emitters residing in a sub-diffraction volume around an intensity minimum are allowed to fluoresce, rendering them distinguishable from the nearby, but dark fluorophores. STED routinely achieves resolution in the few tens of nanometers range in biological samples and is suitable for live imaging. Here, we review the working principle of STED and provide general guidelines for successful STED imaging. The strive for ever higher resolution comes at the cost of increased light burden. We discuss techniques to reduce light exposure and mitigate its detrimental effects on the specimen. These include specialized illumination strategies as well as protecting fluorophores from photobleaching mediated by high-intensity STED light. This opens up the prospect of volumetric imaging in living cells and tissues with diffraction-unlimited resolution in all three spatial dimensions.}, author = {Jahr, Wiebke and Velicky, Philipp and Danzl, Johann G}, issn = {1046-2023}, journal = {Methods}, number = {3}, pages = {27--41}, publisher = {Elsevier}, title = {{Strategies to maximize performance in STimulated Emission Depletion (STED) nanoscopy of biological specimens}}, doi = {10.1016/j.ymeth.2019.07.019}, volume = {174}, year = {2020}, } @article{6906, abstract = {We consider systems of bosons trapped in a box, in the Gross–Pitaevskii regime. We show that low-energy states exhibit complete Bose–Einstein condensation with an optimal bound on the number of orthogonal excitations. This extends recent results obtained in Boccato et al. (Commun Math Phys 359(3):975–1026, 2018), removing the assumption of small interaction potential.}, author = {Boccato, Chiara and Brennecke, Christian and Cenatiempo, Serena and Schlein, Benjamin}, issn = {1432-0916}, journal = {Communications in Mathematical Physics}, pages = {1311--1395}, publisher = {Springer}, title = {{Optimal rate for Bose-Einstein condensation in the Gross-Pitaevskii regime}}, doi = {10.1007/s00220-019-03555-9}, volume = {376}, year = {2020}, } @article{6918, abstract = {We consider the classic problem of Network Reliability. A network is given together with a source vertex, one or more target vertices, and probabilities assigned to each of the edges. Each edge of the network is operable with its associated probability and the problem is to determine the probability of having at least one source-to-target path that is entirely composed of operable edges. This problem is known to be NP-hard. We provide a novel scalable algorithm to solve the Network Reliability problem when the treewidth of the underlying network is small. We also show our algorithm’s applicability for real-world transit networks that have small treewidth, including the metro networks of major cities, such as London and Tokyo. Our algorithm leverages tree decompositions to shrink the original graph into much smaller graphs, for which reliability can be efficiently and exactly computed using a brute force method. To the best of our knowledge, this is the first exact algorithm for Network Reliability that can scale to handle real-world instances of the problem.}, author = {Goharshady, Amir Kafshdar and Mohammadi, Fatemeh}, issn = {09518320}, journal = {Reliability Engineering and System Safety}, publisher = {Elsevier}, title = {{An efficient algorithm for computing network reliability in small treewidth}}, doi = {10.1016/j.ress.2019.106665}, volume = {193}, year = {2020}, } @article{6944, abstract = {We study the problem of automatically detecting if a given multi-class classifier operates outside of its specifications (out-of-specs), i.e. on input data from a different distribution than what it was trained for. This is an important problem to solve on the road towards creating reliable computer vision systems for real-world applications, because the quality of a classifier’s predictions cannot be guaranteed if it operates out-of-specs. Previously proposed methods for out-of-specs detection make decisions on the level of single inputs. This, however, is insufficient to achieve low false positive rate and high false negative rates at the same time. In this work, we describe a new procedure named KS(conf), based on statistical reasoning. Its main component is a classical Kolmogorov–Smirnov test that is applied to the set of predicted confidence values for batches of samples. Working with batches instead of single samples allows increasing the true positive rate without negatively affecting the false positive rate, thereby overcoming a crucial limitation of single sample tests. We show by extensive experiments using a variety of convolutional network architectures and datasets that KS(conf) reliably detects out-of-specs situations even under conditions where other tests fail. It furthermore has a number of properties that make it an excellent candidate for practical deployment: it is easy to implement, adds almost no overhead to the system, works with any classifier that outputs confidence scores, and requires no a priori knowledge about how the data distribution could change.}, author = {Sun, Rémy and Lampert, Christoph}, issn = {1573-1405}, journal = {International Journal of Computer Vision}, number = {4}, pages = {970--995}, publisher = {Springer Nature}, title = {{KS(conf): A light-weight test if a multiclass classifier operates outside of its specifications}}, doi = {10.1007/s11263-019-01232-x}, volume = {128}, year = {2020}, } @article{6952, abstract = {We present a unified framework tackling two problems: class-specific 3D reconstruction from a single image, and generation of new 3D shape samples. These tasks have received considerable attention recently; however, most existing approaches rely on 3D supervision, annotation of 2D images with keypoints or poses, and/or training with multiple views of each object instance. Our framework is very general: it can be trained in similar settings to existing approaches, while also supporting weaker supervision. Importantly, it can be trained purely from 2D images, without pose annotations, and with only a single view per instance. We employ meshes as an output representation, instead of voxels used in most prior work. This allows us to reason over lighting parameters and exploit shading information during training, which previous 2D-supervised methods cannot. Thus, our method can learn to generate and reconstruct concave object classes. We evaluate our approach in various settings, showing that: (i) it learns to disentangle shape from pose and lighting; (ii) using shading in the loss improves performance compared to just silhouettes; (iii) when using a standard single white light, our model outperforms state-of-the-art 2D-supervised methods, both with and without pose supervision, thanks to exploiting shading cues; (iv) performance improves further when using multiple coloured lights, even approaching that of state-of-the-art 3D-supervised methods; (v) shapes produced by our model capture smooth surfaces and fine details better than voxel-based approaches; and (vi) our approach supports concave classes such as bathtubs and sofas, which methods based on silhouettes cannot learn.}, author = {Henderson, Paul M and Ferrari, Vittorio}, issn = {1573-1405}, journal = {International Journal of Computer Vision}, pages = {835--854}, publisher = {Springer Nature}, title = {{Learning single-image 3D reconstruction by generative modelling of shape, pose and shading}}, doi = {10.1007/s11263-019-01219-8}, volume = {128}, year = {2020}, } @article{6997, author = {Zhang, Yuzhou and Friml, Jiří}, issn = {1469-8137}, journal = {New Phytologist}, number = {3}, pages = {1049--1052}, publisher = {Wiley}, title = {{Auxin guides roots to avoid obstacles during gravitropic growth}}, doi = {10.1111/nph.16203}, volume = {225}, year = {2020}, } @article{7004, abstract = {We define an action of the (double of) Cohomological Hall algebra of Kontsevich and Soibelman on the cohomology of the moduli space of spiked instantons of Nekrasov. We identify this action with the one of the affine Yangian of gl(1). Based on that we derive the vertex algebra at the corner Wr1,r2,r3 of Gaiotto and Rapčák. We conjecture that our approach works for a big class of Calabi–Yau categories, including those associated with toric Calabi–Yau 3-folds.}, author = {Rapcak, Miroslav and Soibelman, Yan and Yang, Yaping and Zhao, Gufang}, issn = {1432-0916}, journal = {Communications in Mathematical Physics}, pages = {1803--1873}, publisher = {Springer Nature}, title = {{Cohomological Hall algebras, vertex algebras and instantons}}, doi = {10.1007/s00220-019-03575-5}, volume = {376}, year = {2020}, } @article{7033, abstract = {Removal of the Bax gene from mice completely protects the somas of retinal ganglion cells (RGCs) from apoptosis following optic nerve injury. This makes BAX a promising therapeutic target to prevent neurodegeneration. In this study, Bax+/− mice were used to test the hypothesis that lowering the quantity of BAX in RGCs would delay apoptosis following optic nerve injury. RGCs were damaged by performing optic nerve crush (ONC) and then immunostaining for phospho-cJUN, and quantitative PCR were used to monitor the status of the BAX activation mechanism in the months following injury. The apoptotic susceptibility of injured cells was directly tested by virally introducing GFP-BAX into Bax−/− RGCs after injury. The competency of quiescent RGCs to reactivate their BAX activation mechanism was tested by intravitreal injection of the JNK pathway agonist, anisomycin. Twenty-four weeks after ONC, Bax+/− mice had significantly less cell loss in their RGC layer than Bax+/+ mice 3 weeks after ONC. Bax+/− and Bax+/+ RGCs exhibited similar patterns of nuclear phospho-cJUN accumulation immediately after ONC, which persisted in Bax+/− RGCs for up to 7 weeks before abating. The transcriptional activation of BAX-activating genes was similar in Bax+/− and Bax+/+ RGCs following ONC. Intriguingly, cells deactivated their BAX activation mechanism between 7 and 12 weeks after crush. Introduction of GFP-BAX into Bax−/− cells at 4 weeks after ONC showed that these cells had a nearly normal capacity to activate this protein, but this capacity was lost 8 weeks after crush. Collectively, these data suggest that 8–12 weeks after crush, damaged cells no longer displayed increased susceptibility to BAX activation relative to their naïve counterparts. In this same timeframe, retinal glial activation and the signaling of the pro-apoptotic JNK pathway also abated. Quiescent RGCs did not show a timely reactivation of their JNK pathway following intravitreal injection with anisomycin. These findings demonstrate that lowering the quantity of BAX in RGCs is neuroprotective after acute injury. Damaged RGCs enter a quiescent state months after injury and are no longer responsive to an apoptotic stimulus. Quiescent RGCs will require rejuvenation to reacquire functionality.}, author = {Donahue, RJ and Maes, Margaret E and Grosser, JA and Nickells, RW}, issn = {1559-1182}, journal = {Molecular Neurobiology}, number = {2}, pages = {1070–1084}, publisher = {Springer Nature}, title = {{BAX-depleted retinal ganglion cells survive and become quiescent following optic nerve damage}}, doi = {10.1007/s12035-019-01783-7}, volume = {57}, year = {2020}, } @article{71, abstract = {We consider dynamical transport metrics for probability measures on discretisations of a bounded convex domain in ℝd. These metrics are natural discrete counterparts to the Kantorovich metric 𝕎2, defined using a Benamou-Brenier type formula. Under mild assumptions we prove an asymptotic upper bound for the discrete transport metric Wt in terms of 𝕎2, as the size of the mesh T tends to 0. However, we show that the corresponding lower bound may fail in general, even on certain one-dimensional and symmetric two-dimensional meshes. In addition, we show that the asymptotic lower bound holds under an isotropy assumption on the mesh, which turns out to be essentially necessary. This assumption is satisfied, e.g., for tilings by convex regular polygons, and it implies Gromov-Hausdorff convergence of the transport metric.}, author = {Gladbach, Peter and Kopfer, Eva and Maas, Jan}, issn = {10957154}, journal = {SIAM Journal on Mathematical Analysis}, number = {3}, pages = {2759--2802}, publisher = {Society for Industrial and Applied Mathematics}, title = {{Scaling limits of discrete optimal transport}}, doi = {10.1137/19M1243440}, volume = {52}, year = {2020}, } @article{7142, abstract = {The phytohormone auxin acts as an amazingly versatile coordinator of plant growth and development. With its morphogen-like properties, auxin controls sites and timing of differentiation and/or growth responses both, in quantitative and qualitative terms. Specificity in the auxin response depends largely on distinct modes of signal transmission, by which individual cells perceive and convert auxin signals into a remarkable diversity of responses. The best understood, or so-called canonical mechanism of auxin perception ultimately results in variable adjustments of the cellular transcriptome, via a short, nuclear signal transduction pathway. Additional findings that accumulated over decades implied that an additional, presumably, cell surface-based auxin perception mechanism mediates very rapid cellular responses and decisively contributes to the cell's overall hormonal response. Recent investigations into both, nuclear and cell surface auxin signalling challenged this assumed partition of roles for different auxin signalling pathways and revealed an unexpected complexity in transcriptional and non-transcriptional cellular responses mediated by auxin.}, author = {Gallei, Michelle C and Luschnig, Christian and Friml, Jiří}, issn = {1879-0356}, journal = {Current Opinion in Plant Biology}, number = {2}, pages = {43--49}, publisher = {Elsevier}, title = {{Auxin signalling in growth: Schrödinger's cat out of the bag}}, doi = {10.1016/j.pbi.2019.10.003}, volume = {53}, year = {2020}, } @article{7148, abstract = {In the cerebellum, GluD2 is exclusively expressed in Purkinje cells, where it regulates synapse formation and regeneration, synaptic plasticity, and motor learning. Delayed cognitive development in humans with GluD2 gene mutations suggests extracerebellar functions of GluD2. However, extracerebellar expression of GluD2 and its relationship with that of GluD1 are poorly understood. GluD2 mRNA and protein were widely detected, with relatively high levels observed in the olfactory glomerular layer, medial prefrontal cortex, cingulate cortex, retrosplenial granular cortex, olfactory tubercle, subiculum, striatum, lateral septum, anterodorsal thalamic nucleus, and arcuate hypothalamic nucleus. These regions were also enriched for GluD1, and many individual neurons coexpressed the two GluDs. In the retrosplenial granular cortex, GluD1 and GluD2 were selectively expressed at PSD‐95‐expressing glutamatergic synapses, and their coexpression on the same synapses was shown by SDS‐digested freeze‐fracture replica labeling. Biochemically, GluD1 and GluD2 formed coimmunoprecipitable complex formation in HEK293T cells and in the cerebral cortex and hippocampus. We further estimated the relative protein amount by quantitative immunoblotting using GluA2/GluD2 and GluA2/GluD1 chimeric proteins as standards for titration of GluD1 and GluD2 antibodies. Intriguingly, the relative amount of GluD2 was almost comparable to that of GluD1 in the postsynaptic density fraction prepared from the cerebral cortex and hippocampus. In contrast, GluD2 was overwhelmingly predominant in the cerebellum. Thus, we have determined the relative extracerebellar expression of GluD1 and GluD2 at regional, neuronal, and synaptic levels. These data provide a molecular–anatomical basis for possible competitive and cooperative interactions of GluD family members at synapses in various brain regions.}, author = {Nakamoto, Chihiro and Konno, Kohtarou and Miyazaki, Taisuke and Nakatsukasa, Ena and Natsume, Rie and Abe, Manabu and Kawamura, Meiko and Fukazawa, Yugo and Shigemoto, Ryuichi and Yamasaki, Miwako and Sakimura, Kenji and Watanabe, Masahiko}, issn = {1096-9861}, journal = {Journal of Comparative Neurology}, number = {6}, pages = {1003--1027}, publisher = {Wiley}, title = {{Expression mapping, quantification, and complex formation of GluD1 and GluD2 glutamate receptors in adult mouse brain}}, doi = {10.1002/cne.24792}, volume = {528}, year = {2020}, } @article{7149, abstract = {In recent years, many genes have been associated with chromatinopathies classified as “Cornelia de Lange Syndrome‐like.” It is known that the phenotype of these patients becomes less recognizable, overlapping to features characteristic of other syndromes caused by genetic variants affecting different regulators of chromatin structure and function. Therefore, Cornelia de Lange syndrome diagnosis might be arduous due to the seldom discordance between unexpected molecular diagnosis and clinical evaluation. Here, we review the molecular features of Cornelia de Lange syndrome, supporting the hypothesis that “CdLS‐like syndromes” are part of a larger “rare disease family” sharing multiple clinical features and common disrupted molecular pathways.}, author = {Avagliano, Laura and Parenti, Ilaria and Grazioli, Paolo and Di Fede, Elisabetta and Parodi, Chiara and Mariani, Milena and Kaiser, Frank J. and Selicorni, Angelo and Gervasini, Cristina and Massa, Valentina}, issn = {1399-0004}, journal = {Clinical Genetics}, number = {1}, pages = {3--11}, publisher = {Wiley}, title = {{Chromatinopathies: A focus on Cornelia de Lange syndrome}}, doi = {10.1111/cge.13674}, volume = {97}, year = {2020}, } @article{7160, abstract = {Nocturnal animals that rely on their visual system for foraging, mating, and navigation usually exhibit specific traits associated with living in scotopic conditions. Most nocturnal birds have several visual specializations, such as enlarged eyes and an increased orbital convergence. However, the actual role of binocular vision in nocturnal foraging is still debated. Nightjars (Aves: Caprimulgidae) are predators that actively pursue and capture flying insects in crepuscular and nocturnal environments, mainly using a conspicuous “sit-and-wait” tactic on which pursuit begins with an insect flying over the bird that sits on the ground. In this study, we describe the visual system of the band-winged nightjar (Systellura longirostris), with emphasis on anatomical features previously described as relevant for nocturnal birds. Orbit convergence, determined by 3D scanning of the skull, was 73.28°. The visual field, determined by ophthalmoscopic reflex, exhibits an area of maximum binocular overlap of 42°, and it is dorsally oriented. The eyes showed a nocturnal-like normalized corneal aperture/axial length index. Retinal ganglion cells (RGCs) were relatively scant, and distributed in an unusual oblique-band pattern, with higher concentrations in the ventrotemporal quadrant. Together, these results indicate that the band-winged nightjar exhibits a retinal specialization associated with the binocular area of their dorsal visual field, a relevant area for pursuit triggering and prey attacks. The RGC distribution observed is unusual among birds, but similar to that of some visually dependent insectivorous bats, suggesting that those features might be convergent in relation to feeding strategies.}, author = {Salazar, Juan Esteban and Severin, Daniel and Vega Zuniga, Tomas A and Fernández-Aburto, Pedro and Deichler, Alfonso and Sallaberry A., Michel and Mpodozis, Jorge}, issn = {1421-9743}, journal = {Brain, Behavior and Evolution}, number = {1-4}, pages = {27--36}, publisher = {Karger Publishers}, title = {{Anatomical specializations related to foraging in the visual system of a nocturnal insectivorous bird, the band-winged nightjar (Aves: Caprimulgiformes)}}, doi = {10.1159/000504162}, volume = {94}, year = {2020}, } @article{7161, abstract = {In this paper, we introduce an inertial projection-type method with different updating strategies for solving quasi-variational inequalities with strongly monotone and Lipschitz continuous operators in real Hilbert spaces. Under standard assumptions, we establish different strong convergence results for the proposed algorithm. Primary numerical experiments demonstrate the potential applicability of our scheme compared with some related methods in the literature.}, author = {Shehu, Yekini and Gibali, Aviv and Sagratella, Simone}, issn = {1573-2878}, journal = {Journal of Optimization Theory and Applications}, pages = {877–894}, publisher = {Springer Nature}, title = {{Inertial projection-type methods for solving quasi-variational inequalities in real Hilbert spaces}}, doi = {10.1007/s10957-019-01616-6}, volume = {184}, year = {2020}, } @article{7166, abstract = {In the living cell, we encounter a large variety of motile processes such as organelle transport and cytoskeleton remodeling. These processes are driven by motor proteins that generate force by transducing chemical free energy into mechanical work. In many cases, the molecular motors work in teams to collectively generate larger forces. Recent optical trapping experiments on small teams of cytoskeletal motors indicated that the collectively generated force increases with the size of the motor team but that this increase depends on the motor type and on whether the motors are studied in vitro or in vivo. Here, we use the theory of stochastic processes to describe the motion of N motors in a stationary optical trap and to compute the N-dependence of the collectively generated forces. We consider six distinct motor types, two kinesins, two dyneins, and two myosins. We show that the force increases always linearly with N but with a prefactor that depends on the performance of the single motor. Surprisingly, this prefactor increases for weaker motors with a lower stall force. This counter-intuitive behavior reflects the increased probability with which stronger motors detach from the filament during strain generation. Our theoretical results are in quantitative agreement with experimental data on small teams of kinesin-1 motors.}, author = {Ucar, Mehmet C and Lipowsky, Reinhard}, issn = {1530-6992}, journal = {Nano Letters}, number = {1}, pages = {669--676}, publisher = {American Chemical Society}, title = {{Collective force generation by molecular motors is determined by strain-induced unbinding}}, doi = {10.1021/acs.nanolett.9b04445}, volume = {20}, year = {2020}, }