相关论文: Classical Polylogarithms
We introduce the theory of local and global monodromies of polynomials in cohomology groups in various geometric situations, focusing on its relations with toric geometry and motivic Milnor fibers, and moreover in the modern languages of…
This is a short exposition--mostly by way of the toy models ``double logarithm'' and ``triple logarithm''--which should serve as an introduction to a forthcoming article in which we establish a connection between multiple polylogarithms,…
Using the quantum cluster algebra formalism of Fock and Goncharov, we present several forms of quantum dilogarithm identities associated with periodicities in quantum cluster algebras, namely, the tropical, universal, and local forms. We…
We consider the problem of finding the set of classical polylogarithmic functions $\text{Li}_n$ with branching locus determined by the solution of $p_1\cdot p_2\cdot \ldots \cdot p_n=0$, where $p_1,\ldots, p_n$ are irreducible polynomials…
Complexity theory can be viewed as the study of the relationship between computation and applications, understood the former as complexity classes and the latter as problems. Completeness results are clearly central to that view. Many…
Convergent rewriting systems on algebraic structures give methods to solve decision problems, to prove coherence results, and to compute homological invariants. These methods are based on higher-dimensional extensions of the critical…
We introduce the so-called Clifford-Gegenbauer polynomials in the framework of Dunkl operators, as well on the unit ball B(1), as on the Euclidean space $R^m$. In both cases we obtain several properties of these polynomials, such as a…
We define a Hopf algebra of polylogarithms of an arbitrary field, which is a candidate for a conjectural Hopf algebra of framed mixed Tate motives. Our definition is elementary and mimics Goncharov's construction of higher Bloch groups. We…
We define an additive version of the Bloch group of a field, together with an additive dilogarithm and an Artin-Schreier realization.
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.
This paper is a short introduction to orthogonal polynomials, both the general theory and some special classes. It ends with some remarks about the usage of computer algebra for this theory.
We use Goncharov's coproduct of multiple polylogarithms to define a Lie coalgebra over an arbitrary field. It is generated by symbols subject to inductively defined relations, which we think of as functional relations for multiple…
The notion of monodromy was introduced by J. J. Duistermaat as the first obstruction to the existence of global action coordinates in integrable Hamiltonian systems. This invariant was extensively studied since then and was shown to be…
Monogenity is a classical area of algebraic number theory that continues to be actively researched. This paper collects the results obtained over the past few years in this area. Several of the listed results were presented at a series of…
In this paper, we begin by reviewing the calculus induced by the framework of [10]. In there, we extended Polylogarithm functions over a subalgebra of noncommutative rational power series, recognizable by finite state (multiplicity)…
The harmonic polylogarithms (hpl's) are introduced. They are a generalization of Nielsen's polylogarithms, satisfying a product algebra (the product of two hpl's is in turn a combination of hpl's) and forming a set closed under the…
In~\cite{algorithmic} was given an algorithm that computes arithmetical structures on matrices. We use some of the ideas contained there to get an algorithm that computes arithmetical structures over dominated polynomials. A dominated…
We describe, study, and experiment with an algorithm for finding all solutions of systems of polynomial equations using homotopy continuation and monodromy. This algorithm follows a framework developed in previous work and can operate in…
Polynomials in a category have been studied as a generalization of the traditional notion in mathematics. Their construction has recently been extended to higher groupoids, as formalized in homotopy type theory, by Finster, Mimram, Lucas…
We recall results concerning one-dimensional classical and quantum systems with ladder operators. We obtain the most general one-dimensional classical systems respectively with a third and a fourth order ladder operators satisfying…