activity
20042026
most citedGroup-theoretic algorithms for matrix multiplication

205 citations · 615 across the 51 of their papers we have counts for

collaborators
Showing 2014Show all

5 papers · 1 filter

math.CO2014

On linear configurations in subsets of compact abelian groups, and invariant measurable hypergraphs

Pablo Candela, Balázs Szegedy, Lluís Vena

We prove an arithmetic removal result for all compact abelian groups, generalizing a finitary removal result of Král', Serra and the third author. To this end, we consider infinite…

math.CO2014★ 1 cited

The automorphism group of a graphon

László Lovász, Balázs Szegedy

We study the automorphism group of graphons (graph limits). We prove that after an appropriate "standardization" of the graphon, the automorphism group is compact. Furthermore, we…

math.CO2014★ 11 cited

Multigraph limits, unbounded kernels, and Banach space decorated graphs

Dávid Kunszenti-Kovács, László Lovász, Balázs Szegedy

We present a construction that allows us to define a limit object of Banach space decorated graph sequences in a generalized homomorphism density sense. This general functional ana…

math.CO2014★ 50 cited

An information theoretic approach to Sidorenko's conjecture

Balazs Szegedy

We investigate the famous conjecture by Erd\H os-Simonovits and Sidorenko using information theory. Our method gives a unified treatment for all known cases of the conjecture and i…

math.PR2014

On large girth regular graphs and random processes on trees

Ágnes Backhausz, Balázs Szegedy

We study various classes of random processes defined on the regular tree that are invariant under the automorphism group of . Most important ones are factor of i.i.d. pr…