Related papers: Duality on symmetric multiple polylogarithms
We advocate an account of dualities between physical theories: the basic idea is that dual theories are isomorphic representations of a common core. We defend and illustrate this account, which we call a Schema, in relation to symmetries.…
We compute the graded polynomial identities of the infinite dimensional upper triangular matrix algebra over an arbitrary field. If the grading group is finite, we prove that the set of graded polynomial identities admits a finite basis. We…
Plonka sums consist of an algebraic construction similar, in some sense to direct limits, which allows to represent classes of algebras defined by means of regular identities (namely those equations where the same set of variables appears…
Colored multiple zeta values are special values of multiple polylogarithms evaluated at Nth roots of unity. In this paper, we define both the finite and the symmetrized versions of these values and show that they both satisfy the double…
It is known that multiple zeta values can be written in terms of certain iterated log-sine integrals. Conversely, we evaluate iterated log-sine integrals in terms of multiple polylogarithms and multiple zeta values in this paper. We also…
We introduce an iterated integral version of (generalized) log-sine integrals (iterated log-sine integrals) and prove a relation between a multiple polylogarithm and iterated log-sine integrals. We also give a new method for obtaining…
In this paper we establish two symmetric identities on sums of products of Euler polynomials.
We survey various results and conjectures concerning multiple polylogarithms and the multiple zeta function. Among the results, we announce our resolution of several conjectures on multiple zeta values. We also provide a new integral…
In this talk, some aspects of duality symmetries are presented.
Which polygons admit two (or more) distinct lattice tilings of the plane? We call such polygons double tiles. It is well-known that a lattice tiling is always combinatorially isomorphic either to a grid of squares or to a grid of regular…
Multiplicity codes are algebraic error-correcting codes generalizing classical polynomial evaluation codes, and are based on evaluating polynomials and their derivatives. This small augmentation confers upon them better local decoding,…
We present two novel applications of symmetries for mixed-integer linear programming. First we propose two variants of a new heuristic to improve the objective value of a feasible solution using symmetries. These heuristics can use either…
In this paper we consider iterated integrals of multiple polylogarithm functions and prove some explicit relations of multiple polylogarithm functions. Then we apply the relations obtained to find numerous formulas of alternating multiple…
We discuss duality pairings on integral \'etale motivic cohomology groups of regular and proper schemes over algebraically closed fields, local fields, finite fields, and arithmetic schemes.
The invariant polytope algorithm was a breakthrough in the joint spectral radius computation, allowing to find the exact value of the joint spectral radius for most matrix families~\cite{GP2013,GP2016}. This algorithm found many…
We give a weighted sum formula for the double polylogarithm in two variables, from which we can recover the classical weighted sum formulas for double zeta values, double $T$-values, and some double $L$-values. Also presented is a…
We define an abstract regular polytope to be internally self-dual if its self-duality can be realized as one of its symmetries. This property has many interesting implications on the structure of the polytope, which we present here. Then,…
We prove three theorems on finite real multiple zeta values: the symmetric formula, the sum formula and the height-one duality theorem. These are analogues of their counterparts on finite multiple zeta values.
We prove that if A is a finite algebra with a parallelogram term that satisfies the split centralizer condition, then A is dualizable. This yields yet another proof of the dualizability of any finite algebra with a near unanimity term, but…
In this article, we introduce combinatorial models for poly-Bernoulli polynomials and poly-Euler numbers of both kinds. As their applications, we provide combinatorial proofs of some identities involving poly-Bernoulli polynomials.