相关论文: On rational definite summation

In the present paper and as an application of Roth's theorem concerning the rational approximation of algebraic numbers, we give a sufficient condition that will assure us that a sum, product and quotient of some series of positive rational…

In this paper we present algorithmic considerations and theoretical results about the relation between the orders of certain groups associated to the components of a polynomial and the order of the group that corresponds to the polynomial,…

Let $K$ be a number field. This paper considers arithmetic functions over $K$, that are, complex valued functions on the set of nonzero integral ideals in $K$. Firstly we generalize some basic results on arithmetic functions. Next we define…

We describe an approximate rational arithmetic with round-off errors (both absolute and relative) controlled by the user. The rounding procedure is based on the continued fraction expansion of real numbers. Results of computer experiments…

This paper proposes a new category theoretic account of equationally axiomatizable classes of algebras. Our approach is well-suited for the treatment of algebras equipped with additional computationally relevant structure, such as ordered…

Continuing previous work, this paper focuses on the summability problem of multivariate rational functions in the mixed case in which both shift and $q$-shift operators can appear. Our summability criteria rely on three ingredients…

We explore an algorithm for approximating roots of integers, discuss its motivation and derivation, and analyze its convergence rates with varying parameters and inputs. We also perform comparisons with established methods for approximating…

Starting from Gurevich's thesis for sequential algorithms (the so-called "sequential ASM thesis"), we propose a characterization of the behaviour of sequential algorithms enriched with reflection. That is, we present a set of postulates…

We investigate here sums of triangular numbers $f(x):=\sum_i b_i T_{x_i}$ where $T_n$ is the $n$-th triangular number. We show that for a set of positive integers $S$ there is a finite subset $S_0$ such that $f$ represents $S$ if and only…

The sum $S(h,k):=\sum_{j=1}^{k-1}(-1)^{j+1+[hj/k]}$ appears in the modular transformation formulae of the classical theta function $\vartheta_3(z)$. The double sum $S(k) := \sum_{h=1}^{k-1}S(h,k)$ has a remarkable distribution of values.…

Given a holonomic sequence $F(n)$, we characterize rational functions $r(n)$ so that $r(n)F(n)$ can be summable. We provide upper and lower bounds on the degree of the numerator of $r(k)$ and show the denominator of $r(n)$ can be read from…

We provide a closed formula for the degree of $\text{SO}(n)$ over an algebraically closed field of characteristic zero. In addition, we describe symbolic and numerical techniques which can also be used to compute the degree of…

The main achievement of this thesis is an algorithm which given a finite group presentation and natural numbers n and k, computes all the relators of length and area up to n and k respectively. The complexity of this algorithm is better by…

We study M(n,k,r), the number of orbits of {(a_1,...,a_k)\in Z_n^k | a_1+...+a_k = r (mod n)} under the action of S_k. Equivalently, M(n,k,r) sums the partition numbers of an arithmetic sequence: M(n,k,r) = sum_{t \geq 0} p(n-1,k,r+nt),…

Our goal in this work is to found a closed form for rational generat- ing functions, these generate a various families of polynomials and generalized polynomials, in order to get the general recursive formula satisfied by these polynomials.

We derive a combinatorial multisum expression for the number $D(n,k)$ of partitions of $n$ with Durfee square of order $k$. An immediate corollary is therefore a combinatorial formula for $p(n)$, the number of partitions of $n$. We then…

We prove novel convergence results for a stochastic proximal gradient algorithm suitable for solving a large class of convex optimization problems, where a convex objective function is given by the sum of a smooth and a possibly non-smooth…

Symbolic summation as an active research topic of symbolic computation provides efficient algorithmic tools for evaluating and simplifying different types of sums arising from mathematics, computer science, physics and other areas. Most of…

In this paper we report on new results relating to a conjecture regarding properties of $n\times n$, $n\leq 6$, positive definite matrices. The conjecture has been proven for $n\leq 4$ using computer-assisted sum of squares (SoS) methods…

This paper describes algorithms to deal with nested symbolic sums over combinations of harmonic series, binomial coefficients and denominators. In addition it treats Mellin transforms and the inverse Mellin transformation for functions that…