Related papers: A conjecture in the problem of rational definite s…
It is well known that the resolution method (for propositional logic) is complete. However, completeness proofs found in the literature use an argument by contradiction showing that if a set of clauses is unsatisfiable, then it must have a…
Consider a sum of convex functions, where the only information known about each individual summand is the location of a minimizer. In this work, we give an exact characterization of the set of possible minimizers of the sum. Our results…
We observe that successive applications of known results from the theory of positive systems lead to an {\it efficient general algorithm} for positive realizations of transfer functions. We give two examples to illustrate the algorithm, one…
Using probability theory we derive an expression for the sum of a series of definite integrals involving upper incomplete Gamma functions. In the proof, a normal variance mixture distribution with Beta mixing distributions plays a crucial…
We discuss various universality aspects of numerical computations using standard algorithms. These aspects include empirical observations and rigorous results. We also make various speculations about computation in a broader sense.
Let A be a class of objects, equipped with an integer size such that for all n the number a(n) of objects of size n is finite. We are interested in the case where the generating fucntion sum_n a(n) t^n is rational, or more generally…
We establish several sum-product estimates over finite fields that involve polynomials and rational functions. First, |f(A)+f(A)|+|AA| is substantially larger than |A| for an arbitrary polynomial f over F_p. Second, a characterization is…
We prove recursive formulas involving sums of divisors and sums of triangular numbers and give a variety of identities relating arithmetic functions to divisor functions providing inductive identities for such arithmetic functions.
This paper is concerned with the study of the fractional finite sums theory. We present the classes of functions for which it is possible to characterize the constant related to the derivative of fractional sums (denominated by essence of a…
In 2014, Chen and Singer solved the summability problem of bivariate rational functions. Later an algorithmic proof was presented by Hou and the author. In this paper, the algorithm will be simplified and adapted to the $q$-case.
We present a formulation of the Collatz conjecture that is potentially more amenable to modeling and analysis by automated termination checking tools.
We propose a splitting algorithm for solving a system of composite monotone inclusions formulated in the form of the extended set of solutions in real Hilbert spaces. The resluting algorithm is a an extension of the algorithm in [4]. The…
We determine, within 1, the value of N for which sum (s1 choose i)(s2 choose N)(s1 choose N-i)(N choose i) achieves its maximum value. Here s1 and s2 are fixed integers. This problem arises in studying the most likely value for the size of…
We establish a connection between the ratios conjecture for the Riemann zeta-function and a conjecture concerning correlations of convolutions of M\"{o}bius and divisor functions. Specifically, we prove that the ratios conjecture and an…
Conjectures involving infinite families of restricted partition congruences can be difficult to verify for a number of individual cases, even with a computer. We demonstrate how the machinery of Radu's algorithm may be modified and employed…
A consistently specified halting function may be computed.
Many interesting and useful symbolic computation algorithms manipulate mathematical expressions in mathematically meaningful ways. Although these algorithms are commonplace in computer algebra systems, they can be surprisingly difficult to…
The efficiency of exact subset sum problem algorithms which compute individual subset sums is defined as $e=min(T/z, 1)$, where $z$ is the number of subset sums computed. $e$ is related to these algorithms' computational complexity. This…
We present a method to prove the decidability of provability in several well-known inference systems. This method generalizes both cut-elimination and the construction of an automaton recognizing the provable propositions.
We examine the rationality conjecture which states that (a) the formal power series $\sum_{r\ge 1} \tc_{r+1}(X)\cdot x^r$ represents a rational function of $x$ with a single pole of order 2 at $x=1$ and (b) the leading coefficient of the…