@article{19935, abstract = {The separation logic framework Iris has been built on the premise that all assertions are stable, meaning they unconditionally enjoy the famous frame rule. This gives Iris—and the numerous program logics that build on it—very modular reasoning principles. But stability also comes at a cost. It excludes a core feature of the Viper verifier family, heap-dependent expression assertions, which lift program expressions to the assertion level in order to reduce redundancy between code and specifications and better facilitate SMT-based automation. In this paper, we bring heap-dependent expression assertions to Iris with Daenerys. To do so, we must first revisit the very core of Iris, extending it with a new form of unstable resources (and adapting the frame rule accordingly). On top, we then build a program logic with heap-dependent expression assertions and lay the foundations for connecting Iris to SMT solvers. We apply Daenerys to several case studies, including some that go beyond what Viper and Iris can do individually and others that benefit from the connection to SMT.}, author = {Spies, Simon and Mück, Niklas and Zeng, Haoyi and Sammler, Michael Joachim and Lattuada, Andrea and Müller, Peter and Dreyer, Derek}, issn = {2475-1421}, journal = {Proceedings of the ACM on Programming Languages}, number = {PLDI}, pages = {848--873}, publisher = {Association for Computing Machinery}, title = {{Destabilizing Iris}}, doi = {10.1145/3729284}, volume = {9}, year = {2025}, } @article{19936, abstract = {There has been a recent upsurge of interest in formal, machine-checked verification of timing guarantees for C implementations of real-time system schedulers. However, prior work has only considered tick-based schedulers, which enjoy a clearly defined notion of time: the time "quantum". In this work, we present a new approach to real-time systems verification for interrupt-free schedulers, which are commonly used in deeply embedded and resource-constrained systems but which do not enjoy a natural notion of periodic time. Our approach builds on and connects two recently developed Rocq-based systems—RefinedC (for foundational C verification) and Prosa (for verified response-time analysis)—adapting the former to reason about timed traces and the latter to reason about overheads. We apply the resulting system, which we call RefinedProsa, to verify Rössl, a simple yet representative, fixed-priority, non-preemptive, interrupt-free scheduler implemented in C.}, author = {Bedarkar, Kimaya and Elbeheiry, Laila and Sammler, Michael Joachim and Gäher, Lennard and Brandenburg, Björn and Dreyer, Derek and Garg, Deepak}, issn = {2475-1421}, journal = {Proceedings of the ACM on Programming Languages}, number = {PLDI}, pages = {73--97}, publisher = {Association for Computing Machinery}, title = {{RefinedProsa: Connecting response-time analysis with C verification for interrupt-free schedulers}}, doi = {10.1145/3729249}, volume = {9}, year = {2025}, } @article{19937, abstract = {Simplets are elementary units within simplicial complexes and are fundamental for analyzing the structure of simplicial complexes. Previous efforts have mainly focused on accurately counting or approximating the number of simplets rather than studying their frequencies. However, analyzing simplet frequencies is more practical for large-scale simplicial complexes. This paper introduces the Simplet Frequency Distribution (SFD) vector, which enables the analysis of simplet frequencies in simplicial complexes. Additionally, we provide a bound on the sample complexity required to approximate the SFD vector using any uniform sampling-based algorithm accurately. We extend the definition of simplet frequency distribution to encompass simplices, allowing for the analysis of simplet frequencies within simplices of simplicial complexes. This paper introduces the Simplet Degree Vector (SDV) and the Simplet Degree Centrality (SDC), facilitating this analysis for each simplex. Furthermore, we present a bound on the sample complexity required for accurately approximating the SDV and SDC for a set of simplices using any uniform sampling-based algorithm. We also introduce algorithms for approximating SFD, geometric SFD, SDV, and SDC. We also validate the theoretical bounds with experiments on random simplicial complexes and demonstrate the practical application through a case study.}, author = {Mahini, Mohammad and Beigy, Hamid and Qadami, Salman and Saghafian, Morteza}, issn = {0020-0255}, journal = {Information Sciences}, number = {11}, publisher = {Elsevier}, title = {{Simplet-based signatures and approximation in simplicial complexes: Frequency, degree, and centrality}}, doi = {10.1016/j.ins.2025.122425}, volume = {719}, year = {2025}, } @misc{19956, abstract = {The specific introduction of 1H-13C or 1H-15N moieties into otherwise deuterated proteins holds great potential for high-resolution solution and magic-angle spinning (MAS) NMR studies of protein structure and dynamics. Arginine residues play key roles for example at active sites of enzymes. Taking advantage of a chemically synthesized Arg with a 13C-1H2 group in an otherwise deuterated backbone, we demonstrate here the usefulness of proton-detected arginine MAS NMR approaches to probe arginine dynamics. In experiments on crystalline ubiquitin and the 134 kDa tetrameric enzyme malate dehydrogenase we detected a wide range of motions, from sites that are rigid on time scales of at least tens of milliseconds to residues undergoing predominantly nanosecond motions. Spin-relaxation and dipolar-coupling measurements enabled quantitative determination of these dynamics. We observed microsecond dynamics of residue Arg54 in crystalline ubiquitin, whose backbone is known to sample different β-turn conformations on this time scale. The labeling scheme and experiments presented here expand the toolkit for high-resolution proton-detected MAS NMR}, author = {Schanda, Paul}, publisher = {Institute of Science and Technology Austria}, title = {{Arginine Dynamics Probed by Magic-Angle Spinning NMR with a Specific Isotope-Labeling Scheme}}, doi = {10.15479/AT-ISTA-19956}, year = {2025}, } @article{19963, abstract = {The acquisition of cellular identity requires large-scale alterations in cellular state. The noncanonical proteasome activator PSME3 is known to regulate diverse cellular processes, but its importance for differentiation remains unclear. Here, we demonstrate that PSME3 binds dynamically to highly active promoters over the course of differentiation. However, loss of PSME3 does not globally affect mRNA transcription. We find instead that PSME3 influences the levels of several adhesion-related proteins and acts upstream of the HSP90 co-chaperone NUDC to regulate cell motility and myoblast differentiation in a proteasome-independent manner. Our findings reveal several new facets of PSME3 functionality and highlight its importance for the differentiation of myogenic cells.}, author = {Kuhn, Kenneth D and Cho, Ukrae H. and Hetzer, Martin W}, issn = {2575-1077}, journal = {Life Science Alliance}, number = {9}, publisher = {Embo Press}, title = {{PSME3 regulates migration and differentiation of myoblasts}}, doi = {10.26508/lsa.202503208}, volume = {8}, year = {2025}, } @article{19964, abstract = {It has been suggested that giant planet occurrence peaks for stars with M* ≈ 3 M⊙ at a value a factor of 4 higher than observed for solar-mass stars. This population of giant planets predicted to frequently orbit main-sequence B stars at a ≈ 10 au is difficult to characterize during the few hundred million years while fusion persists in their host stars. By the time those stars become massive, young white dwarfs, any giant planets present would still be luminous as a consequence of their recent formation. From an initial sample of 2195 Gaia-identified massive, young white dwarfs, we use homogeneous Spitzer Infrared Array Camera (IRAC) photometry to search for evidence of unresolved giant planets. For 30 systems, these IRAC data provide sensitivity to objects with M ≲ 10 MJup, and we identify one candidate with M ≈ 4 MJup orbiting the white dwarf GALEX J071816.4+373139. Correcting for the possibility that some of the white dwarfs in our sample result from mergers, we find a giant planet occurrence n GP = 0.11+0.13-0.07 for stars with initial masses M* ≳ 3 M⊙. Our occurrence inference is consistent with both the Doppler-inferred occurrence of giant planets orbiting M* ≈ 2 M⊙ giant stars and the theoretically predicted factor of 4 enhancement in the occurrence of giant planets orbiting M* ≈ 3 M⊙ stars relative to solar-mass stars. Future James Webb Space Telescope NIRCam observations of our sample would provide sensitivity to Saturn-mass planets and thereby a definitive estimate of the occurrence of giant planets orbiting stars with M* ≳ 3 M⊙.}, author = {Cheng, Sihao and Schlaufman, Kevin C. and Caiazzo, Ilaria}, issn = {1538-3881}, journal = {The Astronomical Journal}, number = {1}, publisher = {IOP Publishing}, title = {{A candidate giant planet companion to the massive, young White Dwarf GALEX J071816.4+373139 informs the occurrence of giant planets orbiting B stars}}, doi = {10.3847/1538-3881/addd21}, volume = {170}, year = {2025}, } @article{19965, abstract = {Multiagent learning is challenging when agents face mixed-motivation interactions, where conflicts of interest arise as agents independently try to optimize their respective outcomes. Recent advancements in evolutionary game theory have identified a class of “zero-determinant” strategies, which confer an agent with significant unilateral control over outcomes in repeated games. Building on these insights, we present a comprehensive generalization of zero-determinant strategies to stochastic games, encompassing dynamic environments. We propose an algorithm that allows an agent to discover strategies enforcing predetermined linear (or approximately linear) payoff relationships. Of particular interest is the relationship in which both payoffs are equal, which serves as a proxy for fairness in symmetric games. We demonstrate that an agent can discover strategies enforcing such relationships through experience alone, without coordinating with an opponent. In finding and using such a strategy, an agent (“enforcer”) can incentivize optimal and equitable outcomes, circumventing potential exploitation. In particular, from the opponent’s viewpoint, the enforcer transforms a mixed-motivation problem into a cooperative problem, paving the way for more collaboration and fairness in multiagent systems.}, author = {Mcavoy, Alex and Sehwag, Udari Madhushani and Hilbe, Christian and Chatterjee, Krishnendu and Barfuss, Wolfram and Su, Qi and Leonard, Naomi Ehrich and Plotkin, Joshua B.}, issn = {1091-6490}, journal = {Proceedings of the National Academy of Sciences}, number = {25}, publisher = {National Academy of Sciences}, title = {{Unilateral incentive alignment in two-agent stochastic games}}, doi = {10.1073/pnas.2319927121}, volume = {122}, year = {2025}, } @article{19966, abstract = {Recently discovered nanofluidic memristors, have raised promises for the development of iontronics and neuromorphic computing with ions. Ionic memory effects are related to ion dynamics inside nanochannels, with timescales associated with the manifold physicochemical phenomena occurring at confined interfaces. Here, we explore experimentally the frequency-dependent current–voltage response of model nanochannels—namely glass nanopipettes—to investigate memory effects in ion transport. This characterisation, which we refer to as mem-spectrometry, highlights two characteristic frequencies, associated with short and long timescales of the order of 50 ms and 50 s in the present system. Whereas the former can be associated with ionic diffusion, very long timescales are difficult to explain with conventional transport phenomena. We develop a minimal model accounting for these mem-spectrometry results, pointing to surface charge regulation and ionic adsorption-desorption as possible origins for the long-term memory. Our work demonstrates the relevance of mem-spectrometry to highlight subtle ion transport properties in nanochannels, giving hereby new insights on the mechanisms governing ion transport and current rectification in charged conical nanopores.}, author = {Jouveshomme, Simon and Lizée, Mathieu and Robin, Paul and Bocquet, Lydéric}, issn = {1367-2630}, journal = {New Journal of Physics}, number = {6}, publisher = {IOP Publishing}, title = {{Multiple ionic memories in asymmetric nanochannels revealed by mem-spectrometry}}, doi = {10.1088/1367-2630/ade61b}, volume = {27}, year = {2025}, } @article{19967, abstract = {Context. Investigating the ionizing emission of star-forming galaxies and the escape fraction of ionizing photons is critical to understanding their contribution to reionization and their impact on the surrounding environment. The number of ionizing photons available to reionize the intergalactic medium (IGM) depends on not only the abundance of galaxies but also their efficiency in producing ionizing photons (ξion). This quantity is thus fundamental to quantify the role of faint versus bright sources in driving this process, as we must assess their relative contribution to the total ionizing emissivity. Aims. Our goal is to estimate the ξion using Balmer lines (Hα or Hβ) in a sample of 761 galaxies at 4 ≤ z ≤ 10 selected from different JWST spectroscopic surveys. We aim to determine the redshift evolution of ξion and the relation of ξion with the physical properties of the galaxies. Methods. We used the available HST and JWST photometry to perform a spectral energy distribution (SED) fitting in the sample to determine their physical properties and relate them with ξion. We used the BAGPIPES code for the SED fitting and assumed a delayed exponential model for the star formation history. We used the NIRSpec spectra from prism or grating configurations to estimate Balmer luminosities, and then constrained ξion values after dust correction. Results. We find a mean value of 1025.22 Hz erg−1 for ξion in the sample with an observed scatter of 0.42 dex. We find an increase in the median values of ξion with redshift from 1025.09 Hz erg−1 at z ∼ 4.18 to 1025.28 Hz erg−1 at z ∼ 7.14, confirming the redshift evolution of ξion found in other studies. Regarding the relation between ξion and physical properties, we find a decrease in ξion with increasing stellar mass, indicating that low-mass galaxies are efficient producers of ionizing photons. We also find an increase in ξion with increasing specific star formation rate (sSFR) and increasing UV absolute magnitude. This indicates that faint galaxies and galaxies with high sSFR are also efficient producers. We also investigated the relation of ξion with the rest-frame equivalent width (EW) of [OIII]λ5007 and find that galaxies with the higher EW([OIII]λ5007) are more efficient producers of ionizing photons, with the best fit leading to the relation log(ξion)  =  0.43 × log(EW[OIII])+23.99. Similarly, we find that galaxies with higher O32 = [OIII]λ5007/[OII]λλ3727,3729 and lower gas-phase metallicities (based on the R23 = ([OIII]λλ4959,5007+[OII]λλ3727,3729)/Hβ calibration) show higher ξion values.}, author = {Llerena, M. and Pentericci, L. and Napolitano, L. and Mascia, Sara and Amorín, R. and Calabrò, A. and Castellano, M. and Cleri, N. J. and Giavalisco, M. and Grogin, N. A. and Hathi, N. P. and Hirschmann, M. and Koekemoer, A. M. and Nanayakkara, T. and Pacucci, F. and Shen, L. and Wilkins, S. M. and Yoon, I. and Yung, L. Y.A. and Bhatawdekar, R. and Lucas, R. A. and Wang, X. and Arrabal Haro, P. and Bagley, M. B. and Finkelstein, S. L. and Kartaltepe, J. S. and Merlin, E. and Papovich, C. and Pirzkal, N. and Santini, P.}, issn = {1432-0746}, journal = {Astronomy & Astrophysics}, publisher = {EDP Sciences}, title = {{The ionizing photon production efficiency of star-forming galaxies at z ∼ 4–10}}, doi = {10.1051/0004-6361/202453251}, volume = {698}, year = {2025}, } @inproceedings{19968, abstract = {In the dynamic arena of innovation, the relations between academia and industry are a keystone for breakthroughs and practical applications. Yet, the groundwork of these pivotal University-Industry (U-I) partnerships remains covered in complexity. This paper delves into these intricate relations, unraveling the factors that help successful collaborations. Grounded in the Resource-Based Theory, our study transcends traditional analytical boundaries, leveraging a neural network model to understand a comprehensive dataset from the UK’s Higher Education Statistics Agency, SCIMAGO Rankings, and Clarivate Publications. This novel approach helps to make clear the interplay of academic load, administrative support, scientific output, and university rank in sculpting U-I collaboration dynamics. Our findings suggest that reduced academic load and robust administrative support significantly bolster U-I collaborations. However, the influence of scientific output and university ranking is more nuanced, challenging the common belief. High scientific output, while indicative of expertise, doesn't always align with industry goals. Similarly, while higher-ranked universities could attract more collaborations, the benefits are not universal. This paper not only contributes to a deeper understanding of U-I collaborations, but also provides actionable insights for university administrators, policymakers, and industry leaders. In a world where innovation is key, understanding these collaborative dynamics is crucial for fostering partnerships that push the boundaries of research and practical application.}, author = {Plata, Carlos and Casallas Garcia, Alejandro}, booktitle = {85th Annual Meeting of the Academy of Management}, issn = {2151-6561}, location = {Copenhagen, Denmark}, number = {1}, publisher = {Academy of Management}, title = {{Machine learning analysis of the factors influencing university-industry collaborations}}, doi = {10.5465/AMPROC.2025.54bp}, volume = {2025}, year = {2025}, } @article{19969, 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 graphs. We provide the first non-trivial time lower bounds on general graphs, showing that, when moving beyond cliques, the complexity of stable leader election can range from O(1) to (n3) expected steps. We describe 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(log2 n) states that is at most a factor O(log n) slower. Finally, we observe that for many graphs the constant-state protocol of Beauquier et al. [OPODIS 2013] is at most a factor O(n log n) slower than the fast polynomial-state protocol, and 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}, issn = {1432-0452}, journal = {Distributed Computing}, pages = {207--245}, publisher = {Springer Nature}, title = {{Near-optimal leader election in population protocols on graphs}}, doi = {10.1007/s00446-025-00487-7}, volume = {38}, year = {2025}, } @inproceedings{19982, abstract = {Dynamically maintaining the minimum cut in a graph G under edge insertions and deletion is a fundamental problem in dynamic graph algorithms for which no conditional lower bound on the time per operation exists. In an n-node graph the best known (1 + o (1))-approximate algorithm takes update time [14]. If the minimum cut is guaranteed to be (log n )o (1), a deterministic exact algorithm with n o (1) update time exists [8]. We present the first fully dynamic algorithm for (1 + o (1))-approximate minimum cut with n o(1) update time. Our main technical contribution is to show that it suffices to consider small-volume cuts in suitably contracted graphs.}, author = {El-Hayek, Antoine and Henzinger, Monika H and Li, Jason}, booktitle = {Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms}, location = {New Orleans, LA, United States}, pages = {750--784}, publisher = {Society for Industrial and Applied Mathematics}, title = {{Fully dynamic approximate minimum cut in subpolynomial time per operation}}, doi = {10.1137/1.9781611978322.22}, year = {2025}, } @article{19998, abstract = {nspired by Richard Feynman’s 1959 lecture and the 1966 film Fantastic Voyage, the field of micro/nanorobots has evolved from science fiction to reality, with significant advancements in biomedical and environmental applications. Despite the rapid progress, the deployment of functional micro/nanorobots remains limited. This review of the technology roadmap identifies key challenges hindering their widespread use, focusing on propulsion mechanisms, fundamental theoretical aspects, collective behavior, material design, and embodied intelligence. We explore the current state of micro/nanorobot technology, with an emphasis on applications in biomedicine, environmental remediation, analytical sensing, and other industrial technological aspects. Additionally, we analyze issues related to scaling up production, commercialization, and regulatory frameworks that are crucial for transitioning from research to practical applications. We also emphasize the need for interdisciplinary collaboration to address both technical and nontechnical challenges, such as sustainability, ethics, and business considerations. Finally, we propose a roadmap for future research to accelerate the development of micro/nanorobots, positioning them as essential tools for addressing grand challenges and enhancing the quality of life.}, author = {Ju, Xiaohui and Chen, Chuanrui and Oral, Cagatay M. and Sevim, Semih and Golestanian, Ramin and Sun, Mengmeng and Bouzari, Negin and Lin, Xiankun and Urso, Mario and Nam, Jong Seok and Cho, Yujang and Peng, Xia and Landers, Fabian C. and Yang, Shihao and Adibi, Azin and Taz, Nahid and Wittkowski, Raphael and Ahmed, Daniel and Wang, Wei and Magdanz, Veronika and Medina-Sánchez, Mariana and Guix, Maria and Bari, Naimat and Behkam, Bahareh and Kapral, Raymond and Huang, Yaxin and Tang, Jinyao and Wang, Ben and Morozov, Konstantin and Leshansky, Alexander and Abbasi, Sarmad Ahmad and Choi, Hongsoo and Ghosh, Subhadip and Borges Fernandes, Bárbara and Battaglia, Giuseppe and Fischer, Peer and Ghosh, Ambarish and Jurado Sánchez, Beatriz and Escarpa, Alberto and Martinet, Quentin and Palacci, Jérémie A and Lauga, Eric and Moran, Jeffrey and Ramos-Docampo, Miguel A. and Städler, Brigitte and Herrera Restrepo, Ramón Santiago and Yossifon, Gilad and Nicholas, James D. and Ignés-Mullol, Jordi and Puigmartí-Luis, Josep and Liu, Yutong and Zarzar, Lauren D. and Shields, C. Wyatt and Li, Longqiu and Li, Shanshan and Ma, Xing and Gracias, David H. and Velev, Orlin and Sánchez, Samuel and Esplandiu, Maria Jose and Simmchen, Juliane and Lobosco, Antonio and Misra, Sarthak and Wu, Zhiguang and Li, Jinxing and Kuhn, Alexander and Nourhani, Amir and Maric, Tijana and Xiong, Ze and Aghakhani, Amirreza and Mei, Yongfeng and Tu, Yingfeng and Peng, Fei and Diller, Eric and Sakar, Mahmut Selman and Sen, Ayusman and Law, Junhui and Sun, Yu and Pena-Francesch, Abdon and Villa, Katherine and Li, Huaizhi and Fan, Donglei Emma and Liang, Kang and Huang, Tony Jun and Chen, Xiang-Zhong and Tang, Songsong and Zhang, Xueji and Cui, Jizhai and Wang, Hong and Gao, Wei and Kumar Bandari, Vineeth and Schmidt, Oliver G. and Wu, Xianghua and Guan, Jianguo and Sitti, Metin and Nelson, Bradley J. and Pané, Salvador and Zhang, Li and Shahsavan, Hamed and He, Qiang and Kim, Il-Doo and Wang, Joseph and Pumera, Martin}, issn = {1936-086X}, journal = {ACS Nano}, number = {27}, pages = {24174--24334}, publisher = {American Chemical Society}, title = {{Technology roadmap of micro/nanorobots}}, doi = {10.1021/acsnano.5c03911}, volume = {19}, year = {2025}, } @article{20002, abstract = {While the most widely used CRISPR-Cas enzyme is the Cas9 endonuclease from Streptococcus pyogenes (Cas9), it exhibits single-turnover enzyme kinetics which leads to long residence times on product DNA. This blocks access to DNA repair machinery and acts as a major bottleneck during CRISPR-Cas9 gene editing. Cas9 can eventually be removed from the product by extrinsic factors, such as translocating polymerases, but the mechanisms contributing to Cas9 dissociation following cleavage remain poorly understood. Here, we employ truncated guide RNAs as a strategy to weaken PAM-distal nucleic acid interactions and promote faster enzyme turnover. Using kinetics-guided cryo-EM, we examine the conformational landscape of a multi-turnover Cas9, including the first detailed snapshots of Cas9 dissociating from product DNA. We discovered that while the PAM-distal product dissociates from Cas9 following cleavage, tight binding of the PAM-proximal product directly inhibits re-binding of new targets. Our work provides direct evidence as to why Cas9 acts as a single-turnover enzyme and will guide future Cas9 engineering efforts.}, author = {Kiernan, Kaitlyn and Taylor, David W.}, issn = {2041-1723}, journal = {Nature Communications}, publisher = {Springer Nature}, title = {{Visualization of a multi-turnover Cas9 after product release}}, doi = {10.1038/s41467-025-60668-7}, volume = {16}, year = {2025}, } @article{20003, abstract = {The problem of mobile impurities in quantum baths is of fundamental importance in many-body physics. There has recently been significant progress regarding our understanding of this due to cold atom experiments, but so far it has mainly been concerned with cases where the bath has no or only weak interactions, or the impurity interacts weakly with the bath. Here, we address this gap by developing a new theoretical framework for exploring a mobile impurity interacting strongly with a highly correlated bath of bosons in the quantum critical regime of a Mott insulator (MI) to superfluid (SF) quantum phase transition. Our framework is based on a powerful quantum Gutzwiller (QGW) description of the bosonic bath combined with diagrammatic field theory for the impurity-bath interactions. By resumming a selected class of diagrams to infinite order, a rich picture emerges where the impurity is dressed by the fundamental modes of the bath, which change character from gapped particle-hole excitations in the MI to Higgs and gapless Goldstone modes in the SF. This gives rise to the existence of several quasiparticle (polaron) branches with properties reflecting the strongly correlated environment. In particular, one polaron branch exhibits a sharp cusp in its energy, while a new ground-state polaron emerges at the O(2) quantum phase transition point for integer filling, which reflects the nonanalytic behavior at the transition and the appearance of the Goldstone mode in the SF phase. Smooth versions of these features are inherited in the polaron spectrum away from integer filling due to the influence of Mott physics on the bosonic bath. We furthermore compare our diagrammatic results with quantum Monte Carlo calculations, obtaining excellent agreement. This accuracy is quite remarkable for such a highly non-trivial case of strong interactions between the impurity and bosons in a maximally correlated quantum critical regime, and it establishes the utility of our framework. Finally, our results show how impurities can be used as quantum sensors and highlight fundamental differences between experiments performed at a fixed particle number or a fixed chemical potential.}, author = {Al Hyder, Ragheed and Colussi, Victor E. and Čufar, Matija and Brand, Joachim and Recati, Alessio and Bruun, Georg M.}, issn = {2542-4653}, journal = {Scipost Physics}, number = {1}, publisher = {SciPost Foundation}, title = {{Lattice Bose polarons at strong coupling and quantum criticality}}, doi = {10.21468/SciPostPhys.19.1.002}, volume = {19}, year = {2025}, } @inproceedings{20004, abstract = {A long-standing conjecture of Eckhoff, Linhart, and Welzl, which would generalize McMullen’s Upper Bound Theorem for polytopes and refine asymptotic bounds due to Clarkson, asserts that for k ⩽ ⌊(n-d-2)/2⌋, the complexity of the (⩽ k)-level in a simple arrangement of n hemispheres in S^d is maximized for arrangements that are polar duals of neighborly d-polytopes. We prove this conjecture in the case n = d+4. By Gale duality, this implies the following result about crossing numbers: In every spherical arc drawing of K_n in S² (given by a set V ⊂ S² of n unit vectors connected by spherical arcs), the number of crossings is at least 1/4 ⌊n/2⌋ ⌊(n-1)/2⌋ ⌊(n-2)/2⌋ ⌊(n-3)/2⌋. This lower bound is attained if every open linear halfspace contains at least ⌊(n-2)/2⌋ of the vectors in V. Moreover, we determine the space of all linear and affine relations that hold between the face numbers of levels in simple arrangements of n hemispheres in S^d. This completes a long line of research on such relations, answers a question posed by Andrzejak and Welzl in 2003, and generalizes the classical fact that the Dehn-Sommerville relations generate all linear relations between the face numbers of simple polytopes (which correspond to the 0-level). To prove these results, we introduce the notion of the g-matrix, which encodes the face numbers of levels in an arrangement and generalizes the classical g-vector of a polytope.}, author = {Streltsova, Elizaveta and Wagner, Uli}, booktitle = { 41st International Symposium on Computational Geometry}, isbn = {9783959773706}, issn = {1868-8969}, location = {Kanazawa, Japan}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Levels in arrangements: Linear relations, the g-matrix, and applications to crossing numbers}}, doi = {10.4230/LIPIcs.SoCG.2025.75}, volume = {332}, year = {2025}, } @inproceedings{20005, abstract = {We generalize a classical result by Boris Delaunay that introduced Delaunay triangulations. In particular, we prove that for a locally finite and coarsely dense generic point set A in ℝ^d, every generic point of ℝ^d belongs to exactly binom(d+k,d) simplices whose vertices belong to A and whose circumspheres enclose exactly k points of A. We extend this result to the cases in which the points are weighted, and when A contains only finitely many points in ℝ^d or in 𝕊^d. Furthermore, we use the result to give a new geometric proof for the fact that volumes of hypersimplices are Eulerian numbers.}, author = {Edelsbrunner, Herbert and Garber, Alexey and Saghafian, Morteza}, booktitle = {41st International Symposium on Computational Geometry}, isbn = {9783959773706}, issn = {1868-8969}, location = {Kanazawa, Japan}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{On spheres with k points inside}}, doi = {10.4230/LIPIcs.SoCG.2025.43}, volume = {332}, year = {2025}, } @inproceedings{20006, abstract = {In numerous fields, dynamic time series data require continuous updates, necessitating efficient data processing techniques for accurate analysis. This paper examines the banana tree data structure, specifically designed to efficiently maintain the multi-scale topological descriptor commonly known as persistent homology for dynamically changing time series data. We implement this data structure and conduct an experimental study to assess its properties and runtime for update operations. Our findings indicate that banana trees are highly effective with unbiased random data, outperforming state-of-the-art static algorithms in these scenarios. Additionally, our results show that real-world time series share structural properties with unbiased random walks, suggesting potential practical utility for our implementation.}, author = {Ost, Lara and Cultrera di Montesano, Sebastiano and Edelsbrunner, Herbert}, booktitle = {41st International Symposium on Computational Geometry}, isbn = {9783959773706}, issn = {1868-8969}, location = {Kanazawa, Japan}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Banana trees for the persistence in time series experimentally}}, doi = {10.4230/LIPIcs.SoCG.2025.71}, volume = {332}, year = {2025}, } @inproceedings{20007, abstract = {There is no known polynomial-time algorithm for graph isomorphism testing, but elementary combinatorial “refinement” algorithms seem to be very efficient in practice. Some philosophical justification for this phenomenon is provided by a classical theorem of Babai, Erdős and Selkow: an extremely simple polynomial-time combinatorial algorithm (variously known as “naïve refinement”, “naïve vertex classification”, “colour refinement” or the “1-dimensional Weisfeiler–Leman algorithm”) yields a so-called canonical labelling scheme for “almost all graphs”. More precisely, for a typical outcome of a random graph G(n,1/2), this simple combinatorial algorithm assigns labels to vertices in a way that easily permits isomorphism-testing against any other graph.}, author = {Anastos, Michael and Kwan, Matthew Alan and Moore, Benjamin}, booktitle = {Proceedings of the 57th Annual ACM Symposium on Theory of Computing}, isbn = {9798400715105}, issn = {0737-8017}, location = {Prague, Czechia}, pages = {2098--2106}, publisher = {Association for Computing Machinery}, title = {{Smoothed analysis for graph isomorphism}}, doi = {10.1145/3717823.3718173}, year = {2025}, } @article{20009, abstract = {The suppression of recombination between young X and Y chromosomes is a crucial step in their evolution, but why it occurs is not known. The detailed characterization of the polymorphic sex chromosomes of the fourspine stickleback by Liu et al. promises to shed new light on this longstanding question.}, author = {Vicoso, Beatriz}, issn = {0169-5347}, journal = {Trends in Ecology and Evolution}, number = {8}, pages = {728--730}, publisher = {Elsevier}, title = {{Sex chromosome evolution in action in fourspine sticklebacks}}, doi = {10.1016/j.tree.2025.06.010}, volume = {40}, year = {2025}, }