English
Related papers

Related papers: On the Goncharov Depth Conjecture and polylogarith…

200 papers

To a knot in 3-space, one can associate a sequence of Laurent polynomials, whose $n$th term is the $n$th colored Jones polynomial. The Volume Conjecture for small angles states that the value of the $n$-th colored Jones polynomial at…

Geometric Topology · Mathematics 2007-05-23 Stavros Garoufalidis , Thang T. Q. Le

We study values of generalized polylogarithms at various points and relationships among them. Polylogarithms of small weight at the points 1/2 and -1 are completely investigated. We formulate a conjecture about the structure of the linear…

Number Theory · Mathematics 2012-04-17 S. A. Zlobin

The goal of this paper is to study Goldbach's conjecture for rings of regular functions of affine algebraic varieties over a field. Among our main results, we define the notion of Goldbach condition for Newton polytopes, and we prove in a…

Number Theory · Mathematics 2023-12-29 Alberto F. Boix , Danny A. J. Gómez-Ramírez

We formulate Vojta's conjecture for smooth weighted projective varieties, weighted multiplier ideal sheaves, and weighted log pairs and prove that all three versions of the conjecture are equivalent. In the process, we introduce generalized…

Algebraic Geometry · Mathematics 2025-11-19 Sajad Salami , Tony Shaska

Xu, Yan and Zhao showed that in even weight, the multiple $T$ value $T(2, 1, \ldots, 1, \overline{1})$ is a polynomial in $\log(2)$, $\pi$, Riemann zeta values, and Dirichlet beta values. Based on low-weight examples, they conjectured that…

Number Theory · Mathematics 2024-03-08 Steven Charlton

A depth two extension $A \| B$ is shown to be weak depth two over its double centralizer $V_A(V_A(B))$ if this is separable over $B$. We consider various examples and non-examples of depth one and two properties. Depth two and its…

Quantum Algebra · Mathematics 2007-05-23 Lars Kadison

Using equivariant topology, we prove that it is always possible to find $n$ points in the $d$-dimensional faces of a $nd$-dimensional convex polytope $P$ so that their center of mass is a target point in $P$. Equivalently, the $n$-fold…

Metric Geometry · Mathematics 2014-06-06 Michael Gene Dobbins

Let $\mathcal{A}$ be the subdivision of $\mathbb{R}^d$ induced by $m$ convex polyhedra having $n$ facets in total. We prove that $\mathcal{A}$ has combinatorial complexity $O(m^{\lceil d/2 \rceil} n^{\lfloor d/2 \rfloor})$ and that this…

Computational Geometry · Computer Science 2025-10-16 Boris Aronov , Sang Won Bae , Sergio Cabello , Otfried Cheong , David Eppstein , Christian Knauer , Raimund Seidel

Let $p(n)$ denote the number of partitions of a natural number $n$. As $ n \to \infty$, the $n$th root of $p(n)$ tends to $1$, which is related to the Cauchy--Hadamard test for power series. Andrews also discovered an elementary proof. Sun…

Combinatorics · Mathematics 2026-01-19 Bernhard Heim und Markus Neuhauser

We characterize all the strongly monotypic polytopes. Hadwiger's conjecture for this class of polytopes is deduced from the characterization.

Combinatorics · Mathematics 2021-11-09 Vuong Bui

The conjecture of Kosniowski asserts that if the circle acts on a compact unitary manifold $M$ with a non-empty fixed point set and $M$ does not bound a unitary manifold equivariantly, then the dimension of the manifold is bounded above by…

Differential Geometry · Mathematics 2019-01-01 Donghoon Jang

We define a variant of real-analytic polylogarithms that are single-valued and that satisfy ''clean'' functional relations that do not involve any products of lower weight functions. We discuss the basic properties of these functions and,…

Number Theory · Mathematics 2021-12-14 Steven Charlton , Claude Duhr , Herbert Gangl

We give new explicit formulas for Grassmannian and Aomoto polylogarithms in terms of iterated integrals, for arbitrary weight. We also explicitly reduce the Grassmannian polylogarithm in weight 4 and in weight 5 each to depth 2.…

Number Theory · Mathematics 2022-08-03 Steven Charlton , Herbert Gangl , Danylo Radchenko

Polylogarithms are those multiple polylogarithms that factor through a certain quotient of the de Rham fundamental group of the thrice punctured line known as the polylogarithmic quotient. Building on work of Dan-Cohen, Wewers, and Brown,…

Number Theory · Mathematics 2020-08-25 David Corwin , Ishai Dan-Cohen

Let $I$ be an ideal of a polynomial algebra $S$ over a field generated by square free monomials of degree $\geq d$. If $I$ contains more monomials of degree $d$ than $(n-d)/(n-d+1)$ of the total number of square free monomials of $S$ of…

Commutative Algebra · Mathematics 2011-10-17 Dorin Popescu

A $d$-dimensional lattice polytope $P$ is Gorenstein if it has a multiple $r P$ that is a reflexive polytope up to translation by a lattice vector. The difference $d+1-r$ is called the degree of $P$. We show that a Gorenstein polytope is a…

Combinatorics · Mathematics 2022-03-10 Benjamin Nill

We obtain in closed form averages of polynomials, taken over hermitian matrices with the Gaussian measure involved in the Kontsevich integral, and prove a conjecture of Witten enabling one to express analogous averages with the full (cubic…

High Energy Physics - Theory · Physics 2015-06-26 P. Di Francesco , C. Itzykson , J. -B. Zuber

We establish that three well-known and rather different looking conjectures about Dirichlet characters and their (weighted) sums, (concerning the P\'{o}lya-Vinogradov theorem for maximal character sums, the maximal admissible range in…

Number Theory · Mathematics 2021-12-24 Andrew Granville , Alexander P. Mangerel

Cilleruelo conjectured that for an irreducible polynomial $f \in \mathbb{Z}[X]$ of degree $d \geq 2$ one has $$\log\left[\mathrm{lcm}(f(1),f(2),\ldots f(N))\right]\sim(d-1)N\log N$$ as $N \to \infty$. He proved it in the case $d=2$ but it…

Number Theory · Mathematics 2025-01-07 Alexei Entin , Sean Landsberg

Let $P$ be a set of $n$ points in $d$-dimensions. The simplicial depth, $\sigma_P(q)$ of a point $q$ is the number of $d$-simplices with vertices in $P$ that contain $q$ in their convex hulls. The simplicial depth is a notion of data depth…

Computational Geometry · Computer Science 2015-12-29 Peyman Afshani , Donald R. Sheehy , Yannik Stein