Related papers: Duality on symmetric multiple polylogarithms
We discuss various dualities, relating integrable systems and show that these dualities are explained in the framework of Hamiltonian and Poisson reductions. The dualities we study shed some light on the known integrable systems as well as…
We perform certain alternating binomial summations with parameters that occur in the analysis of algorithms. A combination of integral and special function and special number representations is used. The results are sufficiently general to…
We show that positivity on $\mathbb{R}_+^n$ and on $\mathbb{R}^n$ of real symmetric polynomials of degree at most $p$ in $n\ge2$ variables is solvable by algorithms running in $\mathrm{poly}(n)$ time. For real symmetric quartics, we find…
This paper is an enhanced version of a more than decade-older paper with a similar title. Many formulae involving both finite and infinite sums of digamma and polygamma functions up to quadratic order, few of which appear in standard…
We study a generalization of the classical correspondence between homogeneous quadratic polynomials, quadratic forms, and symmetric/alternating bilinear forms to forms in $n$ variables. The main tool is combinatorial polarization, and the…
We classify all complex $7$- and $8$-dimensional dual mock-Lie algebras by algebraic and geometric way. Also we find all non-trivial complex $9$-dimensional dual mock-Lie algebras.
We consider three types of rings of supersymmetric polynomials: polynomial ones $\Lambda_{m,n}$, partially polynomial $\Lambda_{m,n}^{+y}$ and Laurent supersymmetric rings $\Lambda_{m,n}^{\pm}$. For each type of rings we give their…
We indicate a strategy in order to construct bilinear multiplication algorithms of type Chudnovsky in large extensions of any finite field. In particular, by using the symmetric version of the generalization of Randriambololona specialized…
The volume of a cyclic polytope can be obtained by forming an iterated integral along a suitable piecewise linear path running through its edges. Different choices of such a path are related by the action of a subgroup of the combinatorial…
Consider the $n$th degree polynomial equation, $X^n+A_{n-1}X^{n-1}+...+A_1X+A_0=0$ over the ring of 2 by 2 complex matrices. If this equation has more than ${2n \choose 2}$ solutions, then it has infinitely many solutions. We show here that…
Feynman integrals are very often computed from their differential equations. It is not uncommon that the $\varepsilon$-factorised differential equation contains only dlog-forms with algebraic arguments, where the algebraic part is given by…
Aspects of three dimensional $\mathcal{N}=2$ gauge theories with monopole superpotentials and their dualities are investigated. The moduli spaces of a number of such theories are studied using Hilbert series. Moreover, we propose new…
In this paper, we give explicit evaluation for some infinite series involving generalized (alternating) harmonic numbers. In addition, some formulas for generalized (alternating) harmonic numbers will also be derived.
Using linear functional-based duality of modules, we generalize the syndrome decoding algorithm of linear codes over finite fields to those over finite commutative rings. Moreover, If the ring is local the algorithm is simplified by…
It is well known that the repeated square and multiply algorithm is an efficient way of modular exponentiation. The obvious question to ask is if this algorithm has an inverse which would calculate the discrete logarithm efficiently. The…
We clarify the relationship between different multiple polylogarithms in weight~4 by writing suitable linear combinations of a given type of iterated integral I_{n_1,...,n_d}(z_1,...,z_d), in depth d>1 and weight \sum_i n_i=4 in terms of…
Additive Fourier Transform is sdudied. A fast multiplication algorithm for polynomials over the binary field is given. The bit complexity of the algorithm is $O(n(log n)(\log\log n)^2)$.
We consider a special class of binomial sums involving harmonic numbers and we prove three identities by using the elementary method of the partial fraction decomposition. Some applications to infinite series and congruences are given.
In this paper, we develop the theory of symmetric triads with multiplicities. First, we classify abstract symmetric triads with multiplicities. Second, we determine the symmetric triads with multiplicities corresponding to commutative…
The symmetric Macdonald polynomials are able to be constructed out of the non-symmetric Macdonald polynomials. This allows us to develop the theory of the symmetric Macdonald polynomials by first developing the theory of their non-symmetric…