Related papers: Combinatorial Constructions of Weight Bases: The G…
A commutative Poisson subalgebra of the Poisson algebra of polynomials on the Lie algebra of n x n matrices over ${\Bbb C}$ is introduced which is the Poisson analogue of the Gelfand-Zeitlin subalgebra of the universal enveloping algebra.…
Combinatorial and topological structures, such as graphs, simplicial complexes, and cell complexes, form the foundation of geometric and topological deep learning (GDL and TDL) architectures. These models aggregate signals over such…
In this paper we construct bases of standard (i.e. integrable highest weight) modules $L(\Lambda)$ for affine Lie algebra of type $B_2\sp{(1)}$ consisting of semi-infinite monomials. The main technical ingredient is a construction of…
A Gelfand-Tsetlin tableau $T(v)$ induces a character $\chi_v$ of the Gelfand-Tsetlin subalgebra $\Gamma$ of $U = U(\mathfrak{gl}(n,\mathbb C))$. By a theorem due to Ovsienko, for each tableau $T(v)$ there exists a finite number of…
The goal of this paper is to lay the foundations for a combinatorial study, via orthogonal functions and intertwining operators, of category O for the rational Cherednik algebra of type G(r,p,n). As a first application, we give a…
We define a general notion of Gel'fand-Tsetlin algebras in the framework of inductive limit of the family semisimple star-algebras and the notion of genralized conditional expectations. The inmverse limit of such family with respect to…
We present GDLNN, a new graph machine learning architecture, for graph classification tasks. GDLNN combines a domain-specific programming language, called GDL, with neural networks. The main strength of GDLNN lies in its GDL layer, which…
In the representation theory of simple Lie algebras, we consider the problem of constructing a "canonical" weight basis in an arbitrary irreducible finite-dimensional highest weight module. Vinberg suggested a method for constructing such…
The universal enveloping algebra of any semisimple Lie algebra $\mathfrak{g}$ contains a family of maximal commutative subalgebras, called shift of argument subalgebras, parametrized by regular Cartan elements of $\mathfrak{g}$. For…
Various specifiable combinatorial structures, with d extensive parameters, can be exactly sampled both by the recursive method, with linear arithmetic complexity if a heavy preprocessing is performed, or by the Boltzmann method, with…
The universal enveloping algebra of any semisimple Lie algebra $\mathfrak{g}$ contains a family of maximal commutative subalgebras, called shift of argument subalgebras, parametrized by regular Cartan elements of $\mathfrak{g}$. For…
Let g be a semisimple Lie algebra over the real numbers. We describe an explicit combinatorial construction of the real Weyl group of g with respect to a given Cartan subalgebra. An efficient computation of this Weyl group is important for…
We associate to an arbitrary positive root $\alpha$ of a complex semisimple finite-dimensional Lie algebra $\mfrak{g}$ a twisting endofunctor $T_\alpha$ of the category of $\mfrak{g}$-modules. We apply this functor to generalized Verma…
An explicit algorithmic construction is given for orthogonal bases for spaces of homogeneous polynomials, in the context of Hermitean Clifford analysis, which is a higher dimensional function theory centred around the simultaneous null…
We introduce a simple initial working system in which relations (such as part-whole) are directly represented via an architecture with operating and learning rules fundamentally distinct from standard artificial neural network methods.…
We give new combinatorial formulae for vector-valued weight functions (off-shell nested Bethe vectors) for the evaluation modules over the Yangian Y(gl_n). This paper extends the result for the Yangian Y(gl_4) established earlier in…
In [2] M. Farber constructed invariants of m-component boundary links with values in algebra of noncommutative rational functions. In this paper we simplify his constructions and express them by using noncommutative generalizations of…
We consider the gl(N)-invariant Calogero-Sutherland Models with N=1,2,3,... in a unified framework, which is the framework of Symmetric Polynomials. By the framework we mean an isomorphism between the space of states of the gl(N)-invariant…
We give new combinatorial formulae for vector-valued weight functions (off-shell nested Bethe vectors) for the evaluation modules over the Yangian $Y(\mathfrak{gl}_4)$. The case of $Y(\mathfrak{gl}_n)$ for an arbitrary $n$ is considered in…
The present work is a part of a larger program to construct explicit combinatorial models for the (indecomposable) regular representation of the nilpotent factor $N$ in the Iwasawa decomposition of a semi-simple Lie algebra $\mathfrak g$,…