Related papers: Comprehensive Restriction Algorithm for Hypergeome…
The Apagodu-Zeilberger algorithm can be used for computing annihilating operators for definite sums over hypergeometric terms, or for definite integrals over hyperexponential functions. In this paper, we propose a generalization of this…
Nonholonomic mechanical systems have been attracting more interest in recent years because of their rich geometric properties and their applications in Engineering. In all generality, we discuss the reduction of a Hamilton-Jacobi theory for…
A solution to the effectiveness problem in Kohn's algorithm for generating subelliptic multipliers is provided for domains that include those given by sums of squares of holomorphic functions (also including infinite sums). These domains…
We present a deterministic polynomial-time algorithm for estimating the volume of a hypercube intersected by a fixed number of constraints of the type $f(x) \leq b$, where $f$ is the sum of univariate functions that are each nonnegative,…
Computing an optimal cycle in a given homology class, also referred to as the homology localization problem, is known to be an NP-hard problem in general. Furthermore, there is currently no known optimality criterion that localizes classes…
Higher-order numerical methods are used to find accurate numerical solutions to hyperbolic partial differential equations and equations of transport type. Limiting is required to either converge to the correct type of solution or to adhere…
A method for computing the multigraded Hilbert depth of a module was presented in [16]. In this paper we improve the method and we introduce an effective algorithm for performing the computations. In a particular case, the algorithm may…
We compute the anomalies of the topological A and B models with target space geometry of Hitchin's generalized type. The dimension of the moduli space of generalized holomorphic maps is also computed, which turns out to be equal to the…
We compute the characters of the simple GL-equivariant holonomic D-modules on the vector spaces of general, symmetric and skew-symmetric matrices. We realize some of these D-modules explicitly as subquotients in the pole order filtration…
We present a complexity reduction algorithm for a family of parameter-dependent linear systems when the system parameters belong to a compact semi-algebraic set. This algorithm potentially describes the underlying dynamical system with…
We study the irregularity of hypergeometric D-modules $\mathcal{M}_A (\beta )$ via the explicit construction of Gevrey series solutions along coordinate subspaces in $X =\mathbb{C}^n$. As a consequence, we prove that along coordinate…
A class of generalized conditional gradient algorithms for the solution of optimization problem in spaces of Radon measures is presented. The method iteratively inserts additional Dirac-delta functions and optimizes the corresponding…
Based on the recent progress in the irregular Riemann-Hilbert correspondence for holonomic D-modules, we show that the characteristic cycles of some standard irregular holonomic D-modules can be expressed as in the classical theorem of…
Geometric and holonomic quantum computation utilizes intrinsic geometric properties of quantum-mechanical state spaces to realize quantum logic gates. Since both geometric phases and quantum holonomies are global quantities depending only…
Symmetric submodular maximization is an important class of combinatorial optimization problems, including MAX-CUT on graphs and hyper-graphs. The state-of-the-art algorithm for the problem over general constraints has an approximation ratio…
Let $H$ be a real Hilbert space. In this short note, using some of the properties of bounded linear operators with closed range defined on $H$, certain bounds for a specific convex subset of the solution set of infinite linear…
A new and conceptually simple procedure is derived for the compu- tation of the maximal reachability submodule of a given submodule of the state space of a linear discrete time system over a Noethenian ring R. The procedure is effective if…
$\renewcommand{\Re}{\mathbb{R}}$ We develop a general randomized technique for solving "implic it" linear programming problems, where the collection of constraints are defined implicitly by an underlying ground set of elements. In many…
We propose an algorithm for solving bound-constrained mathematical programs with complementarity constraints on the variables. Each iteration of the algorithm involves solving a linear program with complementarity constraints in order to…
We present a space-efficient algorithm to compute the Hilbert class polynomial H_D(X) modulo a positive integer P, based on an explicit form of the Chinese Remainder Theorem. Under the Generalized Riemann Hypothesis, the algorithm uses…