Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
184 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Kontsevich's noncommutative numerical motives (1108.3785v1)

Published 18 Aug 2011 in math.KT, math.AG, and math.AT

Abstract: In this note we prove that Kontsevich's category NCnum of noncommutative numerical motives is equivalent to the one constructed by the authors. As a consequence, we conclude that NCnum is abelian semi-simple as conjectured by Kontsevich.

Summary

We haven't generated a summary for this paper yet.