SearcharxivSearch

arXiv subjects

Daniil Rudenko

Publications and source records attributed to Daniil Rudenko.

15 recordsLinked to original sources

On the surjectivity conjectures of Dupont and Monod

In this paper we apply our work on polylogarithmic cocycles representing the Borel classes to establish that the comparison map from bounded continuous cohomology to continuous cohomology is surjective for connected semisimple Lie groups with finite centre. This proves conjectures of Dupont and Monod.

math.GR

Mixed Tate motives over number fields

This paper relates algebraic K-theory of fields to polylogarithms via general linear groups. We focus on the case of number fields and prove that the motivic realisation map from the Goncharov Lie coalgebra to the motivic Lie coalgebra is an isomorphism. This implies the Goncharov universality conjecture and a structural result for special values of Dedekind zeta functions. We also construct explicit polylogarithmic cocycles representing nonzero multiples of the Borel classes.

math.KT

The Goncharov Lie coalgebra of a field

This paper relates algebraic $K$-theory of fields to polylogarithms via general linear groups. We introduce the Goncharov Lie coalgebra, defined in terms of the $E_\infty$-homology of general linear groups. Using Steinberg modules, we find a presentation, compute its Lie cobracket, and construct motivic and Hodge realisations. Combining these results with the Rognes rank spectral sequence, we give symbolic descriptions of the rationalisation of the algebraic $K$-theory of fields beyond the cases studied by Matsumoto-Milnor and Bloch-Suslin: we express $K^{(3)}_4(F)$ and the indecomposable part of $K^{(3)}_5(F)$ in terms of Goncharov's polylogarithmic complex of weight 3.

math.KT

Multiple polylogarithms and the Steinberg module

We establish a connection between multiple polylogarithms on a torus and the Steinberg module of $\mathbb{Q}$, and show that multiple polylogarithms of depth $d$ and weight $n$ can be expressed via a single function $\mathrm{Li}_{n-d+1,1,\dots,1}(x_1,x_2,\dots,x_d)$. Using this connection, we give a simple proof of the Bykovski\u{\i} theorem, explain the duality between multiple polylogarithms and iterated integrals, and provide a polylogarithmic interpretation of the conjectures of Rognes and Church-Farb-Putman.

math.NT

The Hopf algebra of formal multiple polylogarithms

We define a Hopf algebra of polylogarithms of an arbitrary field, which is a candidate for a conjectural Hopf algebra of framed mixed Tate motives. Our definition is elementary and mimics Goncharov's construction of higher Bloch groups. We also discuss the Hodge and motivic realizations of the Hopf algebra of polylogarithms.

math.NT

Joseph Wolstenholme and the Trigonometry of Tetrahedra

We describe the results in the trigonometry of tetrahedra obtained by Joseph Wolstenholme in the last few years of his life. 'The late Professor Wolstenholme, M.A., Sc.D., shortly before his death, handed to me a scrap of paper, on which he had hastily scratched the following equation in tetrahedra, saying he had proved it ...' (Richardson, 1897).

physics.hist-ph

On the Goncharov Depth Conjecture and polylogarithms of depth two

We prove the surjectivity part of Goncharov's depth conjecture. We also show that the depth conjecture implies that multiple polylogarithms of depth $d$ and weight $n$ can be expressed via a single function $\mathrm{Li}_{n-d+1,1,\dots,1}(a_1,a_2,\dots,a_d)$, and we prove this latter statement for $d=2$.

math.NT

Cluster Polylogarithms I: Quadrangular Polylogarithms

We suggest a definition of cluster polylogarithms on an arbitrary cluster variety and classify them in type $A$. We find functional equations for multiple polylogarithms which generalize equations discovered by Abel, Kummer, and Goncharov to an arbitrary weight. As an application, we prove a part of the Goncharov depth conjecture in weight six.

math.AG

Rational Elliptic Surfaces and the Trigonometry of Tetrahedra

