@phdthesis{6681, abstract = {The first part of the thesis considers the computational aspects of the homotopy groups πd(X) of a topological space X. It is well known that there is no algorithm to decide whether the fundamental group π1(X) of a given finite simplicial complex X is trivial. On the other hand, there are several algorithms that, given a finite simplicial complex X that is simply connected (i.e., with π1(X) trivial), compute the higher homotopy group πd(X) for any given d ≥ 2. However, these algorithms come with a caveat: They compute the isomorphism type of πd(X), d ≥ 2 as an abstract finitely generated abelian group given by generators and relations, but they work with very implicit representations of the elements of πd(X). We present an algorithm that, given a simply connected space X, computes πd(X) and represents its elements as simplicial maps from suitable triangulations of the d-sphere Sd to X. For fixed d, the algorithm runs in time exponential in size(X), the number of simplices of X. Moreover, we prove that this is optimal: For every fixed d ≥ 2, we construct a family of simply connected spaces X such that for any simplicial map representing a generator of πd(X), the size of the triangulation of S d on which the map is defined, is exponential in size(X). In the second part of the thesis, we prove that the following question is algorithmically undecidable for d < ⌊3(k+1)/2⌋, k ≥ 5 and (k, d) ̸= (5, 7), which covers essentially everything outside the meta-stable range: Given a finite simplicial complex K of dimension k, decide whether there exists a piecewise-linear (i.e., linear on an arbitrarily fine subdivision of K) embedding f : K ↪→ Rd of K into a d-dimensional Euclidean space.}, author = {Zhechev, Stephan Y}, issn = {2663-337X}, pages = {104}, publisher = {Institute of Science and Technology Austria}, title = {{Algorithmic aspects of homotopy theory and embeddability}}, doi = {10.15479/AT:ISTA:6681}, year = {2019}, } @article{6710, abstract = {Sexual dimorphism in morphology, physiology or life history traits is common in dioecious plants at reproductive maturity, but it is typically inconspicuous or absent in juveniles. Although plants of different sexes probably begin to diverge in gene expression both before their reproduction commences and before dimorphism becomes readily apparent, to our knowledge transcriptome-wide differential gene expression has yet to be demonstrated for any angiosperm species.}, author = {Cossard, Guillaume and Toups, Melissa A and Pannell, John }, issn = {1095-8290}, journal = {Annals of botany}, number = {7}, pages = {1119--1131}, publisher = {Oxford University Press}, title = {{Sexual dimorphism and rapid turnover in gene expression in pre-reproductive seedlings of a dioecious herb}}, doi = {10.1093/aob/mcy183}, volume = {123}, year = {2019}, } @article{6713, abstract = {Evolutionary studies are often limited by missing data that are critical to understanding the history of selection. Selection experiments, which reproduce rapid evolution under controlled conditions, are excellent tools to study how genomes evolve under selection. Here we present a genomic dissection of the Longshanks selection experiment, in which mice were selectively bred over 20 generations for longer tibiae relative to body mass, resulting in 13% longer tibiae in two replicates. We synthesized evolutionary theory, genome sequences and molecular genetics to understand the selection response and found that it involved both polygenic adaptation and discrete loci of major effect, with the strongest loci tending to be selected in parallel between replicates. We show that selection may favor de-repression of bone growth through inactivating two limb enhancers of an inhibitor, Nkx3-2. Our integrative genomic analyses thus show that it is possible to connect individual base-pair changes to the overall selection response.}, author = {Castro, João Pl and Yancoskie, Michelle N. and Marchini, Marta and Belohlavy, Stefanie and Hiramatsu, Layla and Kučka, Marek and Beluch, William H. and Naumann, Ronald and Skuplik, Isabella and Cobb, John and Barton, Nicholas H and Rolian, Campbell and Chan, Yingguang Frank}, journal = {eLife}, publisher = {eLife Sciences Publications}, title = {{An integrative genomic analysis of the Longshanks selection experiment for longer limbs in mice}}, doi = {10.7554/eLife.42014}, volume = {8}, year = {2019}, } @article{6717, abstract = {With the recent publication by Silpe and Bassler (2019), considering phage detection of a bacterial quorum-sensing (QS) autoinducer, we now have as many as five examples of phage-associated intercellular communication (Table 1). Each potentially involves ecological inferences by phages as to concentrations of surrounding phage-infected or uninfected bacteria. While the utility of phage detection of bacterial QS molecules may at first glance appear to be straightforward, we suggest in this commentary that the underlying ecological explanation is unlikely to be simple.}, author = {Igler, Claudia and Abedon, Stephen T.}, journal = {Frontiers in Microbiology}, publisher = {Frontiers}, title = {{Commentary: A host-produced quorum-sensing autoinducer controls a phage lysis-lysogeny decision}}, doi = {10.3389/fmicb.2019.01171}, volume = {10}, year = {2019}, } @inproceedings{6725, abstract = {A Valued Constraint Satisfaction Problem (VCSP) provides a common framework that can express a wide range of discrete optimization problems. A VCSP instance is given by a finite set of variables, a finite domain of labels, and an objective function to be minimized. This function is represented as a sum of terms where each term depends on a subset of the variables. To obtain different classes of optimization problems, one can restrict all terms to come from a fixed set Γ of cost functions, called a language. Recent breakthrough results have established a complete complexity classification of such classes with respect to language Γ: if all cost functions in Γ satisfy a certain algebraic condition then all Γ-instances can be solved in polynomial time, otherwise the problem is NP-hard. Unfortunately, testing this condition for a given language Γ is known to be NP-hard. We thus study exponential algorithms for this meta-problem. We show that the tractability condition of a finite-valued language Γ can be tested in O(3‾√3|D|⋅poly(size(Γ))) time, where D is the domain of Γ and poly(⋅) is some fixed polynomial. We also obtain a matching lower bound under the Strong Exponential Time Hypothesis (SETH). More precisely, we prove that for any constant δ<1 there is no O(3‾√3δ|D|) algorithm, assuming that SETH holds.}, author = {Kolmogorov, Vladimir}, booktitle = {46th International Colloquium on Automata, Languages and Programming}, isbn = {978-3-95977-109-2}, issn = {1868-8969}, location = {Patras, Greece}, pages = {77:1--77:12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Testing the complexity of a valued CSP language}}, doi = {10.4230/LIPICS.ICALP.2019.77}, volume = {132}, year = {2019}, } @inbook{6726, abstract = {Randomness is an essential part of any secure cryptosystem, but many constructions rely on distributions that are not uniform. This is particularly true for lattice based cryptosystems, which more often than not make use of discrete Gaussian distributions over the integers. For practical purposes it is crucial to evaluate the impact that approximation errors have on the security of a scheme to provide the best possible trade-off between security and performance. Recent years have seen surprising results allowing to use relatively low precision while maintaining high levels of security. A key insight in these results is that sampling a distribution with low relative error can provide very strong security guarantees. Since floating point numbers provide guarantees on the relative approximation error, they seem a suitable tool in this setting, but it is not obvious which sampling algorithms can actually profit from them. While previous works have shown that inversion sampling can be adapted to provide a low relative error (Pöppelmann et al., CHES 2014; Prest, ASIACRYPT 2017), other works have called into question if this is possible for other sampling techniques (Zheng et al., Eprint report 2018/309). In this work, we consider all sampling algorithms that are popular in the cryptographic setting and analyze the relationship of floating point precision and the resulting relative error. We show that all of the algorithms either natively achieve a low relative error or can be adapted to do so.}, author = {Walter, Michael}, booktitle = {Progress in Cryptology – AFRICACRYPT 2019}, editor = {Buchmann, J and Nitaj, A and Rachidi, T}, isbn = {978-3-0302-3695-3}, issn = {0302-9743}, location = {Rabat, Morocco}, pages = {157--180}, publisher = {Springer Nature}, title = {{Sampling the integers with low relative error}}, doi = {10.1007/978-3-030-23696-0_9}, volume = {11627}, year = {2019}, } @article{6750, abstract = {Polar codes have gained extensive attention during the past few years and recently they have been selected for the next generation of wireless communications standards (5G). Successive-cancellation-based (SC-based) decoders, such as SC list (SCL) and SC flip (SCF), provide a reasonable error performance for polar codes at the cost of low decoding speed. Fast SC-based decoders, such as Fast-SSC, Fast-SSCL, and Fast-SSCF, identify the special constituent codes in a polar code graph off-line, produce a list of operations, store the list in memory, and feed the list to the decoder to decode the constituent codes in order efficiently, thus increasing the decoding speed. However, the list of operations is dependent on the code rate and as the rate changes, a new list is produced, making fast SC-based decoders not rate-flexible. In this paper, we propose a completely rate-flexible fast SC-based decoder by creating the list of operations directly in hardware, with low implementation complexity. We further propose a hardware architecture implementing the proposed method and show that the area occupation of the rate-flexible fast SC-based decoder in this paper is only 38% of the total area of the memory-based base-line decoder when 5G code rates are supported. }, author = {Hashemi, Seyyed Ali and Condo, Carlo and Mondelli, Marco and Gross, Warren J}, issn = {1053587X}, journal = {IEEE Transactions on Signal Processing}, number = {22}, publisher = {IEEE}, title = {{Rate-flexible fast polar decoders}}, doi = {10.1109/TSP.2019.2944738}, volume = {67}, year = {2019}, } @article{6752, abstract = {Two-player games on graphs are widely studied in formal methods, as they model the interaction between a system and its environment. The game is played by moving a token throughout a graph to produce an infinite path. There are several common modes to determine how the players move the token through the graph; e.g., in turn-based games the players alternate turns in moving the token. We study the bidding mode of moving the token, which, to the best of our knowledge, has never been studied in infinite-duration games. The following bidding rule was previously defined and called Richman bidding. Both players have separate budgets, which sum up to 1. In each turn, a bidding takes place: Both players submit bids simultaneously, where a bid is legal if it does not exceed the available budget, and the higher bidder pays his bid to the other player and moves the token. The central question studied in bidding games is a necessary and sufficient initial budget for winning the game: a threshold budget in a vertex is a value t ∈ [0, 1] such that if Player 1’s budget exceeds t, he can win the game; and if Player 2’s budget exceeds 1 − t, he can win the game. Threshold budgets were previously shown to exist in every vertex of a reachability game, which have an interesting connection with random-turn games—a sub-class of simple stochastic games in which the player who moves is chosen randomly. We show the existence of threshold budgets for a qualitative class of infinite-duration games, namely parity games, and a quantitative class, namely mean-payoff games. The key component of the proof is a quantitative solution to strongly connected mean-payoff bidding games in which we extend the connection with random-turn games to these games, and construct explicit optimal strategies for both players.}, author = {Avni, Guy and Henzinger, Thomas A and Chonev, Ventsislav K}, issn = {1557735X}, journal = {Journal of the ACM}, number = {4}, publisher = {ACM}, title = {{Infinite-duration bidding games}}, doi = {10.1145/3340295}, volume = {66}, year = {2019}, } @article{6755, abstract = {Differentiated sex chromosomes are accompanied by a difference in gene dose between X/Z-specific and autosomal genes. At the transcriptomic level, these sex-linked genes can lead to expression imbalance, or gene dosage can be compensated by epigenetic mechanisms and results into expression level equalization. Schistosoma mansoni has been previously described as a ZW species (i.e., female heterogamety, in opposition to XY male heterogametic species) with a partial dosage compensation, but underlying mechanisms are still unexplored. Here, we combine transcriptomic (RNA-Seq) and epigenetic data (ChIP-Seq against H3K4me3, H3K27me3,andH4K20me1histonemarks) in free larval cercariae and intravertebrate parasitic stages. For the first time, we describe differences in dosage compensation status in ZW females, depending on the parasitic status: free cercariae display global dosage compensation, whereas intravertebrate stages show a partial dosage compensation. We also highlight regional differences of gene expression along the Z chromosome in cercariae, but not in the intravertebrate stages. Finally, we feature a consistent permissive chromatin landscape of the Z chromosome in both sexes and stages. We argue that dosage compensation in schistosomes is characterized by chromatin remodeling mechanisms in the Z-specific region.}, author = {Picard, Marion A L and Vicoso, Beatriz and Roquis, David and Bulla, Ingo and Augusto, Ronaldo C. and Arancibia, Nathalie and Grunau, Christoph and Boissier, Jérôme and Cosseau, Céline}, issn = {1759-6653}, journal = {Genome biology and evolution}, number = {7}, pages = {1909--1922}, publisher = {Oxford Academic Press}, title = {{Dosage compensation throughout the Schistosoma mansoni lifecycle: Specific chromatin landscape of the Z chromosome}}, doi = {10.1093/gbe/evz133}, volume = {11}, year = {2019}, } @article{6756, abstract = {We study the topology generated by the temperature fluctuations of the cosmic microwave background (CMB) radiation, as quantified by the number of components and holes, formally given by the Betti numbers, in the growing excursion sets. We compare CMB maps observed by the Planck satellite with a thousand simulated maps generated according to the ΛCDM paradigm with Gaussian distributed fluctuations. The comparison is multi-scale, being performed on a sequence of degraded maps with mean pixel separation ranging from 0.05 to 7.33°. The survey of the CMB over 𝕊2 is incomplete due to obfuscation effects by bright point sources and other extended foreground objects like our own galaxy. To deal with such situations, where analysis in the presence of “masks” is of importance, we introduce the concept of relative homology. The parametric χ2-test shows differences between observations and simulations, yielding p-values at percent to less than permil levels roughly between 2 and 7°, with the difference in the number of components and holes peaking at more than 3σ sporadically at these scales. The highest observed deviation between the observations and simulations for b0 and b1 is approximately between 3σ and 4σ at scales of 3–7°. There are reports of mildly unusual behaviour of the Euler characteristic at 3.66° in the literature, computed from independent measurements of the CMB temperature fluctuations by Planck’s predecessor, the Wilkinson Microwave Anisotropy Probe (WMAP) satellite. The mildly anomalous behaviour of the Euler characteristic is phenomenologically related to the strongly anomalous behaviour of components and holes, or the zeroth and first Betti numbers, respectively. Further, since these topological descriptors show consistent anomalous behaviour over independent measurements of Planck and WMAP, instrumental and systematic errors may be an unlikely source. These are also the scales at which the observed maps exhibit low variance compared to the simulations, and approximately the range of scales at which the power spectrum exhibits a dip with respect to the theoretical model. Non-parametric tests show even stronger differences at almost all scales. Crucially, Gaussian simulations based on power-spectrum matching the characteristics of the observed dipped power spectrum are not able to resolve the anomaly. Understanding the origin of the anomalies in the CMB, whether cosmological in nature or arising due to late-time effects, is an extremely challenging task. Regardless, beyond the trivial possibility that this may still be a manifestation of an extreme Gaussian case, these observations, along with the super-horizon scales involved, may motivate the study of primordial non-Gaussianity. Alternative scenarios worth exploring may be models with non-trivial topology, including topological defect models.}, author = {Pranav, Pratyush and Adler, Robert J. and Buchert, Thomas and Edelsbrunner, Herbert and Jones, Bernard J.T. and Schwartzman, Armin and Wagner, Hubert and Van De Weygaert, Rien}, issn = {14320746}, journal = {Astronomy and Astrophysics}, publisher = {EDP Sciences}, title = {{Unexpected topology of the temperature fluctuations in the cosmic microwave background}}, doi = {10.1051/0004-6361/201834916}, volume = {627}, year = {2019}, } @article{6759, abstract = {We consider the graph class Grounded-L corresponding to graphs that admit an intersection representation by L-shaped curves, where additionally the topmost points of each curve are assumed to belong to a common horizontal line. We prove that Grounded-L graphs admit an equivalent characterisation in terms of vertex ordering with forbidden patterns. We also compare this class to related intersection classes, such as the grounded segment graphs, the monotone L-graphs (a.k.a. max point-tolerance graphs), or the outer-1-string graphs. We give constructions showing that these classes are all distinct and satisfy only trivial or previously known inclusions.}, author = {Jelínek, Vít and Töpfer, Martin}, issn = {10778926}, journal = {Electronic Journal of Combinatorics}, number = {3}, publisher = {Electronic Journal of Combinatorics}, title = {{On grounded L-graphs and their relatives}}, doi = {10.37236/8096}, volume = {26}, year = {2019}, } @article{6762, abstract = {We present and study novel optimal control problems motivated by the search for photovoltaic materials with high power-conversion efficiency. The material must perform the first step: convert light (photons) into electronic excitations. We formulate various desirable properties of the excitations as mathematical control goals at the Kohn-Sham-DFT level of theory, with the control being given by the nuclear charge distribution. We prove that nuclear distributions exist which give rise to optimal HOMO-LUMO excitations, and present illustrative numerical simulations for 1D finite nanocrystals. We observe pronounced goal-dependent features such as large electron-hole separation, and a hierarchy of length scales: internal HOMO and LUMO wavelengths < atomic spacings < (irregular) fluctuations of the doping profiles < system size.}, author = {Friesecke, Gero and Kniely, Michael}, issn = {15403467}, journal = {Multiscale Modeling and Simulation}, number = {3}, pages = {926--947}, publisher = {SIAM}, title = {{New optimal control problems in density functional theory motivated by photovoltaics}}, doi = {10.1137/18M1207272}, volume = {17}, year = {2019}, } @article{6763, abstract = {When grape-sized aqueous dimers are irradiated in a microwave oven, an intense electromagnetic hotspot forms at their point of contact, often igniting a plasma. Here we show that this irradiation can result in the injection of mechanical energy. By examining irradiated hydrogel dimers through high-speed imaging, we find that they repeatedly bounce off of each other while irradiated. We determine that an average of 1 lJ of mechanical energy is injected into the pair during each collision. Furthermore, a characteristic high-pitched audio signal is found to accompany each collision. We show that both the audio signal and the energy injection arise via an interplay between vaporization and elastic deformations in the region of contact, the so-called ‘elastic Liedenfrost effect’. Our results establish a novel, non-contact method of injecting mechanical energy into soft matter systems, suggesting application in fields such as soft robotics.}, author = {Khattak, Hamza K. and Waitukaitis, Scott R and Slepkov, Aaron D.}, issn = {17446848}, journal = {Soft Matter}, number = {29}, pages = {5804--5809}, publisher = {Royal Society of Chemistry}, title = {{Microwave induced mechanical activation of hydrogel dimers}}, doi = {10.1039/c9sm00756c}, volume = {15}, year = {2019}, } @article{6778, abstract = {An important adaptation during colonization of land by plants is gravitropic growth of roots, which enabled roots to reach water and nutrients, and firmly anchor plants in the ground. Here we provide insights into the evolution of an efficient root gravitropic mechanism in the seed plants. Architectural innovation, with gravity perception constrained in the root tips along with a shootward transport route for the phytohormone auxin, appeared only upon the emergence of seed plants. Interspecies complementation and protein domain swapping revealed functional innovations within the PIN family of auxin transporters leading to the evolution of gravitropism-specific PINs. The unique apical/shootward subcellular localization of PIN proteins is the major evolutionary innovation that connected the anatomically separated sites of gravity perception and growth response via the mobile auxin signal. We conclude that the crucial anatomical and functional components emerged hand-in-hand to facilitate the evolution of fast gravitropic response, which is one of the major adaptations of seed plants to dry land.}, author = {Zhang, Yuzhou and Xiao, G and Wang, X and Zhang, Xixi and Friml, Jiří}, issn = {2041-1723}, journal = {Nature Communications}, publisher = {Springer Nature}, title = {{Evolution of fast root gravitropism in seed plants}}, doi = {10.1038/s41467-019-11471-8}, volume = {10}, year = {2019}, } @article{6779, abstract = {Recent studies suggest that unstable recurrent solutions of the Navier-Stokes equation provide new insights into dynamics of turbulent flows. In this study, we compute an extensive network of dynamical connections between such solutions in a weakly turbulent quasi-two-dimensional Kolmogorov flow that lies in the inversion symmetric subspace. In particular, we find numerous isolated heteroclinic connections between different types of solutions—equilibria, periodic, and quasiperiodic orbits—as well as continua of connections forming higher-dimensional connecting manifolds. We also compute a homoclinic connection of a periodic orbit and provide strong evidence that the associated homoclinic tangle forms the chaotic repeller that underpins transient turbulence in the symmetric subspace.}, author = {Suri, Balachandra and Pallantla, Ravi Kumar and Schatz, Michael F. and Grigoriev, Roman O.}, issn = {2470-0053}, journal = {Physical Review E}, number = {1}, publisher = {American Physical Society}, title = {{Heteroclinic and homoclinic connections in a Kolmogorov-like flow}}, doi = {10.1103/physreve.100.013112}, volume = {100}, year = {2019}, } @inproceedings{6780, abstract = {In this work, we consider the almost-sure termination problem for probabilistic programs that asks whether a given probabilistic program terminates with probability 1. Scalable approaches for program analysis often rely on modularity as their theoretical basis. In non-probabilistic programs, the classical variant rule (V-rule) of Floyd-Hoare logic provides the foundation for modular analysis. Extension of this rule to almost-sure termination of probabilistic programs is quite tricky, and a probabilistic variant was proposed in [16]. While the proposed probabilistic variant cautiously addresses the key issue of integrability, we show that the proposed modular rule is still not sound for almost-sure termination of probabilistic programs. Besides establishing unsoundness of the previous rule, our contributions are as follows: First, we present a sound modular rule for almost-sure termination of probabilistic programs. Our approach is based on a novel notion of descent supermartingales. Second, for algorithmic approaches, we consider descent supermartingales that are linear and show that they can be synthesized in polynomial time. Finally, we present experimental results on a variety of benchmarks and several natural examples that model various types of nested while loops in probabilistic programs and demonstrate that our approach is able to efficiently prove their almost-sure termination property}, author = {Huang, Mingzhang and Fu, Hongfei and Chatterjee, Krishnendu and Goharshady, Amir Kafshdar}, booktitle = {Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications }, location = {Athens, Greece}, publisher = {ACM}, title = {{Modular verification for almost-sure termination of probabilistic programs}}, doi = {10.1145/3360555}, volume = {3}, year = {2019}, } @article{6784, abstract = {Mathematical models have been used successfully at diverse scales of biological organization, ranging from ecology and population dynamics to stochastic reaction events occurring between individual molecules in single cells. Generally, many biological processes unfold across multiple scales, with mutations being the best studied example of how stochasticity at the molecular scale can influence outcomes at the population scale. In many other contexts, however, an analogous link between micro- and macro-scale remains elusive, primarily due to the challenges involved in setting up and analyzing multi-scale models. Here, we employ such a model to investigate how stochasticity propagates from individual biochemical reaction events in the bacterial innate immune system to the ecology of bacteria and bacterial viruses. We show analytically how the dynamics of bacterial populations are shaped by the activities of immunity-conferring enzymes in single cells and how the ecological consequences imply optimal bacterial defense strategies against viruses. Our results suggest that bacterial populations in the presence of viruses can either optimize their initial growth rate or their population size, with the first strategy favoring simple immunity featuring a single restriction modification system and the second strategy favoring complex bacterial innate immunity featuring several simultaneously active restriction modification systems.}, author = {Ruess, Jakob and Pleska, Maros and Guet, Calin C and Tkačik, Gašper}, issn = {1553-7358}, journal = {PLoS Computational Biology}, number = {7}, publisher = {Public Library of Science}, title = {{Molecular noise of innate immunity shapes bacteria-phage ecologies}}, doi = {10.1371/journal.pcbi.1007168}, volume = {15}, year = {2019}, } @article{6786, abstract = {Dipolar coupling plays a fundamental role in the interaction between electrically or magnetically polarized species such as magnetic atoms and dipolar molecules in a gas or dipolar excitons in the solid state. Unlike Coulomb or contactlike interactions found in many atomic, molecular, and condensed-matter systems, this interaction is long-ranged and highly anisotropic, as it changes from repulsive to attractive depending on the relative positions and orientation of the dipoles. Because of this unique property, many exotic, symmetry-breaking collective states have been recently predicted for cold dipolar gases, but only a few have been experimentally detected and only in dilute atomic dipolar Bose-Einstein condensates. Here, we report on the first observation of attractive dipolar coupling between excitonic dipoles using a new design of stacked semiconductor bilayers. We show that the presence of a dipolar exciton fluid in one bilayer modifies the spatial distribution and increases the binding energy of excitonic dipoles in a vertically remote layer. The binding energy changes are explained using a many-body polaron model describing the deformation of the exciton cloud due to its interaction with a remote dipolar exciton. The surprising nonmonotonic dependence on the cloud density indicates the important role of dipolar correlations, which is unique to dense, strongly interacting dipolar solid-state systems. Our concept provides a route for the realization of dipolar lattices with strong anisotropic interactions in semiconductor systems, which open the way for the observation of theoretically predicted new and exotic collective phases, as well as for engineering and sensing their collective excitations.}, author = {Hubert, Colin and Baruchi, Yifat and Mazuz-Harpaz, Yotam and Cohen, Kobi and Biermann, Klaus and Lemeshko, Mikhail and West, Ken and Pfeiffer, Loren and Rapaport, Ronen and Santos, Paulo}, issn = {2160-3308}, journal = {Physical Review X}, number = {2}, publisher = {American Physical Society}, title = {{Attractive dipolar coupling between stacked exciton fluids}}, doi = {10.1103/PhysRevX.9.021026}, volume = {9}, year = {2019}, } @article{6788, abstract = {We consider the Nelson model with ultraviolet cutoff, which describes the interaction between non-relativistic particles and a positive or zero mass quantized scalar field. We take the non-relativistic particles to obey Fermi statistics and discuss the time evolution in a mean-field limit of many fermions. In this case, the limit is known to be also a semiclassical limit. We prove convergence in terms of reduced density matrices of the many-body state to a tensor product of a Slater determinant with semiclassical structure and a coherent state, which evolve according to a fermionic version of the Schrödinger–Klein–Gordon equations.}, author = {Leopold, Nikolai K and Petrat, Sören P}, issn = {1424-0661}, journal = {Annales Henri Poincare}, number = {10}, pages = {3471–3508}, publisher = {Springer Nature}, title = {{Mean-field dynamics for the Nelson model with fermions}}, doi = {10.1007/s00023-019-00828-w}, volume = {20}, year = {2019}, } @article{6793, abstract = {The Regge symmetry is a set of remarkable relations between two tetrahedra whose edge lengths are related in a simple fashion. It was first discovered as a consequence of an asymptotic formula in mathematical physics. Here, we give a simple geometric proof of Regge symmetries in Euclidean, spherical, and hyperbolic geometry.}, author = {Akopyan, Arseniy and Izmestiev, Ivan}, issn = {14692120}, journal = {Bulletin of the London Mathematical Society}, number = {5}, pages = {765--775}, publisher = {London Mathematical Society}, title = {{The Regge symmetry, confocal conics, and the Schläfli formula}}, doi = {10.1112/blms.12276}, volume = {51}, year = {2019}, }