相关论文: Finding systems of functional equations for Andrew…
The Grover search algorithm performs an unstructured search of a marked item in a database quadratically faster than classical algorithms and is shown to be optimal. Here, we show that if the search space is divided into two blocks with the…
Let $\mathscr{S}$ denote the set of integer partitions into parts that differ by at least $3$, with the added constraint that no two consecutive multiples of $3$ occur as parts. We derive trivariate generating functions of Andrews--Gordon…
In this work, we illustrate and explore the use of Taylor series as solutions of differential equations. For a large a number of classes of differential equations in the literature, there are plenty of sources where the well known Taylor…
We define discrete generating series for arbitrary functions \( f \colon \mathbb{Z}^n \rightarrow \mathbb{C} \) and derive functional relations that these series satisfy. For linear difference equations with constant coefficients, we…
We propose an inertial Douglas-Rachford splitting algorithm for finding the set of zeros of the sum of two maximally monotone operators in Hilbert spaces and investigate its convergence properties. To this end we formulate first the…
A quantum algorithm for general combinatorial search that uses the underlying structure of the search space to increase the probability of finding a solution is presented. This algorithm shows how coherent quantum systems can be matched to…
Reference [1] established an index theory for a class of linear selfadjoint operator equations covering both second order linear Hamiltonian systems and first order linear Hamiltonian systems as special cases. In this paper based upon this…
In this paper, we generalize Andrews' partitions separated by parity to overpartitions in two ways. We investigate the generating functions for 16 overpartition families whose parts are separated by parity, and we prove various $q$-series…
We propose an algorithm to find a solution to an integro-differential equation of the DGLAP type for all the orders in the running coupling $\alpha$ with splitting functions given at a fixed order in $\alpha.$ Complex analysis is…
We design an efficient data structure for computing a suitably defined approximate depth of any query point in the arrangement $\mathcal{A}(S)$ of a collection $S$ of $n$ halfplanes or triangles in the plane or of halfspaces or simplices in…
We present solutions of asymmetric double sine-Gordon equation (DSGE) of an infinite system based on Mobius transformation and numerical exercise. This method is able to give the forms of the solutions for all the region on the \phi-\eta…
We re-address the problem of construction of new infinite-dimensional completely integrable systems on the basis of known ones, and we reveal a working mechanism for such transitions. By splitting the problem's solution in two steps, we…
This article generalizes a recently introduced procedure to solve nonlinear systems of equations, radically departing from the conventional Newton-Raphson scheme. The original nonlinear system is first unfolded into three simpler…
We describe Gauss-type maps as geometric realizations of certain codes in the monoid of nonnegative matrices in the extended modular group. Each such code, together with an appropriate choice of unimodular intervals in P^1R, determines a…
The principal aim of this article is to establish an iteration method on the space of resurgent functions. We discuss endless continuability of iterated convolution products of resurgent functions and derive their estimates developing the…
We present two algorithms for computing hypergeometric solutions of second order linear differential operators with rational function coefficients. Our first algorithm searches for solutions of the form \[ \exp(\int r \,…
The aim of this paper is to investigate Ennola duality for decomposition of tensor products of irreducible characters of finite general linear groups and finite unitary groups. We prove that Ennola duality holds generically and give a…
We propose a family of quantum algorithms for estimating Gowers uniformity norms $ U^k $ over finite abelian groups and demonstrate their applications to testing polynomial structure and counting arithmetic progressions. Building on recent…
We recast Grover's generalised search algorithm in a geometric language even when the states are not approximately orthogonal. We provide a possible search algorithm based on an arbitrary unitary transformation which can speed up the steps…
This paper extends the SQP-approach of the well-known bundle-Newton method for nonsmooth unconstrained minimization to the nonlinearly constrained case. Instead of using a penalty function or a filter or an improvement function to deal with…