Related papers: Perfect Lattices over Imaginary Quadratic Number F…

Simulations of supersymmetric field theories with spontaneously broken supersymmetry require in addition to the ultraviolet regularisation also an infrared one, due to the emergence of the massless Goldstino. The intricate interplay between…

The problem of computing the index of a coincidence isometry of the hyper cubic lattice $\mathbb{Z}^{n}$ is considered. The normal form of a rational orthogonal matrix is analyzed in detail, and explicit formulas for the index of certain…

In this paper we define infinite-dimensional algebra and its representation, whose basis is naturally identified with semi-infinite configurations of the square ladder model. We also extrapolate the ideas for the cyclic 3-leg triangular…

The Voronoi cell of any atom in a lattice is identical. If atoms are perturbed from their lattice coordinates, then the topologies of the Voronoi cells of the atoms will change. We consider the distribution of Voronoi cell topologies in…

We give an upper bound for the norm of the determinant of additively indecomposable, totally positive definite quadratic forms defined over the ring of integers of totally real number fields. We apply these results to find lower and upper…

We implement methods from the geometry of numbers to give explicit estimates for the number of integral ideals in a number field. We pay particular attention to minimising the effect of the degree $n$ of the number field on the error term…

This paper presents an adaptation of recently developed algorithms for quadratic forms over number fields in arXiv:1304.0708 to global function fields of odd characteristics. First, we present algorithm for checking if a given…

The paper develops elementary linear algebra methods to compute the determinants of the tensor symmetrizations of quadratic and hermitian forms over fields of good characteristic. Explicit results are given for the partitions $(n)$,…

Given a field $K$ equipped with a set of discrete valuations $V$, we develop a general theory to relate reduction properties of skew-hermitian forms over a quaternion $K$-algebra $Q$ to quadratic forms over the function field $K(Q)$…

We construct an infinite commutative lattice of groups whose dual spaces give Kauffman finite-type invariants of long virtual knots. The lattice is based "horizontally" upon the Polyak algebra and extended "vertically" using Manturov's…

Quadratic forms of Hermitian matrix resolvents involve the solutions of shifted linear systems. Efficient iterative solutions use the shift-invariance property of Krylov subspaces The Hermitian Lanczos method reduces a given vector and…

We describe an efficient algorithm to calculate generators of power integral bases in composites of totally real fields with imaginary quadratic fields. We show that the calculation can be reduced to solving index form equations in the…

In quantum information theory, a geometric approach, known as "quantum information geometry," has been considered as a powerful method. In this thesis, we give a computational geometric interpretation to the geometric structure of a quantum…

Let $K$ be an imaginary quadratic field and let $\mathcal{O}_K$ be its ring of integers. For an integral ideal $\mathfrak{n}$ of $\mathcal{O}_K$, let $\Gamma_0({\mathfrak{n}})$ be the congruence subgroup of level ${\mathfrak{n}}$ consisting…

Quadratic form reduction and lattice reduction are fundamental tools in computational number theory and in computer science, especially in cryptography. The celebrated Lenstra-Lenstra-Lov\'asz reduction algorithm (so-called LLL) has been…

Enumerating polygons on regular lattices is a classic problem in rigorous statistical mechanics. The goal of enumerating polygons on the square lattice via fermionic path integration was achieved using a free-fermion quadratic action in the…

Four-Fermi quantum field theories in (2+1) dimensions lie among the simplest models in high-energy physics, the understanding of which requires a non-perturbative lattice formulation addressing their strongly-coupled fixed points. These…

In a seminal work, Micciancio & Voulgaris (2013) described a deterministic single-exponential time algorithm for the Closest Vector Problem (CVP) on lattices. It is based on the computation of the Voronoi cell of the given lattice and thus…

We construct an infinite series of simply transitive irreducible lattices in PGL_2(F_q((t))) \times PGL_2(F_q((t))) by means of a quaternion algebra over F_q(t). The lattices depend on an odd prime power q = p^r and a parameter \tau\ in…

We study the regularity and the algebraic properties of certain lattice ideals. We establish a map I --> I\~ between the family of graded lattice ideals in an N-graded polynomial ring over a field K and the family of graded lattice ideals…