Related papers: Extending Snow's algorithm for computations in the…

The orbits of Weyl groups W(B(n)), W(C(n)) and W(D(n)) of the simple Lie algebras B(n), C(n) and D(n) are reduced to the union of the orbits of Weyl groups of the maximal reductive subalgebras of B(n), C(n) and D(n). Matrices transforming…

There is a well-known presentation for finite and affine Weyl groups called the {\it presentation by conjugation}. Recently, it has been proved that this presentation holds for certain sub-classes of extended affine Weyl groups, the Weyl…

Extended affine Weyl groups are the Weyl groups of extended affine root systems. Finite presentations for extended affine Weyl groups are known only for nullities $\leq 2$, where for nullity 2 there is only one known such presentation. We…

Using the \texttt{WeylModules} \textsf{GAP} Package, we compute structural information about certain Weyl modules for type $G_2$ in characteristic $2$. This gives counterexamples to two conjectures stated by S.~Donkin in 1990. It also…

We outline an abstract approach to the pseudo-differential Weyl calculus for operators in function spaces in infinitely many variables. Our earlier approach to the Weyl calculus for Lie group representations is extended to the case of…

For finite Lie algebras, it is shown that characters can be defined first for Weyl orbits and then for irreducible representations. For $A_N$ Lie algebras, weight multiplicities can then be calculated by only stating that characters are…

Let $W_a$ be an affine Weyl group and $\eta:W_a\longrightarrow W_0$ be the natural projection to the corresponding finite Weyl group. We say that $w\in W_a$ has finite Coxeter part if $\eta(w)$ is conjugate to a Coxeter element of $W_0$.…

We correct the proof of the main result in an earlier paper, showing how to parametrize orbital varieties in a complex simple Lie algebra of type $D$ in terms of domino tableaux and showing how to compute variety attached to any element of…

Deep kernel processes are a recently introduced class of deep Bayesian models that have the flexibility of neural networks, but work entirely with Gram matrices. They operate by alternately sampling a Gram matrix from a distribution over…

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…

In this article, we show that conjugacy classes of classical Weyl groups $W(B_{n})$ and $W(D_{n})$ are of $\textit{type D}$. Consequently, we obtain that Nichols algebras of irreducible Yetter-Drinfeld modules over the classical Weyl groups…

Let $\varPhi$ be a root system of a finite Weyl group $W$ with simple roots $\Delta$ and corresponding simple reflections $S$. For $J \subseteq S$, denote by $W_J$ the standard parabolic subgroup of $W$ generated by $J$, and by $\Delta_J…

We describe boundedness and compactness properties for the operators obtained by the Weyl-Pedersen calculus in the case of the irreducible unitary representations of nilpotent Lie groups that are associated with flat coadjoint orbits. We…

The open-source Python package, su4-branching, is introduced for the derivation of comprehensive spin S and isospin T branching rules for any SU(4) irreducible representation.The Wigner supermultiplet scheme in nuclear and hadronic physics…

Constructive algorithms, requiring no more than $2\times 2$ matrix manipulations, are provided for finding the entries of the positive definite factor in the polar decomposition of matrices in sixteen groups preserving a bilinear form in…

Efficient methods for computing with matrices over finite fields often involve randomised algorithms, where matrices with a certain property are sought via repeated random selection. Complexity analyses for these algorithms require…

We compute all sections of the finite Weyl group, that satisfy the braid relations, in the case that G is an almost-simple connected reductive group defined over an algebraically closed field. We then demonstrate that this set of sections…

We construct an algorithm that, given a pair of homomorphisms between polycyclic-by-finite groups, determines whether their Reidemeister number is finite, and if so returns a set of representatives of the twisted conjugacy classes.…

We introduce an ensemble learning scheme for community detection in complex networks. The scheme uses a Machine Learning algorithmic paradigm we call Extremal Ensemble Learning. It uses iterative extremal updating of an ensemble of network…

By algebraic group theory, there is a map from the semisimple conjugacy classes of a finite group of Lie type to the conjugacy classes of the Weyl group. Picking a semisimple class uniformly at random yields a probability measure on…