Related papers: Eliminating dual spaces
We describe an algorithm for computing Macaulay dual spaces for multi-graded ideals. For homogeneous ideals, the natural grading is inherited by the Macaulay dual space which has been leveraged to develop algorithms to compute the Macaulay…
Generalizing the concept of the Macaulay inverse system, we introduce a way to describe localizations of an ideal in a polynomial ring. This leads to an approach to the differential primary decomposition as a description of the affine…
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…
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…
We produce algorithms to detect whether a complex affine variety computed and presented numerically by the machinery of numerical algebraic geometry corresponds to an associated component of a polynomial ideal.
We introduce an alternative formalization of curved spaces in which the concept of a pointwise affine space, as defined here, replaces that of a manifold. New or modified definitions of familiar notions from differential geometry such as…
We apply methods of nonstandard mathematics in order to regard analytic geometry in a very different way. For example, complex spaces are seen to be the "standard part" of certain algebraic nonstandard schemes. We construct a category of…
The main outcomes of the paper are divided into two parts. First, we present a new dual for quadratic programs, in which, the dual variables are affine functions, and we prove strong duality. Since the new dual is intractable, we consider a…
We investigate the arithmetic of algebraic curves on coarse moduli spaces for special linear rank two local systems on surfaces with fixed boundary traces. We prove a structure theorem for morphisms from the affine line into the moduli…
We introduce the DeterminantalRepresentations package for Macaulay2, which computes definite symmetric determinantal representations of real polynomials. We focus on quadrics and plane curves of low degree (i.e. cubics and quartics). Our…
We present a novel certified and complete algorithm to compute arrangements of real planar algebraic curves. It provides a geometric-topological analysis of the decomposition of the plane induced by a finite number of algebraic curves in…
We introduce efficient differentially private (DP) algorithms for several linear algebraic tasks, including solving linear equalities over arbitrary fields, linear inequalities over the reals, and computing affine spans and convex hulls. As…
We introduce the package \texttt{EliminationTemplates} for the Macaulay2 computer algebra system, which provides tools for constructing automatic solvers for families of zero-dimensional radical ideals depending on algebraically independent…
Cubic spline interpolation on Euclidean space is a standard topic in numerical analysis, with countless applications in science and technology. In several emerging fields, for example computer vision and quantum control, there is a growing…
By introducing a quadratic perturbation to the canonical dual of the maxcut problem, we transform the integer programming problem into a concave maximization problem over a convex positive domain under some circumstances, which can be…
Many algorithms require discriminative boundaries, such as separating hyperplanes or hyperballs, or are specifically designed to work on spherical data. By applying inversive geometry, we show that the two discriminative boundaries can be…
We present Binomials, a package for the computer algebra system Macaulay2, which specializes well known algorithms to binomial ideals. These come up frequently in algebraic statistics and commutative algebra, and it is shown that…
We establish sharp lower and upper bounds for the number of integral points near dilations of a space curve with nowhere vanishing torsion.
Two curves are affinely equivalent if there exists an affine mapping transforming one of them onto the other. Thus, detecting affine equivalence comprises, as important particular cases, similarity, congruence and symmetry detection. In…
The package Binomials contains implementations of specialized algorithms for binomial ideals, including primary decomposition into binomial ideals. The current implementation works in characteristic zero. Primary decomposition is restricted…