Alexander Haupt

activity

20172020

most citedFast Strategies in Waiter-Client Games on

K_{n}

2 citations · 2 across the 4 of their papers we have counts for

collaborators

Showing 2020Show all

3 papers · 1 filter

math.CO2020

Bijective enumeration of rook walks

Alexander M. Haupt

In this paper we answer a question posed by R. Stanley in his collection of Bijection Proof Problems (Problem 240). We present a bijective proof for the enumeration of walks of len…

math.CO2020

Combinatorial Proof of Selberg's Integral Formula

Alexander Haupt

In this paper we present a combinatorial proof of Selberg's integral formula. We start by giving a bijective proof of a Theorem about the number of topological orders of a certain…

math.CO2020★ 2 cited

Fast Strategies in Waiter-Client Games on $K_{n}$

Dennis Clemens, Pranshu Gupta, Fabian Hamann +3

Waiter-Client games are played on some hypergraph $(X, F)$ , where $F$ denotes the family of winning sets. For some bias $b$ , during each round of such a game Wai…

Bijective enumeration of rook walks

Combinatorial Proof of Selberg's Integral Formula

Fast Strategies in Waiter-Client Games on Kn​

Fast Strategies in Waiter-Client Games on $K_{n}$