English
Related papers

Related papers: Telescoping Algorithms for $\Sigma^*$-Extensions v…

200 papers

A general method for the reduction of coupled spherical harmonic products is presented. When the total angular coupling is zero, the reduction leads to an explicitly real expression in the scalar products within the unit vector arguments of…

Mathematical Physics · Physics 2023-02-28 D. R. Lehman , W. C. Parke

We study a mechanism of symmetry reduction in a higher-dimensional field theory upon orbifold compactification. Split multiplets appear unless all components in a multiplet of a symmetry group have a common parity on an orbifold. A gauge…

High Energy Physics - Phenomenology · Physics 2007-05-23 Tetsuaki Kawamoto , Yoshiharu Kawamura

In difference algebra, summability arises as a basic problem upon which rests the effective solution of other more elaborate problems, such as creative telescoping problems and the computation of Galois groups of difference equations. In…

Symbolic Computation · Computer Science 2025-04-29 Carlos E. Arreche

We present an algorithm for low rank decomposition of tensors of any symmetry type, from fully asymmetric to fully symmetric. It recovers the decomposition one summand at a time via the higher-order power method. This approach is known to…

Numerical Analysis · Mathematics 2026-05-22 Kexin Wang , João M. Pereira , Joe Kileel , Anna Seigal

In PRL 115, 143001 (2015), H. Mera et al. developed a new simple but precise Hypergeometric Resummation technique. In this work, we suggest to obtain half of the parameters of the Hypergeometric function from the strong coupling expansion…

High Energy Physics - Theory · Physics 2020-06-08 Abouzeid M. Shalaby

In symbolic integration, the Risch--Norman algorithm aims to find closed forms of elementary integrals over differential fields by an ansatz for the integral, which usually is based on heuristic degree bounds. Norman presented an approach…

Symbolic Computation · Computer Science 2025-02-28 Hao Du , Clemens G. Raab

We consider the problem of decomposing a real-valued symmetric tensor as the sum of outer products of real-valued vectors. Algebraic methods exist for computing complex-valued decompositions of symmetric tensors, but here we focus on…

Numerical Analysis · Mathematics 2018-08-23 Tamara G. Kolda

We present a criterion for the existence of telescopers for mixed hypergeometric terms, which is based on multiplicative and additive decompositions. The criterion enables us to determine the termination of Zeilberger's algorithms for mixed…

Symbolic Computation · Computer Science 2012-11-14 Shaoshi Chen , Frédéric Chyzak , Ruyong Feng , Guofeng Fu , Ziming Li

A telescopic curve is a certain algebraic curve defined by $m-1$ equations in the affine space of dimension $m$, which can be a hyperelliptic curve and an $(n,s)$ curve as a special case. We extend the addition formulae for sigma functions…

Algebraic Geometry · Mathematics 2013-06-20 Takanori Ayano , Atsushi Nakayashiki

We show that a projective triangulation of a subcomplex of a polyhedral complex can be extended to the whole complex. As a result, we show that the weak semistable reduction result of Abramovich - Karu alg-geom/9707012 can be refined, so…

Algebraic Geometry · Mathematics 2007-05-23 D. Abramovich , J. M. Rojas

This paper describes the notion of \sigma -symmetry, which extends the one of \lambda-symmetry, and its application to reduction procedures of systems of ordinary differential equations and of dynamical systems as well. We also consider…

Mathematical Physics · Physics 2015-06-16 Giampaolo Cicogna

In this letter, we consider a problem of reconstructing an unknown discrete signal taking values in a finite alphabet from incomplete linear measurements. The difficulty of this problem is that the computational complexity of the…

Information Theory · Computer Science 2015-03-19 Masaaki Nagahara

The influx of massive amounts of data from current and upcoming cosmological surveys necessitates compression schemes that can efficiently summarize the data with minimal loss of information. We introduce a method that leverages the…

Cosmology and Nongalactic Astrophysics · Physics 2023-12-18 Aizhan Akhmetzhanova , Siddharth Mishra-Sharma , Cora Dvorkin

We extend the shell and kernel reductions for hyperexponential functions over the field of rational functions to a monomial extension. Both of the reductions are incorporated into one algorithm. As an application, we present an additive…

Symbolic Computation · Computer Science 2023-10-03 Shaoshi Chen , Hao Du , Yiman Gao , Ziming Li

Let n be a positive integer, and let R be a finitely presented (but not necessarily finite dimensional) associative algebra over a computable field. We examine algorithmic tests for deciding (1) if every n-dimensional representation of R is…

Rings and Algebras · Mathematics 2007-05-23 Edward S. Letzter

We present a reduction algorithm that simultaneously extends Hermite's reduction for rational functions and the Hermite-like reduction for hyperexponential functions. It yields a unique additive decomposition and allows to decide…

Symbolic Computation · Computer Science 2013-01-23 Alin Bostan , Shaoshi Chen , Frédéric Chyzak , Ziming Li , Guoce Xin

Functional methods and a derivative expansion are employed for laying out a procedure to compute the effective action to any loop order, for scalar fields parametrising an arbitrary Riemannian manifold, while maintaining explicit…

High Energy Physics - Theory · Physics 2024-10-08 Rodrigo Alonso , Mia West

By means of the telescoping method, we establish two sum- mation formulas on sine function. As the special cases of them, several interesting series expansions for $1/\pi^m$ and $\pi^m$.

Combinatorics · Mathematics 2013-11-26 Chuanan Wei , Xiaoxia Wang

One of the main issues in computing a tensor decomposition is how to choose the number of rank-one components, since there is no finite algorithms for determining the rank of a tensor. A commonly used approach for this purpose is to find a…

Computer Vision and Pattern Recognition · Computer Science 2023-09-15 Claudio Turchetti

We provide an algorithm for decomposing a finite-dimensional Lie algebra over a field of characteristic 0 permitting to generalize the derivation tower theorem for Lie algebras, is proved by E. Schenkman \cite{Sc}.

Representation Theory · Mathematics 2007-05-23 Toukaiddine Petit