Related papers: An LLL algorithm with symmetries
In this paper we consider a generalized Kuramoto-Sivashinsky equation. The equivalence group of the class under consideration has been constructed. This group allows us to perform a comprehensive study and a clear and concise formulation of…
We show that the Tensor Renormalization Group (TRG) method can be applied to O(N) spin models, principal chiral models and pure gauge theories (Z2, U(1) and SU(2)) on (hyper) cubic lattices. We explain that contrarily to some common belief,…
The article considers symmetric general linear methods, a class of numerical time integration methods which, like symmetric Runge--Kutta methods, are applicable to general time--reversible differential equations, not just those derived from…
The Lorentz group is the fundamental language for space-time symmetries of relativistic particles. This group can these days be derived from the symmetries observed in other branches of physics. It is shown that this group can be derived…
The Lov\'{a}sz Local Lemma is a very powerful tool in probabilistic combinatorics, that is often used to prove existence of combinatorial objects satisfying certain constraints. Moser and Tardos have shown that the LLL gives more than just…
The Group-Lasso is a well-known tool for joint regularization in machine learning methods. While the l_{1,2} and the l_{1,\infty} version have been studied in detail and efficient algorithms exist, there are still open questions regarding…
The estimation problem in a high regression model with structured sparsity is investigated. An algorithm using a two steps block thresholding procedure called GR-LOL is provided. Convergence rates are produced: they depend on simple…
Following Lazard, we study the $N$-series of a group $G$ and their associated graded Lie algebras. The main examples we consider are the lower central series (LCS), Stallings' rational and mod-$q$ versions, and Zassenhaus' mod-$p$ version…
Fix an integral semisimple element $\lambda$ in the Lie algebra $\mathfrak{g}$ of a complex reductive algebraic group $G$. Let $L$ denote the centralizer of $\lambda$ in $G$ and let $\mathfrak{g}(-1)$ denote the $-1$ eigenspace of…
A Lattice is a partially ordered set where both least upper bound and greatest lower bound of any pair of elements are unique and exist within the set. K\"{o}tter and Kschischang proved that codes in the linear lattice can be used for error…
A lattice of integers is the collection of all linear combinations of a set of vectors for which all entries of the vectors are integers and all coefficients in the linear combinations are also integers. Lattice reduction refers to the…
In statistics, the least absolute shrinkage and selection operator (Lasso) is a regression method that performs both variable selection and regularization. There is a lot of literature available, discussing the statistical properties of the…
The Little map and the Edelman-Greene insertion algorithm, a generalization of the Robinson-Schensted correspondence, are both used for enumerating the reduced decompositions of an element of the symmetric group. We show the Little map…
Lie-symmetry methods are used to determine the symmetry group of reduced magnetohydrodynamics. This group allows for arbitrary, continuous transformations of the fields themselves, along with space-time transformations. The derivation…
It is old folklore that the violation of Leibniz rule on a lattice is an obstruction for constructing a lattice supersymmetric model. While it is still true for full supersymmetry, we show that a slightly modified form of the Leibniz rule,…
We provide an algorithm for computing an effective basis of homology of elliptic surfaces over the complex projective line on which integration of periods can be carried out. This allows the heuristic recovery of several algebraic…
We provide a new branching rule from the general linear group $GL_{2n}(\mathbb{C})$ to the symplectic group $Sp_{2n}(\mathbb{C})$ by establishing a simple algorithm which gives rise to a bijection from the set of semistandard tableaux of a…
We consider several subgroup-related algorithmic questions in groups, modeled after the classic computational lattice problems, and study their computational complexity. We find polynomial time solutions to problems like finding a subgroup…
We propose a new stochastic L-BFGS algorithm and prove a linear convergence rate for strongly convex and smooth functions. Our algorithm draws heavily from a recent stochastic variant of L-BFGS proposed in Byrd et al. (2014) as well as a…
We give a method to describe all congruence images of a finitely generated Zariski dense group $H \leq \mathrm{SL}(n, \mathbb{Z})$. The method is applied to obtain efficient algorithms for solving this problem in odd prime degree $n$; if…