Related papers: Computable Hilbert Schemes
We present new, practical algorithms for the hypersurface implicitization problem: namely, given a parametric description (in terms of polynomials or rational functions) of the hypersurface, find its implicit equation. Two of them are for…
We present a unified theoretical framework for parametric low-rank approximation, a research area devoted to the development of efficient algorithms that act as adaptive alternatives of traditional methods such as Singular Value…
We propose a decentralized online learning algorithm for distributed random inverse problems over network graphs with online measurements, and unifies the distributed parameter estimation in Hilbert spaces and the least mean square problem…
In the framework of inverse linear problems on infinite-dimensional Hilbert space, we prove the convergence of the conjugate gradient iterates to an exact solution to the inverse problem in the most general case where the self-adjoint,…
Algorithms for embedding certain types of nilpotent subalgebras in maximal subalgebras of the same type are developed, using methods of real algebraic groups. These algorithms are applied to determine non-conjugate subalgebras of the…
Reproducing kernel Hilbert spaces are elucidated without assuming prior familiarity with Hilbert spaces. Compared with extant pedagogic material, greater care is placed on motivating the definition of reproducing kernel Hilbert spaces and…
A symmetric ideal is an ideal in a polynomial ring which is stable under all permutations of the variables. In this paper we initiate a global study of zero-dimensional symmetric ideals. By this we mean a geometric study of the invariant…
In this paper, we introduce a system of split variational inequality problems in real Hilbert spaces. Using projection method, we propose an iterative algorithm for the system of split variational inequality problems. Further, we prove that…
Hierarchical decision making problems, such as bilevel programs and Stackelberg games, are attracting increasing interest in both the engineering and machine learning communities. Yet, existing solution methods lack either convergence…
Distributed algorithms for solving coupled semidefinite programs (SDPs) commonly require many iterations to converge. They also put high computational demand on the computational agents. In this paper we show that in case the coupled…
The split common fixed-point problem is an inverse problem that consists in finding an element in a fixed-point set such that its image under a bounded linear operator belongs to another fixed-point set. Recently Censor and Segal proposed…
In this paper we investigate and compare different gradient algorithms designed for the domain expression of the shape derivative. Our main focus is to examine the usefulness of kernel reproducing Hilbert spaces for PDE constrained shape…
Given an ideal $I$ and a weight vector $w$ which partially orders monomials we can consider the initial ideal $\init_w (I)$ which has the same Hilbert function. A well known construction carries this out via a one-parameter subgroup of a…
Let H be a graph, and let C_H(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating C_H(G). Previous results cover only a few specific instances of this general…
Much recent work has addressed the solution of a family of partial differential equations by computing the inverse operator map between the input and solution space. Toward this end, we incorporate function-valued reproducing kernel Hilbert…
In this paper, we propose methods for computing the Hilbert series of multigraded right modules over the free associative algebra. In particular, we compute such series for noncommutative multigraded algebras. Using results from the theory…
In order to determine the Hilbert function of the ideal of a fat point subscheme of projective space, we show that it is enough to determine, both for the subscheme itself and the subschemes obtained from it by successively adjoining to it…
In earlier work we have studied a method for discretization in time of a parabolic problem which consists in representing the exact solution as an integral in the complex plane and then applying a quadrature formula to this integral. In…
We study Hilbert functions of certain non-reduced schemes A supported at finite sets of points in projective space, in particular, fat point schemes. We give combinatorially defined upper and lower bounds for the Hilbert function of A using…
This work introduces a novel algorithm for finding the connected components of a graph where the vertices and edges are grouped into sets defining a Set--Based Graph. The algorithm, under certain restrictions on those sets, has the…