Adrian Beker

collaborators

3 papers

math.CO2026

The inverse problem for the Steiner-Wiener index of trees

Adrian Beker, Rudi MrazoviÄ

For a connected graph $G$ and a set $S \subset V (G)$ , the Steiner distance $d_{G} (S)$ is the minimum number of edges in a connected subgraph of $G$ containing $S$ . The Steiner-Wiener…

math.CO2026

A note on the shortest law for the symmetric group

Adrian Beker, Luka MiliÄeviÄ, Rudi MrazoviÄ

Let $I^\pm (n)$ denote the length of the shortest non-trivial two-variable law for the symmetric group $S_{n}$ . Buskin's quantitative subgroup-separability argument gives the classical l…

math.NT2025

The ErdÅs--Moser sum-free set problem via improved bounds for $k$ -configurations

Adrian Beker

A $k$ -configuration is a collection of $k$ distinct integers $x_{1}, \dots, x_{k}$ together with their pairwise arithmetic means $\frac{x _{i} + x _{j}}{2}$ for $1 \leq i < j \leq k$ . Building…

The inverse problem for the Steiner-Wiener index of trees

A note on the shortest law for the symmetric group

The ErdÅs--Moser sum-free set problem via improved bounds for k-configurations

The ErdÅs--Moser sum-free set problem via improved bounds for $k$ -configurations