Related papers: Duality on symmetric multiple polylogarithms

It is shown that there exists a duality among fields. If a field is dual to another field, the solution of the field can be obtained from the dual field by the duality transformation. We give a general result on the dual fields. Different…

For any finite field $\mathbb{F}$ and any positive integer $n$ we count the number of monic polynomials of degree $n$ over $\mathbb{F}$ with nonzero constant coefficient and a self-reciprocal factor of any specified degree. An application…

Like quantum groups, quantum groupoids frequently appear in pairs of mutually dual objects. We develop a general Pontrjagin duality theory for quantum groupoids in the algebraic setting that extends Van Daele's duality theory for multiplier…

In this paper we shall define the analytic continuation of the multiple polylogarithms by using Chen's theory of iterated path integrals and compute the monodromy of all multiple logarithms explicitly.

Permutation polynomials have been a subject of study for a long time and have applications in many areas of science and engineering. However, only a small number of specific classes of permutation polynomials are described in the literature…

In this paper, we present three classes of complete permutation monomials over finite fields of odd characteristic. Meanwhile, the compositional inverses of these complete permutation polynomials are also proposed.

Suitable duals of multimodules are introduced and used to provide transposition contravariant right semi-adjunctions (and dualitites under reflexivity). Several additional notions on multimodules are discussed: generalized morphisms and…

We give an arithmetic proof of rigidity for postcritically finite polynomials.

We give systematic method to evaluate a large class of one-dimensional integral relating to multiple zeta values (MZV) and colored MZV. We also apply the technique of iterated integrals and regularization to elucidate the nature of some…

Polynomial optimization problems over binary variables can be expressed as integer programs using a linearization with extra monomials in addition to those arising in the given polynomial. We characterize when such a linearization yields an…

Building on our previous work on hybrid polyadic modal logic we identify modal logic equivalents for Matching Logic, a logic for program specification and verification. This provides a rigorous way to transfer results between the two…

This paper serves to elucidate the nature of toric duality dubbed in hep-th/0003085 in the construction for world volume theories of D-branes probing arbitrary toric singularities. This duality will be seen to be due to certain permutation…

Tiling planar regions with dominoes is a classical problem in which the decision and counting problems are polynomial. We prove a variety of hardness results (both NP- and #P-completeness) for different generalizations of dominoes in three…

We review the notion of symplectic duality earlier introduced in the context of topological recursion. We show that the transformation of symplectic duality can be expressed as a composition of $x-y$ dualities in a broader context of log…

In this paper we study the set of rational solutions of equations defined by power sums symmetric polynomials with coefficients in a finite field. We do this by means of applying a methodology which relies on the study of the geometry of…

Using a ``3 by 3 matrix trick'' we previously showed that multiplication in a C*-algebra A, an algebraic structure, is determined by the geometry of the C*-algebra of the 3 by 3 matrices with entries from A. As an application of this…

We show how the separability problem is dual to that of decomposing any given matrix into a conic combination of rank-one partial isometries, thus offering a duality approach different to the positive maps characterization problem. Several…

We provide algorithms for symbolic integration of hyperlogarithms multiplied by rational functions, which also include multiple polylogarithms when their arguments are rational functions. These algorithms are implemented in Maple and we…

For an arbitrary partially ordered set $P$ its {\em dual} $P^*$ is built as the collection of all monotone mappings $P\to\2$ where $\2=\{0,1\}$ with $0<1$. The set of mappings $P^*$ is proved to be a complete lattice with respect to the…

Basic elements of integral calculus over algebras of iterated differential forms, are presented. In particular, defining complexes for modules of integral forms are described and the corresponding berezinians and complexes of integral forms…