相关论文: Finding Exact Values For Infinite Sums
In this paper certain classes of infinite sums involving special functions are evaluated analytically by application of basic quantum mechanical principles to simple models of half harmonic oscillator and a particle trapped inside an…
This paper presents a family of rapidly convergent summation formulas for various finite sums of analytic functions. These summation formulas are obtained by applying a series acceleration transformation involving Stirling numbers of the…
We develop a numerical method for solving a system of nonlinear integral equations involving two integral terms: at the current time t, one integral is taken from 0 to t, and a different integral is taken from t to infinity. We prove the…
We show that the formulas for the sum rules for the eigenvalues of inhomogeneous systems that we have obtained in two recent papers are incomplete when the system contains a zero mode. We prove that there are finite contributions of the…
In the analysis of large/big data sets, aggregation (replacing values of a variable over a group by a single value) is a standard way of reducing the size (complexity) of the data. Data analysis programs provide different aggregation…
We find a new method for looking for the static and spherically symmetric solutions in $F(R)$ theory of gravity. With this method, a number of new solutions in terms of the analytic functions are obtained. We hope this investigation may be…
We give a complete and elementary proofs of "Jordan's sums" and study Euler's types sums. In particular we give a formula for the sum of series with same weight, which is similar to this one of classical 2-Euler's sums.
In some fields such as Mathematics Mechanization, automated reasoning and Trustworthy Computing etc., exact results are needed. Symbolic computations are used to obtain the exact results. Symbolic computations are of high complexity. In…
Computing the real solutions to a system of polynomial equations is a challenging problem, particularly verifying that all solutions have been computed. We describe an approach that combines numerical algebraic geometry and sums of squares…
The subset sum problem is known to be an NP-hard problem in the field of computer science with the fastest known approach having a run-time complexity of $O(2^{0.3113n})$. A modified version of this problem is known as the perfect sum…
In this paper, by using the method of Contour Integral Representations and the Theorem of Residues and integral representations of series, we discuss the analytic representa- tions of parametric Euler sums that involve harmonic numbers…
In this expository article, the real numbers are defined as infinite decimals. After defining an ordering relation and the arithmetic operations, it is shown that the set of real numbers is a complete ordered field. It is further shown that…
The target discounted-sum problem is the following: Given a rational discount factor $0<\lambda<1$ and three rational values $a,b$, and $t$, does there exist a finite or an infinite sequence $w \in \{a,b\}^*$ or $w \in \{a,b\}^\omega$, such…
We present an efficient quantum algorithm for estimating Gauss sums over finite fields and finite rings. This is a natural problem as the description of a Gauss sum can be done without reference to a black box function. With a reduction…
In this paper we provide a method capable of producing an infinite number of solutions for Einstein's equation on static spacetimes with perfect fluid as a matter field. All spacetimes of this type which are symmetric with respect to a…
The infinitary propositional logic of here-and-there is important for the theory of answer set programming in view of its relation to strongly equivalent transformations of logic programs. We know a formal system axiomatizing this logic…
We derive analytic solutions for the potential and field in a one-dimensional system of masses or charges with periodic boundary conditions, in other words Ewald sums for one dimension. We also provide a set of tools for exploring the…
This paper describes a generalization of Clark's completion that is applicable to logic programs containing arithmetic operations and produces syntactically simple, natural looking formulas. If a set of first-order axioms is equivalent to…
This paper presents a novel approach to constructing finite generating sets for infinitely generated ideals. By integrating algebraic and computational techniques, we provide a method to identify finite generators, demonstrated through…
The maximum segment sum problem is to compute, given a list of integers, the largest of the sums of the contiguous segments of that list. This problem specification maps directly onto a cubic-time algorithm; however, there is a very elegant…