TY - JOUR AB - Self-replication of amyloid fibrils via secondary nucleation is an intriguing physicochemical phenomenon in which existing fibrils catalyze the formation of their own copies. The molecular events behind this fibril surface-mediated process remain largely inaccessible to current structural and imaging techniques. Using statistical mechanics, computer modeling, and chemical kinetics, we show that the catalytic structure of the fibril surface can be inferred from the aggregation behavior in the presence and absence of a fibril-binding inhibitor. We apply our approach to the case of Alzheimer’s A amyloid fibrils formed in the presence of proSP-C Brichos inhibitors. We find that self-replication of A fibrils occurs on small catalytic sites on the fibril surface, which are far apart from each other, and each of which can be covered by a single Brichos inhibitor. AU - Curk, Samo AU - Krausser, Johannes AU - Meisl, Georg AU - Frenkel, Daan AU - Linse, Sara AU - Michaels, Thomas C.T. AU - Knowles, Tuomas P.J. AU - Šarić, Anđela ID - 15001 IS - 7 JF - Proceedings of the National Academy of Sciences of the United States of America TI - Self-replication of Aβ42 aggregates occurs on small and isolated fibril sites VL - 121 ER - TY - JOUR AB - The lattice Schwinger model, the discrete version of QED in 1 + 1 dimensions, is a well-studied test bench for lattice gauge theories. Here, we study the fractal properties of this model. We reveal the self-similarity of the ground state, which allows us to develop a recurrent procedure for finding the ground-state wave functions and predicting ground-state energies. We present the results of recurrently calculating ground-state wave functions using the fractal Ansatz and automized software package for fractal image processing. In certain parameter regimes, just a few terms are enough for our recurrent procedure to predict ground-state energies close to the exact ones for several hundreds of sites. Our findings pave the way to understanding the complexity of calculating many-body wave functions in terms of their fractal properties as well as finding new links between condensed matter and high-energy lattice models. AU - Petrova, Elena AU - Tiunov, Egor S. AU - Bañuls, Mari Carmen AU - Fedorov, Aleksey K. ID - 15002 IS - 5 JF - Physical Review Letters SN - 0031-9007 TI - Fractal states of the Schwinger model VL - 132 ER - TY - JOUR AB - In this paper we introduce the critical variational setting for parabolic stochastic evolution equations of quasi- or semi-linear type. Our results improve many of the abstract results in the classical variational setting. In particular, we are able to replace the usual weak or local monotonicity condition by a more flexible local Lipschitz condition. Moreover, the usual growth conditions on the multiplicative noise are weakened considerably. Our new setting provides general conditions under which local and global existence and uniqueness hold. Moreover, we prove continuous dependence on the initial data. We show that many classical SPDEs, which could not be covered by the classical variational setting, do fit in the critical variational setting. In particular, this is the case for the Cahn-Hilliard equations, tamed Navier-Stokes equations, and Allen-Cahn equation. AU - Agresti, Antonio AU - Veraar, Mark ID - 12485 JF - Probability Theory and Related Fields SN - 0178-8051 TI - The critical variational setting for stochastic evolution equations ER - TY - CONF AB - Oblivious routing is a well-studied paradigm that uses static precomputed routing tables for selecting routing paths within a network. Existing oblivious routing schemes with polylogarithmic competitive ratio for general networks are tree-based, in the sense that routing is performed according to a convex combination of trees. However, this restriction to trees leads to a construction that has time quadratic in the size of the network and does not parallelize well. In this paper we study oblivious routing schemes based on electrical routing. In particular, we show that general networks with n vertices and m edges admit a routing scheme that has competitive ratio O(log² n) and consists of a convex combination of only O(√m) electrical routings. This immediately leads to an improved construction algorithm with time Õ(m^{3/2}) that can also be implemented in parallel with Õ(√m) depth. AU - Goranci, Gramoz AU - Henzinger, Monika H AU - Räcke, Harald AU - Sachdeva, Sushant AU - Sricharan, A. R. ID - 15008 SN - 1868-8969 T2 - 15th Innovations in Theoretical Computer Science Conference TI - Electrical flows for polylogarithmic competitive oblivious routing VL - 287 ER - TY - CONF AB - Traditional blockchains grant the miner of a block full control not only over which transactions but also their order. This constitutes a major flaw discovered with the introduction of decentralized finance and allows miners to perform MEV attacks. In this paper, we address the issue of sandwich attacks by providing a construction that takes as input a blockchain protocol and outputs a new blockchain protocol with the same security but in which sandwich attacks are not profitable. Furthermore, our protocol is fully decentralized with no trusted third parties or heavy cryptography primitives and carries a linear increase in latency and minimum computation overhead. AU - Alpos, Orestis AU - Amores-Sesar, Ignacio AU - Cachin, Christian AU - Yeo, Michelle X ID - 15007 SN - 1868-8969 T2 - 27th International Conference on Principles of Distributed Systems TI - Eating sandwiches: Modular and lightweight elimination of transaction reordering attacks VL - 286 ER -