Related papers: Comprehensive Restriction Algorithm for Hypergeome…
We prove Fourier restriction estimates by means of the polynomial partitioning method for compact subsets of any sufficiently smooth hyperbolic hypersurface in threedimensional euclidean space. Our approach exploits in a crucial way the…
We adapt Caro's notion of overholonomicity to give a definition of holonomic D-cap-modules on rigid analytic spaces. We prove stability under five of the six operations (both inverse image functors, duality, and both direct image functors…
We design a Quasi-Polynomial time deterministic approximation algorithm for computing the integral of a multi-dimensional separable function, supported by some underlying hyper-graph structure, appropriately defined. Equivalently, our…
This article deals with optimizing problems classified by the kinds of restrictions as required in differential geometry and in mechanics: holonomic and nonholonomic. The central issue relates to dual nonholonomic programs (what they mean…
Submodular maximization is one of the central topics in combinatorial optimization. It has found numerous applications in the real world. In the past decades, a series of algorithms have been proposed for this problem. However, most of the…
HHL algorithm \cite{harrow} to solve linear system is a powerful and efficient quantum technique to deal with many matrix operations (such as matrix multiplication, powers and inversion). It inspires many applications in quantum machine…
We extend Petkov\v{s}ek's algorithm for computing hypergeometric solutions of scalar difference equations to the case of difference systems $\tau(Y) = M Y$, with $M \in {\rm GL}_n(C(x))$, where $\tau$ is the shift operator. Hypergeometric…
In this paper we construct the Hamiltonian constraint operator of loop quantum cosmology using holonomies defined for arbitrary irreducible SU(2) representations labeled by spin J. We show that modifications to the effective semi-classical…
Many applications require efficient methods for solving continuous shortest path problems. Such paths can be viewed as characteristics of static Hamilton-Jacobi equations. Several fast numerical algorithms have been developed to solve such…
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…
With the advent of quantum computers, many quantum computing algorithms are being developed. Solving linear systems is one of the most fundamental problems in almost all science and engineering. The Harrow-Hassidim-Lloyd algorithm, a…
We revisit the Ou-Wang's approach to the cone restriction problem via polynomial partitioning. By recasting their inductive scheme as a recursive algorithm and incorporating the nested polynomial Wolff axioms, we obtain improved bounds for…
In the limited workspace model, we consider algorithms whose input resides in read-only memory and that use only a constant or sublinear amount of writable memory to accomplish their task. We survey recent results in computational geometry…
We provide bounds on the size of operators obtained by algorithms for executing D-finite closure properties. For operators of small order, we give bounds on the degree and on the height (bit-size). For higher order operators, we give degree…
A simple yet efficient computational algorithm for computing the continuous optimal experimental design for linear models is proposed. An alternative proof the monotonic convergence for $D$-optimal criterion on continuous design spaces are…
Dwork's $p$-adic hypergeometric function is defined to be a ratio ${}_sF_{s-1}(t)/{}_sF_{s-1}(t^p)$ of hypergeometric power series. Dwork showed that it is a uniform limit of rational functions, and hence one can define special values on…
We present a complete algorithm that computes all hypergeometric solutions of homogeneous linear difference equations and rational solutions of parameterized linear difference equations in the setting of $\Pi\Sigma^*$-fields. More…
A computation method of algebraic local cohomology with parameters, associated with zero-dimensional ideal with parameter, is introduced. This computation method gives us in particular a decomposition of the parameter space depending on the…
Geometric modeling by constraints leads to large systems of algebraic equations. This paper studies bipartite graphs underlaid by systems of equations. It shows how these graphs make possible to polynomially decompose these systems into…
In this paper we present algorithms that compute certain local cohomology modules associated to a ring of polynomials containing the rational numbers. In particular we are able to compute the local cohomological dimension of algebraic…