English
Related papers

Related papers: On the Optimality of Gauss's Algorithm over Euclid…

200 papers

Let $E=\mathbb{Q}\big(\sqrt{-d}\big)$ be an imaginary quadratic field for a square-free positive integer $d$, and let $\mathcal{O}$ be its ring of integers. For each positive integer $m$, let $I_m$ be the free Hermitian lattice over…

Number Theory · Mathematics 2023-09-29 Jingbo Liu

Finding the global minimum of a multivariate function efficiently is a fundamental yet difficult problem in many branches of theoretical physics and chemistry. However, we observe that there are many physical systems for which the…

High Energy Physics - Lattice · Physics 2014-11-20 Dhagash Mehta , Andre Sternbeck , Lorenz von Smekal , Anthony G Williams

Gauss' classical reduction theory for indefinite binary quadratic forms over $\mathbb{Z}$ has originally been proven by means of purely algebraic and arithmetic considerations. It was later discovered that this reduction theory is closely…

Number Theory · Mathematics 2015-12-29 Anke Pohl , Verena Spratte

Dirichlet's version of Gauss's reduction theory for indefinite binary quadratic forms includes a map from Gauss-reduced forms to strings of natural numbers. It attaches to a form the minimal period of the continued fraction of a quadratic…

Number Theory · Mathematics 2017-10-16 Barry R. Smith

The list of norm-Euclidean imaginary quadratic fields is known and finite. For each known case, we give a division algorithm that finds a remainder at distance less than the Euclidean minimum of the field.

Number Theory · Mathematics 2026-04-22 François Morain

We introduce a framework generalizing lattice reduction algorithms to module lattices in order to practically and efficiently solve the $\gamma$-Hermite Module-SVP problem over arbitrary cyclotomic fields. The core idea is to exploit the…

Data Structures and Algorithms · Computer Science 2019-12-11 Thomas Espitau , Paul Kirchner , Pierre-Alain Fouque

Lattices are a popular field of study in mathematical research, but also in more practical areas like cryptology or multiple-input/multiple-output (MIMO) transmission. In mathematical theory, most often lattices over real numbers are…

Information Theory · Computer Science 2022-08-19 Sebastian Stern , Cong Ling , Robert F. H. Fischer

We report on the utility of using Shannons Sampling theorem to solve Quantum Mechanical systems. We show that by extending the logic of Shannons interpolation theorem we can define a Universal Lattice Basis, which has superior interpolating…

Computational Physics · Physics 2013-09-16 Jonathan Jerke , C. J. Tymczak

A lattice gauge theory with an action polynomial in independent field variables is considered. The link variables are described by unconstrained complex matrices instead of unitary ones. A mechanism which permits to switch off in the…

High Energy Physics - Theory · Physics 2007-05-23 V. A. Franke , S. A. Paston , E. V. Prokhvatilov

The classical theorems relating integral binary quadratic forms and ideal classes of quadratic orders have been of tremendous importance in mathematics, and many authors have given extensions of these theorems to rings other than the…

Number Theory · Mathematics 2011-04-01 Melanie Matchett Wood

In this paper, we prove effective estimates for the number of exceptional values and the totally ramified value number for the Gauss map of pseudo-algebraic minimal surfaces in Euclidean four-space and give a kind of unicity theorem.

Differential Geometry · Mathematics 2010-01-17 Yu Kawakami

We propose a new exact approach to the generalized graph layering problem that is based on a particular quadratic assignment formulation. It expresses, in a natural way, the associated layout restrictions and several possible objectives,…

Data Structures and Algorithms · Computer Science 2019-08-13 Sven Mallach

We propose an implementation of a two-dimensional $\mathbb{Z}_2$ lattice gauge theory model on a shallow quantum circuit, involving a number of single and two-qubits gates comparable to what can be achieved with present-day and near-future…

In this paper we study Euclidean algorithms and the corresponding continued fractions for oriented linear Grassmanians $G(k,n)$. We propose two algorithms: Maximal Element Elimination algorithm and Minimal Element Elimination algorithm. The…

Number Theory · Mathematics 2025-09-10 Maxim Arnold , Oleg Karpenkov

At finite lattice spacing, Lagrangian and Hamiltonian predictions differ due to discretization effects. In the Hamiltonian limit, i.e. at vanishing temporal lattice spacing $a_t$, the path integral approach in the Lagrangian formalism…

High Energy Physics - Lattice · Physics 2025-11-19 C. F. Groß , S. Romiti , L. Funcke , K. Jansen , A. Kan , S. Kühn , C. Urbach

Let K be a number field, let A be a finite dimensional semisimple K-algebra and let Lambda be an O_K-order in A. It was shown in previous work that, under certain hypotheses on A, there exists an algorithm that for a given (left)…

Number Theory · Mathematics 2020-03-03 Tommy Hofmann , Henri Johnston

We review the literature on algorithms for estimating the index space in a multi-index model. The primary focus is on computationally efficient (polynomial-time) algorithms in Gaussian space, the assumptions under which consistency is…

Machine Learning · Statistics 2025-06-17 Joan Bruna , Daniel Hsu

In the worldline formalism, scalar Quantum Electrodynamics on a 2-dimensional lattice is related to the areas of closed loops on this lattice. We exploit this relationship in order to determine the general structure of the moments of the…

Mathematical Physics · Physics 2017-06-23 Thomas Epelbaum , Francois Gelis , Bin Wu

We suggest a new algorithm for finding a canonical representative of a given braid, and also for the harder problem of finding a $\sigma_1$-consistent representative. We conjecture that the algorithm is quadratic-time. We present numerical…

Geometric Topology · Mathematics 2007-05-23 Bert Wiest

Starting from the Maxwell-Juettner equilibrium distribution, we develop a relativistic lattice Boltzmann (LB) algorithm capable of handling ultrarelativistic systems with flat, but expanding, spacetimes. The algorithm is validated through…

Nuclear Theory · Physics 2013-05-29 P. Romatschke , M. Mendoza , S. Succi