@article{10813, abstract = {Redox mediators could catalyse otherwise slow and energy-inefficient cycling of Li–S and Li–O2 batteries by shuttling electrons or holes between the electrode and the solid insulating storage materials. For mediators to work efficiently they need to oxidize the solid with fast kinetics but with the lowest possible overpotential. However, the dependence of kinetics and overpotential is unclear, which hinders informed improvement. Here, we find that when the redox potentials of mediators are tuned via, for example, Li+ concentration in the electrolyte, they exhibit distinct threshold potentials, where the kinetics accelerate several-fold within a range as small as 10 mV. This phenomenon is independent of types of mediator and electrolyte. The acceleration originates from the overpotentials required to activate fast Li+/e− extraction and the following chemical step at specific abundant surface facets. Efficient redox catalysis at insulating solids therefore requires careful consideration of the surface conditions of the storage materials and electrolyte-dependent redox potentials, which may be tuned by salt concentrations or solvents.}, author = {Cao, Deqing and Shen, Xiaoxiao and Wang, Aiping and Yu, Fengjiao and Wu, Yuping and Shi, Siqi and Freunberger, Stefan Alexander and Chen, Yuhui}, issn = {2520-1158}, journal = {Nature Catalysis}, keywords = {Process Chemistry and Technology, Biochemistry, Bioengineering, Catalysis}, pages = {193--201}, publisher = {Springer Nature}, title = {{Threshold potentials for fast kinetics during mediated redox catalysis of insulators in Li–O2 and Li–S batteries}}, doi = {10.1038/s41929-022-00752-z}, volume = {5}, year = {2022}, } @article{7791, abstract = {Extending a result of Milena Radnovic and Serge Tabachnikov, we establish conditionsfor two different non-symmetric norms to define the same billiard reflection law.}, author = {Akopyan, Arseniy and Karasev, Roman}, issn = {2199-6768}, journal = {European Journal of Mathematics}, number = {4}, pages = {1309 -- 1312}, publisher = {Springer Nature}, title = {{When different norms lead to same billiard trajectories?}}, doi = {10.1007/s40879-020-00405-0}, volume = {8}, year = {2022}, } @article{8286, abstract = {We consider the following dynamic load-balancing process: given an underlying graph G with n nodes, in each step t≥ 0, one unit of load is created, and placed at a randomly chosen graph node. In the same step, the chosen node picks a random neighbor, and the two nodes balance their loads by averaging them. We are interested in the expected gap between the minimum and maximum loads at nodes as the process progresses, and its dependence on n and on the graph structure. Variants of the above graphical balanced allocation process have been studied previously by Peres, Talwar, and Wieder [Peres et al., 2015], and by Sauerwald and Sun [Sauerwald and Sun, 2015]. These authors left as open the question of characterizing the gap in the case of cycle graphs in the dynamic case, where weights are created during the algorithm’s execution. For this case, the only known upper bound is of 𝒪(n log n), following from a majorization argument due to [Peres et al., 2015], which analyzes a related graphical allocation process. In this paper, we provide an upper bound of 𝒪 (√n log n) on the expected gap of the above process for cycles of length n. We introduce a new potential analysis technique, which enables us to bound the difference in load between k-hop neighbors on the cycle, for any k ≤ n/2. We complement this with a "gap covering" argument, which bounds the maximum value of the gap by bounding its value across all possible subsets of a certain structure, and recursively bounding the gaps within each subset. We provide analytical and experimental evidence that our upper bound on the gap is tight up to a logarithmic factor. }, author = {Alistarh, Dan-Adrian and Nadiradze, Giorgi and Sabour, Amirmojtaba}, issn = {1432-0541}, journal = {Algorithmica}, location = {Virtual, Online; Germany}, number = {4}, pages = {1007--1029}, publisher = {Springer Nature}, title = {{Dynamic averaging load balancing on cycles}}, doi = {10.1007/s00453-021-00905-9}, volume = {84}, year = {2022}, } @article{8538, abstract = {We prove some recent experimental observations of Dan Reznik concerning periodic billiard orbits in ellipses. For example, the sum of cosines of the angles of a periodic billiard polygon remains constant in the 1-parameter family of such polygons (that exist due to the Poncelet porism). In our proofs, we use geometric and complex analytic methods.}, author = {Akopyan, Arseniy and Schwartz, Richard and Tabachnikov, Serge}, issn = {2199-6768}, journal = {European Journal of Mathematics}, number = {4}, pages = {1313--1327}, publisher = {Springer Nature}, title = {{Billiards in ellipses revisited}}, doi = {10.1007/s40879-020-00426-9}, volume = {8}, year = {2022}, } @article{9336, abstract = {Mentorship is experience and/or knowledge‐based guidance. Mentors support, sponsor and advocate for mentees. Having one or more mentors when you seek advice can significantly influence and improve your research endeavours, well‐being and career development. Positive mentee–mentor relationships are vital for maintaining work–life balance and success in careers. Early‐career researchers (ECRs), in particular, can benefit from mentorship to navigate challenges in academic and nonacademic life and careers. Yet, strategies for selecting mentors and maintaining interactions with them are often underdiscussed within research environments. In this Words of Advice, we provide recommendations for ECRs to seek and manage mentorship interactions. Our article draws from our experiences as ECRs and published work, to provide suggestions for mentees to proactively promote beneficial mentorship interactions. The recommended practices highlight the importance of identifying mentorship needs, planning and selecting multiple and diverse mentors, setting goals, and maintaining constructive, and mutually beneficial working relationships with mentors.}, author = {Sarabipour, Sarvenaz and Hainer, Sarah J. and Arslan, Feyza N and De Winde, Charlotte M. and Furlong, Emily and Bielczyk, Natalia and Jadavji, Nafisa M. and Shah, Aparna P. and Davla, Sejal}, issn = {1742-4658}, journal = {FEBS Journal}, number = {6}, pages = {1374--1384}, publisher = {Wiley}, title = {{Building and sustaining mentor interactions as a mentee}}, doi = {10.1111/febs.15823}, volume = {289}, year = {2022}, } @article{9649, abstract = {Isomanifolds are the generalization of isosurfaces to arbitrary dimension and codimension, i.e. manifolds defined as the zero set of some multivariate vector-valued smooth function f : Rd → Rd−n. A natural (and efficient) way to approximate an isomanifold is to consider its Piecewise-Linear (PL) approximation based on a triangulation T of the ambient space Rd. In this paper, we give conditions under which the PL-approximation of an isomanifold is topologically equivalent to the isomanifold. The conditions are easy to satisfy in the sense that they can always be met by taking a sufficiently fine triangulation T . This contrasts with previous results on the triangulation of manifolds where, in arbitrary dimensions, delicate perturbations are needed to guarantee topological correctness, which leads to strong limitations in practice. We further give a bound on the Fréchet distance between the original isomanifold and its PL-approximation. Finally we show analogous results for the PL-approximation of an isomanifold with boundary.}, author = {Boissonnat, Jean-Daniel and Wintraecken, Mathijs}, issn = {1615-3383}, journal = {Foundations of Computational Mathematics }, pages = {967--1012}, publisher = {Springer Nature}, title = {{The topological correctness of PL approximations of isomanifolds}}, doi = {10.1007/s10208-021-09520-0}, volume = {22}, year = {2022}, } @article{9794, abstract = {Lymph nodes (LNs) comprise two main structural elements: fibroblastic reticular cells that form dedicated niches for immune cell interaction and capsular fibroblasts that build a shell around the organ. Immunological challenge causes LNs to increase more than tenfold in size within a few days. Here, we characterized the biomechanics of LN swelling on the cellular and organ scale. We identified lymphocyte trapping by influx and proliferation as drivers of an outward pressure force, causing fibroblastic reticular cells of the T-zone (TRCs) and their associated conduits to stretch. After an initial phase of relaxation, TRCs sensed the resulting strain through cell matrix adhesions, which coordinated local growth and remodeling of the stromal network. While the expanded TRC network readopted its typical configuration, a massive fibrotic reaction of the organ capsule set in and countered further organ expansion. Thus, different fibroblast populations mechanically control LN swelling in a multitier fashion.}, author = {Assen, Frank P and Abe, Jun and Hons, Miroslav and Hauschild, Robert and Shamipour, Shayan and Kaufmann, Walter and Costanzo, Tommaso and Krens, Gabriel and Brown, Markus and Ludewig, Burkhard and Hippenmeyer, Simon and Heisenberg, Carl-Philipp J and Weninger, Wolfgang and Hannezo, Edouard B and Luther, Sanjiv A. and Stein, Jens V. and Sixt, Michael K}, issn = {1529-2916}, journal = {Nature Immunology}, pages = {1246--1255}, publisher = {Springer Nature}, title = {{Multitier mechanics control stromal adaptations in swelling lymph nodes}}, doi = {10.1038/s41590-022-01257-4}, volume = {23}, year = {2022}, } @article{9955, abstract = {Neurons can change their classical neurotransmitters during ontogeny, sometimes going through stages of dual release. Here, we explored the development of the neurotransmitter identity of neurons of the avian nucleus isthmi parvocellularis (Ipc), whose axon terminals are retinotopically arranged in the optic tectum (TeO) and exert a focal gating effect upon the ascending transmission of retinal inputs. Although cholinergic and glutamatergic markers are both found in Ipc neurons and terminals of adult pigeons and chicks, the mRNA expression of the vesicular acetylcholine transporter, VAChT, is weak or absent. To explore how the Ipc neurotransmitter identity is established during ontogeny, we analyzed the expression of mRNAs coding for cholinergic (ChAT, VAChT, and CHT) and glutamatergic (VGluT2 and VGluT3) markers in chick embryos at different developmental stages. We found that between E12 and E18, Ipc neurons expressed all cholinergic mRNAs and also VGluT2 mRNA; however, from E16 through posthatch stages, VAChT mRNA expression was specifically diminished. Our ex vivo deposits of tracer crystals and intracellular filling experiments revealed that Ipc axons exhibit a mature paintbrush morphology late in development, experiencing marked morphological transformations during the period of presumptive dual vesicular transmitter release. Additionally, although ChAT protein immunoassays increasingly label the growing Ipc axon, this labeling was consistently restricted to sparse portions of the terminal branches. Combined, these results suggest that the synthesis of glutamate and acetylcholine, and their vesicular release, is complexly linked to the developmental processes of branching, growing and remodeling of these unique axons.}, author = {Reyes‐Pinto, Rosana and Ferrán, José L. and Vega Zuniga, Tomas A and González‐Cabrera, Cristian and Luksch, Harald and Mpodozis, Jorge and Puelles, Luis and Marín, Gonzalo J.}, issn = {1096-9861}, journal = {Journal of Comparative Neurology}, number = {2}, pages = {553--573}, publisher = {Wiley}, title = {{Change in the neurochemical signature and morphological development of the parvocellular isthmic projection to the avian tectum}}, doi = {10.1002/cne.25229}, volume = {530}, year = {2022}, } @article{9977, abstract = {For a Seifert fibered homology sphere X we show that the q-series invariant Zˆ0(X; q) introduced by Gukov-Pei-Putrov-Vafa, is a resummation of the Ohtsuki series Z0(X). We show that for every even k ∈ N there exists a full asymptotic expansion of Zˆ0(X; q) for q tending to e 2πi/k, and in particular that the limit Zˆ0(X; e 2πi/k) exists and is equal to the WRT quantum invariant τk(X). We show that the poles of the Borel transform of Z0(X) coincide with the classical complex Chern-Simons values, which we further show classifies the corresponding components of the moduli space of flat SL(2, C)-connections.}, author = {Mistegaard, William and Andersen, Jørgen Ellegaard}, issn = {1469-7750}, journal = {Journal of the London Mathematical Society}, number = {2}, pages = {709--764}, publisher = {Wiley}, title = {{Resurgence analysis of quantum invariants of Seifert fibered homology spheres}}, doi = {10.1112/jlms.12506}, volume = {105}, year = {2022}, } @article{17383, abstract = {We present a computational inverse design framework for a new class of volumetric deployable structures that have compact rest states and deploy into bending-active 3D target surfaces. Umbrella meshes consist of elastic beams, rigid plates, and hinge joints that can be directly printed or assembled in a zero-energy fabrication state. During deployment, as the elastic beams of varying heights rotate from vertical to horizontal configurations, the entire structure transforms from a compact block into a target curved surface. Umbrella Meshes encode both intrinsic and extrinsic curvature of the target surface and in principle are free from the area expansion ratio bounds of past auxetic material systems. We build a reduced physics-based simulation framework to accurately and efficiently model the complex interaction between the elastically deforming components. To determine the mesh topology and optimal shape parameters for approximating a given target surface, we propose an inverse design optimization algorithm initialized with conformal flattening. Our algorithm minimizes the structure's strain energy in its deployed state and optimizes actuation forces so that the final deployed structure is in stable equilibrium close to the desired surface with few or no external constraints. We validate our approach by fabricating a series of physical models at various scales using different manufacturing techniques.}, author = {Ren, Yingying and Kusupati, Uday and Panetta, Julian and Isvoranu, Florin and Pellis, Davide and Chen, Tian and Pauly, Mark}, issn = {1557-7368}, journal = {ACM Transactions on Graphics}, number = {4}, pages = {1--15}, publisher = {Association for Computing Machinery}, title = {{Umbrella meshes: Elastic mechanisms for freeform shape deployment}}, doi = {10.1145/3528223.3530089}, volume = {41}, year = {2022}, } @article{17501, abstract = {Low-level systems code often needs to interact with data, such as page table entries or network packet headers, in which multiple pieces of information are packaged together as bitfield components of a single machine integer and accessed via bitfield manipulations (e.g., shifts and masking). Most existing approaches to verifying such code employ SMT solvers, instantiated with theories for bit vector reasoning: these provide a powerful hammer, but also significantly increase the trusted computing base of the verification toolchain. In this work, we propose an alternative approach to the verification of bitfield-manipulating systems code, which we call BFF. Building on the RefinedC framework, BFF is not only highly automated (as SMT-based approaches are) but also foundational---i.e., it produces a machine-checked proof of program correctness against a formal semantics for C programs, fully mechanized in Coq. Unlike SMT-based approaches, we do not try to solve the general problem of arbitrary bit vector reasoning, but rather observe that real systems code typically accesses bitfields using simple, well-understood programming patterns: the layout of a bit vector is known up front, and its bitfields are accessed in predictable ways through a handful of bitwise operations involving bit masks. Correspondingly, we center our approach around the concept of a structured bit vector---i.e., a bit vector with a known bitfield layout---which we use to drive simple and predictable automation. We validate the BFF approach by verifying a range of bitfield-manipulating C functions drawn from real systems code, including page table manipulation code from the Linux kernel and the pKVM hypervisor.}, author = {Zhu, Fengmin and Sammler, Michael Joachim and Lepigre, Rodolphe and Dreyer, Derek and Garg, Deepak}, issn = {2475-1421}, journal = {Proceedings of the ACM on Programming Languages}, number = {OOPSLA2}, pages = {1613--1638}, publisher = {Association for Computing Machinery}, title = {{BFF: Foundational and automated verification of bitfield-manipulating programs}}, doi = {10.1145/3563345}, volume = {6}, year = {2022}, } @inproceedings{17502, abstract = {Recent years have seen great advances towards verifying large-scale systems code. However, these verifications are usually based on hand-written assembly or machine-code semantics for the underlying architecture that only cover a small part of the instruction set architecture (ISA). In contrast, other recent work has used Sail to establish formal models for large real-world architectures, including Armv8-A and RISC-V, that are comprehensive (complete enough to boot an operating system or hypervisor) and authoritative (automatically derived from the Arm internal model and validated against the Arm validation suite, and adopted as the official formal specification by RISC-V International, respectively). But the scale and complexity of these models makes them challenging to use as a basis for verification. In this paper, we propose Islaris, the first system to support verification of machine code above these complete and authoritative real-world ISA specifications. Islaris uses a novel combination of SMT-solver-based symbolic execution (the Isla symbolic executor) and automated reasoning in a foundational program logic (a new separation logic we derive using Iris in Coq). We show that this approach can handle Armv8-A and RISC-V machine code exercising a wide range of systems features, including installing and calling exception vectors, code parametric on a relocation address offset (from the production pKVM hypervisor); unaligned access faults; memory-mapped IO; and compiled C code using inline assembly and function pointers.}, author = {Sammler, Michael Joachim and Hammond, Angus and Lepigre, Rodolphe and Campbell, Brian and Pichon-Pharabod, Jean and Dreyer, Derek and Garg, Deepak and Sewell, Peter}, booktitle = {Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation}, location = {San Diego, CA, United States}, pages = {825--840}, publisher = {Association for Computing Machinery}, title = {{Islaris: Verification of machine code against authoritative ISA semantics}}, doi = {10.1145/3519939.3523434}, year = {2022}, } @article{17503, abstract = {Systems code often requires fine-grained control over memory layout and pointers, expressed using low-level (e.g., bitwise) operations on pointer values. Since these operations go beyond what basic pointer arithmetic in C allows, they are performed with the help of integer-pointer casts. Prior work has explored increasingly realistic memory object models for C that account for the desired semantics of integer-pointer casts while also being sound w.r.t. compiler optimisations, culminating in PNVI, the preferred memory object model in ongoing discussions within the ISO WG14 C standards committee. However, its complexity makes it an unappealing target for verification, and no tools currently exist to verify C programs under PNVI. In this paper, we introduce VIP, a new memory object model aimed at supporting C verification. VIP sidesteps the complexities of PNVI with a simple but effective idea: a new construct that lets programmers express the intended provenances of integer-pointer casts explicitly. At the same time, we prove VIP compatible with PNVI, thus enabling verification on top of VIP to benefit from PNVI’s validation with respect to practice. In particular, we build a verification tool, RefinedC-VIP, for verifying programs under VIP semantics. As the name suggests, RefinedC-VIP extends the recently developed RefinedC tool, which is automated yet also produces foundational proofs in Coq. We evaluate RefinedC-VIP on a range of systems-code idioms, and validate VIP’s expressiveness via an implementation in the Cerberus C semantics.}, author = {Lepigre, Rodolphe and Sammler, Michael Joachim and Memarian, Kayvan and Krebbers, Robbert and Dreyer, Derek and Sewell, Peter}, issn = {2475-1421}, journal = {Proceedings of the ACM on Programming Languages}, number = {POPL}, pages = {1--32}, publisher = {Association for Computing Machinery}, title = {{VIP: Verifying real-world C idioms with integer-pointer casts}}, doi = {10.1145/3498681}, volume = {6}, year = {2022}, } @article{17504, abstract = {Today’s compilers employ a variety of non-trivial optimizations to achieve good performance. One key trick compilers use to justify transformations of concurrent programs is to assume that the source program has no data races: if it does, they cause the program to have undefined behavior (UB) and give the compiler free rein. However, verifying correctness of optimizations that exploit this assumption is a non-trivial problem. In particular, prior work either has not proven that such optimizations preserve program termination (particularly non-obvious when considering optimizations that move instructions out of loop bodies), or has treated all synchronization operations as external functions (losing the ability to reorder instructions around them). In this work we present Simuliris, the first simulation technique to establish termination preservation (under a fair scheduler) for a range of concurrent program transformations that exploit UB in the source language. Simuliris is based on the idea of using ownership to reason modularly about the assumptions the compiler makes about programs with well-defined behavior. This brings the benefits of concurrent separation logics to the space of verifying program transformations: we can combine powerful reasoning techniques such as framing and coinduction to perform thread-local proofs of non-trivial concurrent program optimizations. Simuliris is built on a (non-step-indexed) variant of the Coq-based Iris framework, and is thus not tied to a particular language. In addition to demonstrating the effectiveness of Simuliris on standard compiler optimizations involving data race UB, we also instantiate it with Jung et al.’s Stacked Borrows semantics for Rust and generalize their proofs of interesting type-based aliasing optimizations to account for concurrency.}, author = {Gäher, Lennard and Sammler, Michael Joachim and Spies, Simon and Jung, Ralf and Dang, Hoang-Hai and Krebbers, Robbert and Kang, Jeehoon and Dreyer, Derek}, issn = {2475-1421}, journal = {Proceedings of the ACM on Programming Languages}, number = {POPL}, pages = {1--31}, publisher = {Association for Computing Machinery}, title = {{Simuliris: A separation logic framework for verifying concurrent program optimizations}}, doi = {10.1145/3498689}, volume = {6}, year = {2022}, } @article{17526, abstract = {The self-lensing of a massive black hole binary (MBHB), which occurs when the two BHs are aligned close to the line of sight, is expected to produce periodic, short-duration flares. Here we study the shapes of self-lensing flares (SLFs) via general-relativistic ray tracing in a superimposed binary BH metric, in which the emission is generated by geometrically thin accretion flows around each component. The suite of models covers eccentric binary orbits, black hole spins, unequal mass binaries, and different emission model geometries. We explore the above parameter space and report how the light curves change as a function of, e.g., binary separation, inclination, and eccentricity. We also compare our light curves to those in the microlensing approximation, and show how strong deflections, as well as time-delay effects, change the size and shape of the SLF. If gravitational waves (GWs) from the inspiraling MBHB are observed by LISA, SLFs can help securely identify the source and localizing it on the sky, and to constrain the graviton mass by comparing the phasing of the SLFs and the GWs. Additionally, when these systems are viewed edge-on the SLF shows a distinct dip that can be directly correlated with the BH shadow size. This opens a new way to measure BH shadow sizes in systems that are unresolvable by current VLBI facilities.}, author = {Davelaar, Jordy and Haiman, Zoltán}, issn = {2470-0010}, journal = {Physical Review D}, number = {10}, publisher = {American Physical Society (APS)}, title = {{Self-lensing flares from black hole binaries: General-relativistic ray tracing of black hole binaries}}, doi = {10.1103/physrevd.105.103010}, volume = {105}, year = {2022}, } @article{17536, abstract = {There is some weak evidence that the black hole merger named GW190521 had a non-zero eccentricity. In addition, the component black holes' masses exceeded the limit predicted by stellar evolution. The large masses can be explained by successive mergers, which may be efficient in gas disks surrounding active galactic nuclei (AGN), but it is difficult to maintain an eccentric orbit all the way to the merger, as basic physics would argue for circularization. Here we show that AGN-disk environments can lead to an excess of eccentric mergers, if the interactions between single and binary black holes are frequent, and occur with mutual inclinations of less than a few degrees. We further illustrate that this eccentric population has a different distribution of the inclination between the spin vectors of the black holes and their orbital angular momentum at merger, referred to as the spin-orbit tilt, compared to the remaining circular mergers.}, author = {Samsing, J. and Bartos, I. and D’Orazio, D. J. and Haiman, Zoltán and Kocsis, B. and Leigh, N. W. C. and Liu, B. and Pessah, M. E. and Tagawa, H.}, issn = {0028-0836}, journal = {Nature}, number = {7900}, pages = {237--240}, publisher = {Springer Science and Business Media LLC}, title = {{AGN as potential factories for eccentric black hole mergers}}, doi = {10.1038/s41586-021-04333-1}, volume = {603}, year = {2022}, } @article{17547, abstract = {Supermassive black hole (BH) binaries are thought to produce self-lensing flares (SLFs) when the two BHs are aligned with the line of sight. If the binary orbit is observed nearly edge-on, we find a distinct feature in the light curve imprinted by the relativistic shadow around the background (“source”) BH. We study this feature by ray tracing in a binary model and predict that 1% of the current binary candidates could show this feature. Our BH tomography method proposed here could make it possible to extract BH shadows that are spatially unresolvable by high-resolution very long base line interferometry (VLBI).}, author = {Davelaar, Jordy and Haiman, Zoltán}, issn = {0031-9007}, journal = {Physical Review Letters}, number = {19}, publisher = {American Physical Society}, title = {{Self-Lensing flares from black hole binaries: Observing black hole shadows via light curve tomography}}, doi = {10.1103/physrevlett.128.191101}, volume = {128}, year = {2022}, } @article{17553, abstract = {Linear analysis of gas flows around orbiting binaries suggests that a centrifugal barrier ought to clear a low-density cavity around the binary and inhibit mass transfer onto it. Modern hydrodynamics simulations have confirmed the low-density cavity, but show that any mass flowing from large scales into the circumbinary disk is eventually transferred onto the binary components. Even though many numerical studies confirm this picture, it is still not understood precisely how gas parcels overcome the centrifugal barrier and ultimately accrete. We present a detailed analysis of the binary accretion process, using an accurate prescription for evolving grid-based hydrodynamics with Lagrangian tracer particles that track the trajectories of individual gas parcels. We find that binary accretion can be described in four phases: (1) gas is viscously transported through the circumbinary disk up to the centrifugal barrier at the cavity wall, (2) the cavity wall is tidally distorted into accretion streams consisting of near-ballistic gas parcels on eccentric orbits, (3) the portion of each stream moving inwards of an ``accretion horizon'' radius r¯≃a -- the radius beyond which no material is returned to the cavity wall -- becomes bound to a minidisk orbiting an individual binary component, and (4) the minidisk gas accretes onto the binary component through the combined effect of viscous and tidal stresses.}, author = {Tiede, Christopher and Zrake, Jonathan and MacFadyen, Andrew and Haiman, Zoltán}, issn = {0004-637X}, journal = {The Astrophysical Journal}, number = {1}, publisher = {American Astronomical Society}, title = {{How binaries accrete: Hydrodynamic simulations with passive tracer particles}}, doi = {10.3847/1538-4357/ac6c2b}, volume = {932}, year = {2022}, } @article{17560, abstract = {Observations of the most luminous quasars at high redshifts (z>6) have revealed that the largest supermassive black holes (SMBHs) at those epochs tend to be substantially overmassive relative to their host galaxies compared to the local relations, suggesting they experienced rapid early growth phases. We propose an assembly model for the SMBHs that end up in rare massive ∼1012 M⊙ host halos at z∼6−7, applying a kinetic feedback prescription for BHs accreting above the Eddington rate, provided by radiation hydrodynamic simulations for the long-term evolution of the accretion-flow structure. The large inflow rates into these halos during their assembly enable the formation of >109 M⊙ SMBHs by z∼6, even starting from stellar-mass seeds at z∼30, and even in the presence of outflows that reduce the BH feeding rate, especially at early times. This mechanism also naturally yields a high BH-to-galaxy mass ratio of >0.01 before the SMBH mass reaches MBH>109 M⊙ by z∼6. These fast-growing SMBH progenitors are bright enough to be detected by upcoming observations with the James Webb Space Telescope over a wide range of redshift (7