Related papers: An Algorithmic Approach to the $q$-Summability Pro…
Fourier expansion of the integrand in the path integral formula for the partition function of quantum systems leads to a deterministic expression which, though still quite complex, is easier to process than the original functional integral.…
We consider the computation of the mean of sequences in the quantum model of computation. We determine the query complexity in the case of sequences which satisfy a $p$-summability condition for $1\le p<2$. This settles a problem left open…
We find a simple criterion for the equality $Q_\lambda=Q_{\mu/\nu}$ where $Q_\lambda$ and $Q_{\mu/\nu}$ are Schur's Q-functions on infinitely many variables.
In this article, we give a formula for the generalization of the binomial coefficient to the complex numbers as a linear combination of $\sinc$ functions. We then give a general formula to compute the integral on the real line of the…
We consider the $q$th root number function for the symmetric group. Our aim is to develop an asymptotic formula for the multiplicities of the $q$th root number function as $q$ tends to $\infty$. We use character theory, number theory and…
We consider a general statistical linear inverse problem, where the solution is represented via a known (possibly overcomplete) dictionary that allows its sparse representation. We propose two different approaches. A model selection…
This paper proposes uni-orthogonal and bi-orthogonal nonnegative matrix factorization algorithms with robust convergence proofs. We design the algorithms based on the work of Lee and Seung [1], and derive the converged versions by utilizing…
Quantum Annealing (QA) can efficiently solve combinatorial optimization problems whose objective functions are represented by Quadratic Unconstrained Binary Optimization (QUBO) formulations. For broader applicability of QA, quadratization…
In this paper we consider a $q$-analog of the Borel-Laplace summation process defined by Marotte and the second author, and consider two series solutions of linear $q$-difference equations with slopes $0$ and $1$. The latter are…
This paper depicts an algorithm for solving the Decision Boolean Satisfiability Problem using the binary numerical properties of a Special Decision Satisfiability Problem, parallel execution, object oriented, and short termination. The two…
Case-Based Reasoning (CBR) is an artificial intelligence approach to problem-solving with a good record of success. This article proposes using Quantum Computing to improve some of the key processes of CBR, such that a Quantum Case-Based…
A commonly observed problem with the state-of-the art abstractive summarization models is that the generated summaries can be factually inconsistent with the input documents. The fact that automatic summarization may produce…
Q-learning is a stochastic approximation version of the classic value iteration. The literature has established that Q-learning suffers from both maximization bias and slower convergence. Recently, multi-step algorithms have shown practical…
Let $H$ be a hyperexponential function in $n$ variables $x=(x_1,\dots,x_n)$ with coefficients in a field $\mathbb{K}$, $[\mathbb{K}:\mathbb{Q}] <\infty$, and $\omega$ a rational differential $1$-form. Assume that $H\omega$ is closed and $H$…
The aim of this work is to prove a Tauberian theorem for the Ingham summability method. The Tauberian theorem we prove is then applied to analyze asymptotics of mean values of multiplicative functions on natural numbers.
We consider min-max optimization problems for polynomial functions, where a multivariate polynomial is maximized with respect to a subset of variables, and the resulting maximal value is minimized with respect to the remaining variables.…
We present an efficient method to solve the problem of the constrained least squares approximation of the rational B\'{e}zier curve by the B\'{e}zier curve. The presented algorithm uses the dual constrained Bernstein basis polynomials,…
By solving an infinite nonlinear system of $q$-difference equations one constructs a chain of $q$-difference operators. The eigenproblems for the chain are solved and some applications, including the one related to $q$-Hahn orthogonal…
Using the methodology of (rigorous) {\it experimental mathematics}, we give a simple and motivated solution to Zudilin's question concerning a $q$-analog of a problem posed by Asmus Schmidt about a certain binomial coefficients sum. Our…
The following paper proposes a new approach to determine whether a logical (CNF) formula is satisfiable or not using probability theory methods. Furthermore, we will introduce an algorithm that speeds up the standard solution for (CNF-SAT)…