works on

From the 1 of 8 linked papers with an AI index.

collaborators

8 papers

math.CA2026

A characterization of idempotent Schur multipliers

Marcel K. Goh, Csongor Beke, Hamed Hatami +2

The paper proves that any n×n Boolean matrix with bounded γ₂ factorization norm can be expressed as a signed sum of a bounded number of blow‑ups of identity matrices, giving an exp…

cs.CC2026

Communication complexity of point-line incidences over the reals

Marcel K. Goh, Hamed Hatami

We construct a point-line incidence problem over the reals whose randomized communication complexity is constant, but whose deterministic communication complexity is linear even wh…

math.CO2026

Entropy lower bounds and sum-product phenomena

Lampros Gavalakis, Marcel K. Goh, Ioannis Kontoyiannis

Various lower bounds are established for the entropy of sums, products and their combinations. First, we derive a prime-field analogue of a version of the entropy power inequality…

math.CO2026

On an entropic analogue of additive energy

Marcel K. Goh

Recent advances have linked various statements involving sumsets and cardinalities with corresponding statements involving sums of random variables and entropies. In this vein, thi…

math.CO2026

An uncertainty principle for Möbius inversion on posets

Marcel K. Goh

We give conditions for a locally finite poset to have the property that for any functions and not identically zero and linked by the Möbius i…

math.CA2025

Block complexity and idempotent Schur multipliers

Marcel K. Goh, Hamed Hatami

We call a matrix blocky if, up to row and column permutations, it can be obtained from an identity matrix by repeatedly applying one of the following operations: duplicating a row,…