activity
20162026
collaborators

6 papers

math.CO2026

The inverse problem for the Steiner-Wiener index of trees

Adrian Beker, Rudi Mrazović

For a connected graph and a set , the Steiner distance is the minimum number of edges in a connected subgraph of containing . The Steiner-Wiener…

math.CO2026

A note on the shortest law for the symmetric group

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

Let denote the length of the shortest non-trivial two-variable law for the symmetric group . Buskin's quantitative subgroup-separability argument gives the classical lo…

math.NT2026

Lines in the prime number graph

Scott Duke Kominers, Rudi Mrazović, Carl Pomerance +1

The prime number graph is the set of points where denotes the prime. Let be the minimum number of straight line segments needed to cover the fir…

math.PR2026

Expected perimeter and area of the convex hull of planar Brownian motion stopped upon exiting the unit disk

Rudi Mrazović, Hugo Panzo, Stjepan Šebek

We study the convex hull of planar Brownian motion run until the exit time from the unit disk. Our primary objectives are to compute the expected perimeter and expected area of thi…

math.NT2025

Equidistribution of Diophantine pairs among the equivalence classes of quadratic forms

Goran Dražić, Matija Kazalicki, Rudi Mrazović

For a fixed integer n, a pair of nonzero integers {a, c} is called a D(n)-pair if the product ac plus n is a perfect square. In this short note we prove that D(n)-pairs are asympto…

math.NT2016

A random model for the Paley graph

Rudi Mrazović

For a prime we define the Paley graph to be the graph with the set of vertices , and with edges connecting vertices whose sum is a quadratic residue. Pa…