Related papers: An LLL algorithm with symmetries

Lattice rounding in Euclidean space can be viewed as finding the nearest point in the orbit of an action by a discrete group, relative to the norm inherited from the ambient space. Using this point of view, we initiate the study of…

The Lie symmetries of a large class of generalized Toda field theories are studied and used to perform symmetry reduction. Reductions lead to generalized Toda lattices on one hand, to periodic systems on the other. Boundary conditions are…

Clustering is a fundamental primitive in unsupervised learning which gives rise to a rich class of computationally-challenging inference tasks. In this work, we focus on the canonical task of clustering d-dimensional Gaussian mixtures with…

We announce an atlas of subgroup lattices of almost simple groups and present two algorithms that were used to produce the atlas.

As a special type of factorization of finite groups, logarithmic signature (LS) is used as the main component of cryptographic keys for secret key cryptosystems such as PGM and public key cryptosystems like MST1, MST2 and MST3. An LS with…

The Lov\'{a}sz Local Lemma (LLL) is a keystone principle in probability theory, guaranteeing the existence of configurations which avoid a collection $\mathcal B$ of "bad" events which are mostly independent and have low probability. In its…

We analyze all possible symmetry reductions of Lagrangians that yield fully equivalent field equations for any 4-dimensional metric theory of gravity. Specifically, we present a complete list of infinitesimal group actions obeying the…

Partial Least Squares (PLS) methods have been heavily exploited to analyse the association between two blocs of data. These powerful approaches can be applied to data sets where the number of variables is greater than the number of…

We generalize the Plesken-Fabia\'nska $\mathrm{L}_2$-quotient algorithm for finitely presented groups on two or three generators to allow an arbitrary number of generators. The main difficulty lies in a constructive description of the…

We introduce a method for proving Sum-of-Squares (SoS)/ Lasserre hierarchy lower bounds when the initial problem formulation exhibits a high degree of symmetry. Our main technical theorem allows us to reduce the study of the positive…

We show that the partition function of all classical spin models, including all discrete Standard Statistical Models and all abelian discrete Lattice Gauge Theories (LGTs), can be expressed as a special instance of the partition function of…

Lattices defined as modules over algebraic rings or orders have garnered interest recently, particularly in the fields of cryptography and coding theory. Whilst there exist many attempts to generalise the conditions for LLL reduction to…

For a semisimple Lie group $G$, we study Discrete Series representations with admissible branching to a symmetric subgroup $H$. This is done using a canonical associated symmetric subgroup $H_0$, forming a pseudo-dual pair with $H$, and a…

This book provides a gentle introduction to the study of arithmetic subgroups of semisimple Lie groups. This means that the goal is to understand the group SL(n,Z) and certain of its subgroups. Among the major results discussed in the later…

There exist elegant methods of aligning point clouds in $\mathbb R^3$. Unfortunately, these methods fail to generalize to the case of Minkowski space, as we will show. Instead, we propose two solutions to the following problem: given…

We present a polynomial-time reduction of the discrete logarithm problem in any periodic (a.k.a. torsion) semigroup (SGDLP) to the same problem in a subgroup of the same semigroup. It follows that SGDLP can be solved in polynomial time by…

We recently introduced a class of ${\mathbb{Z}}_N$ graded discrete Lax pairs and studied the associated discrete integrable systems (lattice equations). In particular, we introduced a subclass, which we called "self-dual". In this paper we…

The analysis and the classification of all reductions for the nonlinear evolution equations solvable by the inverse scattering method is an interesting and still open problem. We show how the second order reductions of the N-wave…

We prove several inequalities on the determinants of sublattices in LLL-reduced bases. They generalize the inequalities on the length of the shortest vector proven by Lenstra, Lenstra, and Lovasz, and show that LLL-reduction finds not only…

In this work, we study the Lov\'asz local lemma (LLL) problem in the area of distributed quantum computing, which has been the focus of attention of recent advances in quantum computing [STOC'24, STOC'25, STOC'25]. We prove a lower bound of…