Publications

Order by: publication date number of citations

HYPERTILING — a high performance Python library for the generation and visualization of hyperbolic lattices

Manuel Schrauth, Yanick Thurn, Florian Goth, Jefferson S. E. Portela, Dietmar Herdt, Felix Dusel

SciPost Phys. Codebases 34 (2024) · published 28 August 2024 | · pdf

HYPERTILING is a high-performance Python library for the generation and visualization of regular hyperbolic lattices embedded in the Poincar\'e disk model. Using highly optimized, efficient algorithms, hyperbolic tilings with millions of vertices can be created in a matter of minutes on a single workstation computer. Facilities including computation of adjacent vertices, dynamic lattice manipulation, refinements, as well as powerful plotting and animation capabilities are provided to support advanced uses of hyperbolic graphs. In this manuscript, we present a comprehensive exploration of the package, encompassing its mathematical foundations, usage examples, applications, and a detailed description of its implementation.

1 citation
Codebase release 1.3 for HYPERTILING

Manuel Schrauth, Yanick Thurn, Florian Goth, Jefferson S. E. Portela, Dietmar Herdt, Felix Dusel

SciPost Phys. Codebases 34-r1.3 (2024) · published 28 August 2024 | · src

HYPERTILING is a high-performance Python library for the generation and visualization of regular hyperbolic lattices embedded in the Poincaré disk model. Using highly optimized, efficient algorithms, hyperbolic tilings with millions of vertices can be created in a matter of minutes on a single workstation computer. Facilities including computation of adjacent vertices, dynamic lattice manipulation, refinements, as well as powerful plotting and animation capabilities are provided to support advanced uses of hyperbolic graphs. In this manuscript, we present a comprehensive exploration of the package, encompassing its mathematical foundations, usage examples, applications, and a detailed description of its implementation.

1 citation
Codebase release 1.1 for GAPS

Michael H. Seymour, Siddharth Sule

SciPost Phys. Codebases 33-r1.1 (2024) · published 12 August 2024 | · src

The Single Instruction, Multiple Thread (SIMT) paradigm of GPU programming does not support the branching nature of a parton shower algorithm by definition. However, modern GPUs are designed to schedule threads with diverging processes independently, allowing them to handle such branches. With regular thread synchronisation and careful treatment of the individual steps, one can simulate a parton shower on a GPU. We present a Sudakov veto algorithm designed to simulate parton branching on multiple events in parallel. We also release a CUDA C++ program that generates matrix elements, showers partons and computes jet rates and event shapes for LEP at 91.2 GeV on a GPU. To benchmark its performance, we also provide a near-identical C++ program designed to simulate events serially on a CPU. While the consequences of branching are not absent, we demonstrate that a GPU can provide the throughput of a many-core CPU. As an example, we show that the time taken to shower $10^6$ events on one NVIDIA TESLA V100 GPU is equivalent to that of 295 Intel Xeon E5-2620 CPU cores.

1 citation
An algorithm to parallelise parton showers on a GPU

Michael H. Seymour, Siddharth Sule

SciPost Phys. Codebases 33 (2024) · published 12 August 2024 | · pdf

The Single Instruction, Multiple Thread (SIMT) paradigm of GPU programming does not support the branching nature of a parton shower algorithm by definition. However, modern GPUs are designed to schedule threads with diverging processes independently, allowing them to handle such branches. With regular thread synchronisation and careful treatment of the individual steps, one can simulate a parton shower on a GPU. We present a Sudakov veto algorithm designed to simulate parton branching on multiple events in parallel. We also release a CUDA C++ program that generates matrix elements, showers partons and computes jet rates and event shapes for LEP at 91.2 GeV on a GPU. To benchmark its performance, we also provide a near-identical C++ program designed to simulate events serially on a CPU. While the consequences of branching are not absent, we demonstrate that a GPU can provide the throughput of a many-core CPU. As an example, we show that the time taken to shower $10^6$ events on one NVIDIA TESLA V100 GPU is equivalent to that of 295 Intel Xeon E5-2620 CPU cores.

1 citation
disorder: Deep inelastic scattering at high orders

Alexander Karlberg

SciPost Phys. Codebases 32 (2024) · published 9 July 2024 | · pdf

We present a Fortran 77/95 code capable of computing QCD corrections in deep inelastic scattering (DIS). The code uses the Projection-to-Born method to augment an existing $\mathcal{O}(\alpha_{\mathrm{s}}^2)$ dijet DIS code, thereby obtaining predictions for photon-mediated neutral-current single-jet DIS production in the laboratory frame. The code is lightweight and fast, and yet includes the most common functionalities found in typical perturbative QCD programs, like automatic renormalisation and factorisation scale uncertainties, options to run and combine multiple seeds, and interfaces to fastjet and LHAPDF. Due to the underlying disent and HOPPET codes, the program also provides stable results in the infrared, relevant for extracting logarithmic coefficients for analytic resummations, and access to the massless DIS structure functions and (reduced) cross sections up to $\mathcal{O}(\alpha_{\mathrm{s}}^3)$.

