Sage Days 99: SageMath and Macaulay2 - An Open Source Initiative

General Information

Sage Days 99: SageMath and Macaulay2 - An Open Source Initiative will be a five-day workshop bringing together developers from the Macaulay2 and Sage communities to discuss, design, and implement new algorithms and computational tools that will be of use to scientists and industry professionals. All software developed during the workshop will be made freely available as part of the open-source mathematics software systems Macaulay2 and Sage. Themes of the workshop include algebraic geometry, commutative algebra, representation theory, combinatorics, and optimization. The workshop will include talks on target features and the logistics of Macaulay2 and Sage development, as well as working groups on a variety of participant-driven themes.

When and where?

July 22-26, 2019, at the IMA, University of Minnesota, in Minneapolis, MN, USA.

Questions and Answers Wiki

https://github.com/Macaulay2/Workshop-2019-Minneapolis/wiki

SageMath Developer Guides

• Quick Start Guide (courtesy of Bryan Gillespe)

• Another quick start guide to Sage development (courtesy of Franco Saliola)

• SageMath Documentation

• Here is a link to the trac ticket that we created and contributed to during the "Contributing to SageMath" session: https://trac.sagemath.org/ticket/28261

Exploring the Macaulay2 interface in SageMath

Here is the worksheet that was used during the "exploring the M2 interface" (with some notes added): exploring-m2-interface.ipynb

Apply for a 2019-2020 IMA Coding Sprint!!

Details on applying near the bottom of IMA Workshop Website

Rolling Deadlines for 2019-2020:

September 1st, 2019 for Coding Sprints after October 1st, 2019

December 1st, 2019 for Coding Sprints after February 1st, 2020

March 1st, 2020 for Coding Sprints after May 1st, 2020

May 1st, 2020 for Coding Sprints after July 1st, 2020 (if funding is still available)

Acknowledging Projects

For SageMath Trac Tickets, please include 'days99' and 'IMA Coding Sprints' in the 'keywords' field.

For M2 github contributions, please include it in the Workshop-Minneapolis-2019 folder or mention your project in the readme therein.

Tentative list of Coding Projects (Group Leader)

Further development of plane partition class (Jessica Striker)

Opening Talk

Plane partitions have many intriguing combinatorial properties and symmetries, including connections to current research. At SageDays 78, a class for plane partitions in a box was implemented. At this workshop, I would like to add important functionality to this class, including generation of plane partitions summing to n (rather than in a bounding box), symmetry classes, random generation, and maps to fundamental domains. We could also consider coding a connection to Macaulay2, as plane partitions are in bijection with monomial ideals of three variables.

Interested Participants:

• Jessica Striker
• Kevin Dilks
• Dylan Heuer
• Joe Bernstein
• Jang Soo Kim
• Erika Pirnes

A new version of the D-modules package (Laura Matusevich)

Description: The M2 D-modules package was coded by Anton Leykin and Harrison Tsai almost 20 years ago; the current version 1.4 is about 8 years old. The goal of this project is to give the D-modules package some TLC. No specific expertise in D-modules is required: I will bring you up to speed on the basic theory, and go through the algorithms that form the core of the package. The main objective is to optimize the main functions and make them more user friendly.

Interested Participants:

• Laura Matusevich
• Aleksandra Sobieska
• Patricia Klein
• Avi Steiner
• Mahrud Sayrafi

Geometry and combinatorics of matroids (Jacob Matherne)

The goal of this coding project is to implement several combinatorial and geometric objects recently arising in matroid theory and related areas. Projects 2 and especially 4 are related to the Polytope algebras and tropical geometry project.

1. Lorentzian polynomials, defined by Petter Branden and June Huh this February, connect discrete convex analysis with many log-concavity phenomena in combinatorics. Since their invention a few months ago, there have been many applications: mostly for proving various polynomials (many of them associated to matroids) in algebraic combinatorics have some log-concavity properties. The goal of this project is to implement a test for the Lorentzian property of a multivariate homogeneous polynomial.

2. Kazhdan-Lusztig (KL) polynomials of matroids were defined via a recursive algorithm by Elias, Proudfoot, and Wakefield in 2014. These polynomials carry both combinatorial and algebro-geometric information about the matroid but their recursive implementation is prohibitively slow for larger rank matroids. By now there are explicit formulas for KL polynomials of several classes of matroids---the goal of this coding project will be to implement code which uses these quicker formulas when they exist.

