most citedAdditive arithmetic functions meet the inclusion-exclusion principle: Asymptotic formulas concerning the GCD and LCM of several integers

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

collaborators

2 papers

math.CO2026

Whitney's 2-isomorphism theorem for graphings

Márton Borbényi, Grigory Terlov, László Márton Tóth

We prove measurable analogues of Whitney's classical theorems on weak isomorphisms of finite graphs. For locally finite graphings, we define a weak isomorphism to be an edge-measur…

math.NT2021★ 3 cited

Additive arithmetic functions meet the inclusion-exclusion principle: Asymptotic formulas concerning the GCD and LCM of several integers

Olivier Bordellès, László Tóth

We obtain asymptotic formulas for the sums and involving the gcd and lcm of the i…