相关论文: S\'eries hyperg\'eom\'etriques multiples et polyz\…
In this paper we describe an algorithm for implicitizing rational hypersurfaces in case there exists at most a finite number of base points. It is based on a technique exposed in math.AG/0210096, where implicit equations are obtained as…
We report on implementations for algorithms treating algebraic and arithmetic properties of hypergeometric functions in the computer algebra system SageMath. We treat hypergeometric series over the rational numbers, over finite fields, and…
We evaluate several classes of high weight hypergeometric series via Gamma, polylogarithm and elliptic integrals, mainly through distribution relations.
We define a power series associated with a homogeneous ideal in a polynomial ring, encoding information on the Segre classes defined by extensions of the ideal in projective spaces of arbitrarily high dimension. We prove that this power…
In this paper, we give an overview of the various general methods in computing the zeta function of an algebraic variety defined over a finite field, with an emphasis on computing the reduction modulo $p^m$ of the zeta function of a…
Characteristic p multizeta values were initially studied by Thakur, who defined them as analogues of classical multiple zeta values of Euler. In the present paper we establish an effective criterion for Eulerian multizeta values, which…
We construct polylogarithms on families of pointed Riemann surfaces of any genus which describe monodromies of meromorphic connections with simple poles. Furthermore, we show that the polylogaritms are computable as power series in…
We prove that every multiple zeta value is a $\mathbb{Z}$-linear combination of $\zeta(k_1,\dots, k_r)$ where $k_i\geq 2$. Our proof also yields an explicit algorithm for such an expansion. The key ingredient is to introduce modified…
We prove and generalize several recent conjectures of Z.-W. Sun surrounding binomial coefficients and harmonic numbers. We show that Sun's series and their analogs can be represented as cyclotomic multiple zeta values of levels…
We prove a kind of integral expressions for finite multiple harmonic sums and multiple zeta-star values. Moreover, we introduce a class of multiple integrals, associated with some combinatorial data (called 2-labeled posets). This class…
We present a new algorithm to decompose generic spinor polynomials into linear factors. Spinor polynomials are certain polynomials with coefficients in the geometric algebra of dimension three that parametrize rational conformal motions.…
It is well-known that every non-negative univariate real polynomial can be written as the sum of two polynomial squares with real coefficients. When one allows a weighted sum of finitely many squares instead of a sum of two squares, then…
We introduce the method of desingularization of multi-variable multiple zeta-functions (of the generalized Euler-Zagier type), under the motivation of finding suitable rigorous meaning of the values of multiple zeta-functions at…
This paper presents a generalised symbolic algorithm for solving systems of linear algebraic equations with multi-diagonal coefficient matrices. The algorithm is given in a pseudocode. A theorem which gives the condition for correctness of…
We give new closed and explicit formulas for "multiple zeta values" at non-positive integers of generalized Euler-Zagier multiple zeta-functions. We first prove these formulas for a small convenient class of these multiple zeta-functions…
The algebra of big zeta values we introduce in this paper is an intermediate object between multiple zeta values and periods of the multiple zeta motive. It consists of number series generalizing multiple zeta values, the simplest examples,…
We present a new algorithm for computing hyperexponential solutions of ordinary linear differential equations with polynomial coefficients. The algorithm relies on interpreting formal series solutions at the singular points as analytic…
We describe an algorithm to decompose rational functions from which we determine the poset of groups fixing these functions.
Based on a theorem by Vasconcelos, we give an algorithm for equidimensional decomposition of algebraic sets using syzygy computations via Gr\"obner bases. This algorithm avoids the use of elimination, homological algebra and processing the…
Certifying the positivity of trigonometric polynomials is of first importance for design problems in discrete-time signal processing. It is well known from the Riesz-Fej\'ez spectral factorization theorem that any trigonometric univariate…