Related papers: Numerical Hilbert functions for Macaulay2
A parallel splitting method is proposed for solving systems of coupled monotone inclusions in Hilbert spaces. Convergence is established for a wide class of coupling schemes. Unlike classical alternating algorithms, which are limited to two…
This note presents the multivariate Hermite criterion: a practical and powerful algorithm for determining the number of distinct real and complex roots of a zero-dimensional system of polynomials in any finite number of variables. The final…
We show that sampling or interpolation formulas in reproducing kernel Hilbert spaces can be obtained by reproducing kernels whose dual systems form molecules, ensuring that the size profile of a function is fully reflected by the size…
We extend the recent classification of Hilbert schemes with two Borel-fixed points to arbitrary characteristic. We accomplish this by synthesizing Reeves' algorithm for generating strongly stable ideals with the basic properties of…
In this PhD thesis we propose an algorithmic approach to the study of the Hilbert scheme. Developing algorithmic methods, we also obtain general results about Hilbert schemes. In Chapter 1 we discuss the equations defining the Hilbert…
We introduce the $\textit{Macaulay2}$ package $\texttt{OIGroebnerBases}$ for working with OI-modules over Noetherian polynomial OI-algebras. The main methods implement OI-analogues of Buchberger's algorithm and Schreyer's theorem to compute…
We introduce the Macaulay2 package BooleanGB, which computes a Gr\"obner basis for Boolean polynomials using a binary representation rather than symbolic. We compare the runtime of several Boolean models from systems in biology and give an…
We introduce the Macaulay2 package GradedLieAlgebras for doing computations in graded Lie algebras presented by generators and relations.
Recently Gouveia, Thomas and the authors introduced the slack realization space, a new model for the realization space of a polytope. It represents each polytope by its slack matrix, the matrix obtained by evaluating each facet inequality…
Let Hilb^p be the Hilbert scheme parametrizing the closed subschemes of P^n with Hilbert polynomial p\in Q[t] over a field K of characteristic zero. By bounding below the cohomological Hilbert functions of the points of Hilb^p we define…
We describe a recently revived version of the software package SubalgberaBases, which is distributed in the Macaulay2 computer algebra system. The package allows the user to compute and manipulate subagebra bases -- which are also known as…
A computation method of algebraic local cohomology with parameters, associated with zero-dimensional ideal with parameter, is introduced. This computation method gives us in particular a decomposition of the parameter space depending on the…
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…
In this article we show how to compute a matrix representation and the implicit equation by means of the method developed in [Botbol: arXiv:1007.3437], using the computer algebra system Macaulay2 \cite{M2}. As it is probably the most…
We consider the problem of symbolic-numeric integration of symbolic functions, focusing on rational functions. Using a hybrid method allows the stable yet efficient computation of symbolic antiderivatives while avoiding issues of…
We investigate the structure and properties of symmetric ideals generated by general forms in the polynomial ring under the natural action of the symmetric group. This work significantly broadens the framework established in our earlier…
In this paper we provide a description of the package \textit{PolyominoIdeals} for \textit{Macaulay2} that allows to deal with collections of cells, polyominoes and related binomial ideals.
By double ideal quotient, we mean $(I:(I:J))$ where ideals $I$ and $J$. In our previous work [11], double ideal quotient and its variants are shown to be very useful for checking prime divisor and generating primary component. Combining…
Given positive integers $m_1, m_2, ..., m_n$, and $n$ general points $p_i$ of ${\bf CP}^2$, bounds are given for the least degree $t$ among plane curves passing through each point $p_i$ with multiplicity at least $m_i$, and for the least…
The Mathieu functions are used to solve analytically some problems in elliptical cylinder coordinates. A computational toolbox was implemented in Matlab. Since the notation and normalization for Mathieu functions vary in the literature, we…