This project is a complement to the code about hermitian lattices available in Hecke. We aim here to connect Hecke and GAP to handle some algorithmic methods regarding quadratic forms with their isometries. In particular, the integration of this code within Oscar is necessary to benefit from all the performance of GAP with respect to computations with groups and automorphisms in general.
For now, the project covers methods regarding rational and integral quadratic forms.
We introduce two new structures
The former parametrizes pairs $(V, f)$ where $V$ is a rational quadratic form and $f$ is an isometry of $V$. The latter parametrizes pairs $(L, f)$ where $L$ is an integral quadratic form, also known as $\mathbb Z$-lattice and $f$ is an isometry of $L$. One of the main features of this project is the enumeration of isomorphism classes of pairs $(L, f)$, where $f$ is an isometry of finite order with at most two prime divisors. The methods we resort to for this purpose are developed in the paper [BH23].
We also provide some algorithms computing isomorphism classes of primitive embeddings of even lattices following Nikulin's theory. More precisely, the function
primitive_embeddings offers, under certain conditions, the possibility to compute representatives of primitive embeddings and classify them in different ways. Note nonetheless that these functions are not efficient in the case were the discriminant groups have a large number of subgroups.
This project has been slightly tested on simple and known examples. It is currently being tested on a larger scale to test its reliability. Moreover, there are still computational bottlenecks due to non-optimized algorithms.
Among the possible improvements and extensions:
- Implement extra methods for lattices with isometries of infinite order;
- Extend existing methods for equivariant primitive embeddings/extensions.
The project was initiated by S. Brandhorst and T. Hofmann for classifying finite subgroups of automorphisms of K3 surfaces. Our current goal is to use this code, and further extensions of it, to classify finite subgroups of bimeromorphic self-maps of hyperkaehler manifolds, which are a higher dimensional analogues of K3 surface.
No tutorials available at the moment.
No examples available at the moment.
Since this project is still under development, feel free to try any feature and report all the bugs you may have found. Any suggestions for improvements or extensions are more than welcome. Refer to the next section to know who you should contact and how. Do not hesitate either to ask for new features - we will be glad to add anything you may need for your research.
One may expect many things to vary within the next months: name of the functions, available features, performance. This is due to the fact that the current version of the code is still at an experimental stage.
If you are working with some objects of type
ZZLatWithIsom and you need to report an issue, you can produce directly some lines of codes helping to reconstruct your example. This can help the reviewers to understand your issue and assist you. We have implemented a method
to_oscar which prints few lines of codes for reconstructing your example.
julia> V = quadratic_space(QQ, 2);
julia> Vf = quadratic_space_with_isometry(V, neg = true)
Quadratic space of dimension 2 with isometry of finite order 2 given by [-1 0] [ 0 -1]
G = matrix(QQ, 2, 2, [1 0; 0 1]); V = quadratic_space(QQ, G); f = matrix(QQ, 2, 2, [-1 0; 0 -1]); Vf = quadratic_space_with_isometry(V, f);
julia> Lf = lattice(Vf)
Integer lattice of rank 2 and degree 2 with isometry of finite order 2 given by [-1 0] [ 0 -1]
B = matrix(QQ, 2, 2, [1 0; 0 1]); G = matrix(QQ, 2, 2, [1 0; 0 1]); L = integer_lattice(B, gram = G); f = matrix(QQ, 2, 2, [-1 0; 0 -1]); Lf = integer_lattice_with_isometry(L, f);
Within the code, there are more hidden messages and testing which are disabled by default. If you plan to experiment with the codes with your favourite examples, you may want to be able to detect some issues to be reported, as well as knowing what the code is doing. Indeed, some functions might take time in term of compilation but also computations. For this, you can enable these extra tests and printings by setting:
Please direct questions about this part of OSCAR to the following people:
You can ask questions in the OSCAR Slack.
Alternatively, you can raise an issue on GitHub.