Related papers: Numerical Hilbert functions for Macaulay2
We introduce the notion of Local Computation Mechanism Design - designing game theoretic mechanisms which run in polylogarithmic time and space. Local computation mechanisms reply to each query in polylogarithmic time and space, and the…
Conjectures for the Hilbert function of the m-th symbolic power of the ideal of n general points of P2 are verified for infinitely many m for each square n > 9, using an approach developed by the authors in a previous paper. In those cases…
Computations over the rational numbers often encounter the problem of intermediate coefficient growth. A solution to this is provided by modular methods, which apply the algorithm under consideration modulo a number of primes and then lift…
It remains an open problem to classify the Hilbert functions of double points in $\mathbb{P}^2$. Given a valid Hilbert function $H$ of a zero-dimensional scheme in $\mathbb{P}^2$, we show how to construct a set of fat points $Z \subseteq…
In this paper, we examine a number of additive and multiplicative multilevel iterative methods and preconditioners in the setting of two-dimensional local mesh refinement. While standard multilevel methods are effective for uniform…
An accurate method to compute enclosures of Abelian integrals is developed. This allows for an accurate description of the phase portraits of planar polynomial systems that are perturbations of Hamiltonian systems. As an example, it is…
The Hilbert scheme of $n$ points in the affine plane contains the open subscheme parametrizing $n$ distinct points in the affine plane, and the closed subscheme parametrizing ideals of codimension $n$ supported at the origin of the affine…
We give a new method for the evaluation of a class of integrals of rational symmetric functions in N pairs of variables {x_a, y_a}_{a=1,... N} arising in coupled matrix models, valid for a broad class of two-variable measures. The result is…
We develop a validated numerical procedure for continuation of local stable/unstable manifold patches attached to equilibrium solutions of ordinary differential equations. The procedure has two steps. First we compute an accurate high order…
We report on a package of routines for the computer algebra system Maple which supports the explicit determination of the geometric quantities, field equations, equations of motion, and conserved quantities of General Relativity in the…
In this article, we discuss the numerical solution of Boolean polynomial programs by algorithms borrowing from numerical methods for differential equations, namely the Houbolt scheme, the Lie scheme, and a Runge-Kutta scheme. We first…
For solving linear ill-posed problems regularization methods are required when the right hand side is with some noise. In the present paper regularized solutions are obtained by implicit iteration methods in Hilbert scales. % By exploiting…
With the exception of q-hypergeometric summation, the use of computer algebra packages implementing Zeilberger's "holonomic systems approach" in a broader mathematical sense is less common in the field of q-series and basic hypergeometric…
There are three main types of numerical computations for the Bessel function of the second kind: series expansion, continued fraction, and asymptotic expansion. In addition, they are combined in the appropriate domain for each. However,…
New numerical algorithms based on rational functions are introduced that can solve certain Laplace and Helmholtz problems on two-dimensional domains with corners faster and more accurately than the standard methods of finite elements and…
By making use of some techniques based upon certain inverse new pairs of symbolic operators, the author investigate several decomposition formulas associated with Humbert hypergeometric functions $\Phi_1 $, $\Phi_2 $, $\Phi_3 $, $\Psi_1 $,…
The computation of Kronecker coefficients is a challenging problem with a variety of applications. In this paper we present an approach based on methods from symplectic geometry and residue calculus. We outline a general algorithm for the…
In this paper we study Hilbert functions and isomorphism classes of Artinian level local algebras via Macaulay's inverse system. Upper and lower bounds concerning numerical functions admissible for level algebras of fixed type and socle…
Bounds for the Castelnuovo-Mumford regularity and Hilbert coefficients are given in terms of the arithmetic degree (if the ring is reduced) or in terms of the defining degrees. From this it follows that there exists only a finite number of…
For families of Hamiltonians defined by parts that are local, the most general definition of a symmetry algebra is the commutant algebra, i.e., the algebra of operators that commute with each local part. Thinking about symmetry algebras as…