Related papers: Comprehensive Restriction Algorithm for Hypergeome…
We develop new approximation algorithms for classical graph and set problems in the RAM model under space constraints. As one of our main results, we devise an algorithm for d-Hitting Set that runs in time n^{O(d^2 + d/\epsilon})}, uses…
We determine the holonomy of generalized Killing spinor covariant derivatives of the form $D= \nabla + \Omega$ on pseudo-Riemannian reductive homogeneous spaces in a purely algebraic and algorithmic way, where $\Omega : TM \rightarrow…
We adapt the rectangular splitting technique of Paterson and Stockmeyer to the problem of evaluating terms in holonomic sequences that depend on a parameter. This approach allows computing the $n$-th term in a recurrent sequence of suitable…
We consider a class of maps from integral Hankel operators to Hankel matrices, which we call restriction maps. In the simplest case, such a map is simply a restriction of the integral kernel onto integers. More generally, it is given by an…
This paper deals with exploiting symmetry for solving linear and integer programming problems. Basic properties of linear representations of finite groups can be used to reduce symmetric linear programming to solving linear programs of…
A holonomic system of linear partial differential equations is, roughly speaking, a system whose solution space is finite dimensional. A distribution that is a solution of a holonomic system is called a holonomic distribution. We give…
We show that in $\text{O}(D)$ invariant matrix theories containing a large number $D$ of complex or Hermitian matrices, one can define a $D\rightarrow\infty$ limit for which the sum over planar diagrams truncates to a tractable, yet…
Submodularity is one of the most important property of combinatorial optimization, and $k$-submodularity is a generalization of submodularity. Maximization of $k$-submodular function is NP-hard, and approximation algorithms are studied. For…
We develop a $D-$module approach to various kinds of solutions to several classes of important differential equations by long divisions of different differential operators. The zeros of remainder maps of such long divisions are handled by…
We exhibit algorithms to compute systems of Hecke eigenvalues for spaces of Hilbert modular forms over a totally real field. We provide many explicit examples as well as applications to modularity and Galois representations.
We propose a deep learning algorithm for high dimensional optimal stopping problems. Our method is inspired by the penalty method for solving free boundary PDEs. Within our approach, the penalized PDE is approximated using the Deep BSDE…
Building on the blueprint from Goemans and Williamson (1995) for the Max-Cut problem, we construct a polynomial-time approximation algorithm for orthogonally constrained quadratic optimization problems. First, we derive a semidefinite…
We produce a decomposition of the parameter space of the $A$-hypergeometric system associated to a projective monomial curve as a union of an arrangement of lines and its complement, in such a way that the analytic behavior of the solutions…
We present algorithms to solve coupled systems of linear differential equations, arising in the calculation of massive Feynman diagrams with local operator insertions at 3-loop order, which do {\it not} request special choices of bases.…
Alon and F\"uredi (European J. Combin. 1993) gave a tight bound for the following hyperplane covering problem: find the minimum number of hyperplanes required to cover all points of the n-dimensional hypercube {0,1}^n except the origin.…
We conisder time-dependent Schr\"odinger systems, which are quantizations of the Hamiltonian systems obtained from a similarity reduction of the Drinfeld-Sokolov hierarchy by K. Fuji and T. Suzuki, and a similarity reduction of the UC…
We develop an approach to finding upper bounds for the number of arithmetic operations necessary for doing harmonic analysis on permutation modules of finite groups. The approach takes advantage of the intrinsic orbital structure of…
For a linear Hamming metric code of length n over a finite field, the number of distinct weights of its codewords is at most n. The codes achieving the equality in the above bound were called full weight spectrum codes. In this paper we…
Submodular maximization under various constraints is a fundamental problem studied continuously, in both computer science and operations research, since the late $1970$'s. A central technique in this field is to approximately optimize the…
We show that the properties of the lower part of the spectrum of the Helmholtz equation for an heterogeneous system in a finite region in $d$ dimensions, where the solutions to the homogeneous problems are known, can be systematically…