Related papers: Special Values of Generalized Log-sine Integrals
We construct different integrable generalizations of the massive Thirring equations corresponding loop algebras $\widetilde{\mathfrak{g}}^{\sigma}$ in different gradings and associated ''triangular'' $R$-operators. We consider the most…
We design algorithms for computing values of many p-adic elementary and special functions, including logarithms, exponentials, polylogarithms, and hypergeometric functions. All our algorithms feature a quasi-linear complexity with respect…
This article is written with the hope to draw attention to a method that uses integral transforms to find exact values for a large class of convergent series (and, in particular, series of rational terms). We apply the method to some series…
The principal objective of this paper is to determine the structure of $n$-Lie derivations ($n\geq 3$) on generalized matrix algebras.It is shown that under certain mild assumptions, every $n$-Lie derivation can be decomposed into the sum…
Let g be a basic classical Lie superalgebra over C. In the case of a typical weight whose every nonnegative integer multiple is also typical, we compute a closed form for the Hilbert series whose coefficients encode the dimensions of…
This article presents a numerical illustration of a recently proposed strongly polynomial-time algorithm for the general linear programming (LP) problem. Each iteration of the proposed algorithm consists of two Gauss-Jordan pivoting…
We present a brief survey of the methods used in deducing upper estimates for irrationality measures of the logarithm values. We particularly expose the best known estimates for $\log2$ (due to E. Rukhadze), $\pi$ (due to M. Hata) and…
Higher-point functions of gauge invariant composite operators in N=4 super Yang-Mills theory can be computed via triangulation. The elementary tile in this process is the hexagon introduced for the evaluation of structure constants. A…
We present an explicit polynomial formula for evaluating the principal logarithm of all matrices lying on the line segment $\{I(1-t)+At:t\in [0,1]\}$ joining the identity matrix $I$ (at $t=0$) to any real matrix $A$ (at $t=1$) having no…
We finish the determination of the invariants of the coadjoint representation of six dimensional real Lie algebras, by determining a fundamental set of invariants for the 99 isomorphism classes of solvable Lie algebras with five dimensional…
There are several researches on Lie algebras and Lie superalgebras graded by finite root systems. In this paper, we study Leibniz algebras graded by finite root systems and obtain some results in simply-laced cases.
In 1999, Arakawa and Kaneko introduced a zeta function whose special values at negative integers yield the poly-Bernoulli numbers and investigated its relation to multiple zeta values. Since the poly-Bernoulli numbers appear in this…
We review an approach for the computation of Feynman integrals by use of multiple polylogarithms, with an emphasis on the related criterion of linear reducibility of the graph. We show that the set of graphs which satisfies the linear…
In this paper, we present a generic parametrization of generically zero-dimensional parametric polynomial systems. More specifically, we study the specialization properties of the Rational Univariate Representation and derive bounds on the…
In [Trace identities and $\bf {Z}/2\bf {Z}$-graded invariants, {\it Trans. Amer. Math. Soc. \bf309} (1988), 581--589] we generalized the first and second fundamental theorems of invariant theory from the general linear group to the general…
We extend the algorithms of Robinson, Smyth, and McKee--Smyth to enumerate all real-rooted integer polynomials of a fixed degree, where the first few (at least three) leading coefficients are specified. Additionally, we introduce new linear…
We compute the graded polynomial identities and its graded codimension sequence for the elementary gradings of the Lie algebra of upper triangular matrices of order 3.
We review recent developments in the study of multiple polylogarithms, including the Hopf algebra of the multiple polylogarithms and the symbol map, as well as the construction of single valued multiple polylogarithms and discuss an…
The computational complexity of polynomial ideals and Gr\"obner bases has been studied since the 1980s. In recent years, the related notions of polynomial subalgebras and SAGBI bases have gained more and more attention in computational…
We report our experiences with the generalized integration-by-parts algorithm [hep-ph/9609429] in the context of calculations of a realistic one-loop subset of diagrams.