1 citation
Codebase release r1.0 for disorder

Alexander Karlberg

SciPost Phys. Codebases 32-r1.0 (2024) · published 9 July 2024 | · src

We present a Fortran 77/95 code capable of computing QCD corrections in deep inelastic scattering (DIS). The code uses the Projection-to-Born method to augment an existing $\mathcal{O}(\alpha_{\mathrm{s}}^2)$ dijet DIS code, thereby obtaining predictions for photon-mediated neutral-current single-jet DIS production in the laboratory frame. The code is lightweight and fast, and yet includes the most common functionalities found in typical perturbative QCD programs, like automatic renormalisation and factorisation scale uncertainties, options to run and combine multiple seeds, and interfaces to fastjet and LHAPDF. Due to the underlying disent and HOPPET codes, the program also provides stable results in the infrared, relevant for extracting logarithmic coefficients for analytic resummations, and access to the massless DIS structure functions and (reduced) cross sections up to $\mathcal{O}(\alpha_{\mathrm{s}}^3)$.

1 citation
Introduction to the PanScales framework, version 0.1

Melissa van Beekveld, Mrinal Dasgupta, Basem Kamal El-Menoufi, Silvia Ferrario Ravasio, Keith Hamilton, Jack Helliwell, Alexander Karlberg, Rok Medves, Pier Francesco Monni, Gavin P. Salam, Ludovic Scyboz, Alba Soto-Ontoso, Gregory Soyez, Rob Verheyen

SciPost Phys. Codebases 31 (2024) · published 25 June 2024 | · pdf

In this article, we document version 0.1 of the PANSCALES code for parton shower simulations. With the help of a few examples, we discuss basic usage of the code, including tests of logarithmic accuracy of parton showers. We expose some of the numerical techniques underlying the logarithmic tests and include a description of how users can implement their own showers within the framework. Some of the simpler logarithmic tests can be performed in a few minutes on a modern laptop. As an early step towards phenomenology, we also outline some aspects of a preliminary interface to PYTHIA 8.3, for access to its hard matrix elements and its hadronisation modules.

3 citations
Codebase release r0.1 for PanScales

Melissa van Beekveld, Mrinal Dasgupta, Basem Kamal El-Menoufi, Silvia Ferrario Ravasio, Keith Hamilton, Jack Helliwell, Alexander Karlberg, Rok Medves, Pier Francesco Monni, Gavin P. Salam, Ludovic Scyboz, Alba Soto-Ontoso, Gregory Soyez, Rob Verheyen

SciPost Phys. Codebases 31-r0.1 (2024) · published 25 June 2024 | · src

In this article, we document version 0.1 of the PANSCALES code for parton shower simulations. With the help of a few examples, we discuss basic usage of the code, including tests of logarithmic accuracy of parton showers. We expose some of the numerical techniques underlying the logarithmic tests and include a description of how users can implement their own showers within the framework. Some of the simpler logarithmic tests can be performed in a few minutes on a modern laptop. As an early step towards phenomenology, we also outline some aspects of a preliminary interface to PYTHIA 8.3, for access to its hard matrix elements and its hadronisation modules.

1 citation
A tool to check whether a symmetry-compensated collinear magnetic material is antiferro- or altermagnetic

Andriy Smolyanyuk, Libor Šmejkal, Igor I. Mazin

SciPost Phys. Codebases 30 (2024) · published 12 June 2024 | · pdf

Altermagnets (AM) is a recently discovered class of collinear magnets that share some properties (anomalous transport, etc) with ferromagnets, some (zero net magnetization) with antiferromagnets, while also exhibiting unique properties (spin-splitting of electronic bands and resulting spin-splitter current). Since the moment compensation in AM is driven by symmetry, it must be possible to identify them by analyzing the crystal structure directly, without computing the electronic structure. Given the significant potential of AM for spintronics, it is very useful to have a tool for such an analysis. This work presents an open-access code implementing such a direct check.

1 citation
Codebase release r1.0 for amcheck

Andriy Smolyanyuk, Libor Šmejkal, Igor I. Mazin

SciPost Phys. Codebases 30-r1.0 (2024) · published 12 June 2024 | · src

Altermagnets (AM) is a recently discovered class of collinear magnets that share some properties (anomalous transport, etc) with ferromagnets, some (zero net magnetization) with antiferromagnets, while also exhibiting unique properties (spin-splitting of electronic bands and resulting spin-splitter current). Since the moment compensation in AM is driven by symmetry, it must be possible to identify them by analyzing the crystal structure directly, without computing the electronic structure. Given the significant potential of AM for spintronics, it is very useful to have a tool for such an analysis. This work presents an open-access code implementing such a direct check.

1 citation

Previous 1 2 3 4 5 6 7 Next

Publications

1 citation

1 citation

1 citation

1 citation

1 citation

1 citation

3 citations

1 citation

1 citation

1 citation