line bundle cohomology on toric varieties
What is cohomCalg?
cohomCalg is a software package for the convenient computation of cohomology group dimensions of line bundles on toric varieties.
It is the result of a research collaboration with R. Blumenhagen, T. Rahn and H. Roschy where we discovered a new algorithm for this purpose—see the paper here for the details—and I developed a high-performance C++ implementation of the algorithm. You can try out cohomCalg below (with certain restrictions), see the official website for the manual.
Where can I get cohomCalg?
For the most recent version of the program see the Official cohomCalg website.
cohomCalg Test Environment
What does cohomCalg cost?
Nothing. As the result of a scientific research project, it’s licensed under the GPL v3 and therefore comes completely free with full source code.
Can I use the program in my own work?
Yes. The license certainly allows for derivated work, provided that the original authors are acknowledged and the work is itself released under the GPL v3 with open source code. Therefore you should include some reference to our research paper on the algorithm at an appropiate place of your work. Further citation information is available on the official cohomCalg website. Please keep in mind that while the project will be maintained and further expanded in the foreseeable future, it’s long time support cannot be guaranteed.
Given the generators of a Stanley-Reisner ideal and the gauged linear sigma-model (GLSM) charges / degrees of the homogeneous coordinates for a toric variety, the program computes the dimensions of the sheaf cohomology groups for the twisted holomorphic line bundle / structure sheaf O(D) on the variety. Those dimensions are required frequently for the computation of numerous physically relevant quantities. The underlying idea of counting rationoms (monomials with integer exponents) occurred to R. Blumenhagen in the late ’90s. A closer inspection by us revealed the need for a refined definition of the multiplicity factors that weight the numbers of the rationoms, leading to the algorithm in its final form  and the subsequent proof . The ease of usage for the computation of line bundle cohomology group dimensions provides a very efficient tool for string model building. Furthermore, the algorithm can—apparently—easily be used for the computation of coset spaces (i.e. equivariant cohomology groups on the original space) as well .
In comparison to our earlier algorithm implementation as a Mathematica 7 script, the C++ implementation cohomCalg provides a huge speedup by five to six orders of magnitude according to our measurements. For the actual geometries of interest to us, this effectivily means quasi-instantaneous computation time for all relevant examples. Besides that, cohomCalg’s usage is extremely straightforward and intuitive: data input and output is provided via a text files in a rather human-readable format, which allows for an easy integration into our day-to-day workflow. In case you are interested in some of the details of the implementation, take a look at the corresponding section in the manual contained in the package.