Nathan J. Bowler

collaborators

3 papers

math.CO2025

Locally interval graphs are circular-arc graphs

Tara Abrishami, Sandra Albrechtsen, Nathan Bowler +2

Circular-arc graphs are graphs that can be represented as intersection graphs of subpaths of a cycle. Interval graphs are graphs that can be represented as intersection graphs of s…

math.CO2025

$R (K_{ℵ_{0}}, K^_{2, 3})$ is a win for Player 1

Nathan Bowler, Henri Ortmüller

The Strong Ramsey game $R (B, G)$ is a two player game with players $P_{1}$ and $P_{2}$ , where $B$ and $G$ are $k$ -uniform hypergraphs for some $k \geq 2$ . $G$ is always finite…

cs.LO2025

Probabilistic Strategies: Definability and the Tensor Completeness Problem

Nathan Bowler, Sergey Goncharov, Paul Blain Levy

Programs that combine I/O and countable probabilistic choice, modulo either bisimilarity or trace equivalence, can be seen as describing a probabilistic strategy. For well-founded…

Locally interval graphs are circular-arc graphs

R(Kℵ0​​,K^2,3​) is a win for Player 1

Probabilistic Strategies: Definability and the Tensor Completeness Problem

$R (K_{ℵ_{0}}, K^_{2, 3})$ is a win for Player 1