Silvan Horvath

activity

20222026

most citedPriority Algorithms with Advice for Disjoint Path Allocation Problems

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

collaborators

4 papers

math.LO2026

On the number of $Q$ -points

Silvan Horvath, Tan Özalp

We show that, up to isomorphism, the number of $Q$ -points is either finite, $2^{d}$ or $2^{c}$ . This answers a question asked by Borodulin-Nadzieja, Martínez-…

math.LO2025

There may be exactly $n$ $Q$ -points

Lorenz Halbeisen, Silvan Horvath, Tan Özalp

We generalize the main result of arXiv:2505.17960 and show the consistency of the statement ``There are exactly $n$ $Q$ -points up to isomorphism" for any finite $n$ . Furthermore, w…

math.LO2025

A unique $Q$ -point and infinitely many near-coherence classes of ultrafilters

Lorenz Halbeisen, Silvan Horvath, Saharon Shelah

We show that in the model obtained by iteratively pseudo-intersecting a Ramsey ultrafilter via a length- $ω_{2}$ countable support iteration of restricted Mathias forcing over a groun…

cs.DS2022★ 1 cited

Priority Algorithms with Advice for Disjoint Path Allocation Problems

Hans-Joachim Böckenhauer, Fabian Frei, Silvan Horvath

We analyze the Disjoint Path Allocation problem (DPA) in the priority framework. Motivated by the problem of traffic regulation in communication networks, DPA consists of allocatin…

On the number of Q-points

There may be exactly n Q-points

A unique Q-point and infinitely many near-coherence classes of ultrafilters

Priority Algorithms with Advice for Disjoint Path Allocation Problems

On the number of $Q$ -points

There may be exactly $n$ $Q$ -points

A unique $Q$ -point and infinitely many near-coherence classes of ultrafilters