@inproceedings{12015, abstract = {We study the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a natural generalization of sphere packing and is defined as follows. Let P, N > 0 and L∈Z≥2. A multiple packing is a set C of points in Bn(0–,nP−−−√) such that any point in ℝ n lies in the intersection of at most L – 1 balls of radius nN−−−√ around points in C. 1 In this paper, we derive two lower bounds on the largest possible density of a multiple packing. These bounds are obtained through a stronger notion called average-radius multiple packing. Specifically, we exactly pin down the asymptotics of (expurgated) Gaussian codes and (expurgated) spherical codes under average-radius multiple packing. To this end, we apply tools from high-dimensional geometry and large deviation theory. The bound for spherical codes matches the previous best known bound which was obtained for the standard (weaker) notion of multiple packing through a curious connection with error exponents [Bli99], [ZV21]. The bound for Gaussian codes suggests that they are strictly inferior to spherical codes.}, author = {Zhang, Yihan and Vatedka, Shashank}, booktitle = {2022 IEEE International Symposium on Information Theory}, isbn = {9781665421591}, issn = {2157-8095}, location = {Espoo, Finland}, pages = {3085--3090}, publisher = {IEEE}, title = {{Lower bounds for multiple packing}}, doi = {10.1109/ISIT50566.2022.9834443}, volume = {2022}, year = {2022}, } @inproceedings{12016, abstract = {We consider the problem of coded distributed computing using polar codes. The average execution time of a coded computing system is related to the error probability for transmission over the binary erasure channel in recent work by Soleymani, Jamali and Mahdavifar, where the performance of binary linear codes is investigated. In this paper, we focus on polar codes and unveil a connection between the average execution time and the scaling exponent μ of the family of codes. In the finite-length characterization of polar codes, the scaling exponent is a key object capturing the speed of convergence to capacity. In particular, we show that (i) the gap between the normalized average execution time of polar codes and that of optimal MDS codes is O(n –1/μ ), and (ii) this upper bound can be improved to roughly O(n –1/2 ) by considering polar codes with large kernels. We conjecture that these bounds could be improved to O(n –2/μ ) and O(n –1 ), respectively, and provide a heuristic argument as well as numerical evidence supporting this view.}, author = {Fathollahi, Dorsa and Mondelli, Marco}, booktitle = {2022 IEEE International Symposium on Information Theory}, isbn = {9781665421591}, issn = {2157-8095}, location = {Espoo, Finland}, pages = {2154--2159}, publisher = {IEEE}, title = {{Polar coded computing: The role of the scaling exponent}}, doi = {10.1109/ISIT50566.2022.9834712}, volume = {2022}, year = {2022}, } @inproceedings{12017, abstract = {In the classic adversarial communication problem, two parties communicate over a noisy channel in the presence of a malicious jamming adversary. The arbitrarily varying channels (AVCs) offer an elegant framework to study a wide range of interesting adversary models. The optimal throughput or capacity over such AVCs is intimately tied to the underlying adversary model; in some cases, capacity is unknown and the problem is known to be notoriously hard. The omniscient adversary, one which knows the sender’s entire channel transmission a priori, is one of such classic models of interest; the capacity under such an adversary remains an exciting open problem. The myopic adversary is a generalization of that model where the adversary’s observation may be corrupted over a noisy discrete memoryless channel. Through the adversary’s myopicity, one can unify the slew of different adversary models, ranging from the omniscient adversary to one that is completely blind to the transmission (the latter is the well known oblivious model where the capacity is fully characterized).In this work, we present new results on the capacity under both the omniscient and myopic adversary models. We completely characterize the positive capacity threshold over general AVCs with omniscient adversaries. The characterization is in terms of two key combinatorial objects: the set of completely positive distributions and the CP-confusability set. For omniscient AVCs with positive capacity, we present non-trivial lower and upper bounds on the capacity; unlike some of the previous bounds, our bounds hold under fairly general input and jamming constraints. Our lower bound improves upon the generalized Gilbert-Varshamov bound for general AVCs while the upper bound generalizes the well known Elias-Bassalygo bound (known for binary and q-ary alphabets). For the myopic AVCs, we build on prior results known for the so-called sufficiently myopic model, and present new results on the positive rate communication threshold over the so-called insufficiently myopic regime (a completely insufficient myopic adversary specializes to an omniscient adversary). We present interesting examples for the widely studied models of adversarial bit-flip and bit-erasure channels. In fact, for the bit-flip AVC with additive adversarial noise as well as random noise, we completely characterize the omniscient model capacity when the random noise is sufficiently large vis-a-vis the adversary’s budget.}, author = {Yadav, Anuj Kumar and Alimohammadi, Mohammadreza and Zhang, Yihan and Budkuley, Amitalok J. and Jaggi, Sidharth}, booktitle = {2022 IEEE International Symposium on Information Theory}, isbn = {9781665421591}, issn = {2157-8095}, location = {Espoo, Finland}, pages = {2535--2540}, publisher = {Institute of Electrical and Electronics Engineers}, title = {{New results on AVCs with omniscient and myopic adversaries}}, doi = {10.1109/ISIT50566.2022.9834632}, volume = {2022}, year = {2022}, } @inproceedings{12018, abstract = {We study the problem of characterizing the maximal rates of list decoding in Euclidean spaces for finite list sizes. For any positive integer L ≥ 2 and real N > 0, we say that a subset C⊂Rn is an (N,L – 1)-multiple packing or an (N,L– 1)-list decodable code if every Euclidean ball of radius nN−−−√ in ℝ n contains no more than L − 1 points of C. We study this problem with and without ℓ 2 norm constraints on C, and derive the best-known lower bounds on the maximal rate for (N,L−1) multiple packing. Our bounds are obtained via error exponents for list decoding over Additive White Gaussian Noise (AWGN) channels. We establish a curious inequality which relates the error exponent, a quantity of average-case nature, to the list-decoding radius, a quantity of worst-case nature. We derive various bounds on the error exponent for list decoding in both bounded and unbounded settings which could be of independent interest beyond multiple packing.}, author = {Zhang, Yihan and Vatedka, Shashank}, booktitle = {2022 IEEE International Symposium on Information Theory}, isbn = {9781665421591}, issn = {2157-8095}, location = {Espoo, Finland}, pages = {1324--1329}, publisher = {Institute of Electrical and Electronics Engineers}, title = {{Lower bounds on list decoding capacity using error exponents}}, doi = {10.1109/ISIT50566.2022.9834815}, volume = {2022}, year = {2022}, } @inproceedings{12019, abstract = {This paper studies combinatorial properties of codes for the Z-channel. A Z-channel with error fraction τ takes as input a length-n binary codeword and injects in an adversarial manner up to nτ asymmetric errors, i.e., errors that only zero out bits but do not flip 0’s to 1’s. It is known that the largest (L − 1)-list-decodable code for the Z-channel with error fraction τ has exponential (in n) size if τ is less than a critical value that we call the Plotkin point and has constant size if τ is larger than the threshold. The (L−1)-list-decoding Plotkin point is known to be L−1L−1−L−LL−1. In this paper, we show that the largest (L−1)-list-decodable code ε-above the Plotkin point has size Θ L (ε −3/2 ) for any L − 1 ≥ 1.}, author = {Polyanskii, Nikita and Zhang, Yihan}, booktitle = {2022 IEEE International Symposium on Information Theory}, isbn = {9781665421591}, issn = {2157-8095}, location = {Espoo, Finland}, pages = {2553--2558}, publisher = {Institute of Electrical and Electronics Engineers}, title = {{List-decodable zero-rate codes for the Z-channel}}, doi = {10.1109/ISIT50566.2022.9834829}, volume = {2022}, year = {2022}, } @article{12051, abstract = {Transcription of the ribosomal RNA precursor by RNA polymerase (Pol) I is a major determinant of cellular growth, and dysregulation is observed in many cancer types. Here, we present the purification of human Pol I from cells carrying a genomic GFP fusion on the largest subunit allowing the structural and functional analysis of the enzyme across species. In contrast to yeast, human Pol I carries a single-subunit stalk, and in vitro transcription indicates a reduced proofreading activity. Determination of the human Pol I cryo-EM reconstruction in a close-to-native state rationalizes the effects of disease-associated mutations and uncovers an additional domain that is built into the sequence of Pol I subunit RPA1. This “dock II” domain resembles a truncated HMG box incapable of DNA binding which may serve as a downstream transcription factor–binding platform in metazoans. Biochemical analysis, in situ modelling, and ChIP data indicate that Topoisomerase 2a can be recruited to Pol I via the domain and cooperates with the HMG box domain–containing factor UBF. These adaptations of the metazoan Pol I transcription system may allow efficient release of positive DNA supercoils accumulating downstream of the transcription bubble.}, author = {Daiß, Julia L and Pilsl, Michael and Straub, Kristina and Bleckmann, Andrea and Höcherl, Mona and Heiss, Florian B and Abascal-Palacios, Guillermo and Ramsay, Ewan P and Tluckova, Katarina and Mars, Jean-Clement and Fürtges, Torben and Bruckmann, Astrid and Rudack, Till and Bernecky, Carrie A and Lamour, Valérie and Panov, Konstantin and Vannini, Alessandro and Moss, Tom and Engel, Christoph}, issn = {2575-1077}, journal = {Life Science Alliance}, keywords = {Health, Toxicology and Mutagenesis, Plant Science, Biochemistry, Genetics and Molecular Biology (miscellaneous), Ecology}, number = {11}, publisher = {Life Science Alliance}, title = {{The human RNA polymerase I structure reveals an HMG-like docking domain specific to metazoans}}, doi = {10.26508/lsa.202201568}, volume = {5}, year = {2022}, } @article{12052, abstract = {Directionality in the intercellular transport of the plant hormone auxin is determined by polar plasma membrane localization of PIN-FORMED (PIN) auxin transport proteins. However, apart from PIN phosphorylation at conserved motifs, no further determinants explicitly controlling polar PIN sorting decisions have been identified. Here we present Arabidopsis WAVY GROWTH 3 (WAV3) and closely related RING-finger E3 ubiquitin ligases, whose loss-of-function mutants show a striking apical-to-basal polarity switch in PIN2 localization in root meristem cells. WAV3 E3 ligases function as essential determinants for PIN polarity, acting independently from PINOID/WAG-dependent PIN phosphorylation. They antagonize ectopic deposition of de novo synthesized PIN proteins already immediately following completion of cell division, presumably via preventing PIN sorting into basal, ARF GEF-mediated trafficking. Our findings reveal an involvement of E3 ligases in the selective targeting of apically localized PINs in higher plants.}, author = {Konstantinova, N and Hörmayer, Lukas and Glanc, Matous and Keshkeih, R and Tan, Shutang and Di Donato, M and Retzer, K and Moulinier-Anzola, J and Schwihla, M and Korbei, B and Geisler, M and Friml, Jiří and Luschnig, C}, issn = {2041-1723}, journal = {Nature Communications}, publisher = {Springer Nature}, title = {{WAVY GROWTH Arabidopsis E3 ubiquitin ligases affect apical PIN sorting decisions}}, doi = {10.1038/s41467-022-32888-8}, volume = {13}, year = {2022}, } @article{12053, abstract = {Strigolactones (SLs) are a class of phytohormones that regulate plant shoot branching and adventitious root development. However, little is known regarding the role of SLs in controlling the behavior of the smallest unit of the organism, the single cell. Here, taking advantage of a classic single-cell model offered by the cotton (Gossypium hirsutum) fiber cell, we show that SLs, whose biosynthesis is fine-tuned by gibberellins (GAs), positively regulate cell elongation and cell wall thickness by promoting the biosynthesis of very-long-chain fatty acids (VLCFAs) and cellulose, respectively. Furthermore, we identified two layers of transcription factors (TFs) involved in the hierarchical regulation of this GA-SL crosstalk. The top-layer TF GROWTH-REGULATING FACTOR 4 (GhGRF4) directly activates expression of the SL biosynthetic gene DWARF27 (D27) to increase SL accumulation in fiber cells and GAs induce GhGRF4 expression. SLs induce the expression of four second-layer TF genes (GhNAC100-2, GhBLH51, GhGT2, and GhB9SHZ1), which transmit SL signals downstream to two ketoacyl-CoA synthase genes (KCS) and three cellulose synthase (CesA) genes by directly activating their transcription. Finally, the KCS and CesA enzymes catalyze the biosynthesis of very long chain fatty acids and cellulose, respectively, to regulate development of high-grade cotton fibers. In addition to providing a theoretical basis for cotton fiber improvement, our results shed light on SL signaling in plant development at the single-cell level.}, author = {Tian, Z and Zhang, Yuzhou and Zhu, L and Jiang, B and Wang, H and Gao, R and Friml, Jiří and Xiao, G}, issn = {1532-298X}, journal = {The Plant Cell}, number = {12}, pages = {4816--4839}, publisher = {Oxford University Press}, title = {{Strigolactones act downstream of gibberellins to regulate fiber cell elongation and cell wall thickness in cotton (Gossypium hirsutum)}}, doi = {10.1093/plcell/koac270}, volume = {34}, year = {2022}, } @article{12054, abstract = {Polar auxin transport is unique to plants and coordinates their growth and development1,2. The PIN-FORMED (PIN) auxin transporters exhibit highly asymmetrical localizations at the plasma membrane and drive polar auxin transport3,4; however, their structures and transport mechanisms remain largely unknown. Here, we report three inward-facing conformation structures of Arabidopsis thaliana PIN1: the apo state, bound to the natural auxin indole-3-acetic acid (IAA), and in complex with the polar auxin transport inhibitor N-1-naphthylphthalamic acid (NPA). The transmembrane domain of PIN1 shares a conserved NhaA fold5. In the substrate-bound structure, IAA is coordinated by both hydrophobic stacking and hydrogen bonding. NPA competes with IAA for the same site at the intracellular pocket, but with a much higher affinity. These findings inform our understanding of the substrate recognition and transport mechanisms of PINs and set up a framework for future research on directional auxin transport, one of the most crucial processes underlying plant development.}, author = {Yang, Z and Xia, J and Hong, J and Zhang, C and Wei, H and Ying, W and Sun, C and Sun, L and Mao, Y and Gao, Y and Tan, S and Friml, Jiří and Li, D and Liu, X and Sun, L}, issn = {1476-4687}, journal = {Nature}, number = {7927}, pages = {611--615}, publisher = {Springer Nature}, title = {{Structural insights into auxin recognition and efflux by Arabidopsis PIN1}}, doi = {10.1038/s41586-022-05143-9}, volume = {609}, year = {2022}, } @article{12067, abstract = {We present a divergent strategy for the fluorination of phenylacetic acid derivatives that is induced by a charge-transfer complex between Selectfluor and 4-(dimethylamino)pyridine. A comprehensive investigation of the conditions revealed a critical role of the solvent on the reaction outcome. In the presence of water, decarboxylative fluorination through a single-electron oxidation is dominant. Non-aqueous conditions result in the clean formation of α-fluoro-α-arylcarboxylic acids.}, author = {Madani, Amiera and Anghileri, Lucia and Heydenreich, Matthias and Möller, Heiko M. and Pieber, Bartholomäus}, issn = {1523-7052}, journal = {Organic Letters}, number = {29}, pages = {5376–5380}, publisher = {American Chemical Society}, title = {{Benzylic fluorination induced by a charge-transfer complex with a solvent-dependent selectivity switch}}, doi = {10.1021/acs.orglett.2c02050}, volume = {24}, year = {2022}, } @article{12079, abstract = {We extend the recent rigorous convergence result of Abels and Moser (SIAM J Math Anal 54(1):114–172, 2022. https://doi.org/10.1137/21M1424925) concerning convergence rates for solutions of the Allen–Cahn equation with a nonlinear Robin boundary condition towards evolution by mean curvature flow with constant contact angle. More precisely, in the present work we manage to remove the perturbative assumption on the contact angle being close to 90∘. We establish under usual double-well type assumptions on the potential and for a certain class of boundary energy densities the sub-optimal convergence rate of order ε12 for general contact angles α∈(0,π). For a very specific form of the boundary energy density, we even obtain from our methods a sharp convergence rate of order ε; again for general contact angles α∈(0,π). Our proof deviates from the popular strategy based on rigorous asymptotic expansions and stability estimates for the linearized Allen–Cahn operator. Instead, we follow the recent approach by Fischer et al. (SIAM J Math Anal 52(6):6222–6233, 2020. https://doi.org/10.1137/20M1322182), thus relying on a relative entropy technique. We develop a careful adaptation of their approach in order to encode the constant contact angle condition. In fact, we perform this task at the level of the notion of gradient flow calibrations. This concept was recently introduced in the context of weak-strong uniqueness for multiphase mean curvature flow by Fischer et al. (arXiv:2003.05478v2).}, author = {Hensel, Sebastian and Moser, Maximilian}, issn = {1432-0835}, journal = {Calculus of Variations and Partial Differential Equations}, number = {6}, publisher = {Springer Nature}, title = {{Convergence rates for the Allen–Cahn equation with boundary contact energy: The non-perturbative regime}}, doi = {10.1007/s00526-022-02307-3}, volume = {61}, year = {2022}, } @article{12082, abstract = {Proximity-dependent protein labeling provides a powerful in vivo strategy to characterize the interactomes of specific proteins. We previously optimized a proximity labeling protocol for Caenorhabditis elegans using the highly active biotin ligase TurboID. A significant constraint on the sensitivity of TurboID is the presence of abundant endogenously biotinylated proteins that take up bandwidth in the mass spectrometer, notably carboxylases that use biotin as a cofactor. In C. elegans, these comprise POD-2/acetyl-CoA carboxylase alpha, PCCA-1/propionyl-CoA carboxylase alpha, PYC-1/pyruvate carboxylase, and MCCC-1/methylcrotonyl-CoA carboxylase alpha. Here, we developed ways to remove these carboxylases prior to streptavidin purification and mass spectrometry by engineering their corresponding genes to add a C-terminal His10 tag. This allows us to deplete them from C. elegans lysates using immobilized metal affinity chromatography. To demonstrate the method's efficacy, we use it to expand the interactome map of the presynaptic active zone protein ELKS-1. We identify many known active zone proteins, including UNC-10/RIM, SYD-2/liprin-alpha, SAD-1/BRSK1, CLA-1/CLArinet, C16E9.2/Sentryn, as well as previously uncharacterized potentially synaptic proteins such as the ortholog of human angiomotin, F59C12.3 and the uncharacterized protein R148.3. Our approach provides a quick and inexpensive solution to a common contaminant problem in biotin-dependent proximity labeling. The approach may be applicable to other model organisms and will enable deeper and more complete analysis of interactors for proteins of interest.}, author = {Artan, Murat and Hartl, Markus and Chen, Weiqiang and De Bono, Mario}, issn = {1083-351X}, journal = {Journal of Biological Chemistry}, number = {9}, publisher = {Elsevier}, title = {{Depletion of endogenously biotinylated carboxylases enhances the sensitivity of TurboID-mediated proximity labeling in Caenorhabditis elegans}}, doi = {10.1016/j.jbc.2022.102343}, volume = {298}, year = {2022}, } @article{12083, abstract = {We consider the many-body time evolution of weakly interacting bosons in the mean field regime for initial coherent states. We show that bounded k-particle operators, corresponding to dependent random variables, satisfy both a law of large numbers and a central limit theorem.}, author = {Rademacher, Simone Anna Elvira}, issn = {0022-2488}, journal = {Journal of Mathematical Physics}, number = {8}, publisher = {AIP Publishing}, title = {{Dependent random variables in quantum dynamics}}, doi = {10.1063/5.0086712}, volume = {63}, year = {2022}, } @article{12084, abstract = {Neuronal networks encode information through patterns of activity that define the networks’ function. The neurons’ activity relies on specific connectivity structures, yet the link between structure and function is not fully understood. Here, we tackle this structure-function problem with a new conceptual approach. Instead of manipulating the connectivity directly, we focus on upper triangular matrices, which represent the network dynamics in a given orthonormal basis obtained by the Schur decomposition. This abstraction allows us to independently manipulate the eigenspectrum and feedforward structures of a connectivity matrix. Using this method, we describe a diverse repertoire of non-normal transient amplification, and to complement the analysis of the dynamical regimes, we quantify the geometry of output trajectories through the effective rank of both the eigenvector and the dynamics matrices. Counter-intuitively, we find that shrinking the eigenspectrum’s imaginary distribution leads to highly amplifying regimes in linear and long-lasting dynamics in nonlinear networks. We also find a trade-off between amplification and dimensionality of neuronal dynamics, i.e., trajectories in neuronal state-space. Networks that can amplify a large number of orthogonal initial conditions produce neuronal trajectories that lie in the same subspace of the neuronal state-space. Finally, we examine networks of excitatory and inhibitory neurons. We find that the strength of global inhibition is directly linked with the amplitude of amplification, such that weakening inhibitory weights also decreases amplification, and that the eigenspectrum’s imaginary distribution grows with an increase in the ratio between excitatory-to-inhibitory and excitatory-to-excitatory connectivity strengths. Consequently, the strength of global inhibition reveals itself as a strong signature for amplification and a potential control mechanism to switch dynamical regimes. Our results shed a light on how biological networks, i.e., networks constrained by Dale’s law, may be optimised for specific dynamical regimes.}, author = {Christodoulou, Georgia and Vogels, Tim P and Agnes, Everton J.}, issn = {1553-7358}, journal = {PLoS Computational Biology}, number = {8}, publisher = {Public Library of Science}, title = {{Regimes and mechanisms of transient amplification in abstract and biological neural networks}}, doi = {10.1371/journal.pcbi.1010365}, volume = {18}, year = {2022}, } @article{12085, abstract = {Molecular catch bonds are ubiquitous in biology and essential for processes like leucocyte extravasion1 and cellular mechanosensing2. Unlike normal (slip) bonds, catch bonds strengthen under tension. The current paradigm is that this feature provides ‘strength on demand3’, thus enabling cells to increase rigidity under stress1,4,5,6. However, catch bonds are often weaker than slip bonds because they have cryptic binding sites that are usually buried7,8. Here we show that catch bonds render reconstituted cytoskeletal actin networks stronger than slip bonds, even though the individual bonds are weaker. Simulations show that slip bonds remain trapped in stress-free areas, whereas weak binding allows catch bonds to mitigate crack initiation by moving to high-tension areas. This ‘dissociation on demand’ explains how cells combine mechanical strength with the adaptability required for shape change, and is relevant to diseases where catch bonding is compromised7,9, including focal segmental glomerulosclerosis10 caused by the α-actinin-4 mutant studied here. We surmise that catch bonds are the key to create life-like materials.}, author = {Mulla, Yuval and Avellaneda Sarrió, Mario and Roland, Antoine and Baldauf, Lucia and Jung, Wonyeong and Kim, Taeyoon and Tans, Sander J. and Koenderink, Gijsje H.}, issn = {1476-4660}, journal = {Nature Materials}, number = {9}, pages = {1019--1023}, publisher = {Springer Nature}, title = {{Weak catch bonds make strong networks}}, doi = {10.1038/s41563-022-01288-0}, volume = {21}, year = {2022}, } @inproceedings{12088, abstract = {We present a quantum-enabled microwave-telecom interface with bidirectional conversion efficiencies up to 15% and added input noise quanta as low as 0.16. Moreover, we observe evidence for electro-optic laser cooling and vacuum amplification.}, author = {Sahu, Rishabh and Hease, William J and Rueda Sanchez, Alfredo R and Arnold, Georg M and Qiu, Liu and Fink, Johannes M}, booktitle = {Conference on Lasers and Electro-Optics}, isbn = {9781557528209}, location = {San Jose, CA, United States}, publisher = {Optica Publishing Group}, title = {{Realizing a quantum-enabled interconnect between microwave and telecom light}}, doi = {10.1364/CLEO_QELS.2022.FW4D.4}, year = {2022}, } @inproceedings{12102, abstract = {Given a Markov chain M = (V, v_0, δ), with state space V and a starting state v_0, and a probability threshold ε, an ε-core is a subset C of states that is left with probability at most ε. More formally, C ⊆ V is an ε-core, iff ℙ[reach (V\C)] ≤ ε. Cores have been applied in a wide variety of verification problems over Markov chains, Markov decision processes, and probabilistic programs, as a means of discarding uninteresting and low-probability parts of a probabilistic system and instead being able to focus on the states that are likely to be encountered in a real-world run. In this work, we focus on the problem of computing a minimal ε-core in a Markov chain. Our contributions include both negative and positive results: (i) We show that the decision problem on the existence of an ε-core of a given size is NP-complete. This solves an open problem posed in [Jan Kretínský and Tobias Meggendorfer, 2020]. We additionally show that the problem remains NP-complete even when limited to acyclic Markov chains with bounded maximal vertex degree; (ii) We provide a polynomial time algorithm for computing a minimal ε-core on Markov chains over control-flow graphs of structured programs. A straightforward combination of our algorithm with standard branch prediction techniques allows one to apply the idea of cores to find a subset of program lines that are left with low probability and then focus any desired static analysis on this core subset.}, author = {Ahmadi, Ali and Chatterjee, Krishnendu and Goharshady, Amir Kafshdar and Meggendorfer, Tobias and Safavi Hemami, Roodabeh and Zikelic, Dorde}, booktitle = {42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}, isbn = {9783959772617}, issn = {1868-8969}, location = {Madras, India}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, title = {{Algorithms and hardness results for computing cores of Markov chains}}, doi = {10.4230/LIPIcs.FSTTCS.2022.29}, volume = {250}, year = {2022}, } @article{12107, abstract = {The sensitivity of coarse-grained daily extreme precipitation to sea surface temperature is analyzed using satellite precipitation estimates over the 300–302.5 K range. A theoretical scaling is proposed, linking changes in coarse-grained precipitation to changes in fine-scale hourly precipitation area fraction and changes in conditional fine-scale precipitation rates. The analysis reveals that the extreme coarse-grained precipitation scaling with temperature (∼7%/K) is dominated by the fine-scale precipitating fraction scaling (∼6.5%/K) when using a 3 mm/h fine-scale threshold to delineate the precipitating fraction. These results are shown to be robust to the selection of the precipitation product and to the percentile used to characterize the extreme. This new coarse-grained scaling is further related to the well-known scaling for fine-scale precipitation extremes, and suggests a compensation between thermodynamic and dynamic contributions or that both contributions are small with respect to that of fractional coverage. These results suggest that processes responsible for the changes in fractional coverage are to be accounted for to assess the sensitivity of coarse-grained extreme daily precipitation to surface temperature.}, author = {Roca, Rémy and De Meyer, Victorien and Muller, Caroline J}, issn = {1944-8007}, journal = {Geophysical Research Letters}, number = {24}, publisher = {Wiley}, title = {{Precipitating fraction, not intensity, explains extreme coarse-grained precipitation Clausius-Clapeyron scaling with sea surface temperature over tropical oceans}}, doi = {10.1029/2022GL100624}, volume = {49}, year = {2022}, } @article{12108, abstract = {The sequential exchange of filament composition to increase filament curvature was proposed as a mechanism for how some biological polymers deform and cut membranes. The relationship between the filament composition and its mechanical effect is lacking. We develop a kinetic model for the assembly of composite filaments that includes protein–membrane adhesion, filament mechanics and membrane mechanics. We identify the physical conditions for such a membrane remodeling and show this mechanism of sequential polymer assembly lowers the energetic barrier for membrane deformation.}, author = {Meadowcroft, Billie and Palaia, Ivan and Pfitzner, Anna Katharina and Roux, Aurélien and Baum, Buzz and Šarić, Anđela}, issn = {1079-7114}, journal = {Physical Review Letters}, number = {26}, publisher = {American Physical Society}, title = {{Mechanochemical rules for shape-shifting filaments that remodel membranes}}, doi = {10.1103/PhysRevLett.129.268101}, volume = {129}, year = {2022}, } @article{12110, abstract = {A recently proposed approach for avoiding the ultraviolet divergence of Hamiltonians with particle creation is based on interior-boundary conditions (IBCs). The approach works well in the non-relativistic case, i.e., for the Laplacian operator. Here, we study how the approach can be applied to Dirac operators. While this has successfully been done already in one space dimension, and more generally for codimension-1 boundaries, the situation of point sources in three dimensions corresponds to a codimension-3 boundary. One would expect that, for such a boundary, Dirac operators do not allow for boundary conditions because they are known not to allow for point interactions in 3D, which also correspond to a boundary condition. Indeed, we confirm this expectation here by proving that there is no self-adjoint operator on a (truncated) Fock space that would correspond to a Dirac operator with an IBC at configurations with a particle at the origin. However, we also present a positive result showing that there are self-adjoint operators with an IBC (on the boundary consisting of configurations with a particle at the origin) that are away from those configurations, given by a Dirac operator plus a sufficiently strong Coulomb potential.}, author = {Henheik, Sven Joscha and Tumulka, Roderich}, issn = {0022-2488}, journal = {Journal of Mathematical Physics}, number = {12}, publisher = {AIP Publishing}, title = {{Interior-boundary conditions for the Dirac equation at point sources in three dimensions}}, doi = {10.1063/5.0104675}, volume = {63}, year = {2022}, }