3. (unrelated but should be in Sage) Counting linear extensions of posets is a notoriously difficult problem (it's #P-complete by a result of Brightwell and Winkler in 1991). However, for posets whose Hasse diagram is a tree, there is a polynomial time algorithm due to Atkinson in 1990. This is an O(n^2) algorithm, where n is the number of elements of the poset. The goal of this project is to implement Atkinson's algorithm for counting the number of linear extensions of tree posets.

4. (if time permits) The Chow ring of a matroid was the object of recent intense study by Adiprasito, Huh, and Katz---these rings, for representable matroids, are the cohomology rings of a certain variety associated to the corresponding hyperplane arrangement. Chow rings of matroids admit a variety of maps to Chow rings of related matroids (mirroring maps that exist between cohomology rings in algebraic topology). The goal of this coding project is to implement these rings (and related ones) as well as the system of maps between them.

Interested Participants:

• Jacob Matherne
• Kevin Dilks (3)
• Galen Dorpalen-Barry
• Julie Rana (project 4)
• Bryan Gillespie
• Josephine Yu

• Thomas McConville

Groebner bases for FI-modules (Steven Sam)

The application of FI-modules to examples in topology, commutative algebra, combinatorics, etc. has seen an explosion of activity in the last several years. Here FI is the category of finite sets and bijective functions and an FI-module is a functor to the category of vector spaces. The idea is strongly connected to the representation theory of symmetric groups and stability phenomena that occur in examples. Explicit computation with FI-modules can be done via a theory of Gr\"obner bases for categories which is developed in work of Sam-Snowden. However, no computer implementation exists for doing this, so the goal of this project is to provide one.

Interested Participants:

• Steven Sam
• Tom Grubb
• Franco Saliola
• Erica Musgrave

Maps between toric varieties or between simplicity complexes (Greg Smith)

• Option 1) Add new functionality to the NormalToricVarieties package related to toric maps. This likely involves adding a new Type called “ToricMaps”, creating basic constructors (such as the canonical map associated to a blowup) and tests (such as isProper). More ambiguously, it would also create the induced maps on toric divisors, coherent sheafs, and intersection rings. One might even hope to compute higher direct images is some cases (although this would likely require new algorithms). This option only makes sense if there are enough participants with a sufficiently strong background in toric geometry. I already have some code to get things started.

  Option 2) Add new functionality to the SimplicialComplexes package related to simplicial maps. Again, this likely involves adding a new Type, creating basic constructors, and appropriate Boolean-valued methods. Creating the induced maps on Chain Complexes would be a key application—one would like to have all of the elementary operations from algebraic topology. One would also like to add a database of “classic” examples. I believe that some first steps in this direction were taken at the 2017 Macaulay2 workshop in Berkeley, but the changes haven’t yet been incorporated into the distributed version. This project has the advantage having much smaller prerequisites.

Interested Participants:

• Greg Smith
• Patricia Klein
• Elise Walker
• Julie Rana (project 1)
• Avi Steiner
• Thomas Yahl
• Weikun Wang
• Mike Loper (project 1)

Cluster algebra combinatorics in SageMath (Emily Gunawan)

We propose reviewing tickets and implementing changes related to cluster algebra theory. Currently there are two cluster algebra packages (combinat:ClusterSeed and algebras:ClusterAlgebra) implemented in SageMath. Options for specific projects during this workshop include:

0. Learn about creating Python packages for SageMath. See a tutorial: Sharing code as packages and a sample package: sage_sample.

1. Modifying an existing Python implementation: The clusters of a type A cluster algebra are naturally in bijection with certain Catalan objects such as polygon triangulations and Conway-Coxeter frieze patterns. We propose to implement a constructor for this in Sage, and write methods to go between Conway-Coxeter frieze patterns and some of the Catalan objects already implemented in Sage (for example, binary trees).

2. Writing new code for SageMath: Given an arbitrary cluster algebra of rank n, an (integral) frieze is a ring homomorphism from the cluster algebra to an integral domain (the integers). A frieze vector is an n-tuple which uniquely determines a frieze. We propose adding a method which allows the user to print the frieze values. Furthermore, in type A, the positive frieze vectors are in bijection with the Catalan objects (for example, the Conway-Coxeter frieze patterns), so we propose writing methods for going between the type A positive frieze vectors and other Catalan objects. The (finite) number of positive frieze vectors is also known for type E6 and type D and there is an algorithm for producing them.

