Related papers: Numerical Schubert Calculus in Macaulay2
We present numerical homotopy continuation algorithms for solving systems of equations on a variety in the presence of a finite Khovanskii basis. These take advantage of Anderson's flat degeneration to a toric variety. When Anderson's…
We offer a Maple-procedure for computing of the Hilbert polynomials of the algebras of $SL_2$-invariants
Fractional calculus has become widely studied and applied to physical problems in recent years. As a result, many methods for the numerical computation of fractional derivatives and integrals have been defined. However, these algorithms are…
Based on the multiplicative rule of Schubert classes obtained in [Du3], we present an algorithm computing the product of two arbitrary Schubert classes. As a result, the algorithm gives also a method to compute the integral cohomology ring…
We introduce the Macaulay2 package $\mathtt{LinearTruncations}$ for finding and studying the truncations of a multigraded module over a standard multigraded ring that have linear resolutions.
We give a computational algorithm for computing Ext groups between bounded complexes of coherent sheaves on a projective variety, and we describe an implementation of this algorithm in Macaulay2. In particular, our results yield methods for…
We discuss an algorithm computing the push-forward to projective space of several classes associated to a (possibly singular, reducible, nonreduced) projective scheme. For example, the algorithm yields the topological Euler characteristic…
Formulating a Schubert problem as the solutions to a system of equations in either Pl\"ucker space or in the local coordinates of a Schubert cell usually involves more equations than variables. Using reduction to the diagonal, we previously…
Effective Hamiltonian calculations for large quantum systems can be both analytically intractable and numerically expensive using standard techniques. In this manuscript, we present numerical techniques inspired by Nonperturbative…
Let $\Phi$ be a root system. Postnikov introduced and studied the mixed $\Phi$-Eulerian numbers. These numbers indicate the mixed volumes of $\Phi$-hypersimplices. As specializations of these numbers, one can obtain the usual Eulerian…
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.
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…
In recent years we provided numerical methods based on pseudospectral collocation for computing the Floquet multipliers of different types of delay equations, with the goal of studying the stability of their periodic solutions. The latest…
We show that the Hilbert space with basis indexed by infinite permutations and the cohomology ring of the infinite flag variety can be seen as representations of the Heisenberg algebra, which are isomorphic using the back-stable Schubert…
We introduce the CpMackeyFunctors package for Macaulay2, which allows for computations with Mackey functors over a cyclic group of prime order.
We study the T-equivariant quantum cohomology of the Grassmannian. We prove the vanishing of a certain class of equivariant quantum Littlewood-Richardson coefficients, which implies an equivariant quantum Pieri rule. As in the equivariant…
We prove a Chevalley formula for the equivariant quantum multiplication of two Schubert classes in the homogeneous variety X=G/P. As in the case when X is a Grassmannian, studied by the author in a previous paper, this formula implies an…
Many applications in science call for the numerical simulation of systems on manifolds with spherical topology. Through use of integer spin weighted spherical harmonics we present a method which allows for the implementation of arbitrary…
We describe a Schubert induction theorem, a tool for analyzing intersections on a Grassmannian over an arbitrary base ring. The key ingredient in the proof is the Geometric Littlewood-Richardson rule, described in a companion paper.…
We introduce the Macaulay2 package BooleanGB, which computes a Gr\"obner basis for Boolean polynomials using a binary representation rather than symbolic. We compare the runtime of several Boolean models from systems in biology and give an…