Related papers: Comprehensive Restriction Algorithm for Hypergeome…
We study the parameterized complexity of the following fundamental geometric problems with respect to the dimension $d$: i) Given $n$ points in $\Rd$, compute their minimum enclosing cylinder. ii) Given two $n$-point sets in $\Rd$, decide…
Multidimensional persistence has been proposed to study the persistence of topological features in data indexed by multiple parameters. In this work, we further explore its algebraic complications from the point of view of higher…
We study the numerical approximation of a coupled hyperbolic-parabolic system by a family of discontinuous Galerkin space-time finite element methods. The model is rewritten as a first-order evolutionary problem that is treated by the…
A natural and important generalization of submodularity -- $k$-submodularity -- applies to set functions with $k$ arguments and appears in a broad range of applications, such as infrastructure design, machine learning, and healthcare. In…
We give a new complexity bound for calculating the complex dimension of an algebraic set. Our algorithm is completely deterministic and approaches the best recent randomized complexity bounds. We also present some new, significantly sharper…
In this article, we consider a counting problem for orbits of hyperbolic rational maps on the Riemann sphere, where constraints are placed on the multipliers of orbits. Using arguments from work of Dolgopyat, we consider varying and…
We give a bijection between a quotient space of the parameters and the space of moments for any $A$-hypergeometric distribution. An algorithmic method to compute the inverse image of the map is proposed utilizing the holonomic gradient…
We develop a dimension theory for coadmissible D-cap-modules on rigid analytic spaces and study those which are of minimal dimension, in analogy to the theory of holonomic D-modules in the algebraic setting. We discuss a number of…
Hyperbolic programming is the problem of computing the infimum of a linear function when restricted to the hyperbolicity cone of a hyperbolic polynomial, a generalization of semidefinite programming. We propose an approach based on symbolic…
A finite dimensional system with a quadratic Hamiltonian constraint is Dirac quantized in holomorphic, antiholomorphic and mixed representations. A unique inner product is found by imposing Hermitian conjugacy relations on an operator…
We calculate the decomposition series of the D-module defined as the push-forward of a rank one linear system on the complement of a normal crossings hyperplane configuration and use data of a resolution of singularities to give a…
The geometric formulation of Hamilton--Jacobi theory for systems with nonholonomic constraints is developed, following the ideas of the authors in previous papers. The relation between the solutions of the Hamilton--Jacobi problem with the…
In this paper, we propose the first exact algorithm for minimizing the difference of two submodular functions (D.S.), i.e., the discrete version of the D.C. programming problem. The developed algorithm is a branch-and-bound-based algorithm…
Topological mapping of a large physical system on a graph, and its decomposition using universal measures is proposed. We find inherent limits to the potential for optimization of a given system and its approximate representations by…
We give new polynomial lower bounds for a number of dynamic measure problems in computational geometry. These lower bounds hold in the Word-RAM model, conditioned on the hardness of either 3SUM, APSP, or the Online Matrix-Vector…
In algebraic geometry, one studies the solutions to polynomial equations, or, equivalently, to linear partial differential equations with constant coefficients. These lecture notes address the more general case when the coefficients are…
Hyperbolic spaces have been quite popular in the recent past for representing hierarchically organized data. Further, several classification algorithms for data in these spaces have been proposed in the literature. These algorithms mainly…
Leveraging a general framework adapted from symbolic integration, a unified reduction-based algorithm for computing telescopers of minimal order for hypergeometric and q-hypergeometric terms has been recently developed. In this paper, we…
Let Q be an affine semigroup generating Z^d, and fix a finitely generated Z^d-graded module M over the semigroup algebra k[Q] for a field k. We provide an algorithm to compute a minimal Z^d-graded injective resolution of M up to any desired…
In this paper we deal with the restricted Block Relocation Problem. We present a new lower bound and a heuristic approach for the problem. The proposed lower bound can be computed in polynomial time and it is provably better than some…