Related papers: On the Goncharov Depth Conjecture and polylogarith…

The Ehrhart polynomial of an integral convex polytope counts the number of lattice points in dilates of the polytope. In math.CO/0402148, the authors conjectured that for any cyclic polytope with integral parameters, the Ehrhart polynomial…

The well-known 1-2-3 Conjecture asserts that the edges of every graph without an isolated edge can be weighted with $1$, $2$ and $3$ so that adjacent vertices receive distinct weighted degrees. This is open in general. We prove that every…

We give different bounds for the Stanley depth of a monomial ideal $I$ of a polynomial algebra $S$ over a field $K$. For example we show that the Stanley depth of $I$ is less or equal with the Stanley depth of any prime ideal associated to…

We give an explicit formula proving Xu's Conjecture on alternating double zeta values. We also discuss the limitations of Glanois' motivic Galois descent criterion in this case, as it cannot specify the depth of the descent.

Let $I$ be a squarefree monomial ideal of a polynomial algebra over a field minimally generated by $f_1,...,f_r$ of degree $ d\geq 1$, and a set $E$ of monomials of degree $\geq d+1$. Let $J\subsetneq I$ be a squarefree monomial ideal…

We prove a conjecture of Meszaros and Morales on the volume of a flow polytope. Independently from our work, Zeilberger sketched a proof of their conjecture. In fact, our proof is the same as Zeilberger's proof. The purpose of this note is…

We introduce a natural notion of depth that applies to individual cutting planes as well as entire families. This depth has nice properties that make it easy to work with theoretically, and we argue that it is a good proxy for the practical…

Motivated by Sato and Mori's work on the Korteweg-de Vries (KdV) equation and the modified KdV equation, Mizukawa, Nakajima, and Yamada made a conjecture on 2-reduced Schur functions and Schur's Q-functions. The conjecture claims that…

We present a class of lattices in R^d (d >= 2) which we call GL-lattices and conjecture that any lattice is such. This conjecture is referred to as GLC. Littlewood's conjecture amounts to saying that Z^2 is GL. We then prove existence of GL…

For an integer n>2 we define a polylogarithm, which is a holomorphic function on the universal abelian cover of C-{0,1} defined modulo (2 pi i)^n/(n-1)!. We use the formal properties of its functional relations to define groups lifting…

We prove a new theorem on additive Levy processes and show that this theorem implies several proved theorems and a hard conjectured theorem.

The Boros-Moll polynomials $P_m(a)$ arise in the evaluation of a quartic integral. It has been conjectured by Boros and Moll that these polynomials are infinitely log-concave. In this paper, we show that $P_m(a)$ is 2-log-concave for any…

We present a proof of the Casas-Alvero conjecture, stating that if a complex polynomial has a root in common with each of its derivatives it must be a multiple of the power of some monomial.

We prove a conjecture of Broadurst (arXiv:1004.0519v1) on asymptotic expansions of certain polylogarithm type functions related to the Dickman function.

The values at positive integers of the polyzeta functions are solutions of the polynomial equations arising from Drinfeld's associators, which have numerous applications in quantum algebra. Considered as iterated integrals they become…

We obtain new partial results supporting the spectral set conjecture in dimension 1.

Beginning from the resolution of the Dirichlet L function, using the inner product formula between two infinite-dimensional vectors in the complex space, the author proved the baffling problem--Hecke conjecture.

Even though Zaremba's conjecture remains open, Bourgain and Kontorovich solved the problem for a full density subset. Nevertheless, there are only a handful of explicit sequences known to satisfy the strong version of the conjecture, all of…

With the aid of Hensel Lemma, we refine the 2-adic Newton polygon algorithm proposed by Magron, Koprowski, and Vaccon at ISSAC 2023 to express computationally a given positive univariate polynomial with rational coefficients as a sum of…

One can associate to any bivariate polynomial P(X,Y) its Newton polygon. This is the convex hull of the points (i,j) such that the monomial X^i Y^j appears in P with a nonzero coefficient. We conjecture that when P is expressed as a sum of…