Tootfinder

DLHT: A Non-blocking Resizable Hashtable with Fast Deletes and Memory-awareness
Antonios Katsarakis, Vasilis Gavrielatos, Nikos Ntarmos
https://arxiv.org/abs/2406.09986

DLHT: A Non-blocking Resizable Hashtable with Fast Deletes and Memory-awareness
This paper presents DLHT, a concurrent in-memory hashtable. Despite efforts to optimize hashtables, that go as far as sacrificing core functionality, state-of-the-art designs still incur multiple memory accesses per request and block request processing in three cases. First, most hashtables block while waiting for data to be retrieved from memory. Second, open-addressing designs, which represent the current state-of-the-art, either cannot free index slots on deletes or must block all requests t…

This https://arxiv.org/abs/2308.05378 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

On covering systems of polynomial rings over finite fields
In 1950, Erdős posed a question known as the minimum modulus problem on covering systems for $\mathbb{Z}$, which asked whether the minimum modulus of a covering system with distinct moduli is bounded. This long-standing problem was finally resolved by Hough in 2015, as he proved that the minimum modulus of any covering system with distinct moduli does not exceed $10^{16}$. Recently, Balister, Bollobás, Morris, Sahasrabudhe, and Tiba developed a versatile method called the distortion method an…

Acceleration without Disruption: DFT Software as a Service
Fusong Ju, Xinran Wei, Lin Huang, Andrew J. Jenkins, Leo Xia, Jia Zhang, Jianwei Zhu, Han Yang, Bin Shao, Peggy Dai, Ashwin Mayya, Zahra Hooshmand, Alexandra Efimovskaya, Nathan A. Baker, Matthias Troyer, Hongbin Liu
https://arxiv.org/abs/2406.11185 https://arxiv.org/pdf/2406.11185
arXiv:2406.11185v1 Announce Type: new
Abstract: Density functional theory (DFT) has been a cornerstone in computational chemistry, physics, and materials science for decades, benefiting from advancements in computational power and theoretical methods. This paper introduces a novel, cloud-native application, Accelerated DFT, which offers an order of magnitude acceleration in DFT simulations. By integrating state-of-the-art cloud infrastructure and redesigning algorithms for graphic processing units (GPUs), Accelerated DFT achieves high-speed calculations without sacrificing accuracy. It provides an accessible and scalable solution for the increasing demands of DFT calculations in scientific communities. The implementation details, examples, and benchmark results illustrate how Accelerated DFT can significantly expedite scientific discovery across various domains.

This https://arxiv.org/abs/2309.15364 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Non-stationary difference equation and affine Laumon space II: Quantum Knizhnik-Zamolodchikov equation
We show that Shakirov's non-stationary difference equation, when it is truncated, implies the quantum Knizhnik-Zamolodchikov ($q$-KZ) equation for $U_{\mathsf v}(A_1^{(1)})$ with generic spins. Namely we can tune mass parameters so that the Hamiltonian acts on the space of finite Laurent polynomials. Then the representation matrix of the Hamiltonian agrees with the $R$-matrix, or the quantum $6j$ symbols. On the other hand, we prove that the $K$ theoretic Nekrasov partition function from the af…

🔊 #NowPlaying on BBCRadio3's #Breakfast
Thorkell Sigurbjörnsson, Schola Cantorum Reykjavicensis & Hörður Áskelsson:
🎵 Heyr himna smidur
#ThorkellSigurbjörnsson #ScholaCantorumReykjavicensis #HörðurÁskelsson