Related papers: Black box exceptional groups of Lie type
We study a new class of infinite dimensional Lie algebras, which has important applications to the theory of integrable equations. The construction of these algebras is very similar to the one for automorphic functions and this motivates…
Black box variational inference allows researchers to easily prototype and evaluate an array of models. Recent advances allow such algorithms to scale to high dimensions. However, a central question remains: How to specify an expressive…
A randomized algorithm for computing a compressed representation of a given rank-structured matrix $A \in \mathbb{R}^{N\times N}$ is presented. The algorithm interacts with $A$ only through its action on vectors. Specifically, it draws two…
We consider the problem of interpolating an unknown multivariate polynomial with coefficients taken from a finite field or as numerical approximations of complex numbers. Building on the recent work of Garg and Schost, we improve on the…
We propose the method for obtaining invariants of arbitrary representations of Lie groups that reduces this problem to known problems of linear algebra. The basis of this method is the idea of a special extension of the representation…
The problem of classifying equivalence classes of presentations up to isomorphism of Cayley graphs is considered in this article in the case of dicyclic groups. The number of equivalence classes of presentations is uniformly bounded - it is…
The concept of Automorphic Lie Algebras arises in the context of reduction groups introduced in the early 1980s in the field of integrable systems. Automorphic Lie Algebras are obtained by imposing a discrete group symmetry on a current…
A new structure, based on joining copies of a group by means of a \emph{twist}, has recently been considered to describe the brackets of the two exceptional real Lie algebras of type $G_2$ in a highly symmetric way. In this work we show…
Using the theory of group action, we first introduce the concept of the automorphism group of an exponential family or a graphical model, thus formalizing the general notion of symmetry of a probabilistic model. This automorphism group…
The group Lasso is an extension of the Lasso for feature selection on (predefined) non-overlapping groups of features. The non-overlapping group structure limits its applicability in practice. There have been several recent attempts to…
We prove that if the multiplication group $Mult(L)$ of a connected $2$-dimensional topological loop is a Lie group, then $Mult(L)$ is an elementary filiform nilpotent Lie group of dimension at least $4$. Moreover, we describe loops having…
We present a quantum algorithm which identifies with certainty a hidden subgroup of an arbitrary finite group G in only a polynomial (in log |G|) number of calls to the oracle. This is exponentially better than the best classical algorithm.…
We examine subgroups of locally compact groups that are continuous homomorphic images of connected Lie groups and we give a criterion for being such an image. We also provide a new characterisation of Lie groups and a characterisation of…
We say that a group G is a cube group if it is generated by a set S of involutions such that the corresponding Cayley graph Cay(G,S) is isomorphic to a cube. Equivalently, G is a cube group if it acts on a cube such that the action is…
We present a strong connection between quantum information and quantum permutation groups. Specifically, we define a notion of quantum isomorphisms of graphs based on quantum automorphisms from the theory of quantum groups, and then show…
In this paper, we prove results on the relationship between the complexity of the group and color isomorphism problems. The difficulty of color isomorphism problems is known to be closely linked to the the composition factors of the…
In this paper we give a polynomial-time quantum algorithm for computing orders of solvable groups. Several other problems, such as testing membership in solvable groups, testing equality of subgroups in a given solvable group, and testing…
Two groups are said to have the same character table if a permutation of the rows and a permutation of the columns of one table produces the other table. The problem of determining when two groups have the same character table is…
We classify group gradings on the simple Lie algebras of types $G_2$ and $D_4$ over the field of real numbers (or any real closed field): fine gradings up to equivalence and $G$-gradings, with a fixed group $G$, up to isomorphism.
We introduce a topological property for finitely generated groups called stackable that implies the existence of an inductive procedure for constructing van Kampen diagrams with respect to a particular finite presentation. We also define…