Related papers: Computations involving symbolic powers
Author presents a study of certain category of the integrals, which might look quite difficult to compute, but in fact are easily computable, because they do not depend on the parameter in the integrand. As simple and elementary the…
Cylindrical Algebraic Decomposition (CAD) has long been one of the most important algorithms within Symbolic Computation, as a tool to perform quantifier elimination in first order logic over the reals. More recently it is finding…
Ideals in the ring of power series in three variables can be classified based on algebra structures on their minimal free resolutions. The classification is incomplete in the sense that it remains open which algebra structures actually…
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,…
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.
Given distinct points $p_1,\cdots,p_r$ of the projective plane $P^2$ and a positive integer $m$, the homogeneous ideal defining the fat point subscheme $Z=m(p_1+\cdots+p_r)$ is the symbolic power $I^{(m)}$ of the homogeneous ideal $I$…
We introduce the Macaulay2 package SparseResultants, which provides general tools for computing sparse resultants, sparse discriminants, and hyperdeterminants. We give some background on the theory and briefly show how the package works.
A computation scheme for solving elliptic boundary value problems with axially symmetric confining potentials using different sets of one-parameter basis functions is presented. The efficiency of the proposed symbolic-numerical algorithms…
As a generalization of the ideals of star configurations of hypersurfaces, we consider the $a$-fold product ideal $I_a(f_1^{m_1}\cdots f_s^{m_s})$ when ${f_1,\dots,f_s}$ is a sequence of generic forms and $1\le a\le m_1+\cdots+m_s$.…
Macaulay Duality, between quotients of a polynomial ring over a field, annihilated by powers of the variables, and finitely generated submodules of the ring's graded dual, is generalized over any Noetherian ring, and used to provide…
Motivated by algorithmic problems from combinatorial group theory we study computational properties of integers equipped with binary operations +, -, z = x 2^y, z = x 2^{-y} (the former two are partial) and predicates < and =. Notice that…
We define Boolean algebras in the linear context and study its symmetric powers. We give explicit formulae for products in symmetric Boolean algebras of various dimensions. We formulate symmetric forms of the inclusion-exclusion principle.
Let $n \ge 2$ be an integer and consider the defining ideal of the Fermat configuration of points in $\mathbb{P}^2$: $I_n=(x(y^n-z^n),y(z^n-x^n),z(x^n-y^n)) \subset R=\mathbb{C}[x,y,z]$. In this paper, we compute explicitly the least degree…
We consider the following question concerning the equality of ordinary and symbolic powers of ideals. In a regular local ring, if the ordinary and symbolic powers of a one-dimensional prime ideal are the same up to its height, then are they…
Symmetric functions provide one of the most efficient tools for combinatorial enumeration, in the context of objects that may be acted upon by permutations. Only assuming a basic knowledge of linear algebra, we introduce and describe the…
We introduce the VirtualResolution package for the computer algebra system Macaulay2. This package has tools to construct, display, and study virtual resolutions for products of projective spaces. The package also has tools for generating…
Decomposing the domain of a function into parts has many uses in mathematics. A domain may naturally be a union of pieces, a function may be defined by cases, or different boundary conditions may hold on different regions. For any…
Computing the probability of a formula given the probabilities or weights associated with other formulas is a natural extension of logical inference to the probabilistic setting. Surprisingly, this problem has received little attention in…
This paper compares different representations (in the sense of computable analysis) of a number of function spaces that are of interest in analysis. In particular subspace representations inherited from a larger function space are compared…
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…