Related papers: The Rees Algebra Package in Macaulay2
This preprint contains a description of a package for Mathematica called EinS. This package allows one to perform various calculations with indexed objects.
Our main purpose is to give multiple examples for using the available implementations for computing the normalization of an affine ring, computing the minimial generators of the normalization as an algebra over the original ring and…
The Lie algebras over the algebra of dual numbers are introduced and investigated.
In this paper we present some results showing the good behavior of the $\tau$-invariant of a Rees algebra with integral closure and elimination (of variables).
Treating a realistic problem in any field of reaction kinetics raises a series of problems: we review these illustrated with examples using ReactionKinetics, a Mathematica based package.
We introduce and study vertex cover algebras of weighted simplicial complexes. These algebras are special classes of symbolic Rees algebras. We show that symbolic Rees algebras of monomial ideals are finitely generated and that such an…
The capability of R to do symbolic mathematics is enhanced by the caracas package. This package uses the Python computer algebra library SymPy as a back-end but caracas is tightly integrated in the R environment, thereby enabling the R user…
This is the second installment of an exposition of an ACL2 formalization of elementary linear algebra. It extends the results of Part I, which covers the algebra of matrices over a commutative ring, but focuses on aspects of the theory that…
In this paper, we estimate the Hilbert-Kunz multiplicity of the (extended) Rees algebras in terms of some invariants of the base ring. Also, we give an explicit formula for the Hilbert-Kunz multiplicities of Rees algebras over Veronese…
We study almost complete intersections ideals whose Rees algebras are extremal in the sense that some of their fundamental metrics---depth or relation type---have maximal or minimal values in the class. The focus is on those ideals that…
We present the $\textit{NumericalImplicitization}$ package for $\textit{Macaulay2}$, which allows for user-friendly computation of the invariants of the image of a polynomial map, such as dimension, degree, and Hilbert function values. This…
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 introduce a new Macaulay 2 package, SimplicialDecomposability, which works in conjunction with the extant package SimplicialComplexes in order to compute a shelling order, if one exists, of a specified simplicial complex. Further,…
Consider a grade 2 perfect ideal $I$ in $R=k[x_1,\cdots,x_d]$ which is generated by forms of the same degree. Assume that the presentation matrix $\varphi$ is almost linear, that is, all but the last column of $\varphi$ consist of entries…
The NumericalHilbert package for Macaulay2 includes algorithms for computing local dual spaces of polynomial ideals, and related local combinatorial data about its scheme structure. These techniques are numerically stable, and can be used…
The MultiplicitySequence package for Macaulay2 computes the multiplicity sequence of a graded ideal in a standard graded ring over a field, as well as several invariants of monomial ideals related to integral dependence. We discuss two…
The purpose of the present paper is to investigate cohomologies of Reynolds Lie-Yamaguti algebras of any weight and provide some applications. First, we introduce the notion of Reynolds Lie-Yamaguti algebras and give some new examples.…
We compute a minimal bigraded resolution of the Rees Algebra associated to a proper rational parametrization of a monomial plane curve. We describe explicitly both the bigraded Betti numbers and the maps of the resolution in terms of a…
This paper is a short survey about some properties of algebras ob- tained by the Cayley-Dickson process and some of their applications.
Solving a system of polynomial equations is a ubiquitous problem in the applications of mathematics. Until recently, it has been hopeless to find explicit solutions to such systems, and mathematics has instead developed deep and powerful…