Related papers: Easy Proof of Three Recursive $\pi$-Algorithms -- …
We describe a simple algorithm for estimating the $k$-th normalized Betti number of a simplicial complex over $n$ elements using the path integral Monte Carlo method. For a general simplicial complex, the running time of our algorithm is…
We prove simplicity, and compute $\delta$-derivations and symmetric associative forms of algebras in the title.
Whittle index is a generalization of Gittins index that provides very efficient allocation rules for restless multi-armed bandits. In this work, we develop an algorithm to test the indexability and compute the Whittle indices of any…
This paper employs a powerful argument, called an algorithmic argument, to prove lower bounds of the quantum query complexity of a multiple-block ordered search problem in which, given a block number i, we are to find a location of a target…
Let $\R$ be a real closed field, $ {\mathcal Q} \subset \R[Y_1,...,Y_\ell,X_1,...,X_k], $ with $ \deg_{Y}(Q) \leq 2, \deg_{X}(Q) \leq d, Q \in {\mathcal Q}, #({\mathcal Q})=m$, and $ {\mathcal P} \subset \R[X_1,...,X_k] $ with $\deg_{X}(P)…
Every classical orthogonal polynomial system $p_n(x)$ satisfies a three-term recurrence relation of the type \[ p_{n+1}(x)=(A_nx+B_n)p_n(x)-C_np_{n-1}(x)~ (n=0,1,2,\ldots, p_{-1}\equiv 0), \] with $C_nA_nA_{n-1}>0$. Moreover, Favard's…
This paper provides algebraic proofs for several types of congruences involving the multipartition function and self-convolutions of the divisor function. Our computations use methods of Differential Algebra in $\mathbb{Z}/q\mathbb{Z}$,…
By making use of the multiplicate form of the extended Carlitz inverse series relations, we establish two general `dual' theorems of Jackson's summation formula for well--poised $_8\phi_7$-series. Their duplicate forms under the partition…
The three operator splitting scheme was recently proposed by [Davis and Yin, 2015] as a method to optimize composite objective functions with one convex smooth term and two convex (possibly non-smooth) terms for which we have access to…
Simple proofs of the midpoint, trapezoidal and Simpson's rules are proved for numerical integration on a compact interval. The integrand is assumed to be twice continuously differentiable for the midpoint and trapezoidal rules, and to be…
Denote by $\pi(x;q,a)$ the number of primes $p\leqslant x$ with $p\equiv a\bmod q.$ We prove new upper bounds for $\pi(x;q,a)$ when $q$ is a large prime very close to $\sqrt{x}$, improving upon the classical work of Iwaniec (1982). The…
We apply the Pade technique to find rational approximations to % \[h^{\pm}(q_1,q_2)=\sum_{k=1}^\infty\frac{\q_1^k}{1\pm \q_2^k}, 0<q_1,q_2<1, q_1\in\mathbb{Q}, q_2=1/p_2, p_2\in\mathbb{N}\setminus\{1\}.\] % A separate section is dedicated…
Successive quadratic approximations, or second-order proximal methods, are useful for minimizing functions that are a sum of a smooth part and a convex, possibly nonsmooth part that promotes regularization. Most analyses of iteration…
Uhlmann's theorem is a central result in quantum information theory, which associates the closeness of two quantum states with that of their purifications. The theorem also well characterizes a fundamental task: how close a pure quantum…
Finite-sum optimization has wide applications in machine learning, covering important problems such as support vector machines, regression, etc. In this paper, we initiate the study of solving finite-sum optimization problems by quantum…
We consider a version of Shor's quantum factoring algorithm such that the quantum Fourier transform is replaced by an extremely simple one where decomposition coefficients take only the values of $1,i,-1,-i$. In numerous calculations which…
We present the first algorithm for computing class groups and unit groups of arbitrary number fields that provably runs in probabilistic subexponential time, assuming the Extended Riemann Hypothesis (ERH). Previous subexponential algorithms…
Training in machine learning generally consists in finding one model, whose parameters minimize a data-dependent loss. Yet, empirical work shows that ensemble learning, an approach in which multiple models are sampled, can improve…
Ballantine--Beck--Feigon--Maurischat introduced the subsum polynomial \[ \operatorname{sp}(\lambda,x):=\prod_i (1+x^{\lambda_i}) \] attached to an integer partition $\lambda$, and studied rational functions obtained by summing reciprocals…
There are thousands of papers on rootfinding for nonlinear scalar equations. Here is one more, to talk about an apparently new method, which I call ``Inverse Cubic Iteration'' (ICI) in analogy to the Inverse Quadratic Iteration in Richard…