2003Bulletin of the London Mathematical SocietyRequires access

A COUNTEREXAMPLE TO A CONJECTURE OF AKEMANN AND ANDERSON

Nik Weaver

Open publisher page 6 citations

Abstract

Akemann and Anderson made a conjecture about ‘paving’ projections in finite-dimensional matrix algebras which, if true, would settle the well-known Kadison–Singer problem. Their conjecture is falsified in this paper by an explicit sequence of counterexamples.

About this research paper

What this paper is about

Akemann and Anderson made a conjecture about ‘paving’ projections in finite-dimensional matrix algebras which, if true, would settle the well-known Kadison–Singer problem. Their conjecture is falsified in this paper by an explicit sequence of counterexamples.

Why it matters

OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Akemann and Anderson made a conjecture about ‘paving’ projections in finite-dimensional matrix algebras which, if true, would settle the well-known Kadison–Singer problem. Their conjecture is falsified in this paper by an explicit sequence of counterexamples.

Key concepts: Counterexample, Conjecture, Mathematics, Sequence (biology), Matrix (chemical analysis), Pure mathematics, Combinatorics, Discrete mathematics

Related papers

Back to paper searchBrowse research topicsOriginal source
A COUNTEREXAMPLE TO A CONJECTURE OF AKEMANN AND ANDERSON — Research Paper | ScholarLens