Related papers: Computable Hilbert Schemes
We study the Hilbert scheme of smooth, irreducible, non-degenerate and linearly normal curves of degree $d$ and genus $g$ in $\mathbb{P}^r$ ($r\ge 3$) whose complete and very ample hyperplane linear series $\mathcal{D}$ have relatively…
Classifying points in high dimensional spaces is a fundamental geometric problem in machine learning. In this paper, we address classifying points in the $d$-dimensional Hilbert polygonal metric. The Hilbert metric is a generalization of…
Censor-Hillel et al. [PODC'15] recently showed how to efficiently implement centralized algebraic algorithms for matrix multiplication in the congested clique model, a model of distributed computing that has received increasing attention in…
Closed subschemes in projective space with a fixed Hilbert polynomial are parametrized by a Hilbert scheme. We classify the smooth ones. We identify numerical conditions on a polynomial that completely determine when the Hilbert scheme is…
This paper concerns models and convergence principles for dealing with stochasticity in a wide range of algorithms arising in nonlinear analysis and optimization in Hilbert spaces. It proposes a flexible geometric framework within which…
This work is devoted to establish the strong convergence results of an iterative algorithm generated by the shrinking projection method in Hilbert spaces. The proposed approximation sequence is used to find a common element in the set of…
This work is related to PHG (Parallel Hierarchical Grid). PHG is a toolbox for developing parallel adaptive finite element programs, which is under active development at the State Key Laboratory of Scientific and Engineering Computing. The…
Hilbert schemes of suitable smooth, projective manifolds of low degree which are 3-fold scrolls over the Hirzebruch surface F_1 are studied. An irreducible component of the Hilbert scheme parametrizing such varieties is shown to be…
The problem of the minimization of least squares functionals with $\ell^1$ penalties is considered in an infinite dimensional Hilbert space setting. While there are several algorithms available in the finite dimensional setting there are…
Border bases can be considered to be the natural extension of Gr\"obner bases that have several advantages. Unfortunately, to date the classical border basis algorithm relies on (degree-compatible) term orderings and implicitly on reduced…
Reverse mathematics studies which subsystems of second order arithmetic are equivalent to key theorems of ordinary, non-set-theoretic mathematics. The main philosophical application of reverse mathematics proposed thus far is foundational…
This note is devoted to the study of the links between the Hilbert function of a subscheme X of the projective space, and its geometric properties. We will assume that X is arithmetically Cohen-Macaulay, which allows us to characterize its…
Denoting $\mathcal{H}_{d,g,5}$ by the Hilbert scheme of smooth curves of degree $d$ and genus $g$ in $\mathbb{P}^5$, let $\mathcal{H}$ be an irreducible component of $\mathcal{H}_{d,g,5}$. We study the Hilbert function…
The present review presents the authors previous results on the topic from the title in a new light. Most of the previous results were obtained using the techniques of antilinear Hilbert-Schmidt mappings of one Hilbert pace into another,…
These notes aim at providing a complete and systematic account of some foundational aspects of algebraic supergeometry, namely, the extension to the geometry of superschemes of many classical notions, techniques and results that make up the…
There are several remarks on Hilbert series of finitely presented (f. p.) associative algebras over a field and their modules. First, given an integer $D$, the set of Hilbert series of right-sided ideals with generators and relations of…
We study the Hilbert scheme $\mathcal{H}^\mathcal{L}_{d,g,r}$ parametrizing smooth, irreducible, non-degenerate and linearly normal curves of degree $d$ and genus $g$ in $\mathbb{P}^r$ whose complete and very ample hyperplane linear series…
The performance of reproducing kernel Hilbert space-based methods is known to be sensitive to the choice of the reproducing kernel. Choosing an adequate reproducing kernel can be challenging and computationally demanding, especially in…
We study complexity measures on subsets of the boolean hypercube and exhibit connections between algebra (the Hilbert function) and combinatorics (VC theory). These connections yield results in both directions. Our main complexity-theoretic…
In this article, the reproducing kernel Hilbert space [0, 1] is employed for solving a class of third-order periodic boundary value problem by using fitted reproducing kernel algorithm. The reproducing kernel function is built to get fast…