Skip to content

Author

Matthew J. Colbrook

We have 7 of 76 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Oct 2026

Spectral isometries of unital $C^*$-algebras

This paper provides a human digestion of a proof of the spectral isometry conjecture for $C^*$-algebras found by GPT-6 Astra. We prove that every unital surjective complex-linear spectral isometry between unital $C^*$-algebras is a Jordan isomorphism. Without the assumption that the map preserves the identity, it is a...

Matthew J. Colbrook, G. Stepaniants · 0 citations
Preprint Oct 2026

On the planar Neumann--Poincar\'e inverse spectral problem

Does the Neumann--Poincar\'e spectrum determine a planar domain up to an extended M\"obius transformation? We construct a pair showing that the answer is no, even for analytic, strictly convex, algebraic boundaries. Their operators are similar. We then prove a positive result for prescribed finite-dimensional families...

Habib Ammari, Matthew J. Colbrook · 0 citations
Preprint Sep 2026

A counterexample to Kenig's conjecture for the Laplace double-layer operator

We disprove Kenig's 1994 spectral-radius conjecture for the double-layer operator in every dimension $d\ge2$. For every $t>1/2$ sufficiently close to $1/2$, we construct a bounded simply connected Lipschitz domain with connected boundary such that the double-layer operator on $L^2$ with respect to the surface measure h...

Matthew J. Colbrook, Siavash Sadeghi · 0 citations
Preprint Aug 2026

A computer-assisted counterexample to the planar Berenstein conjecture

The Dirichlet endpoint considered here, the nonzero Neumann datum forces the harmonic source modes to remain, producing a coupled interior--boundary system involving the full zero-Dirichlet inverse and its Neumann trace, together with a separate sign-recovery problem.

Matthew J. Colbrook, Siavash Sadeghi, George Stepaniants · 1 citation
Preprint Sep 2026

Crown graphs maximise the representation number of bipartite graphs

The representation number of a graph is the least positive integer $k$ for which its vertices can be arranged in a word, each occurring $k$ times, so that two distinct letters alternate precisely when the corresponding vertices are adjacent. We prove that every bipartite graph on $N\ge9$ vertices has representation num...

Matthew J. Colbrook, Catherine Drysdale · 0 citations
Preprint Aug 2026

A computer-assisted counterexample to the planar Pompeiu and Schiffer conjectures

A bounded simply connected noncircular domain of $\Omega$ with real-analytic Jordan boundary and a nonconstant function $u$ such that $u$ is a Neumann eigenfunction which is constant on the boundary, and $\Omega$ is a counterexample to Schiffer's conjecture.

Matthew J. Colbrook, George Stepaniants · 5 citations
Preprint Aug 2026

A sharp isoperimetric inequality for the Neumann--Poincar\'e operator in every dimension

Let $\Omega\subset\mathbb{R}^d$, $d\ge2$, be a bounded connected domain with boundary of class $C^{1,\alpha}$, where $0<\alpha<1$. For the adjoint Neumann--Poincar\'e operator $K^*_{\partial\Omega}$, normalised so that its distinguished eigenvalue is $1/2$, let $\lambda_j^+(\Omega)$ denote the upper min--max values on...

Matthew J. Colbrook, Siavash Sadeghi · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.