CC degree of the Grassmannian
ABSTRACT: We determine the number of complex solutions to a nonlinear eigenvalue problem on the Grassmannian in its Plücker embedding. This is motivated by quantum chemistry, where it represents the truncation to single electrons in coupled cluster theory. We prove the formula for the Grassmannian of lines which was conjectured in earlier work with Fabian Faulstich. This rests on the geometry of the graph of a birational parametrization of the Grassmannian. We present a squarefree Gröbner basis for this graph, and we develop connections to toric degenerations from representation theory.
Macaulay2 source code
verifyTheorem14functions.m2,Verify (3,9)Jupyter Notebook
Theorem 14 Verifications,CC degree of the GrassmannianJulia source code
9 real solutions
Verifications of Theorem 14
We used Macaulay2 (version 1.22) to verify Theorem 14 in the cases of
To verify the first statement of Theorem 14 for a specific case you need the function KhovanskiiCheck from the file verifyTheorem14functions.m2. To test a specific case of \({\rm Gr}(d,n)\), e.g. \({\rm Gr}(d,n) = {\rm Gr}(3,7)\), run
load "verifyTheorem14functions.m2";
(d,n) = (3,7);
KhovanskiiCheck(d,n)
This function compares the Hilbert series for the graph of the parametrization of \({\rm Gr}(d,n)\) and the graph of the corresponding monomial parametrization. Knowing the PBW poset for the Grassmannian speeds up the computation of the ideal \({\mathcal G}(d,n)\). The usage is as follows:
KhovanskiiCheckWithPoset(3,7, poset37)
Here, poset37 should be a list of lists of indices ordered consistently to the PBW order.
To verify the second statement of Theorem 14 you need to use the function SquarefreeCheck from verifyTheorem14functions.m2:
load "verifyTheorem14functions.m2";
(d,n) = (3,7);
SquarefreeCheck(d,n, poset37)
Cases \((3,6)\), \((3,7)\) and \((4,8)\) are verified in the
Jupyter Notebook Theorem 14 Verifications.
The PBW posets for all the 4 cases in Remark 15 can also be found in the notebook.
The case \((4,9)\) was verified using the code Verify (3,9).
There we calculate that the CC degree is 574507, while computing the ideals \(G\) and \(T\) takes 9484 seconds
and verifying the first and second statement in Theorem 14 takes 68 seconds.
The CC degree of the Grassmannian calculated numerically
The code CC degree of the Grassmannian uses HomotopyContinuation.jl (version 2.9.2)
to calculate the CC degree of the Grassmannian \(\operatorname{Gr}(d,n)\). By Theorem 1 we can use this code to find the degree of
the graph \(\mathcal{G}(d,n)\) and numerically verify Example 4. Also by Theorem 14 we can use this code to calculate the normalized volume of \(\operatorname{CFFLV}(d,n)\).
Hamiltonians providing real and non-degenerate solutions
We illustrate Remark 6 by a small example of CC degree for \(\mathrm{Gr}(2,4)\). We found a symmetric \(6 \times 6\) Hamiltonian for which CC equations have all 9 solutions real and nondegenerate.
Solutions can be found with the code 9 real solutions using HomotopyContinuation.jl.
Project page created: 24/10/2023
Project contributors: Viktoriia Borovik, Bernd Sturmfels and Svala Sverrisdóttir
Corresponding author of this page: Svala Sverrrisdóttir, svala@math.berkeley.edu
Macaulay2 code written by: Viktoriia Borovik
Julia code written by: Bernd Sturmfels
Jupyter notebook written by: Svala Sverrisdottir and Viktoriia Borovik
Software used: Julia (Version 1.9.2), Macaulay2 (Version 1.22)
System setup used: MacBook Pro with macOS Venture 13.5.1, Processor 2,6 GHz 6-Core Intel Core i7, Memory 16 GB 2400 MHz DDR4.
License for code of this project page: MIT License (https://spdx.org/licenses/MIT.html)
License for all other content of this project page: CC BY 4.0 (https://creativecommons.org/licenses/by/4.0/)
Last updated 20/10/2023.