@article{17072, abstract = {The collapse of polypeptides is thought important to protein folding, aggregation, intrinsic disorder, and phase separation. However, whether polypeptide collapse is modulated in cells to control protein states is unclear. Here, using integrated protein manipulation and imaging, we show that the chaperonin GroEL-ES can accelerate the folding of proteins by strengthening their collapse. GroEL induces contractile forces in substrate chains, which draws them into the cavity and triggers a general compaction and discrete folding transitions, even for slow-folding proteins. This collapse enhancement is strongest in the nucleotide-bound states of GroEL and is aided by GroES binding to the cavity rim and by the amphiphilic C-terminal tails at the cavity bottom. Collapse modulation is distinct from other proposed GroEL-ES folding acceleration mechanisms, including steric confinement and misfold unfolding. Given the prevalence of collapse throughout the proteome, we conjecture that collapse modulation is more generally relevant within the protein quality control machinery.}, author = {Naqvi, Mohsin M. and Avellaneda Sarrió, Mario and Roth, Andrew and Koers, Eline J. and Roland, Antoine and Sunderlikova, Vanda and Kramer, Günter and Rye, Hays S. and Tans, Sander J.}, issn = {2375-2548}, journal = {Science Advances}, number = {9}, publisher = {American Association for the Advancement of Science}, title = {{Protein chain collapse modulation and folding stimulation by GroEL-ES}}, doi = {10.1126/sciadv.abl6293}, volume = {8}, year = {2022}, } @inbook{17075, abstract = {Disorders associated with the malfunction of amino acid transporters mainly affect the function of the intestine, kidney, brain, and liver. Mutations of brain amino acid transporters, for example, alter neuronal excitability (e.g., episodic ataxia due to SLC1A3 (EAAT1) defect and hyperekplexia due to SLC6A5 (GLYT2) deficiency) or brain development (SLC1A1 (EAAT3), SLC3A2/SLC7A5 (CD98hc/LAT1), and SLC1A4 (ASCT1) deficiencies). Mutations of renal and intestinal amino acid transporters SLC3A1/SLC7A9 (rBAT/b0,+AT) and SLC1A1 (EAAT3) cause renal problems (cystinuria and dicarboxylic aminoaciduria, respectively) and malabsorption that can affect whole-body homoeostasis (Hartnup disorder SLC6A19 (B0AT1), lysinuric protein intolerance SLC3A2/SLC7A7 (CD98hc/y+LAT1), and hyperdibasic aminoaciduria type 1). Mutations in the neuronal system A amino acid transporter SLC38A8 (SNAT8) cause eye developmental and visual defects. Inborn errors associated with mitochondrial SLC25 family members such as SLC25A12 (neuronal- and muscle-specific mitochondrial aspartate/glutamate transporter 1; AGC1) (global cerebral hypomyelination), SLC25A13 (aspartate/glutamate transporter 2) (citrin deficiency), SLC25A15 (ornithine-citrulline carrier 2) (homocitrullinuria, hyperornithinemia, and hyperammonemia syndrome), and SLC25A22 (mitochondrial glutamate/H+ symporter 1, GC1) (neonatal myoclonic epilepsy) will be dealt within Chap. 43 (defects of mitochondrial carriers).}, author = {Palacín, Manuel and Bröer, Stefan and Novarino, Gaia}, booktitle = {Physician's Guide to the Diagnosis, Treatment, and Follow-Up of Inherited Metabolic Diseases}, editor = {Blau, Nenad and Vici, Carlo Dionisi and Ferreira, Carlos R. and Vianey-Saban, Christine and van Karnebeek, Clara D.M.}, isbn = {9783030677268}, pages = {291--312}, publisher = {Springer Nature}, title = {{Amino Acid Transport Defects}}, doi = {10.1007/978-3-030-67727-5_18}, year = {2022}, } @article{17077, abstract = {Resolving a conjecture of Füredi from 1988, we prove that with high probability, the random graph 𝔾(𝑛, 1/2) admits a friendly bisection of its vertex set, i.e., a partition of its vertex set into two parts whose sizes differ by at most one in which 𝑛 − 𝑜(𝑛) vertices have more neighbours in their own part as across. Our proof is constructive, and in the process, we develop a new method to study stochastic processes driven by degree information in random graphs; this involves combining enumeration techniques with an abstract second moment argument.}, author = {Ferber, Asaf and Kwan, Matthew Alan and Narayanan, Bhargav and Sah, Ashwin and Sawhney, Mehtaab}, issn = {2692-3688}, journal = {Communications of the American Mathematical Society}, number = {10}, pages = {380--416}, publisher = {American Mathematical Society}, title = {{Friendly bisections of random graphs}}, doi = {10.1090/cams/13}, volume = {2}, year = {2022}, } @inproceedings{17084, abstract = {Given a graph where every vertex has exactly one labeled token, how can we most quickly execute a given permutation on the tokens? In (sequential) token swapping, the goal is to use the shortest possible sequence of swaps, each of which exchanges the tokens at the two endpoints of an edge of the graph. In parallel token swapping, the goal is to use the fewest rounds, each of which consists of one or more swaps on the edges of a matching. We prove that both of these problems remain NP-hard when the graph is restricted to be a tree. These token swapping problems have been studied by disparate groups of researchers in discrete mathematics, theoretical computer science, robot motion planning, game theory, and engineering. Previous work establishes NP-completeness on general graphs (for both problems), constant-factor approximation algorithms, and some poly-time exact algorithms for simple graph classes such as cliques, stars, paths, and cycles. Sequential and parallel token swapping on trees were first studied over thirty years ago (as "sorting with a transposition tree") and over twenty-five years ago (as "routing permutations via matchings"), yet their complexities were previously unknown. We also show limitations on approximation of sequential token swapping on trees: we identify a broad class of algorithms that encompass all three known polynomial-time algorithms that achieve the best known approximation factor (which is 2) and show that no such algorithm can achieve an approximation factor less than 2.}, author = {Aichholzer, Oswin and Demaine, Erik D. and Korman, Matias and Lubiw, Anna and Lynch, Jayson and Masárová, Zuzana and Rudoy, Mikhail and Vassilevska Williams, Virginia and Wein, Nicole}, booktitle = {30th Annual European Symposium on Algorithms}, location = {Berlin/Potsdam, Germany}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Hardness of token swapping on trees}}, doi = {10.4230/LIPIcs.ESA.2022.3}, volume = {244}, year = {2022}, } @inbook{17085, abstract = {Mosses are a cosmopolitan group of land plants, sister to vascular plants, with a high potential for molecular and cell biological research. The species Physcomitrium patens has helped gaining better understanding of the biological processes of the plant cell, and it has become a central system to understand water-to-land plant transition through 2D-to-3D growth transition, regulation of asymmetric cell division, shoot apical cell establishment and maintenance, phyllotaxis and regeneration. P. patens was the first fully sequenced moss in 2008, with the latest annotated release in 2018. It has been shown that many gene functions and networks are conserved in mosses when compared to angiosperms. Importantly, this model organism has a simplified and accessible body structure that facilitates close tracking in time and space with the support of live cell imaging set-ups and multiple reporter lines. This has become possible thanks to its fully established molecular toolkit, with highly efficient PEG-assisted, CRISPR/Cas9 and RNAi transformation and silencing protocols, among others. Here we provide examples on how mosses exhibit advantages over vascular plants to study several processes and their future potential to answer some other outstanding questions in plant cell biology.}, author = {Floriach-Clark, Jordi and Tang, Han and Willemsen, Viola}, booktitle = {Model Organisms in Plant Genetics}, editor = {Abdurakhmonov, Ibrokhim Y.}, isbn = {9781839697500}, publisher = {IntechOpen}, title = {{Mosses: Accessible Systems for Plant Development Studies}}, doi = {10.5772/intechopen.100535}, year = {2022}, } @inproceedings{17086, abstract = {We consider a high-dimensional mean estimation problem over a binary hidden Markov model, which illuminates the interplay between memory in data, sample size, dimension, and signal strength in statistical inference. In this model, an estimator observes n samples of a d-dimensional parameter vector θ∗∈Rd, multiplied by a random sign Si (1≤i≤n), and corrupted by isotropic standard Gaussian noise. The sequence of signs {Si}i∈[n]∈{−1,1}n is drawn from a stationary homogeneous Markov chain with flip probability δ∈[0,1/2]. As δ varies, this model smoothly interpolates two well-studied models: the Gaussian Location Model for which δ=0 and the Gaussian Mixture Model for which δ=1/2. Assuming that the estimator knows δ, we establish a nearly minimax optimal (up to logarithmic factors) estimation error rate, as a function of ∥θ∗∥,δ,d,n. We then provide an upper bound to the case of estimating δ, assuming a (possibly inaccurate) knowledge of θ∗. The bound is proved to be tight when θ∗ is an accurately known constant. These results are then combined to an algorithm which estimates θ∗ with δ unknown a priori, and theoretical guarantees on its error are stated.}, author = {Zhang, Yihan and Weinberger, Nir}, booktitle = {36th Conference on Neural Information Processing Systems}, isbn = {9781713871088}, location = {New Orleans, LA, United States}, publisher = {ML Research Press}, title = {{Mean estimation in high-dimensional binary Markov Gaussian mixture models}}, volume = {35}, year = {2022}, } @inproceedings{17088, abstract = {In this paper, we consider the problem of sparsifying BERT models, which are a key building block for natural language processing, in order to reduce their storage and computational cost. We introduce the Optimal BERT Surgeon (oBERT), an efficient and accurate pruning method based on approximate second-order information, which we show to yield state-of-the-art results in both stages of language tasks: pre-training and fine-tuning. Specifically, oBERT extends existing work on second-order pruning by allowing for pruning weight blocks, and is the first such method that is applicable at BERT scale. Second, we investigate compounding compression approaches to obtain highly compressed but accurate models for deployment on edge devices. These models significantly push boundaries of the current state-of-the-art sparse BERT models with respect to all metrics: model size, inference speed and task accuracy. For example, relative to the dense BERT-base, we obtain 10x model size compression with < 1% accuracy drop, 10x CPU-inference speedup with < 2% accuracy drop, and 29x CPU-inference speedup with < 7.5% accuracy drop. Our code, fully integrated with Transformers and SparseML, is available at https://github.com/neuralmagic/sparseml/tree/main/research/optimal_BERT_surgeon_oBERT.}, author = {Kurtic, Eldar and Campos, Daniel and Nguyen, Tuan and Frantar, Elias and Kurtz, Mark and Fineran, Benjamin and Goin, Michael and Alistarh, Dan-Adrian}, booktitle = {Proceedings of the 2022 Conference on Empirical Methods in Natural Language Processing}, location = {Abu Dhabi, United Arab Emirates}, pages = {4163--4181}, publisher = {Association for Computational Linguistics}, title = {{The optimal BERT surgeon: Scalable and accurate second-order pruning for large language models}}, doi = {10.18653/v1/2022.emnlp-main.279}, year = {2022}, } @unpublished{17157, abstract = {An action of a complex reductive group G on a smooth projective variety X is regular when all regular unipotent elements in G act with finitely many fixed points. Then the complex G-equivariant cohomology ring of X is isomorphic to the coordinate ring of a certain regular fixed point scheme. Examples include partial flag varieties, smooth Schubert varieties and Bott-Samelson varieties. We also show that a more general version of the fixed point scheme allows a generalisation to GKM spaces, such as toric varieties.}, author = {Hausel, Tamás and Rychlewicz, Kamil P}, booktitle = {arXiv}, title = {{Spectrum of equivariant cohomology as a fixed point scheme}}, doi = {10.48550/arXiv.2212.11836}, year = {2022}, } @article{18606, abstract = {Shear thickening is an intriguing rheological behaviour which consists in a brutal increase in the viscosity above a critical shear rate. It is famously encountered in suspensions of corn starch in water. Despite having been discovered in the early 1930's, its underlying mechanisms remained a mystery for a long time. In 2013–14, numerical and theoretical works [[1], [2], [3]] put forward a frictional transition scenario to explain this phenomenon. In this talk, I will present experimental work investigating this frictional transition scenario. In order to test the ideas of this model, one has to go further than standard rheological techniques, since they do not provide access to the frictional state of the measured suspension. I will thus focus on the techniques that we developed in order to evidence the frictional transition and link it to the presence of a shear-thickening behaviour.}, author = {Clavaud, Cécile}, issn = {2772-5693}, journal = {Science Talks}, publisher = {Elsevier}, title = {{Shear thickening in dense suspensions: an experimental study}}, doi = {10.1016/j.sctalk.2022.100038}, volume = {3}, year = {2022}, } @inbook{19984, abstract = {The first part of this paper is a survey of mathematical results on mirror symmetry phenomena between Hitchin systems for Langlands dual groups. The second part introduces and discusses multiplicity algebras of the Hitchin system on Lagrangians, and considers corresponding conjectural structures on their mirror.}, author = {Hausel, Tamás}, booktitle = {International Congress of Mathematicians}, isbn = {9783985470587}, location = {virtuel}, pages = {2228--2249}, publisher = {EMS Press}, title = {{Enhanced mirror symmetry for Langlands dual Hitchin systems}}, doi = {10.4171/icm2022/164}, year = {2022}, } @article{10016, abstract = {Auxin has always been at the forefront of research in plant physiology and development. Since the earliest contemplations by Julius von Sachs and Charles Darwin, more than a century-long struggle has been waged to understand its function. This largely reflects the failures, successes, and inevitable progress in the entire field of plant signaling and development. Here I present 14 stations on our long and sometimes mystical journey to understand auxin. These highlights were selected to give a flavor of the field and to show the scope and limits of our current knowledge. A special focus is put on features that make auxin unique among phytohormones, such as its dynamic, directional transport network, which integrates external and internal signals, including self-organizing feedback. Accented are persistent mysteries and controversies. The unexpected discoveries related to rapid auxin responses and growth regulation recently disturbed our contentment regarding understanding of the auxin signaling mechanism. These new revelations, along with advances in technology, usher us into a new, exciting era in auxin research. }, author = {Friml, Jiří}, issn = {1943-0264}, journal = {Cold Spring Harbor Perspectives in Biology}, number = {5}, publisher = {Cold Spring Harbor Laboratory Press}, title = {{Fourteen stations of auxin}}, doi = {10.1101/cshperspect.a039859}, volume = {14}, year = {2022}, } @article{10181, abstract = {In this article we study some geometric properties of proximally smooth sets. First, we introduce a modification of the metric projection and prove its existence. Then we provide an algorithm for constructing a rectifiable curve between two sufficiently close points of a proximally smooth set in a uniformly convex and uniformly smooth Banach space, with the moduli of smoothness and convexity of power type. Our algorithm returns a reasonably short curve between two sufficiently close points of a proximally smooth set, is iterative and uses our modification of the metric projection. We estimate the length of the constructed curve and its deviation from the segment with the same endpoints. These estimates coincide up to a constant factor with those for the geodesics in a proximally smooth set in a Hilbert space.}, author = {Ivanov, Grigory and Lopushanski, Mariana S.}, issn = {1877-0541}, journal = {Set-Valued and Variational Analysis}, number = {2}, pages = {657--675}, publisher = {Springer Nature}, title = {{Rectifiable curves in proximally smooth sets}}, doi = {10.1007/s11228-021-00612-1}, volume = {30}, year = {2022}, } @article{10182, abstract = {The mitochondrial oxidative phosphorylation system is central to cellular metabolism. It comprises five enzymatic complexes and two mobile electron carriers that work in a mitochondrial respiratory chain. By coupling the oxidation of reducing equivalents coming into mitochondria to the generation and subsequent dissipation of a proton gradient across the inner mitochondrial membrane, this electron transport chain drives the production of ATP, which is then used as a primary energy carrier in virtually all cellular processes. Minimal perturbations of the respiratory chain activity are linked to diseases; therefore, it is necessary to understand how these complexes are assembled and regulated and how they function. In this Review, we outline the latest assembly models for each individual complex, and we also highlight the recent discoveries indicating that the formation of larger assemblies, known as respiratory supercomplexes, originates from the association of the intermediates of individual complexes. We then discuss how recent cryo-electron microscopy structures have been key to answering open questions on the function of the electron transport chain in mitochondrial respiration and how supercomplexes and other factors, including metabolites, can regulate the activity of the single complexes. When relevant, we discuss how these mechanisms contribute to physiology and outline their deregulation in human diseases.}, author = {Vercellino, Irene and Sazanov, Leonid A}, issn = {1471-0080}, journal = {Nature Reviews Molecular Cell Biology}, pages = {141–161}, publisher = {Springer Nature}, title = {{The assembly, regulation and function of the mitochondrial respiratory chain}}, doi = {10.1038/s41580-021-00415-0}, volume = {23}, year = {2022}, } @article{10211, abstract = {We study the problem of recovering an unknown signal 𝑥𝑥 given measurements obtained from a generalized linear model with a Gaussian sensing matrix. Two popular solutions are based on a linear estimator 𝑥𝑥^L and a spectral estimator 𝑥𝑥^s. The former is a data-dependent linear combination of the columns of the measurement matrix, and its analysis is quite simple. The latter is the principal eigenvector of a data-dependent matrix, and a recent line of work has studied its performance. In this paper, we show how to optimally combine 𝑥𝑥^L and 𝑥𝑥^s. At the heart of our analysis is the exact characterization of the empirical joint distribution of (𝑥𝑥,𝑥𝑥^L,𝑥𝑥^s) in the high-dimensional limit. This allows us to compute the Bayes-optimal combination of 𝑥𝑥^L and 𝑥𝑥^s, given the limiting distribution of the signal 𝑥𝑥. When the distribution of the signal is Gaussian, then the Bayes-optimal combination has the form 𝜃𝑥𝑥^L+𝑥𝑥^s and we derive the optimal combination coefficient. In order to establish the limiting distribution of (𝑥𝑥,𝑥𝑥^L,𝑥𝑥^s), we design and analyze an approximate message passing algorithm whose iterates give 𝑥𝑥^L and approach 𝑥𝑥^s. Numerical simulations demonstrate the improvement of the proposed combination with respect to the two methods considered separately.}, author = {Mondelli, Marco and Thrampoulidis, Christos and Venkataramanan, Ramji}, issn = {1615-3383}, journal = {Foundations of Computational Mathematics}, keywords = {Applied Mathematics, Computational Theory and Mathematics, Computational Mathematics, Analysis}, number = {5}, pages = {1513--1566}, publisher = {Springer}, title = {{Optimal combination of linear and spectral estimators for generalized linear models}}, doi = {10.1007/s10208-021-09531-x}, volume = {22}, year = {2022}, } @article{10284, abstract = {Infections early in life can have enduring effects on an organism's development and immunity. In this study, we show that this equally applies to developing ‘superorganisms’––incipient social insect colonies. When we exposed newly mated Lasius niger ant queens to a low pathogen dose, their colonies grew more slowly than controls before winter, but reached similar sizes afterwards. Independent of exposure, queen hibernation survival improved when the ratio of pupae to workers was small. Queens that reared fewer pupae before worker emergence exhibited lower pathogen levels, indicating that high brood rearing efforts interfere with the ability of the queen's immune system to suppress pathogen proliferation. Early-life queen pathogen exposure also improved the immunocompetence of her worker offspring, as demonstrated by challenging the workers to the same pathogen a year later. Transgenerational transfer of the queen's pathogen experience to her workforce can hence durably reduce the disease susceptibility of the whole superorganism.}, author = {Casillas Perez, Barbara E and Pull, Christopher and Naiser, Filip and Naderlinger, Elisabeth and Matas, Jiri and Cremer, Sylvia}, issn = {1461-0248}, journal = {Ecology Letters}, number = {1}, pages = {89--100}, publisher = {Wiley}, title = {{Early queen infection shapes developmental dynamics and induces long-term disease protection in incipient ant colonies}}, doi = {10.1111/ele.13907}, volume = {25}, year = {2022}, } @article{10335, abstract = {Van der Holst and Pendavingh introduced a graph parameter σ, which coincides with the more famous Colin de Verdière graph parameter μ for small values. However, the definition of a is much more geometric/topological directly reflecting embeddability properties of the graph. They proved μ(G) ≤ σ(G) + 2 and conjectured σ(G) ≤ σ(G) for any graph G. We confirm this conjecture. As far as we know, this is the first topological upper bound on σ(G) which is, in general, tight. Equality between μ and σ does not hold in general as van der Holst and Pendavingh showed that there is a graph G with μ(G) ≤ 18 and σ(G) ≥ 20. We show that the gap appears at much smaller values, namely, we exhibit a graph H for which μ(H) ≥ 7 and σ(H) ≥ 8. We also prove that, in general, the gap can be large: The incidence graphs Hq of finite projective planes of order q satisfy μ(Hq) ∈ O(q3/2) and σ(Hq) ≥ q2.}, author = {Kaluza, Vojtech and Tancer, Martin}, issn = {0209-9683}, journal = {Combinatorica}, pages = {1317--1345}, publisher = {Springer Nature}, title = {{Even maps, the Colin de Verdière number and representations of graphs}}, doi = {10.1007/s00493-021-4443-7}, volume = {42}, year = {2022}, } @article{10411, abstract = {The phytohormone auxin is the major growth regulator governing tropic responses including gravitropism. Auxin build-up at the lower side of stimulated shoots promotes cell expansion, whereas in roots it inhibits growth, leading to upward shoot bending and downward root bending, respectively. Yet it remains an enigma how the same signal can trigger such opposite cellular responses. In this review, we discuss several recent unexpected insights into the mechanisms underlying auxin regulation of growth, challenging several existing models. We focus on the divergent mechanisms of apoplastic pH regulation in shoots and roots revisiting the classical Acid Growth Theory and discuss coordinated involvement of multiple auxin signaling pathways. From this emerges a more comprehensive, updated picture how auxin regulates growth.}, author = {Li, Lanxin and Gallei, Michelle C and Friml, Jiří}, issn = {1360-1385}, journal = {Trends in Plant Science}, number = {5}, pages = {440--449}, publisher = {Cell Press}, title = {{Bending to auxin: Fast acid growth for tropisms}}, doi = {10.1016/j.tplants.2021.11.006}, volume = {27}, year = {2022}, } @article{10413, abstract = {Motivated by the recent introduction of the intrinsic semilattice entropy, we study generalized quasi-metric semilattices and their categories. We investigate the relationship between these objects and generalized semivaluations, extending Nakamura and Schellekens' approach. Finally, we use this correspondence to compare the intrinsic semilattice entropy and the semigroup entropy induced in particular situations, like sets, torsion abelian groups and vector spaces.}, author = {Dikranjan, Dikran and Giordano Bruno, Anna and Künzi, Hans Peter and Zava, Nicolò and Toller, Daniele}, issn = {0166-8641}, journal = {Topology and its Applications}, publisher = {Elsevier}, title = {{Generalized quasi-metric semilattices}}, doi = {10.1016/j.topol.2021.107916}, volume = {309}, year = {2022}, } @article{10530, abstract = {Cell dispersion from a confined area is fundamental in a number of biological processes, including cancer metastasis. To date, a quantitative understanding of the interplay of single cell motility, cell proliferation, and intercellular contacts remains elusive. In particular, the role of E- and N-Cadherin junctions, central components of intercellular contacts, is still controversial. Combining theoretical modeling with in vitro observations, we investigate the collective spreading behavior of colonies of human cancer cells (T24). The spreading of these colonies is driven by stochastic single-cell migration with frequent transient cell-cell contacts. We find that inhibition of E- and N-Cadherin junctions decreases colony spreading and average spreading velocities, without affecting the strength of correlations in spreading velocities of neighboring cells. Based on a biophysical simulation model for cell migration, we show that the behavioral changes upon disruption of these junctions can be explained by reduced repulsive excluded volume interactions between cells. This suggests that in cancer cell migration, cadherin-based intercellular contacts sharpen cell boundaries leading to repulsive rather than cohesive interactions between cells, thereby promoting efficient cell spreading during collective migration. }, author = {Zisis, Themistoklis and Brückner, David and Brandstätter, Tom and Siow, Wei Xiong and d’Alessandro, Joseph and Vollmar, Angelika M. and Broedersz, Chase P. and Zahler, Stefan}, issn = {0006-3495}, journal = {Biophysical Journal}, keywords = {Biophysics}, number = {1}, pages = {P44--60}, publisher = {Elsevier}, title = {{Disentangling cadherin-mediated cell-cell interactions in collective cancer cell migration}}, doi = {10.1016/j.bpj.2021.12.006}, volume = {121}, year = {2022}, } @article{10537, abstract = {We consider the quantum many-body evolution of a homogeneous Fermi gas in three dimensions in the coupled semiclassical and mean-field scaling regime. We study a class of initial data describing collective particle–hole pair excitations on the Fermi ball. Using a rigorous version of approximate bosonization, we prove that the many-body evolution can be approximated in Fock space norm by a quasi-free bosonic evolution of the collective particle–hole excitations.}, author = {Benedikter, Niels P and Nam, Phan Thành and Porta, Marcello and Schlein, Benjamin and Seiringer, Robert}, issn = {1424-0637}, journal = {Annales Henri Poincaré}, number = {5}, pages = {1725--1764}, publisher = {Springer Nature}, title = {{Bosonization of fermionic many-body dynamics}}, doi = {10.1007/s00023-021-01136-y}, volume = {23}, year = {2022}, }