Related papers: Numerical Schubert Calculus in Macaulay2
A new algorithm for computing coefficients of the Baker--Campbell--Hausdorff series is presented, which can be straightforwardly implemented in any general-purpose programming language or computer algebra system. The algorithm avoids…
The paper concerns numerical algorithms for solving the Beltrami equation $f_{\bar{z}}(z)=\mu(z) f_z(z)$ for a compactly supported $\mu$. First, we study an efficient algorithm that has been proposed in the literature, and present its…
We report on our experiences exploring state of the art Groebner basis computation. We investigate signature based algorithms in detail. We also introduce new practical data structures and computational techniques for use in both signature…
We investigate the computational performance of various numerical methods for the integration of the equations of motion and the variational equations for some typical classical many-body models of condensed matter physics: the…
A driving question in (quantum) cohomology of flag varieties is to find non-recursive, positive combinatorial formulas for expressing the product of two classes in a particularly nice basis, called the Schubert basis. Bertram,…
We show that, with coefficients in a field or a complete local ring k, the Braden-MacPherson algorithm computes the stalks of parity sheaves with coefficients in k. As a consequence we deduce that the Braden-MacPherson algorithm may be used…
We compute the Brauer group of the moduli stack of elliptic curves over the integers, localizations of the integers, finite fields of odd characteristic, and algebraically closed fields of characteristic not $2$. The methods involved…
These are extended notes of a talk given at Maurice Auslander Distinguished Lectures and International Conference (Woods Hole, MA) in April 2013. Their aim is to give an introduction into Schubert calculus on Grassmannians and flag…
Algorithms for computing the classical Gaussian quadrature rules (Gauss--Jacobi, Gauss--Laguerre, and Gauss--Hermite) are presented, based on globally convergent fourth-order iterative methods combined with asymptotic approximations, which…
We introduce the Macaulay2 package MatchingPowers. It allows to compute and manipulate the matching powers of a monomial ideal. The basic theory of matching powers is explained and the main features of the package are presented.
We present a method to experimentally realize large-scale permutation-symmetric Hamiltonians for continuous-time quantum protocols such as quantum walk and adiabatic quantum computation. In particular, the method can be used to perform an…
A common challenge in scientific and technical domains is the quantitative description of geometries and shapes, e.g. in the analysis of microscope imagery or astronomical observation data. Frequently, it is desirable to go beyond scalar…
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,…
CLIFFORD performs various computations in Grassmann and Clifford algebras. It can compute with quaternions, octonions, and matrices with entries in Cl(B) - the Clifford algebra of a vector space V endowed with an arbitrary bilinear form B.…
We develop a combinatorial rule to compute the real geometry of type B Schubert curves $S(\lambda_\bullet)$ in the orthogonal Grassmannian $\mathrm{OG}_n$, which are one-dimensional Schubert problems defined with respect to orthogonal flags…
PHCpack is a software package for polynomial homotopy continuation, which provides a robust path tracker [Telen, Van Barel, Verschelde, SISC 2020]. This tracker computes the radius of convergence of Newton's method, estimates the distance…
We report on a package of routines for the computer algebra system Maple which supports the explicit determination of the geometric quantities, field equations, equations of motion, and conserved quantities of General Relativity in the…
We show that the Schubert calculus of enumerative geometry is real, for special Schubert conditions. That is, for any such enumerative problem, there exist real conditions for which all the a priori complex solutions are real.
In this paper, we present a closed formula for the cohomology of real Grassmannians. To achieve this, we use a theory of stratified spaces to compute the differentials in a chain complex that computes the cohomology. Specifically, we…
Numerical algebraic geometry provides a number of efficient tools for approximating the solutions of polynomial systems. One such tool is the parameter homotopy, which can be an extremely efficient method to solve numerous polynomial…