Related papers: Numerical Hilbert functions for Macaulay2

Designing scalable estimation algorithms is a core challenge in modern statistics. Here we introduce a framework to address this challenge based on parallel approximants, which yields estimators with provable properties that operate on the…

In a local Cohen-Macaulay ring $(A, \mathrm{m})$, we study the Hilbert function of an $\mathrm{m}$-primary ideal $I$ whose reduction number is two. It is a continuous work of the papers of Huneke, Ooishi, Sally, and Goto-Nishida-Ozeki. With…

We describe an algorithm for computing parameter-test-ideals in certain local Cohen-Macaulay rings. The algorithm is based on the study of a Frobenius map on the injective hull of the residue field of the ring and on the application of…

Using Macaulay's correspondence we study the family of Artinian Gorenstein local algebras with fixed symmetric Hilbert function decomposition. As an application we give a new lower bound for cactus varieties of the third Veronese embedding.…

This note describes a Macaulay2 package for handling divisors. Group operations for divisors are included. There are methods for converting divisors to reflexive or invertible sheaves. Additionally, there are methods for checking whether…

We study the question of whether there is a minimum Hilbert functions for double point schemes whose support is $s$ points with the generic Hilbert functions. Previous work shows that the question has an affirmative answer for $s \le 9$ and…

Punctual noncommutative Hilbert schemes are projective varieties parametrizing finite codimensional left ideals in noncommutative formal power series rings. We determine their motives and intersection cohomology, by constructing affine…

In this paper, we characterize Probabilistic Principal Component Analysis in Hilbert spaces and demonstrate how the optimal solution admits a representation in dual space. This allows us to develop a generative framework for kernel methods.…

We obtain a functional model for an arbitrary Abelian locally von Neumann algebra acting on a representing locally Hilbert space under the assumption that the index directed set is countable, in terms of locally essentially bounded…

The Hilbert series of local cohomologies for monomial ideals, which are not necessarily square-free, is established. As applications, we give a sharp lower bound of the non-vanishing degree of local cohomologies and also a sharp lower bound…

In this paper, a novel parallel hybrid iterative method is proposed for finding a common element of the set of solutions of a system of equilibrium problems, the set of solutions of variational inequalities for inverse strongly monotone…

We construct Monte Carlo methods for the $L^2$-approximation in Hilbert spaces of multivariate functions sampling no more than $n$ function values of the target function. Their errors catch up with the rate of convergence and the…

Many authors have studied the numerical computation of conformal mappings (numerical conformal mapping), and there are nowadays several efficient numerical schemes. Among them, Amano's method offers a straightforward numerical procedure for…

Let I be a homogeneous ideal in a polynomial ring P over a field. By Macaulay's Theorem, there exists a lexicographic ideal L=Lex(I) with the same Hilbert function as I. Peeva has proved that the Betti numbers of P/I can be obtained from…

The Bernstein-Sato polynomial (or global b-function) is an important invariant in singularity theory, which can be computed using symbolic methods in the theory of D-modules. After surveying algorithms for computing the global b-function,…

Numerical experiments with smooth surface extension and image inpainting using harmonic and biharmonic functions are carried out. The boundary data used for constructing biharmonic functions are the values of the Laplacian and normal…

We provide algorithms for symbolic integration of hyperlogarithms multiplied by rational functions, which also include multiple polylogarithms when their arguments are rational functions. These algorithms are implemented in Maple and we…

In this Macaulay2 \cite{M2} package we define an object called {\it linear code}. We implement functions that compute basic parameters and objects associated with a linear code, such as generator and parity check matrices, the dual code,…

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…

We develop the Littlewood-Richardson homotopy algorithm, which uses numerical continuation to compute solutions to Schubert problems on Grassmannians and is based on the geometric Littlewood-Richardson rule. One key ingredient of this…