Related papers: Computable Hilbert Schemes
$\renewcommand{\Re}{\mathbb{R}}$ We develop a general randomized technique for solving "implic it" linear programming problems, where the collection of constraints are defined implicitly by an underlying ground set of elements. In many…
HHL algorithm \cite{harrow} to solve linear system is a powerful and efficient quantum technique to deal with many matrix operations (such as matrix multiplication, powers and inversion). It inspires many applications in quantum machine…
Starting with a similarity function between objects, it is possible to define a distance metric on pairs of objects, and more generally on probability distributions over them. These distance metrics have a deep basis in functional analysis,…
In this paper, we present a distributed algorithm for solving convex, constraint-coupled, optimization problems over peer-to-peer networks. We consider a network of processors that aim to cooperatively minimize the sum of local cost…
Modern deep learning architectures increasingly contend with sophisticated signals that are natively infinite-dimensional, such as time series, probability distributions, or operators, and are defined over irregular domains. Yet, a unified…
Traditional machine learning models, particularly neural networks, are rooted in finite-dimensional parameter spaces and nonlinear function approximations. This report explores an alternative formulation where learning tasks are expressed…
We propose an adaptive iteratively linearized finite element method (AILFEM) in the context of strongly monotone nonlinear operators in Hilbert spaces. The approach combines adaptive mesh-refinement with an energy-contractive linearization…
The main topic of the paper is the construction of various explicit flat families of border bases. To begin with, we cover the punctual Hilbert scheme Hilb^\mu(A^n) by border basis schemes and work out the base changes. This enables us to…
Sphere packing, Hilbert's eighteenth problem, asks for the densest arrangement of congruent spheres in n-dimensional Euclidean space. Although relevant to areas such as cryptography, crystallography, and medical imaging, the problem remains…
Let $k$ be a commutative ring and $S=k[x_0, \ldots, x_n]$ be a polynomial ring over $k$ with a monomial order. For any monomial ideal $J$, there exists an affine $k$-scheme of finite type, called Gr\"obner scheme, which parameterizes all…
Hilbert's program was an ambitious and wide-ranging project in the philosophy and foundations of mathematics. In order to "dispose of the foundational questions in mathematics once and for all, "Hilbert proposed a two-pronged approach in…
Let $\mathcal{H}_{d,g,r}$ be the Hilbert scheme parametrizing smooth irreducible and non-degenerate curves of degree $d$ and genus $g$ in $\PP^r$. We denote by $\mathcal{H}^\mathcal{L}_{d,g,r}$ the union of those components of…
In this paper, we present an efficient algorithm for solving a class of chance constrained optimization under non-parametric uncertainty. Our algorithm is built on the possibility of representing arbitrary distributions as functions in…
In this paper, we investigate the relationship between the Hilbert functions and the associated properties of the graded modules. To attain this, we construct the graded modules from the sets of points in projective space, $\mathbb{P}_k^n$…
The multigraded Hilbert scheme parametrizes all homogeneous ideals in a polynomial ring graded by an abelian group with a fixed Hilbert function. We prove that any multigraded Hilbert scheme is smooth and irreducible when the polynomial…
We present an extension of the projection method proposed by Challis et al. (Int J Solids Struct 45(14$\unicode{x2013}$15):4130$\unicode{x2013}$4146, 2008) for constrained level set-based topology optimisation that harnesses the Hilbertian…
Our main goal is to track down an algebraic basis of Hilbert space $\ell^2$ which is a connected and locally connected subset of the unit sphere.
We consider the problem of learning a low-rank matrix, constrained to lie in a linear subspace, and introduce a novel factorization for modeling such matrices. A salient feature of the proposed factorization scheme is it decouples the…
We denote by $\mathcal{H}_{d,g,r}$ the Hilbert scheme of smooth curves, which is the union of components whose general point corresponds to a smooth irreducible and non-degenerate curve of degree $d$ and genus $g$ in $\mathbb{P}^r$. In this…
This paper proposes a new algorithm for simultaneous graph matching and clustering. For the first time in the literature, these two problems are solved jointly and synergetically without relying on any training data, which brings advantages…