@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}, } @article{7791, abstract = {Extending a result of Milena Radnovic and Serge Tabachnikov, we establish conditionsfor two different non-symmetric norms to define the same billiard reflection law.}, author = {Akopyan, Arseniy and Karasev, Roman}, issn = {2199-6768}, journal = {European Journal of Mathematics}, number = {4}, pages = {1309 -- 1312}, publisher = {Springer Nature}, title = {{When different norms lead to same billiard trajectories?}}, doi = {10.1007/s40879-020-00405-0}, volume = {8}, year = {2022}, } @article{8286, abstract = {We consider the following dynamic load-balancing process: given an underlying graph G with n nodes, in each step t≥ 0, one unit of load is created, and placed at a randomly chosen graph node. In the same step, the chosen node picks a random neighbor, and the two nodes balance their loads by averaging them. We are interested in the expected gap between the minimum and maximum loads at nodes as the process progresses, and its dependence on n and on the graph structure. Variants of the above graphical balanced allocation process have been studied previously by Peres, Talwar, and Wieder [Peres et al., 2015], and by Sauerwald and Sun [Sauerwald and Sun, 2015]. These authors left as open the question of characterizing the gap in the case of cycle graphs in the dynamic case, where weights are created during the algorithm’s execution. For this case, the only known upper bound is of 𝒪(n log n), following from a majorization argument due to [Peres et al., 2015], which analyzes a related graphical allocation process. In this paper, we provide an upper bound of 𝒪 (√n log n) on the expected gap of the above process for cycles of length n. We introduce a new potential analysis technique, which enables us to bound the difference in load between k-hop neighbors on the cycle, for any k ≤ n/2. We complement this with a "gap covering" argument, which bounds the maximum value of the gap by bounding its value across all possible subsets of a certain structure, and recursively bounding the gaps within each subset. We provide analytical and experimental evidence that our upper bound on the gap is tight up to a logarithmic factor. }, author = {Alistarh, Dan-Adrian and Nadiradze, Giorgi and Sabour, Amirmojtaba}, issn = {1432-0541}, journal = {Algorithmica}, location = {Virtual, Online; Germany}, number = {4}, pages = {1007--1029}, publisher = {Springer Nature}, title = {{Dynamic averaging load balancing on cycles}}, doi = {10.1007/s00453-021-00905-9}, volume = {84}, year = {2022}, } @article{8538, abstract = {We prove some recent experimental observations of Dan Reznik concerning periodic billiard orbits in ellipses. For example, the sum of cosines of the angles of a periodic billiard polygon remains constant in the 1-parameter family of such polygons (that exist due to the Poncelet porism). In our proofs, we use geometric and complex analytic methods.}, author = {Akopyan, Arseniy and Schwartz, Richard and Tabachnikov, Serge}, issn = {2199-6768}, journal = {European Journal of Mathematics}, number = {4}, pages = {1313--1327}, publisher = {Springer Nature}, title = {{Billiards in ellipses revisited}}, doi = {10.1007/s40879-020-00426-9}, volume = {8}, year = {2022}, } @article{9199, abstract = {We associate a certain tensor product lattice to any primitive integer lattice and ask about its typical shape. These lattices are related to the tangent bundle of Grassmannians and their study is motivated by Peyre's programme on "freeness" for rational points of bounded height on Fano varieties.}, author = {Browning, Timothy D and Horesh, Tal and Wilsch, Florian Alexander}, issn = {1944-7833}, journal = {Algebra & Number Theory}, number = {10}, pages = {2385--2407}, publisher = {Mathematical Sciences Publishers}, title = {{Equidistribution and freeness on Grassmannians}}, doi = {10.2140/ant.2022.16.2385}, volume = {16}, year = {2022}, } @article{9336, abstract = {Mentorship is experience and/or knowledge‐based guidance. Mentors support, sponsor and advocate for mentees. Having one or more mentors when you seek advice can significantly influence and improve your research endeavours, well‐being and career development. Positive mentee–mentor relationships are vital for maintaining work–life balance and success in careers. Early‐career researchers (ECRs), in particular, can benefit from mentorship to navigate challenges in academic and nonacademic life and careers. Yet, strategies for selecting mentors and maintaining interactions with them are often underdiscussed within research environments. In this Words of Advice, we provide recommendations for ECRs to seek and manage mentorship interactions. Our article draws from our experiences as ECRs and published work, to provide suggestions for mentees to proactively promote beneficial mentorship interactions. The recommended practices highlight the importance of identifying mentorship needs, planning and selecting multiple and diverse mentors, setting goals, and maintaining constructive, and mutually beneficial working relationships with mentors.}, author = {Sarabipour, Sarvenaz and Hainer, Sarah J. and Arslan, Feyza N and De Winde, Charlotte M. and Furlong, Emily and Bielczyk, Natalia and Jadavji, Nafisa M. and Shah, Aparna P. and Davla, Sejal}, issn = {1742-4658}, journal = {FEBS Journal}, number = {6}, pages = {1374--1384}, publisher = {Wiley}, title = {{Building and sustaining mentor interactions as a mentee}}, doi = {10.1111/febs.15823}, volume = {289}, year = {2022}, } @article{9364, abstract = {Let t : Fp → C be a complex valued function on Fp. A classical problem in analytic number theory is bounding the maximum M(t) := max 0≤H

0 there exists a large subset of a ∈ F×p such that for kl a,1,p : x → e((ax+x) / p) we have M(kla,1,p) ≥ (1−ε/√2π + o(1)) log log p, as p→∞. Finally, we prove a result on the growth of the moments of {M (kla,1,p)}a∈F×p. 2020 Mathematics Subject Classification: 11L03, 11T23 (Primary); 14F20, 60F10 (Secondary).}, author = {Bonolis, Dante}, issn = {1469-8064}, journal = {Mathematical Proceedings of the Cambridge Philosophical Society}, number = {3}, pages = {563 -- 590}, publisher = {Cambridge University Press}, title = {{On the size of the maximum of incomplete Kloosterman sums}}, doi = {10.1017/S030500412100030X}, volume = {172}, year = {2022}, } @article{9365, abstract = {In this paper, we propose a new iterative method with alternated inertial step for solving split common null point problem in real Hilbert spaces. We obtain weak convergence of the proposed iterative algorithm. Furthermore, we introduce the notion of bounded linear regularity property for the split common null point problem and obtain the linear convergence property for the new algorithm under some mild assumptions. Finally, we provide some numerical examples to demonstrate the performance and efficiency of the proposed method.}, author = {Ogbuisi, Ferdinard U. and Shehu, Yekini and Yao, Jen Chih}, issn = {1029-4945}, journal = {Optimization}, number = {13}, pages = {3767--3795}, publisher = {Taylor and Francis}, title = {{Convergence analysis of new inertial method for the split common null point problem}}, doi = {10.1080/02331934.2021.1914035}, volume = {71}, year = {2022}, } @article{9469, abstract = {In this paper, we consider reflected three-operator splitting methods for monotone inclusion problems in real Hilbert spaces. To do this, we first obtain weak convergence analysis and nonasymptotic O(1/n) convergence rate of the reflected Krasnosel'skiĭ-Mann iteration for finding a fixed point of nonexpansive mapping in real Hilbert spaces under some seemingly easy to implement conditions on the iterative parameters. We then apply our results to three-operator splitting for the monotone inclusion problem and consequently obtain the corresponding convergence analysis. Furthermore, we derive reflected primal-dual algorithms for highly structured monotone inclusion problems. Some numerical implementations are drawn from splitting methods to support the theoretical analysis.}, author = {Iyiola, Olaniyi S. and Enyi, Cyril D. and Shehu, Yekini}, issn = {1029-4937}, journal = {Optimization Methods and Software}, number = {4}, pages = {1527--1565}, publisher = {Taylor and Francis}, title = {{Reflected three-operator splitting method for monotone inclusion problem}}, doi = {10.1080/10556788.2021.1924715}, volume = {37}, year = {2022}, } @article{9649, abstract = {Isomanifolds are the generalization of isosurfaces to arbitrary dimension and codimension, i.e. manifolds defined as the zero set of some multivariate vector-valued smooth function f : Rd → Rd−n. A natural (and efficient) way to approximate an isomanifold is to consider its Piecewise-Linear (PL) approximation based on a triangulation T of the ambient space Rd. In this paper, we give conditions under which the PL-approximation of an isomanifold is topologically equivalent to the isomanifold. The conditions are easy to satisfy in the sense that they can always be met by taking a sufficiently fine triangulation T . This contrasts with previous results on the triangulation of manifolds where, in arbitrary dimensions, delicate perturbations are needed to guarantee topological correctness, which leads to strong limitations in practice. We further give a bound on the Fréchet distance between the original isomanifold and its PL-approximation. Finally we show analogous results for the PL-approximation of an isomanifold with boundary.}, author = {Boissonnat, Jean-Daniel and Wintraecken, Mathijs}, issn = {1615-3383}, journal = {Foundations of Computational Mathematics }, pages = {967--1012}, publisher = {Springer Nature}, title = {{The topological correctness of PL approximations of isomanifolds}}, doi = {10.1007/s10208-021-09520-0}, volume = {22}, year = {2022}, } @article{9695, abstract = {Real-world data typically contain a large number of features that are often heterogeneous in nature, relevance, and also units of measure. When assessing the similarity between data points, one can build various distance measures using subsets of these features. Using the fewest features but still retaining sufficient information about the system is crucial in many statistical learning approaches, particularly when data are sparse. We introduce a statistical test that can assess the relative information retained when using two different distance measures, and determine if they are equivalent, independent, or if one is more informative than the other. This in turn allows finding the most informative distance measure out of a pool of candidates. The approach is applied to find the most relevant policy variables for controlling the Covid-19 epidemic and to find compact yet informative representations of atomic structures, but its potential applications are wide ranging in many branches of science.}, author = {Glielmo, Aldo and Zeni, Claudio and Cheng, Bingqing and Csanyi, Gabor and Laio, Alessandro}, issn = {2752-6542}, journal = {PNAS Nexus}, number = {2}, publisher = {Oxford University Press}, title = {{Ranking the information content of distance measures}}, doi = {10.1093/pnasnexus/pgac039}, volume = {1}, year = {2022}, } @article{9794, abstract = {Lymph nodes (LNs) comprise two main structural elements: fibroblastic reticular cells that form dedicated niches for immune cell interaction and capsular fibroblasts that build a shell around the organ. Immunological challenge causes LNs to increase more than tenfold in size within a few days. Here, we characterized the biomechanics of LN swelling on the cellular and organ scale. We identified lymphocyte trapping by influx and proliferation as drivers of an outward pressure force, causing fibroblastic reticular cells of the T-zone (TRCs) and their associated conduits to stretch. After an initial phase of relaxation, TRCs sensed the resulting strain through cell matrix adhesions, which coordinated local growth and remodeling of the stromal network. While the expanded TRC network readopted its typical configuration, a massive fibrotic reaction of the organ capsule set in and countered further organ expansion. Thus, different fibroblast populations mechanically control LN swelling in a multitier fashion.}, author = {Assen, Frank P and Abe, Jun and Hons, Miroslav and Hauschild, Robert and Shamipour, Shayan and Kaufmann, Walter and Costanzo, Tommaso and Krens, Gabriel and Brown, Markus and Ludewig, Burkhard and Hippenmeyer, Simon and Heisenberg, Carl-Philipp J and Weninger, Wolfgang and Hannezo, Edouard B and Luther, Sanjiv A. and Stein, Jens V. and Sixt, Michael K}, issn = {1529-2916}, journal = {Nature Immunology}, pages = {1246--1255}, publisher = {Springer Nature}, title = {{Multitier mechanics control stromal adaptations in swelling lymph nodes}}, doi = {10.1038/s41590-022-01257-4}, volume = {23}, year = {2022}, } @article{9955, abstract = {Neurons can change their classical neurotransmitters during ontogeny, sometimes going through stages of dual release. Here, we explored the development of the neurotransmitter identity of neurons of the avian nucleus isthmi parvocellularis (Ipc), whose axon terminals are retinotopically arranged in the optic tectum (TeO) and exert a focal gating effect upon the ascending transmission of retinal inputs. Although cholinergic and glutamatergic markers are both found in Ipc neurons and terminals of adult pigeons and chicks, the mRNA expression of the vesicular acetylcholine transporter, VAChT, is weak or absent. To explore how the Ipc neurotransmitter identity is established during ontogeny, we analyzed the expression of mRNAs coding for cholinergic (ChAT, VAChT, and CHT) and glutamatergic (VGluT2 and VGluT3) markers in chick embryos at different developmental stages. We found that between E12 and E18, Ipc neurons expressed all cholinergic mRNAs and also VGluT2 mRNA; however, from E16 through posthatch stages, VAChT mRNA expression was specifically diminished. Our ex vivo deposits of tracer crystals and intracellular filling experiments revealed that Ipc axons exhibit a mature paintbrush morphology late in development, experiencing marked morphological transformations during the period of presumptive dual vesicular transmitter release. Additionally, although ChAT protein immunoassays increasingly label the growing Ipc axon, this labeling was consistently restricted to sparse portions of the terminal branches. Combined, these results suggest that the synthesis of glutamate and acetylcholine, and their vesicular release, is complexly linked to the developmental processes of branching, growing and remodeling of these unique axons.}, author = {Reyes‐Pinto, Rosana and Ferrán, José L. and Vega Zuniga, Tomas A and González‐Cabrera, Cristian and Luksch, Harald and Mpodozis, Jorge and Puelles, Luis and Marín, Gonzalo J.}, issn = {1096-9861}, journal = {Journal of Comparative Neurology}, number = {2}, pages = {553--573}, publisher = {Wiley}, title = {{Change in the neurochemical signature and morphological development of the parvocellular isthmic projection to the avian tectum}}, doi = {10.1002/cne.25229}, volume = {530}, year = {2022}, } @article{9977, abstract = {For a Seifert fibered homology sphere X we show that the q-series invariant Zˆ0(X; q) introduced by Gukov-Pei-Putrov-Vafa, is a resummation of the Ohtsuki series Z0(X). We show that for every even k ∈ N there exists a full asymptotic expansion of Zˆ0(X; q) for q tending to e 2πi/k, and in particular that the limit Zˆ0(X; e 2πi/k) exists and is equal to the WRT quantum invariant τk(X). We show that the poles of the Borel transform of Z0(X) coincide with the classical complex Chern-Simons values, which we further show classifies the corresponding components of the moduli space of flat SL(2, C)-connections.}, author = {Mistegaard, William and Andersen, Jørgen Ellegaard}, issn = {1469-7750}, journal = {Journal of the London Mathematical Society}, number = {2}, pages = {709--764}, publisher = {Wiley}, title = {{Resurgence analysis of quantum invariants of Seifert fibered homology spheres}}, doi = {10.1112/jlms.12506}, volume = {105}, year = {2022}, } @article{10764, abstract = {Presynaptic glutamate replenishment is fundamental to brain function. In high activity regimes, such as epileptic episodes, this process is thought to rely on the glutamate-glutamine cycle between neurons and astrocytes. However the presence of an astroglial glutamine supply, as well as its functional relevance in vivo in the healthy brain remain controversial, partly due to a lack of tools that can directly examine glutamine transfer. Here, we generated a fluorescent probe that tracks glutamine in live cells, which provides direct visual evidence of an activity-dependent glutamine supply from astroglial networks to presynaptic structures under physiological conditions. This mobilization is mediated by connexin43, an astroglial protein with both gap-junction and hemichannel functions, and is essential for synaptic transmission and object recognition memory. Our findings uncover an indispensable recruitment of astroglial glutamine in physiological synaptic activity and memory via an unconventional pathway, thus providing an astrocyte basis for cognitive processes.}, author = {Cheung, Giselle T and Bataveljic, Danijela and Visser, Josien and Kumar, Naresh and Moulard, Julien and Dallérac, Glenn and Mozheiko, Daria and Rollenhagen, Astrid and Ezan, Pascal and Mongin, Cédric and Chever, Oana and Bemelmans, Alexis Pierre and Lübke, Joachim and Leray, Isabelle and Rouach, Nathalie}, issn = {2041-1723}, journal = {Nature Communications}, publisher = {Springer Nature}, title = {{Physiological synaptic activity and recognition memory require astroglial glutamine}}, doi = {10.1038/s41467-022-28331-7}, volume = {13}, year = {2022}, } @article{10763, abstract = {AMPA-type glutamate receptors (AMPARs) mediate rapid signal transmission at excitatory synapses in the brain. Glutamate binding to the receptor’s ligand-binding domains (LBDs) leads to ion channel activation and desensitization. Gating kinetics shape synaptic transmission and are strongly modulated by transmembrane AMPAR regulatory proteins (TARPs) through currently incompletely resolved mechanisms. Here, electron cryo-microscopy structures of the GluA1/2 TARP-γ8 complex, in both open and desensitized states (at 3.5 Å), reveal state-selective engagement of the LBDs by the large TARP-γ8 loop (‘β1’), elucidating how this TARP stabilizes specific gating states. We further show how TARPs alter channel rectification, by interacting with the pore helix of the selectivity filter. Lastly, we reveal that the Q/R-editing site couples the channel constriction at the filter entrance to the gate, and forms the major cation binding site in the conduction path. Our results provide a mechanistic framework of how TARPs modulate AMPAR gating and conductance.}, author = {Herguedas, Beatriz and Kohegyi, Bianka K. and Dohrke, Jan Niklas and Watson, Jake and Zhang, Danyang and Ho, Hinze and Shaikh, Saher A. and Lape, Remigijus and Krieger, James M. and Greger, Ingo H.}, issn = {2041-1723}, journal = {Nature Communications}, publisher = {Springer Nature}, title = {{Mechanisms underlying TARP modulation of the GluA1/2-γ8 AMPA receptor}}, doi = {10.1038/s41467-022-28404-7}, volume = {13}, year = {2022}, } @article{10769, abstract = {studiamos aspectos de Teoría Cuántica de Campos a densidad finita usando técnicas y conceptos de información cuántica. Nos enfocamos en fermiones de Dirac masivos con potencial químico en 1+1 dimensiones espacio-temporales. Usando la entropía de entrelazamiento en un intervalo, construimos la función c entrópica que es finita. Esta función c no es monótona, e incorpora el entrelazamiento de largo alcance proveniente de la superficie de Fermi. Motivados por trabajos previos de modelos en la red, calculamos numéricamente las entropías de Renyi y encontramos oscilaciones de Friedel. Seguidamente, analizamos la información mutua como una medida de correlación entre diferentes regiones. Usando una expansión de distancia grande desarrollada por Cardy, argumentamos que la información mutua detecta las correlaciones inducidas por la superficie de Fermi todavía al orden dominante en la expansión. Finalmente, analizamos la entropía relativa y sus generalizaciones de Renyi para distinguir estados con diferente carga. Encontramos que estados en diferentes sectores de superselección dan origen a un comportamiento super-extensivo en la entropía relativa.}, author = {Daguerre, L. and Torroba, G. and Medina Ramos, Raimel A and Solís, M.}, issn = {1850-1168}, journal = {Anales de la Asociacion Fisica Argentina}, number = {4}, pages = {93--98}, publisher = {Asociación Física Argentina}, title = {{Non relativistic quantum field theory: Dynamics and irreversibility}}, doi = {10.31527/analesafa.2021.32.4.93}, volume = {32}, year = {2022}, }