Related papers: On the Optimality of Gauss's Algorithm over Euclid…
Complex bases, along with direct-sums defined by rings of imaginary quadratic integers, induce algebraic lattices. In this work, we study such lattices and their reduction algorithms. Firstly, when the lattice is spanned over a two…
Our aim is to find a complex continued fraction algorithm finding all the best Diophantine approximations to a complex number. Using the sequence of minimal vectors in a two dimensional lattice over Gaussian integers, we obtain an algorithm…
The Euclidean algorithm is one of the oldest algorithms known to mankind. Given two integral numbers $a_1$ and $a_2$, it computes the greatest common divisor (gcd) of $a_1$ and $a_2$ in a very elegant way. From a lattice perspective, it…
We introduce here a rewrite system in the group of unimodular matrices, \emph{i.e.}, matrices with integer entries and with determinant equal to $\pm 1$. We use this rewrite system to precisely characterize the mechanism of the Gaussian…
The distributional analysis of Euclidean algorithms was carried out by Baladi and Vall\'{e}e. They showed the asymptotic normality of the number of division steps and associated costs in the Euclidean algorithm as a random variable on the…
We propose an efficient variational method for $Z_2$ lattice gauge theory based on the matrix product ansatz. The method is applied to ladder and square lattices. The Gauss law needs to be imposed on quantum states to guarantee gauge…
This paper deals with lattices $(L,\Vert~\Vert)$ over polynomial rings, where $L$ is a finitely generated module over $k[t]$, the polynomial ring over the field $k$ in the indeterminate $t$, and $\Vert~\Vert$ is a discrete real-valued…
The Euclidean algorithm is the oldest algorithms known to mankind. Given two integral numbers $a_1$ and $a_2$, it computes the greatest common divisor (gcd) of $a_1$ and $a_2$ in a very elegant way. From a lattice perspective, it computes a…
We propose and study a generalized continued fraction algorithm that can be executed in an arbitrary imaginary quadratic field, the novelty being a non-restriction to the five Euclidean cases. Many hallmark properties of classical continued…
The lattice formulation provides a way to regularize, define and compute the Path Integral in a Quantum Field Theory. In this paper we review the theoretical foundations and the most basic algorithms required to implement a typical lattice…
We present a lattice algorithm specifically designed for some classical applications of lattice reduction. The applications are for lattice bases with a generalized knapsack-type structure, where the target vectors are boundably short. For…
A periodic lattice in Euclidean space is the infinite set of all integer linear combinations of basis vectors. Any lattice can be generated by infinitely many different bases. This ambiguity was only partially resolved, but standard…
The algorithm for finding the optimal consistent approximation of an inconsistent pairwise comparisons matrix is based on a logarithmic transformation of a pairwise comparisons matrix into a vector space with the Euclidean metric.…
This work addresses the problem of simulating Gaussian random fields that are continuously indexed over a class of metric graphs, termed graphs with Euclidean edges, being more general and flexible than linear networks. We introduce three…
We consider Euclidean lattices spanned by images of algebraic conjugates of an algebraic number under Minkowski embedding, investigating their rank, properties of their automorphism groups and sets of minimal vectors. We are especially…
We describe a polynomial time algorithm for, given an undirected graph G, finding the minimum dimension d such that G may be isometrically embedded into the d-dimensional integer lattice Z^d.
The Gauss law needs to be imposed on quantum states to guarantee gauge invariance when one studies gauge theory in hamiltonian formalism. In this work, we propose an efficient variational method based on the matrix product ansatz for a Z_2…
Classical existence theorems and solution methods for quadratic programming traditionally rely on the analytical properties of real numbers, specifically compactness and completeness. These tools are unavailable in general linearly ordered…
In this article we introduce theory and algorithms for learning discrete representations that take on a lattice that is embedded in an Euclidean space. Lattice representations possess an interesting combination of properties: a) they can be…
We perform a systematic study of the image of the Gauss map for complete minimal surfaces in Euclidean four-space. In particular, we give a geometric interpretation of the maximal number of exceptional values of the Gauss map of a complete…