activity
20192026
most citedOn strong infinite Sidon and sets and random sets of integers

1 citations · 1 across the 6 of their papers we have counts for

collaborators

6 papers

quant-ph2026

A logarithmic phase singularity at the heart of Landau-Zener transitions

Eric P. Glasbrenner, David Fabian, Wolfgang P. Schleich

Three ingredients of the elementary Landau-Zener problem determine the familiar expression for the asymptotic value of the probability amplit…

math.CO2026

Graph bootstrap percolation -- a discovery of slowness

David Fabian, Patrick Morris, Tibor Szabó

Graph bootstrap percolation is a discrete-time process capturing the spread of a virus on the edges of . Given an initial set of infected edges, the transmiss…

quant-ph2026

Advanced Quantum Communication and Quantum Networks -- From basic research to future applications

Björn Kubala, Alexander Sauer, Alessandro Tarantola +7

Classical communication is the basis for many of our current and future technologies, such as mobile phones, video conferences, autonomous vehicles and particularly the internet. I…

math.CO2025

Slow graph bootstrap percolation III: Chain constructions

David Fabian, Patrick Morris, Tibor Szabó

For graphs , we study the extremal function which is the maximum running time (until stabilisation) of an -bootstrap percolation process on vertices. Building on…

math.CO2023

Slow graph bootstrap percolation II: Accelerating properties

David Fabian, Patrick Morris, Tibor Szabó

For a graph and an -vertex graph , the -bootstrap process on is the process which starts with and, at every time step, adds any missing edges on the vertices o…

math.CO2019★ 1 cited

On strong infinite Sidon and sets and random sets of integers

David Fabian, Juanjo Rué, Christoph Spiegel

A set of integers is an -strong Sidon set if the pairwise sums of its elements are far apart by a certain measure depending on , more specifically if $…