English
Related papers

Related papers: Symbolic Summation of Multivariate Rational Functi…

200 papers

The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…

Optimization and Control · Mathematics 2011-12-08 Jesus A. De Loera , Peter N. Malkin , Pablo A. Parrilo

We consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; indefinite and definite summation of sequences that are…

Symbolic Computation · Computer Science 2008-04-03 Alin Bostan , Frédéric Chyzak , Bruno Salvy , Thomas Cluzeau

We propose a symbolic generative task description language and a corresponding inference engine capable of representing arbitrary multimodal tasks as structured symbolic flows. Unlike conventional generative models that rely on large-scale…

Decomposing the domain of a function into parts has many uses in mathematics. A domain may naturally be a union of pieces, a function may be defined by cases, or different boundary conditions may hold on different regions. For any…

Symbolic Computation · Computer Science 2010-05-03 Jacques Carette , Alan P. Sexton , Volker Sorge , Stephen M. Watt

We present a general approach to rounding semidefinite programming relaxations obtained by the Sum-of-Squares method (Lasserre hierarchy). Our approach is based on using the connection between these relaxations and the Sum-of-Squares proof…

Data Structures and Algorithms · Computer Science 2013-12-24 Boaz Barak , Jonathan Kelner , David Steurer

A sum-of-squares is a polynomial that can be expressed as a sum of squares of other polynomials. Determining if a sum-of-squares decomposition exists for a given polynomial is equivalent to a linear matrix inequality feasibility problem.…

Optimization and Control · Mathematics 2013-03-07 Peter Seiler , Qian Zheng , Gary Balas

In this paper, motivated by diffraction of traveling light waves, a simple mathematical model is proposed, both for the multivariate super-resolution problem and the problem of blind-source separation of real-valued exponential sums. This…

Numerical Analysis · Mathematics 2017-08-01 Charles K. Chui , Hrushikesh N. Mhaskar

A core challenge for both physics and artificial intellicence (AI) is symbolic regression: finding a symbolic expression that matches data from an unknown function. Although this problem is likely to be NP-hard in principle, functions of…

Computational Physics · Physics 2020-04-16 Silviu-Marian Udrescu , Max Tegmark

Usually creative telescoping is used to derive recurrences for sums. In this article we show that the non-existence of a creative telescoping solution, and more generally, of a parameterized telescoping solution, proves algebraic…

Symbolic Computation · Computer Science 2008-09-02 Carsten Schneider

Finding a common factor of two multivariate polynomials with approximate coefficients is a problem in symbolic-numeric computing. Taking a tropical view on this problem leads to efficient preprocessing techniques, applying polyhedral…

Algebraic Geometry · Mathematics 2008-09-02 Danko Adrovic , Jan Verschelde

Symbolic execution is a powerful technique for program analysis. However, it has many limitations in practical applicability: the path explosion problem encumbers scalability, the need for language-specific implementation, the inability to…

Programming Languages · Computer Science 2018-07-03 Shiqi Shen , Soundarya Ramesh , Shweta Shinde , Abhik Roychoudhury , Prateek Saxena

This study proposes an approach toward the first principles electronic structure calculation with the aid of symbolic-numeric solving. The symbolic computation enables us to express the Hartree-Fock-Roothaan equation and the molecular…

Symbolic Computation · Computer Science 2013-02-26 Akihito Kikuchi

By combining the telescoping method with an algebraic relation, four classes of binomial moments are examined. Several explicit summation formulae are established.

Combinatorics · Mathematics 2026-03-30 Marta Na Chen , Wenchang Chu

In this paper, we consider an extension of Jacobi's symbol, the so called rational $2^k$-th power residue symbol. In Section 3, we prove a novel generalization of Zolotarev's lemma. In Sections 4, 5 and 6, we show that several hard…

Number Theory · Mathematics 2017-09-20 Markus Hittmeir

Multimodal summarization requires models to jointly understand textual and visual inputs to generate concise, semantically coherent summaries. Existing methods often inject shallow visual features into deep language models, leading to…

Artificial Intelligence · Computer Science 2026-05-13 Abid Ali , Diego Molla-Aliod , Usman Naseem

Polynomial multiplication is a fundamental problem in symbolic computation. There are efficient methods for the multiplication of two univariate polynomials. However, there is rarely efficiently nontrivial method for the multiplication of…

Computational Complexity · Computer Science 2024-03-20 Cancan Wang , Ming Su , Gang Wang , Qingpo Zhang

We address the decision problem for sentences involving univariate functions constructed from a fixed Pfaffian function of order $1$. We present a new symbolic procedure solving this problem with a computable complexity based on the…

Algebraic Geometry · Mathematics 2019-05-29 Maria Laura Barbagallo , Gabriela Jeronimo , Juan Sabia

Parametric linear systems are linear systems of equations in which some symbolic parameters, that is, symbols that are not considered to be candidates for elimination or solution in the course of analyzing the problem, appear in the…

Rings and Algebras · Mathematics 2025-09-01 Robert M. Corless , Mark Giesbrecht , Leili Rafiee Sevyeri , B. David Saunders

In some real world situations, linear models are not sufficient to represent accurately complex relations between input variables and output variables of a studied system. Multilayer Perceptrons are one of the most successful non-linear…

Neural and Evolutionary Computing · Computer Science 2008-02-05 Fabrice Rossi , Brieuc Conan-Guez

Functions with singularities are notoriously difficult to approximate with conventional approximation schemes. In computational applications, they are often resolved with low-order piecewise polynomials, multilevel schemes, or other types…

Numerical Analysis · Mathematics 2024-07-30 Nicolas Boullé , Astrid Herremans , Daan Huybrechs