collaborators

6 papers

math.CO2026

Holographic functions and neural networks

Balazs Szegedy

A fuzzy Boolean function is a map $f:\cube^n\to [0,1]$, where . We introduce and compare three ways of saying that such a function has bounded complexity. The first…

math.CO2026

Star observations in bounded-degree graphs

Balazs Szegedy

Similarity metrics are central in the theory of large networks and graph limits. For bounded-degree graphs, the Benjamini--Schramm metric records the distribution of rooted neighbo…

math.GR2026

The Jamneshan-Tao conjecture for finite abelian groups of bounded rank

Pablo Candela, Diego González-Sánchez, Balázs Szegedy

We confirm the Jamneshan-Tao conjecture for finite abelian groups of rank at most a fixed integer (i.e. finite abelian groups generated by at most elements), by proving an…

math.DS2025

An inverse theorem for all finite abelian groups via nilmanifolds

Pablo Candela, Diego González-Sánchez, Balázs Szegedy

We prove a first inverse theorem for Gowers norms on all finite abelian groups that uses only nilmanifolds (rather than possibly more general nilspaces). This makes progress toward…

math.CO2025

Free nilspaces, double-coset nilspaces, and Gowers norms

Pablo Candela, Diego González-Sánchez, Balázs Szegedy

Compact finite-rank nilspaces have become central in the nilspace approach to higher-order Fourier analysis, notably through their role in a general form of the inverse theorem for…

math.CO2025

Spectral algorithms in higher-order Fourier analysis

Pablo Candela, Diego González-Sánchez, Balázs Szegedy

Our goal is to provide simple and practical algorithms in higher-order Fourier analysis which are based on spectral decompositions of operators. We propose a general framework for…