Related papers: An Algorithmic Approach to the $q$-Summability Pro…
The method of rational function certification for proving terminating hypergeometric identities is extended from single sums or integrals to multi-integral/sums and ``$q$'' integral/sums.
The fractional q-calculus is the q-extension of the ordinary fractional calculus and dates back to early 20-th century. The theory of q-calculus operators are used in various areas of science such as ordinary fractional calculus, optimal…
This paper is an enhanced version of a more than decade-older paper with a similar title. Many formulae involving both finite and infinite sums of digamma and polygamma functions up to quadratic order, few of which appear in standard…
We consider the question of approximating any real number $\alpha$ by sums of $n$ rational numbers $\frac{a_1}{q_1} + \frac{a_2}{q_2} + ... + \frac{a_n}{q_n}$ with denominators $1 \leq q_1, q_2, ..., q_n \leq N$. This leads to an inquiry on…
In this paper, we consider the fractional sum of the divisor functions. We can improve previous results considered by Bordell\'{e}s \cite{Bo} and Liu-Wu-Yang \cite{LWY}.
Theorem. An irreducible cubic polynomial with rational coefficients has a root in a one step radical extension of Q if and only if the discriminate is a square of a rational number. Theorem. An irreducible polynomial x^4+px^2+qx+s with…
The extended L\"uroth's Theorem says that if the transcendence degree of $\KK(\mathsf{f}_1,\dots,\mathsf{f}_m)/\KK$ is 1 then there exists $f \in \KK(\underline{X})$ such that $\KK(\mathsf{f}_1,\dots,\mathsf{f}_m)$ is equal to $\KK(f)$. In…
Recently, Ni and Pan proved a $q$-congruence on certain sums involving central $q$-binomial coefficients, which was conjectured by Guo. In this paper, we give a generalization of this $q$-congruence and confirm another $q$-congruence, also…
Recently, Guo and Zeng discovered q-analogues of Faulhaber's formulas for the sums of powers. They left it as an open problem to extend the combinatorial interpretation of Faulhaber's formulas as given by Gessel and Viennot to the q case.…
The analysis of solutions to algebraic equations is further simplified. A couple of functions and their analytic continuation or root findings are required.
We consider the problem of evaluating certain types of functional aggregation queries on relational data subject to additive inequalities. Such aggregation queries, with a smallish number of additive inequalities, arise naturally/commonly…
In part 1 of this paper some linear weighted generalized Fibonacci number summation identities were derived using the fact that the Fibonacci number is the residue of a rational function. In this part, using the same method, some quadratic…
We prove two single-parameter q-supercongruences which were recently conjectured by Guo, and establish their further extensions with one more parameter. Crucial ingredients in the proof are the terminating form of q-binomial theorem and a…
In this paper, we derive some formulae involving coefficients of polynomials which occur quite naturally in the study of restricted partitions. Our method involves a recently discovered sieve technique by Li and Wan (Sci. China. Math.…
The k-satisfiability problem is a well-known task in computational complexity theory. In this paper approach for it's solving is introduced.
Let h be a complex meromorphic function decomposed in two different ways P(f) and Q(g), where f, g are meromorphic functions and P, Q are rational functions. We follow an approach due to C.-C. Yang, P. Li and K. H. Ha who handle similar…
We provide a new quantum algorithm that efficiently determines the quality of a least-squares fit over an exponentially large data set by building upon an algorithm for solving systems of linear equations efficiently (Harrow et al., Phys.…
A famous result due to Ko and Friedman (1982) asserts that the problems of integration and maximisation of a univariate real function are computationally hard in a well-defined sense. Yet, both functionals are routinely computed at great…
We study the close connection between rational functions that approximate a given Boolean function, and quantum algorithms that compute the same function using postselection. We show that the minimal degree of the former equals (up to a…
We present a package to perform partial fraction decompositions of multivariate rational functions. The algorithm allows to systematically avoid spurious denominator factors and is capable of producing unique results also when being applied…