Marcel K. Goh

activity

20202026

most citedArithmetic subsequences in a random ordering of an additive set

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

collaborators

13 papers

math.CA2026

A characterization of idempotent Schur multipliers

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

We prove that every idempotent Schur multiplier is a finite signed sum of contractive idempotent Schur multipliers. This was conjectured by Katavolos and Paulsen in 2003 and previo…

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.CA2025

Block structure in boolean matrices of bounded factorization norm

Marcel K. Goh, Hamed Hatami

A boolean matrix is blocky if its $1$ -entries form a collection of 1-monochromatic submatrices that are disjoint in both rows and columns. Blocky matrices are precisely the set of…

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,…

math.CO2025

A note on plane trees with decreasing labels

Tsun-Ming Cheung, Luc Devroye, Marcel K. Goh

This note derives asymptotic upper and lower bounds for the number of planted plane trees on $n$ nodes assigned labels from the set ${1, 2, \dots, k}$ with the restriction that on…

math.CO2024★ 1 cited

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.CO2023

An uncertainty principle for Möbius inversion on posets

Marcel K. Goh

We give conditions for a locally finite poset $P$ to have the property that for any functions $f : P \to C$ and $g : P \to C$ not identically zero and linked by the Möbius in…

math.CO2022

On the homology of several number-theoretic set families

Marcel K. Goh, Jonah Saks

This paper describes the homology of various simplicial complexes associated to set families from combinatorial number theory, including primitive sets, pairwise coprime sets, prod…

math.CO2021

The lattice of arithmetic progressions

Marcel K. Goh, Jad Hamdan, Jonah Saks

This paper concerns the lattice $L_{n}$ of subsets of ${1, \dots, n}$ that are arithmetic progressions, under the inclusion order. For $n \geq 4$ , this poset is not graded and thus n…

math.PR2021

Leaf multiplicity in a Bienaymé-Galton-Watson tree

Anna M. Brandenberger, Luc Devroye, Marcel K. Goh +1

This note defines a notion of multiplicity for nodes in a rooted tree and presents an asymptotic calculation of the maximum multiplicity over all leaves in a Bienaymé-Galton-Watson…

math.CO2020★ 2 cited

Arithmetic subsequences in a random ordering of an additive set

Marcel K. Goh, Rosie Y. Zhao

For a finite set $A$ of size $n$ , an ordering is an injection from ${1, 2, \dots, n}$ to $A$ . We present results concerning the asymptotic properties of the length $L_{n}$ of the lon…

math.PR2020

Root estimation in Galton-Watson trees

Anna M. Brandenberger, Luc Devroye, Marcel K. Goh

Given only the free-tree structure of a tree, the root estimation problem asks if one can guess which of the free tree's nodes is the root of the original tree. We determine the ma…