We study the trigonometry of non-Euclidean tetrahedra using tools from algebraic geometry. We establish a bijection between non-Euclidean tetrahedra and certain rational elliptic surfaces. We interpret the edge lengths and the dihedral angles of a tetrahedron as values of period maps for the corresponding surface. As a corollary we show that the cross-ratio of the exponents of the solid angles of a tetrahedron is equal to the cross-ratio of the exponents of the perimeters of its faces. The Regge symmetries of a tetrahedron are related to the action of the Weyl group $W(D_6)$ on the Picard lattice of the corresponding surface.

math.AG

On the Goncharov depth conjecture and a formula for volumes of orthoschemes

We prove a conjecture of Goncharov, which says that any multiple polylogarithm can be expressed via polylogarithms of depth at most half of the weight. We give an explicit formula for this presentation, involving a summation over trees that correspond to decompositions of a polygon into quadrangles. Our second result is a formula for volume of hyperbolic orthoschemes, generalizing the formula of Lobachevsky in dimension $3$ to an arbitrary dimension. We show a surprising relation between two results, which comes from the fact that hyperbolic orthoschemes are parametrized by configurations of points on $\mathbb{P}^1.$ In particular, we derive both formulas from their common generalization.

math.AG

Motivic correlators, cluster varieties and Zagier's conjecture on zeta(F,4)

We prove Zagier's conjecture on the value at s=4 of the Dedekind zeta-function of a number field F. For any field F, we define a map from the appropriate pieces of algebraic K-theory of F to the cohomology of the weight 4 polylogarithmic motivic complex. When F is the function field of a complex variety, composing this map with the regulator map on the polylogarithmic complex to the Deligne cohomology, we get a rational multiple of Beilinson's regulator. This plus Borel's theorem implies Zagier's conjecture. Another application is a formula expressing the value at s=4 of the L-function of an elliptic curve E over Q via generalized Eisenstein-Kronecker series. We get a strong evidence for the part of Freeness Conjecture describing the weight four part of the motivic Lie coalgebra of F via higher Bloch groups. Our main tools are motivic correlators and a new link of cluster varieties to polylogarithms.

math.NT

On the functional equations for polylogarithms in one variable

We develop a new approach to the study of the functional equations satisfied by classical polylogarithms, inspired by Goncharov's conjectures. We prove a sharpened version of Zagier's criterion for such an equation and explain, how our approach leads to a very simple description of the equations in one variable, satisfied by dilogarithm and trilogarithm. Our main result is the complete description of the functional equations for weight four polylogarithm in one variable.

math.AG

The Strong Suslin Reciprocity Law

We prove the strong Suslin reciprocity law conjectured by A. Goncharov. The Suslin reciprocity law is a generalization of the Weil reciprocity law to higher Milnor $K-$theory. The Milnor $K-$groups can be identified with the top cohomology groups of the polylogarithmic motivic complexes; Goncharov's conjecture predicts the existence of a contracting homotopy underlying Suslin reciprocity. The main ingredient of the proof is a homotopy invariance theorem for the cohomology of the polylogarithmic motivic complexes in the "next to Milnor" degree. We apply these results to the theory of scissors congruences of hyperbolic polytopes. For every triple of rational functions on a compact projective curve over $\mathbb{C}$ we construct a hyperbolic polytope (defined up to scissors congruence). The hyperbolic volume and the Dehn invariant of this polytope can be computed directly from the triple of rational functions on the curve.

math.KT

A property of trivalent graphs related to equidissections

Monsky proved that a square cannot be dissected into an odd number of triangles of equal area. Stein conjectured that the same holds for any polygon whose edges can be paired into parallel and equal-length segments. We prove Stein's conjecture under an assumption that all triangle vertices have rational coordinates. Our result is derived from a more general property of trivalent graphs equipped with a $\mathbb{Q}^2$-valued flow.

math.CO

On equidissection of balanced polygons

In this paper we show that a lattice balanced polygon of odd area cannot be cut into an odd number of triangles of equal areas. First result of this type was obtained by Paul Monsky in 1970. He proved that a square cannot be cut into an odd number of triangles of equal areas. In 2000 Sherman Stein conjectured that the same holds for any balanced polygon. We also show connections between the equidissection problem and tropical geometry.

math.CO