Related papers: Efficient Legendre polynomials transforms: from re…

We compute Ext-groups between classical exponential functors (i.e. symmetric, exterior or divided powers) and their Frobenius twists. Our method relies on bar constructions, and bridges these Ext-groups with the homology of Eilenberg-Mac…

We consider here a particular quadratic equation linking two elements of a C-Algebra. By analysing powers of the unknowns, it appears a double sequence of polynomials related to classical Bernoulli polynomials. We get the generating…

Many mathematicians have been studying various degenerate versions of special polynomials and numbers in some arithmetic and combinatorial aspects. Our main focus here is a new type of degenerate poly-Euler polynomials and numbers. This…

The main purpose of this paper is to study generalized (self-) reciprocal Appell polynomials, which play a certain role in connection with Faulhaber-type polynomials. More precisely, we show for any Appell sequence when satisfying a…

Tensor expression simplification is an "ancient" topic in computer algebra, a representative of which is the canonicalization of Riemann tensor polynomials. Practically fast algorithms exist for monoterm canonicalization, but not for…

A strong link between information geometry and algebraic statistics is made by investigating statistical manifolds which are algebraic varieties. In particular it it shown how first and second order efficient estimators can be constructed,…

We observe that the vocabulary used to construct the "answer" to problems in computer algebra can have a dramatic effect on the computational complexity of solving that problem. We recall a formalization of this observation and explain the…

In this paper, we suggest a new efficient algorithm in order to compute S-polynomial reduction rapidly in the known algorithm for computing Grobner bases, and compare the complexity with others.

We show that the Hilbert space with basis indexed by infinite permutations and the cohomology ring of the infinite flag variety can be seen as representations of the Heisenberg algebra, which are isomorphic using the back-stable Schubert…

It is shown how one can apply the classification of the holonomy algebras of Lorentzian manifolds to solve some problems. In particular, a new proof to the classification of Lorentzian manifolds with recurrent curvature tensor is given; the…

There is a remarkable formula for the principal specialization of a type A Schubert polynomial as a weighted sum over reduced words. Taking appropriate limits transforms this to an identity for the backstable Schubert polynomials recently…

Using combinatorial techniques, we derive a recurrence identity that expresses an exponential power sum with negative powers in terms of another exponential power sum with positive powers. Consequently, we derive a formula for the power sum…

Persson and Strang (2003) evaluated the integral over [-1,1] of a squared odd degree Legendre polynomial divided by x^2 as being equal to 2. We consider a similar integral for orthogonal polynomials with respect to a general even…

A new family of polynomials, called cumulant polynomial sequence, and its extensions to the multivariate case is introduced relied on a purely symbolic combinatorial method. The coefficients of these polynomials are cumulants, but depending…

For two generalized Frobenius manifolds related by a Legendre-type transformation, we show that the associated integrable hierarchies of hydrodynamic type, which are called the Legendre-extended Principal Hierarchies, are related by a…

We study the effective potential for composite operators. Introducing a source coupled to the composite operator, we define the effective potential by a Legendre transformation. We find that in three or fewer dimensions, one can use the…

We recast homogeneous linear recurrence sequences with fixed coefficients in terms of partial Bell polynomials, and use their properties to obtain various combinatorial identities and multifold convolution formulas. Our approach relies on a…

We give expansions of reproducing kernels of the Christoffel-Darboux type in terms of Schur polynomials. For this, we use evaluations of averages of characteristic polynomials and Schur polynomials in random matrix ensembles. We explicitly…

We prove a formula for double Schubert and Grothendieck polynomials specialized to two rearrangements of the same set of variables. Our formula generalizes the usual formulas for Schubert and Grothendieck polynomials in terms of RC-graphs,…

In this paper we outline the most general and universal algorithmic approach to reduction of loop integrals to basic integrals. The approach is based on computation of Groebner bases for recurrence relations derived from the integration by…