Related papers: Computable Hilbert Schemes
Matrices are typically considered over fields or rings. Motivated by applications in parametric differential equations and data-driven modeling, we suggest to study matrices with entries from a Hilbert space and present an elementary theory…
The toric Hilbert scheme is a parameter space for all ideals with the same multi-graded Hilbert function as a given toric ideal. Unlike the classical Hilbert scheme, it is unknown whether toric Hilbert schemes are connected. We construct a…
We study the decompositions of Hilbert schemes induced by the Schubert cell decomposition of the Grassmannian variety and show that Hilbert schemes admit a stratification into locally closed subschemes along which the generic initial ideals…
We consider the problem of approximating a given element $f$ from a Hilbert space $\mathcal{H}$ by means of greedy algorithms and the application of such procedures to the regression problem in statistical learning theory. We improve on the…
The Hilbert scheme $\mathbf{Hilb}_{p(t)}^{n}$ parametrizes closed subschemes and families of closed subschemes in the projective space $\mathbb{P}^n$ with a fixed Hilbert polynomial $p(t)$. It is classically realized as a closed subscheme…
We give a notion of "combinatorial proximity" among strongly stable ideals in a given polynomial ring with a fixed Hilbert polynomial. We show that this notion guarantees "geometric proximity" of the corresponding points in the Hilbert…
The present paper investigates properties of quasi-stable ideals and of Borel-fixed ideals in a polynomial ring $k[x_0,\dots,x_n]$, in order to design two algorithms: the first one takes as input $n$ and an admissible Hilbert polynomial…
In this thesis we consider the geometry of the Hilbert scheme of points in P^n, concentrating on the locus of points corresponding to the Gorenstein subschemes of P^n. New results are given, most importantly we provide tools for…
We present quadrature schemes to calculate matrices, where the so-called modified Hilbert transformation is involved. These matrices occur as temporal parts of Galerkin finite element discretizations of parabolic or hyperbolic problems when…
Border basis schemes are open subschemes of Hilbert schemes parametrizing 0-dimensional subschemes of $\mathbb{P}^n$ of given length. They yield open coverings and are easy to describe and to compute with. Our topic is to find re-embeddings…
Sparse polynomial approximation has become indispensable for approximating smooth, high- or infinite-dimensional functions from limited samples. This is a key task in computational science and engineering, e.g., surrogate modelling in…
We compute the completion of the local ring of the Hilbert scheme of degree $n+1$ subschemes of $\mathbb{A}^n$ at the point corresponding to the ideal $\langle x_1,\ldots,x_n\rangle^2$, and describe the completion of the universal family.…
Hilbert schemes of suitable smooth, projective 3-fold scrolls over the Hirzebruch surface F_e, with e > 1, are studied. An irreducible component of the Hilbert scheme parametrizing such varieties is shown to be generically smooth of the…
We consider the multigraded Hilbert scheme corresponding to the Hilbert function of a finite number of points in general position in a smooth projective complex toric variety. We develop several criteria for a point of that parameter space…
We investigate the Hilbert scheme of points on a smooth threefold. We introduce a notion of broken Gorenstein structure for finite schemes, and show that its existence guarantees smoothness on the Hilbert scheme. Moreover, we conjecture…
In this paper we deal with the connection of frames with the class of Hilbert Schmidt operators. First we give an easy criteria for operators being in this class using frames. It is the equivalent to the criteria using orthonormal bases.…
We introduce a new class of "filtered" schemes for some first order non-linear Hamilton-Jacobi-Bellman equations. The work follows recent ideas of Froese and Oberman (SIAM J. Numer. Anal., Vol 51, pp.423-444, 2013). The proposed schemes are…
In this article we study the possibilities of recovering the structure of port-Hamiltonian systems starting from ``unlabelled'' ordinary differential equations describing mechanical systems. The algorithm we suggest solves the problem in…
The proximal point algorithm is a widely used tool for solving a variety of convex optimization problems such as finding zeros of maximally monotone operators, fixed points of nonexpansive mappings, as well as minimizing convex functions.…
The automation of posterior inference in Bayesian data analysis has enabled experts and nonexperts alike to use more sophisticated models, engage in faster exploratory modeling and analysis, and ensure experimental reproducibility. However,…