3. Cleaning up an existing implementation (ticket #16310): Given a cluster algebra from a surface, the snake graph formula is a way to compute cluster algebra elements coming from generalized arcs and bracelets. We propose integrating an existing implementation into SageMath. The code is functional, but it still requires integration with the most recent version of SageMath.

4. Improving functionality of an existing implementation (ticket #19160): We propose creating SnakeGraph as its own object, allowing it to take as input continued fractions and binary sequences (also called sign functions), and producing TikZ graphics as output.

5. We propose reviewing and cleaning up the ClusterSeed and ClusterQuiver classes needed to deal with principal coefficients or frozen vertices when the user tries to use their own variable labels. This was started at Sage Days 64.5.

Interested Participants:

• Emily Gunawan
• Gregg Musiker
• Jacob Matherne
• Harrison Smith
• Elizabeth Kelley

Cluster algebras as algebras (Gregg Musiker)

As part of the previous working group or separately, using M2 and Sage together to study algebraic aspects of cluster algebras such as their upper bounds and writing elements in terms of bases.

Interested Participants:

• Gregg Musiker
• Jacob Matherne

Primary Decomposition (Justin Chen)

Primary decomposition is one of the most fundamental representations of an ideal in a polynomial ring. However, the computational task of computing primary decompositions is difficult in general. The current algorithm used in Macaulay2 (Shimoyama-Yokoyama) leaves room for improvement, and although other algorithms (Gianni-Trager-Zacharias) have been introduced in the MinimalPrimes package, these still need revision. This project aims to improve primary decomposition in Macaulay2, a large part of which will be performing the necessary work to make MinimalPrimes a stable package.

Interested Participants:

• Justin Chen
• Patricia Klein
• Fred Galetto
• Elise Walker
• Julie Rana
• Thomas Yahl

Polytope algebras and tropical geometry (Josephine Yu)

I am interested in computation with polytopes inspired by tropical geometry. McMullen’s polytope algebra is isomorphic to the algebra of tropical cycles (balanced fans). For a fixed polytope, the algebra of tropical cycles supported on its normal fan coincides with the Chow ring of the toric variety of the polytope. I would like to implement some computations with these objects in Sage and/or M2. This is also related to the Geometry of Matroid project. I would also like to think about how to compute real tropicalizations of semialgebraic sets.

Interested Participants:

• Josephine Yu
• Julie Rana
• Avi Steiner
• Elise Villella

Simplicial and Cellular Resolutions (Jay Yang)

The goal of this project would be to improve the code that exists for labeled simplicial complexes, and add code for labeled cell complexes.

There is some code currently in SimplicialComplexes that can manipulate a labeled simplicial complex, A first task would be to either extract this code and improve it, or write helper functions to manipulate labeled simplicial complexes. Including code to extract the labels in a clean format, and to check conditions such as acyclicity, and minimality. Second, we can add code to allow for arbitrary monomial ideal labels instead of just monomial labels. Third, we can implement this for cell complexes. This would require creating a type of labeled cell complexes and would be more involved.

Interested Participants:

• Jay Yang
• Aleksandra Sobieska

Use Macaulay2 as an optional backend to compute non-commutative Grobner bases in Sage (Franco Saliola)

(Projected suggested by Mike Zabrocki.)

Current state of affairs:

• computation of ideals in the polynomial ring is an option through algorithm='macaulay2:gb' but Grobner bases of the Free algebra are computed by singular and then only if you use the "letterplace" implementation (see "FreeAlgebra?" to see the comment). Example:

  • sage: FA=FreeAlgebra(QQ,implementation='letterplace',names=['x1','x2','x3'])
    sage: (x1,x2,x3)=FA.gens()
    sage: I = FA.ideal([x1+x2+x3,x1^2+x2^2+x3^2,x1^3+x2^3+x3^3])
    sage: I.grobner_basis??

• Note that there is not even a grobner_basis method if you delete implementation='letterplace' above.

• Calling grobner_basis with anything larger than the smallest examples crashed Sage for me (killed the kernel with no error message).

• Here seems to be a package to do it in Macaulay2: https://faculty.math.illinois.edu/Macaulay2/doc/Macaulay2-1.13/share/doc/Macaulay2/NCAlgebra/html/index.html

Interested Participants:

• Franco Saliola
• Gregg Musiker

Polynomial rings with commuting and anticommuting sets of variables (Franco Saliola)

(Projected suggested by Mike Zabrocki.)

Be able to create polynomial rings with commuting and anticommuting sets of variables, and compute Grobner bases therein (the idea again is to use Macaulay2 as the backend).

The reason this came up was because of this paper (and Mike has since had people contacting him for help using the code for making similar conjectures): https://arxiv.org/pdf/1902.08966.pdf

Current state of affairs (as far as I can tell):

• in Sage, polynomial rings cannot be constructed with anticommuting variables (the way Macaulay2 does)
• Mike had two ways of doing this:
  • construct the Free algebra and quotient by the ideal generated xi xj - xj xi for the commuting variables and xi xj + xj xi for the anticommuting variables (this is what inspired the topic for the previous coding sprint);
  • or just use Sage to make calls directly to Macaulay2 (Mike provided example code, and would love for this to be improved).

Interested Participants:

• Franco Saliola
• Gregg Musiker
• Galen Dorpalen-Barry

More projects to be posted. Please feel free to add your own interests or email Gregg (musiker at math dot umn dot edu) or Christine (cberkesc at math dot umn dot edu) with them if you do not have direct wiki editing access.