Goncharov's polynomiality conjecture for cyclotomic motivic dimensions
Goncharov's polynomiality conjecture for cyclotomic motivic dimensions
From papers
For a positive integer , define
where is the weight- component and is the depth- graded component. Let range over prime numbers.
Goncharov's polynomiality conjecture. If is a prime, then and are polynomials in .
The conjecture concerns uniform dimension formulas for cyclotomic motivic structures as the prime level varies. The supplied text does not state whether it has been proved or disproved.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
A. B. Goncharov, “Periods and mixed motives”, arXiv:math/0202154 (2002).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.