Related papers: An LLL algorithm with symmetries

We classify solvable Lie groups admitting left invariant symplectic half-flat structure. When the Lie group has a compact quotient by a lattice, we show that these structures provide solutions of supersymmetric equations of type IIA.

We study differentially private stochastic optimization in convex and non-convex settings. For the convex case, we focus on the family of non-smooth generalized linear losses (GLLs). Our algorithm for the $\ell_2$ setting achieves optimal…

Sparse prediction with categorical data is challenging even for a moderate number of variables, because one parameter is roughly needed to encode one category or level. The Group Lasso is a well known efficient algorithm for selection…

Let Gamma be a lattice in a simply-connected solvable Lie group. We construct a Q-defined algebraic group A such that the abstract commensurator of Gamma is isomorphic to A(Q) and Aut(Gamma) is commensurable with A(Z). Our proof uses the…

The aim of the paper is to study the group schemes $G:=\operatorname{SL}_{2, A}, \operatorname{GL}_{2,A}$ and universal Clebsch-Gordan filtrations. Here $A$ is a field or any commutative ring. If $V:=A\{e_1,e_2\}$ is the free rank $2$…

An algorithm of the tensor renormalization group is proposed based on a randomized algorithm for singular value decomposition. Our algorithm is applicable to a broad range of two-dimensional classical models. In the case of a square…

For optimization problems with nonlinear constraints, linearly constrained Lagrangian (LCL) methods sequentially minimize a Lagrangian function subject to linearized constraints. These methods converge rapidly near a solution but may not be…

We give a long exact sequence for the homology of a graded atomic lattice equipped with a sheaf of modules, in terms of the deleted and restricted lattices. This is then used to compute the homology of the arrangement lattice of a…

We study the Steinberg lattice of the general linear group when reduced modulo a prime different from the defining characteristic.

The determination of scalars involved in Lusztig's conjecture for finite reductive groups $G(F_q)$ was achieved by Waldspurger in the case of symplectic groups or orthogonal groups, under the condition that $p,q$ are large enough. Here $p$…

We determine the normalizer in $SL_{2}(\mathbb{R})$ of several families of congruence subgroups of $SL_{2}(\mathbb{Z})$. In addition, we show how these tools can be used to evaluate the groups of automorphisms and the discriminant kernels…

We produce an example of an irreducible discrete subgroup in the product $SL(2,\R)\times SL(2,\R)$ which is not a lattice. This answers a question asked in [15].

Global optimization problems with a quasi-concave objective function and linear constraints are studied. We point out that various other classes of global optimization problems can be expressed in this way. We present two algorithms, which…

We classify the linearly reductive finite subgroup schemes $G$ of $SL_2=SL(V)$ over an algebraically closed field $k$ of positive characteristic, up to conjugation. As a corollary, we prove that such $G$ is in one-to-one correspondence with…

This paper introduces a new subtraction operation for convex sets, which defines their difference as a collection of inclusion-minimal convex sets with appropriate definitions of linear operations on them. With these operations the set of…

We propose a symmetric low-rank representation (SLRR) method for subspace clustering, which assumes that a data set is approximately drawn from the union of multiple subspaces. The proposed technique can reveal the membership of multiple…

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…

The Lovasz Local Lemma (LLL) is a powerful result in probability theory that states that the probability that none of a set of bad events happens is nonzero if the probability of each event is small compared to the number of events that…

The Lov\'{a}sz Local Lemma (LLL) is a cornerstone principle in the probabilistic method of combinatorics, and a seminal algorithm of Moser & Tardos (2010) provides an efficient randomized algorithm to implement it. This can be parallelized…

We propose a novel Linear Program (LP) based formula- tion for solving jigsaw puzzles. We formulate jigsaw solving as a set of successive global convex relaxations of the stan- dard NP-hard formulation, that can describe both jigsaws with…