Paderborn University

works on

density functional theory 1 electronic structure 1 high-performance computing 1 open-source software 1 plane-wave methods 1 pseudopotentials 1

From the 1 of 1.2k papers with an AI index.

output

19942026

most citedQuantum ESPRESSO: a modular and open-source software project for quantum simulations of materials

29.3k citations

Showing math.COShow all

33 papers · 1 filter

math.CO2025

On the association scheme of perfect matchings and their designs

John Bamberg, Lukas Klawuhn

We investigate generalisations of 1-factorisations and hyperfactorisations of the complete graph $K_{2 n}$ . We show that they are special subsets of the association scheme obtained…

math.CO2024★ 2 cited

Designs in finite classical polar spaces

Michael Kiermaier, Kai-Uwe Schmidt, Alfred Wassermann

Combinatorial designs have been studied for nearly 200 years. Fifty years ago, Cameron, Delsarte, and Ray-Chaudhury started investigating their q-analogs, also known as subspace de…

math.CO2023

Fractional factors and component factors in graphs with isolated toughness smaller than 1

Isaak H. Wolf

Let $G$ be a simple graph and let $n, m$ be two integers with $0 < m < n$ . We prove that $i so (G - S) \leq \frac{n}{m} ∣ S ∣$ for every $S \subset V (G)$ if and only if $G$ has a $\{C_{2i+1},T…

math.CO2023

Rotation $r$ -graphs

Eckhard Steffen, Isaak H. Wolf

We study rotation $r$ -graphs and show that for every $r$ -graph $G$ of odd regularity there is a simple rotation $r$ -graph $G^{'}$ such that $G$ can be obtained form $G^{'}$ by a finite n…

math.CO2022

Edge-connectivity and pairwise disjoint perfect matchings in regular graphs

Yulai Ma, Davide Mattiolo, Eckhard Steffen +1

For $0 \leq t \leq r$ let $m (t, r)$ be the maximum number $s$ such that every $t$ -edge-connected $r$ -graph has $s$ pairwise disjoint perfect matchings. There are only a few values o…