We obtain the exact partition function for a lattice Gaussian model where the site degrees of freedom are sections of a U(1) bundle over a triangular lattice which globally forms a torus, with three independent nearest neighbour interactions in the different lattice directions. We find that in the s
Lattices of Compatibly Embedded Finite Fields
β Scribed by WIEB BOSMA; JOHN CANNON; ALLAN STEEL
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 474 KB
- Volume
- 24
- Category
- Article
- ISSN
- 0747-7171
No coin nor oath required. For personal study only.
β¦ Synopsis
The design of a computational facility for finite fields that allows complete freedom in the manner in which fields are constructed, is complicated by the fact that a field of fixed isomorphism type K may be constructed in many different ways. It is desirable that the user be able to perform simultaneous computations in different versions of K in such a way that isomorphisms identifying elements in the different versions are applied automatically whenever necessary. This paper presents a coherent scheme for solving this problem based on an efficient method for compatibly embedding one field within another. This scheme forms a central component of the Magma module for finite fields. The paper also outlines the different representations of finite fields employed in the package and comments briefly on some of the major algorithms.
π SIMILAR VOLUMES
Electric field patterns in finite two-dimensional wire photonics lattices are investigated by means of electromagnetic simulations. These studies reveal a strong analogy with the envelope wavefunction approach extensively used for semiconductor superlattices. Several propagating eigenmodes in the pa
In this paper, we prove reconstruction results for truncated lattices. The main results are that truncated lattices that contain a 4-crown and truncated semi-modular lattices are reconstructible. Reconstruction of the truncated lattices not covered by this work appears challenging. Indeed, the remai