Related papers: Numerical Implicitization
We introduce a Macaulay2 package for working with jet schemes. The main method constructs jets of ideals, polynomial rings and their quotients, ring homomorphisms, affine varieties, and (hyper)graphs. The package also includes additional…
We describe algorithms for computing geometric invariants for Hilbert modular surfaces, and we report on their implementation.
We present new, practical algorithms for the hypersurface implicitization problem: namely, given a parametric description (in terms of polynomials or rational functions) of the hypersurface, find its implicit equation. Two of them are for…
We present twelve numerical methods for evaluation of objects and concepts from Poisson geometry. We describe how each method works with examples, and explain how it is executed in code. These include methods that evaluate Hamiltonian and…
The toric Hilbert scheme parametrizes all algebras isomorphic to a given semigroup algebra as a multigraded vectorspace. All components of the scheme are toric varieties, and among them, there is a fairly well understood coherent component.…
We introduce the MatrixSchubert package for the computer algebra system Macaulay2. This package has tools to construct and study matrix Schubert varieties and alternating sign matrix (ASM) varieties. The package also introduces tools for…
We describe the package "IncidenceCorrespondenceCohomology" for the computer algebra system Macaulay2. The main feature concerns the computation of characters and dimensions for the cohomology groups of line bundles on the incidence…
Polynomial factorization in conventional sense is an ill-posed problem due to its discontinuity with respect to coefficient perturbations, making it a challenge for numerical computation using empirical data. As a regularization, this paper…
We apply tropical geometry to study the image of a map defined by Laurent polynomials with generic coefficients. If this image is a hypersurface then our approach gives a construction of its Newton polytope.
We present different methods for symbolic computer algebra computations in higher dimensional (\ge9) Clifford algebras using the \Clifford\ and \Bigebra\ packages for \Maple(R). This is achieved using graded tensor decompositions,…
Graph polynomials encode fundamental combinatorial invariants of graphs. Their computation is investigated using tree and path decomposition frameworks, with formal definitions of treewidth, k-trees, and pathwidth establishing the…
We present {\tt RandomPoints}, a package in \emph{Macaulay2} designed mainly to identify rational and geometric points in a variety over a finite field. We provide tools to estimate the dimension of a variety. We also present methods to…
We compute the factorization homology of a polynomial algebra over a compact and closed manifold with trivialized tangent bundle up to weak equivalence in a new way. This calculation is based on the model of a graph complex and an explicit…
We investigate the representation of symmetric polynomials as a sum of squares. Since this task is solved using semidefinite programming tools we explore the geometric, algebraic, and computational implications of the presence of discrete…
The Hilbert-Kunz multiplicity and $F$-signature are important invariants for researchers in commutative algebra and algebraic geometry. We provide software, and describe the automation of a calculation, for the two invariants in the case of…
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 present the Julia package HomotopyContinuation.jl, which provides an algorithmic framework for solving polynomial systems by numerical homotopy continuation. We introduce the basic capabilities of the package and demonstrate the software…
In this work, our aim is to obtain conditions to assure polynomial approximation in Hilbert spaces $L^{2}(\mu)$, with $\mu$ a compactly supported measure in the complex plane, in terms of properties of the associated moment matrix to the…
We offer a Maple package {\tt Poincare\_Series} for calculating the Poincar\'e series for the algebras of invariants/covariants of binary forms, for the algebras of joint invariants/covariants of several binary forms, for the kernel of…
In this paper, we focus on computing the kernel of a map of polynomial rings $\varphi$. This core problem in symbolic computation is known as implicitization. While there are extremely effective Gr\"obner basis methods used to solve this…