Related papers: Gosper's algorithm and Bell numbers

One can find lists of whole numbers having equal sum and product. We call such a creature a bioperational multiset. No one seems to have seriously studied them in areas outside whole numbers such as the rationals, Gaussian integers, or…

We use Constraint Satisfaction Methods to construct and enumerate finite $L$-algebras up to isomorphism. These objects were recently introduced by Rump and appear in Garside theory, algebraic logic, and the study of the combinatorial…

Given a set (or multiset) S of n numbers and a target number t, the subset sum problem is to decide if there is a subset of S that sums up to t. There are several methods for solving this problem, including exhaustive search,…

We fix a counting function of multiplicities of algebraic points in a projective hypersurface over a number field, and take the sum over all algebraic points of bounded height and fixed degree. An upper bound for the sum with respect to…

We count the number of irreducible polynomials in several variables of a given degree over a finite field. The results are expressed in terms of a generating series, an exact formula and an asymptotic approximation. We also consider the…

Estimation is the computational task of recovering a hidden parameter $x$ associated with a distribution $D_x$, given a measurement $y$ sampled from the distribution. High dimensional estimation problems arise naturally in statistics,…

We present algorithms to evaluate two types of multiple sums, which appear in higher-order loop computations. We consider expansions of a generalized hypergeometric-type sums, $\sum_{n_1,...,n_N} [Gamma(a1.n+c1) Gamma(a2.n}+c2) ...…

An efficient evaluation method is described for polynomials in finite fields. Its complexity is shown to be lower than that of standard techniques when the degree of the polynomial is large enough. Applications to the syndrome computation…

Geometry processing presents a variety of difficult numerical problems, each seeming to require its own tailored solution. This breadth is largely due to the expansive list of geometric primitives, e.g., splines, triangles, and hexahedra,…

This paper offers a solution method that allows one to find exact values for a large class of convergent series of rational terms. Sums of this form arise often in problems dealing with Quantum Field Theory.

Let $\mathcal{A}$ be a finite set of integers, and let $h\mathcal{A}$ denote the $h$-fold sumset of $\mathcal{A}$. Let $(h\mathcal{A})^{(t)}$ be subset of $h\mathcal{A}$ consisting of all integers that have at least $t$ representations as a…

We extend the sum-of-divisors function to the complex plane via the Gaussian integers. Then we prove a modified form of Euler's classification of odd perfect numbers.

The problem of characterizing a real polynomial $f$ as a sum of squares of polynomials on a real algebraic variety $V$ dates back to the pioneering work of Hilbert in [Mathematische Annalen 32.3 (1888): 342-350]. In this paper, we…

This paper studies generalized semi-infinite programs (GSIPs) given by polynomials. We propose a hierarchy of polynomial optimization relaxations to solve them. They are based on Lagrange multiplier expressions and polynomial extensions.…

For certain problems involving vector fields, it is possible to find an associated imaginary field that, in conjunction with the first, forms a complex field for which the equation can be solved. This result is generalized to arbitrary…

Sumterms are introduced as syntactic entities, and sumtuples are introduced as semantic entities. Equipped with these concepts a new description is obtained of the notion of a sum as (the name for) a role which can be played by a number.…

We calculate some finite and infinite sums containing the digamma function in closed-form. For this purpose, we differentiate selected reduction formulas of the hypergeometric function with respect to the parameters applying some derivative…

For any positive integers $a$ and $b$, we enumerate all colored partitions made by noncrossing diagonals of a convex polygon into polygons whose number of sides is congruent to $b$ modulo $a$. For the number of such partitions made by a…

Floating point arithmetic allows us to use a finite machine, the digital computer, to reach conclusions about models based on continuous mathematics. In this article we work in the other direction, that is, we present examples in which…

In this paper, we derive some explicit expansion formulas associated to Brenke polynomials using operational rules based on their corresponding generating functions. The obtained coefficients are expressed either in terms of finite double…