@article{11740, abstract = {We consider a generalised model of a random simplicial complex, which arises from a random hypergraph. Our model is generated by taking the downward-closure of a non-uniform binomial random hypergraph, in which for each k, each set of k+1 vertices forms an edge with some probability pk independently. As a special case, this contains an extensively studied model of a (uniform) random simplicial complex, introduced by Meshulam and Wallach [Random Structures & Algorithms 34 (2009), no. 3, pp. 408–417]. We consider a higher-dimensional notion of connectedness on this new model according to the vanishing of cohomology groups over an arbitrary abelian group R. We prove that this notion of connectedness displays a phase transition and determine the threshold. We also prove a hitting time result for a natural process interpretation, in which simplices and their downward-closure are added one by one. In addition, we determine the asymptotic behaviour of cohomology groups inside the critical window around the time of the phase transition.}, author = {Cooley, Oliver and Del Giudice, Nicola and Kang, Mihyun and Sprüssel, Philipp}, issn = {1077-8926}, journal = {Electronic Journal of Combinatorics}, number = {3}, publisher = {Electronic Journal of Combinatorics}, title = {{Phase transition in cohomology groups of non-uniform random simplicial complexes}}, doi = {10.37236/10607}, volume = {29}, year = {2022}, } @article{11783, abstract = {We consider a gas of N bosons with interactions in the mean-field scaling regime. We review the proof of an asymptotic expansion of its low-energy spectrum, eigenstates, and dynamics, which provides corrections to Bogoliubov theory to all orders in 1/ N. This is based on joint works with Petrat, Pickl, Seiringer, and Soffer. In addition, we derive a full asymptotic expansion of the ground state one-body reduced density matrix.}, author = {Bossmann, Lea}, issn = {1089-7658}, journal = {Journal of Mathematical Physics}, keywords = {Mathematical Physics, Statistical and Nonlinear Physics}, number = {6}, publisher = {AIP Publishing}, title = {{Low-energy spectrum and dynamics of the weakly interacting Bose gas}}, doi = {10.1063/5.0089983}, volume = {63}, year = {2022}, } @inproceedings{11808, abstract = {In recent years, significant advances have been made in the design and analysis of fully dynamic algorithms. However, these theoretical results have received very little attention from the practical perspective. Few of the algorithms are implemented and tested on real datasets, and their practical potential is far from understood. Here, we present a quick reference guide to recent engineering and theory results in the area of fully dynamic graph algorithms.}, author = {Hanauer, Kathrin and Henzinger, Monika H and Schulz, Christian}, booktitle = {1st Symposium on Algorithmic Foundations of Dynamic Networks}, isbn = {9783959772242}, issn = {1868-8969}, location = {Virtual}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Recent advances in fully dynamic graph algorithms}}, doi = {10.4230/LIPIcs.SAND.2022.1}, volume = {221}, year = {2022}, } @inproceedings{11812, abstract = {This paper presents a comprehensive study of algorithms for maintaining the number of all connected four-vertex subgraphs in a dynamic graph. Specifically, our algorithms maintain the number of paths of length three in deterministic amortized O(m^{1/2}) update time, and any other connected four-vertex subgraph which is not a clique in deterministic amortized update time O(m^{2/3}). Queries can be answered in constant time. We also study the query times for subgraphs containing an arbitrary edge that is supplied only with the query as well as the case where only subgraphs containing a vertex s that is fixed beforehand are considered. For length-3 paths, paws, 4-cycles, and diamonds our bounds match or are not far from (conditional) lower bounds: Based on the OMv conjecture we show that any dynamic algorithm that detects the existence of paws, diamonds, or 4-cycles or that counts length-3 paths takes update time Ω(m^{1/2-δ}). Additionally, for 4-cliques and all connected induced subgraphs, we show a lower bound of Ω(m^{1-δ}) for any small constant δ > 0 for the amortized update time, assuming the static combinatorial 4-clique conjecture holds. This shows that the O(m) algorithm by Eppstein et al. [David Eppstein et al., 2012] for these subgraphs cannot be improved by a polynomial factor.}, author = {Hanauer, Kathrin and Henzinger, Monika H and Hua, Qi Cheng}, booktitle = {1st Symposium on Algorithmic Foundations of Dynamic Networks}, isbn = {9783959772242}, issn = {1868-8969}, location = {Virtual}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Fully dynamic four-vertex subgraph counting}}, doi = {10.4230/LIPIcs.SAND.2022.18}, volume = {221}, year = {2022}, } @article{11841, abstract = {Primary nucleation is the fundamental event that initiates the conversion of proteins from their normal physiological forms into pathological amyloid aggregates associated with the onset and development of disorders including systemic amyloidosis, as well as the neurodegenerative conditions Alzheimer’s and Parkinson’s diseases. It has become apparent that the presence of surfaces can dramatically modulate nucleation. However, the underlying physicochemical parameters governing this process have been challenging to elucidate, with interfaces in some cases having been found to accelerate aggregation, while in others they can inhibit the kinetics of this process. Here we show through kinetic analysis that for three different fibril-forming proteins, interfaces affect the aggregation reaction mainly through modulating the primary nucleation step. Moreover, we show through direct measurements of the Gibbs free energy of adsorption, combined with theory and coarse-grained computer simulations, that overall nucleation rates are suppressed at high and at low surface interaction strengths but significantly enhanced at intermediate strengths, and we verify these regimes experimentally. Taken together, these results provide a quantitative description of the fundamental process which triggers amyloid formation and shed light on the key factors that control this process.}, author = {Toprakcioglu, Zenon and Kamada, Ayaka and Michaels, Thomas C.T. and Xie, Mengqi and Krausser, Johannes and Wei, Jiapeng and Šarić, Anđela and Vendruscolo, Michele and Knowles, Tuomas P.J.}, issn = {1091-6490}, journal = {Proceedings of the National Academy of Sciences of the United States of America}, number = {31}, publisher = {National Academy of Sciences}, title = {{Adsorption free energy predicts amyloid protein nucleation rates}}, doi = {10.1073/pnas.2109718119}, volume = {119}, year = {2022}, } @article{11843, abstract = {A key attribute of persistent or recurring bacterial infections is the ability of the pathogen to evade the host’s immune response. Many Enterobacteriaceae express type 1 pili, a pre-adapted virulence trait, to invade host epithelial cells and establish persistent infections. However, the molecular mechanisms and strategies by which bacteria actively circumvent the immune response of the host remain poorly understood. Here, we identified CD14, the major co-receptor for lipopolysaccharide detection, on mouse dendritic cells (DCs) as a binding partner of FimH, the protein located at the tip of the type 1 pilus of Escherichia coli. The FimH amino acids involved in CD14 binding are highly conserved across pathogenic and non-pathogenic strains. Binding of the pathogenic strain CFT073 to CD14 reduced DC migration by overactivation of integrins and blunted expression of co-stimulatory molecules by overactivating the NFAT (nuclear factor of activated T-cells) pathway, both rate-limiting factors of T cell activation. This response was binary at the single-cell level, but averaged in larger populations exposed to both piliated and non-piliated pathogens, presumably via the exchange of immunomodulatory cytokines. While defining an active molecular mechanism of immune evasion by pathogens, the interaction between FimH and CD14 represents a potential target to interfere with persistent and recurrent infections, such as urinary tract infections or Crohn’s disease.}, author = {Tomasek, Kathrin and Leithner, Alexander F and Glatzová, Ivana and Lukesch, Michael S. and Guet, Calin C and Sixt, Michael K}, issn = {2050-084X}, journal = {eLife}, publisher = {eLife Sciences Publications}, title = {{Type 1 piliated uropathogenic Escherichia coli hijack the host immune response by binding to CD14}}, doi = {10.7554/eLife.78995}, volume = {11}, year = {2022}, } @inproceedings{11844, abstract = {In the stochastic population protocol model, we are given a connected graph with n nodes, and in every time step, a scheduler samples an edge of the graph uniformly at random and the nodes connected by this edge interact. A fundamental task in this model is stable leader election, in which all nodes start in an identical state and the aim is to reach a configuration in which (1) exactly one node is elected as leader and (2) this node remains as the unique leader no matter what sequence of interactions follows. On cliques, the complexity of this problem has recently been settled: time-optimal protocols stabilize in Θ(n log n) expected steps using Θ(log log n) states, whereas protocols that use O(1) states require Θ(n2) expected steps. In this work, we investigate the complexity of stable leader election on general graphs. We provide the first non-trivial time lower bounds for leader election on general graphs, showing that, when moving beyond cliques, the complexity landscape of leader election becomes very diverse: the time required to elect a leader can range from O(1) to Θ(n3) expected steps. On the upper bound side, we first observe that there exists a protocol that is time-optimal on many graph families, but uses polynomially-many states. In contrast, we give a near-time-optimal protocol that uses only O(log2n) states that is at most a factor log n slower. Finally, we show that the constant-state protocol of Beauquier et al. [OPODIS 2013] is at most a factor n log n slower than the fast polynomial-state protocol. Moreover, among constant-state protocols, this protocol has near-optimal average case complexity on dense random graphs.}, author = {Alistarh, Dan-Adrian and Rybicki, Joel and Voitovych, Sasha}, booktitle = {Proceedings of the Annual ACM Symposium on Principles of Distributed Computing}, isbn = {9781450392624}, location = {Salerno, Italy}, pages = {246--256}, publisher = {Association for Computing Machinery}, title = {{Near-optimal leader election in population protocols on graphs}}, doi = {10.1145/3519270.3538435}, year = {2022}, } @article{11858, abstract = {This paper is a continuation of Part I of this project, where we developed a new local well-posedness theory for nonlinear stochastic PDEs with Gaussian noise. In the current Part II we consider blow-up criteria and regularization phenomena. As in Part I we can allow nonlinearities with polynomial growth and rough initial values from critical spaces. In the first main result we obtain several new blow-up criteria for quasi- and semilinear stochastic evolution equations. In particular, for semilinear equations we obtain a Serrin type blow-up criterium, which extends a recent result of Prüss–Simonett–Wilke (J Differ Equ 264(3):2028–2074, 2018) to the stochastic setting. Blow-up criteria can be used to prove global well-posedness for SPDEs. As in Part I, maximal regularity techniques and weights in time play a central role in the proofs. Our second contribution is a new method to bootstrap Sobolev and Hölder regularity in time and space, which does not require smoothness of the initial data. The blow-up criteria are at the basis of these new methods. Moreover, in applications the bootstrap results can be combined with our blow-up criteria, to obtain efficient ways to prove global existence. This gives new results even in classical 𝐿2-settings, which we illustrate for a concrete SPDE. In future works in preparation we apply the results of the current paper to obtain global well-posedness results and regularity for several concrete SPDEs. These include stochastic Navier–Stokes equations, reaction– diffusion equations and the Allen–Cahn equation. Our setting allows to put these SPDEs into a more flexible framework, where less restrictions on the nonlinearities are needed, and we are able to treat rough initial values from critical spaces. Moreover, we will obtain higher-order regularity results.}, author = {Agresti, Antonio and Veraar, Mark}, issn = {1424-3202}, journal = {Journal of Evolution Equations}, keywords = {Mathematics (miscellaneous)}, number = {2}, publisher = {Springer Nature}, title = {{Nonlinear parabolic stochastic evolution equations in critical spaces part II}}, doi = {10.1007/s00028-022-00786-7}, volume = {22}, year = {2022}, } @article{11916, abstract = {A domain is called Kac regular for a quadratic form on L2 if every functions vanishing almost everywhere outside the domain can be approximated in form norm by functions with compact support in the domain. It is shown that this notion is stable under domination of quadratic forms. As applications measure perturbations of quasi-regular Dirichlet forms, Cheeger energies on metric measure spaces and Schrödinger operators on manifolds are studied. Along the way a characterization of the Sobolev space with Dirichlet boundary conditions on domains in infinitesimally Riemannian metric measure spaces is obtained.}, author = {Wirth, Melchior}, issn = {2538-225X}, journal = {Advances in Operator Theory}, keywords = {Algebra and Number Theory, Analysis}, number = {3}, publisher = {Springer Nature}, title = {{Kac regularity and domination of quadratic forms}}, doi = {10.1007/s43036-022-00199-w}, volume = {7}, year = {2022}, } @article{11917, abstract = {We study the many-body dynamics of an initially factorized bosonic wave function in the mean-field regime. We prove large deviation estimates for the fluctuations around the condensate. We derive an upper bound extending a recent result to more general interactions. Furthermore, we derive a new lower bound which agrees with the upper bound in leading order.}, author = {Rademacher, Simone Anna Elvira and Seiringer, Robert}, issn = {1572-9613}, journal = {Journal of Statistical Physics}, keywords = {Mathematical Physics, Statistical and Nonlinear Physics}, publisher = {Springer Nature}, title = {{Large deviation estimates for weakly interacting bosons}}, doi = {10.1007/s10955-022-02940-4}, volume = {188}, year = {2022}, } @inproceedings{11918, abstract = {Statistics of small subgraph counts such as triangles, four-cycles, and s-t paths of short lengths reveal important structural properties of the underlying graph. These problems have been widely studied in social network analysis. In most relevant applications, the graphs are not only massive but also change dynamically over time. Most of these problems become hard in the dynamic setting when considering the worst case. In this paper, we ask whether the question of small subgraph counting over dynamic graphs is hard also in the average case. We consider the simplest possible average case model where the updates follow an Erdős-Rényi graph: each update selects a pair of vertices (u, v) uniformly at random and flips the existence of the edge (u, v). We develop new lower bounds and matching algorithms in this model for counting four-cycles, counting triangles through a specified point s, or a random queried point, and st paths of length 3, 4 and 5. Our results indicate while computing st paths of length 3, and 4 are easy in the average case with O(1) update time (note that they are hard in the worst case), it becomes hard when considering st paths of length 5. We introduce new techniques which allow us to get average-case hardness for these graph problems from the worst-case hardness of the Online Matrix vector problem (OMv). Our techniques rely on recent advances in fine-grained average-case complexity. Our techniques advance this literature, giving the ability to prove new lower bounds on average-case dynamic algorithms.}, author = {Henzinger, Monika H and Lincoln, Andrea and Saha, Barna}, booktitle = {33rd Annual ACM-SIAM Symposium on Discrete Algorithms}, location = {Alexandria, VA, United States}, pages = {459--498}, publisher = {Society for Industrial and Applied Mathematics}, title = {{The complexity of average-case dynamic subgraph counting}}, doi = {10.1137/1.9781611977073.23}, year = {2022}, } @inproceedings{11930, abstract = {We present a practically efficient algorithm for maintaining a global minimum cut in large dynamic graphs under both edge insertions and deletions. While there has been theoretical work on this problem, our algorithm is the first implementation of a fully-dynamic algorithm. The algorithm uses the theoretical foundation and combines it with efficient and finely-tuned implementations to give an algorithm that can maintain the global minimum cut of a graph with rapid update times. We show that our algorithm gives up to multiple orders of magnitude speedup compared to static approaches both on edge insertions and deletions.}, author = {Henzinger, Monika H and Noe, Alexander and Schulz, Christian}, booktitle = {2022 Proceedings of the Symposium on Algorithm Engineering and Experiments}, location = {Alexandria, VA, United States}, pages = {13--26}, publisher = {Society for Industrial and Applied Mathematics}, title = {{Practical fully dynamic minimum cut algorithms}}, doi = {10.1137/1.9781611977042.2}, year = {2022}, } @article{11937, abstract = {Most experimentally known high-pressure ice phases have a body-centred cubic (bcc) oxygen lattice. Our large-scale molecular-dynamics simulations with a machine-learning potential indicate that, amongst these bcc ice phases, ices VII, VII′ and X are the same thermodynamic phase under different conditions, whereas superionic ice VII″ has a first-order phase boundary with ice VII′. Moreover, at about 300 GPa, the transformation between ice X and the Pbcm phase has a sharp structural change but no apparent activation barrier, whilst at higher pressures the barrier gradually increases. Our study thus clarifies the phase behaviour of the high-pressure ices and reveals peculiar solid–solid transition mechanisms not known in other systems.}, author = {Reinhardt, Aleks and Bethkenhagen, Mandy and Coppari, Federica and Millot, Marius and Hamel, Sebastien and Cheng, Bingqing}, issn = {2041-1723}, journal = {Nature Communications}, publisher = {Springer Nature}, title = {{Thermodynamics of high-pressure ice phases explored with atomistic simulations}}, doi = {10.1038/s41467-022-32374-1}, volume = {13}, year = {2022}, } @article{11951, abstract = {The mammalian hippocampal formation (HF) plays a key role in several higher brain functions, such as spatial coding, learning and memory. Its simple circuit architecture is often viewed as a trisynaptic loop, processing input originating from the superficial layers of the entorhinal cortex (EC) and sending it back to its deeper layers. Here, we show that excitatory neurons in layer 6b of the mouse EC project to all sub-regions comprising the HF and receive input from the CA1, thalamus and claustrum. Furthermore, their output is characterized by unique slow-decaying excitatory postsynaptic currents capable of driving plateau-like potentials in their postsynaptic targets. Optogenetic inhibition of the EC-6b pathway affects spatial coding in CA1 pyramidal neurons, while cell ablation impairs not only acquisition of new spatial memories, but also degradation of previously acquired ones. Our results provide evidence of a functional role for cortical layer 6b neurons in the adult brain.}, author = {Ben Simon, Yoav and Käfer, Karola and Velicky, Philipp and Csicsvari, Jozsef L and Danzl, Johann G and Jonas, Peter M}, issn = {2041-1723}, journal = {Nature Communications}, keywords = {General Physics and Astronomy, General Biochemistry, Genetics and Molecular Biology, General Chemistry, Multidisciplinary}, publisher = {Springer Nature}, title = {{A direct excitatory projection from entorhinal layer 6b neurons to the hippocampus contributes to spatial coding and memory}}, doi = {10.1038/s41467-022-32559-8}, volume = {13}, year = {2022}, } @article{11955, abstract = {Covalent organic frameworks (COFs) are structurally tuneable, porous and crystalline polymers constructed through the covalent attachment of small organic building blocks as elementary units. Using the myriad of such building blocks, a broad spectrum of functionalities has been applied for COF syntheses for broad applications, including heterogeneous catalysis. Herein, we report the synthesis of a new family of porous and crystalline COFs using a novel acridine linker and benzene-1,3,5-tricarbaldehyde derivatives bearing a variable number of hydroxy groups. With the broad absorption in the visible light region, the COFs were applied as photocatalysts in metallaphotocatalytic C−N cross-coupling. The fully β-ketoenamine linked COF showed the highest activity, due to the increased charge separation upon irradiation. The COF showed good to excellent yields for several aryl bromides, good recyclability and even catalyzed the organic transformation in presence of green light as energy source.}, author = {Traxler, Michael and Gisbertz, Sebastian and Pachfule, Pradip and Schmidt, Johannes and Roeser, Jérôme and Reischauer, Susanne and Rabeah, Jabor and Pieber, Bartholomäus and Thomas, Arne}, issn = {1521-3773}, journal = {Angewandte Chemie International Edition}, number = {21}, publisher = {Wiley}, title = {{Acridine‐functionalized covalent organic frameworks (COFs) as photocatalysts for metallaphotocatalytic C−N cross‐coupling}}, doi = {10.1002/anie.202117738}, volume = {61}, year = {2022}, } @article{11991, abstract = {The study of the complexity of the constraint satisfaction problem (CSP), centred around the Feder-Vardi Dichotomy Conjecture, has been very prominent in the last two decades. After a long concerted effort and many partial results, the Dichotomy Conjecture has been proved in 2017 independently by Bulatov and Zhuk. At about the same time, a vast generalisation of CSP, called promise CSP, has started to gain prominence. In this survey, we explain the importance of promise CSP and highlight many new very interesting features that the study of promise CSP has brought to light. The complexity classification quest for the promise CSP is wide open, and we argue that, despite the promise CSP being more general, this quest is rather more accessible to a wide range of researchers than the dichotomy-led study of the CSP has been.}, author = {Krokhin, Andrei and Opršal, Jakub}, issn = {2372-3491}, journal = {ACM SIGLOG News}, number = {3}, pages = {30--59}, publisher = {Association for Computing Machinery}, title = {{An invitation to the promise constraint satisfaction problem}}, doi = {10.1145/3559736.3559740}, volume = {9}, year = {2022}, } @article{11993, abstract = {Moulding refers to a set of manufacturing techniques in which a mould, usually a cavity or a solid frame, is used to shape a liquid or pliable material into an object of the desired shape. The popularity of moulding comes from its effectiveness, scalability and versatility in terms of employed materials. Its relevance as a fabrication process is demonstrated by the extensive literature covering different aspects related to mould design, from material flow simulation to the automation of mould geometry design. In this state-of-the-art report, we provide an extensive review of the automatic methods for the design of moulds, focusing on contributions from a geometric perspective. We classify existing mould design methods based on their computational approach and the nature of their target moulding process. We summarize the relationships between computational approaches and moulding techniques, highlighting their strengths and limitations. Finally, we discuss potential future research directions.}, author = {Alderighi, Thomas and Malomo, Luigi and Auzinger, Thomas and Bickel, Bernd and Cignoni, Paulo and Pietroni, Nico}, issn = {1467-8659}, journal = {Computer Graphics Forum}, keywords = {Computer Graphics and Computer-Aided Design}, number = {6}, pages = {435--452}, publisher = {Wiley}, title = {{State of the art in computational mould design}}, doi = {10.1111/cgf.14581}, volume = {41}, year = {2022}, } @article{11996, abstract = {If you mix fruit syrups with alcohol to make a schnapps, the two liquids will remain perfectly blended forever. But if you mix oil with vinegar to make a vinaigrette, the oil and vinegar will soon separate back into their previous selves. Such liquid-liquid phase separation is a thermodynamically driven phenomenon and plays an important role in many biological processes (1). Although energy injection at the macroscale can reverse the phase separation—a strong shake is the normal response to a separated vinaigrette—little is known about the effect of energy added at the microscopic level on phase separation. This fundamental question has deep ramifications, notably in biology, because active processes also make the interior of a living cell different from a dead one. On page 768 of this issue, Adkins et al. (2) examine how mechanical activity at the microscopic scale affects liquid-liquid phase separation and allows liquids to climb surfaces.}, author = {Palacci, Jérémie A}, issn = {1095-9203}, journal = {Science}, number = {6607}, pages = {710--711}, publisher = {American Association for the Advancement of Science}, title = {{A soft active matter that can climb walls}}, doi = {10.1126/science.adc9202}, volume = {377}, year = {2022}, } @article{11997, abstract = {We study the fate of an impurity in an ultracold heteronuclear Bose mixture, focusing on the experimentally relevant case of a ⁴¹K - ⁸⁷Rb mixture, with the impurity in a ⁴¹K hyperfine state. Our paper provides a comprehensive description of an impurity in a BEC mixture with contact interactions across its phase diagram. We present results for the miscible and immiscible regimes, as well as for the impurity in a self-bound quantum droplet. Here, varying the interactions, we find exotic states where the impurity localizes either at the center or at the surface of the droplet. }, author = {Bighin, Giacomo and Burchianti, A. and Minardi, F. and Macrì, T.}, issn = {2469-9934}, journal = {Physical Review A}, number = {2}, publisher = {American Physical Society}, title = {{Impurity in a heteronuclear two-component Bose mixture}}, doi = {10.1103/PhysRevA.106.023301}, volume = {106}, year = {2022}, } @article{11998, abstract = {Recently it became possible to study highly excited rotational states of molecules in superfluid helium through nonadiabatic alignment experiments (Cherepanov et al 2021 Phys. Rev. A 104 L061303). This calls for theoretical approaches that go beyond explaining renormalized values of molecular spectroscopic constants, which suffices when only the lowest few rotational states are involved. As the first step in this direction, here we present a basic quantum mechanical model describing highly excited rotational states of molecules in superfluid helium nanodroplets. We show that a linear molecule immersed in a superfluid can be seen as an effective symmetric top, similar to the rotational structure of radicals, such as OH or NO, but with the angular momentum of the superfluid playing the role of the electronic angular momentum in free molecules. The simple theory sheds light onto what happens when the rotational angular momentum of the molecule increases beyond the lowest excited states accessible by infrared spectroscopy. In addition, the model allows to estimate the effective rotational and centrifugal distortion constants for a broad range of species and to explain the crossover between light and heavy molecules in superfluid 4He in terms of the many-body wavefunction structure. Some of the above mentioned insights can be acquired by analyzing a simple 2 × 2 matrix.}, author = {Cherepanov, Igor and Bighin, Giacomo and Schouder, Constant A. and Chatterley, Adam S. and Stapelfeldt, Henrik and Lemeshko, Mikhail}, issn = {1367-2630}, journal = {New Journal of Physics}, number = {7}, publisher = {IOP Publishing}, title = {{A simple model for high rotational excitations of molecules in a superfluid}}, doi = {10.1088/1367-2630/ac8113}, volume = {24}, year = {2022}, }