Related papers: Nest representations of directed graph algebras

The goal of this paper is to study the representation theory of a classical infinite-dimensional Lie algebra - the Lie algebra of vector fields on an N-dimensional torus for N > 1. The case N=1 gives a famous Virasoro algebra (or its…

Let G = Aut(T) be the automorphism group of a regular tree T. We study continuous irreducible representations of G that preserve a continuous strongly nondegenerate sesquilinear form of finite index on a Hilbert space. These are already…

Dynamic graphs provide a flexible data abstraction for modelling many sorts of real-world systems, such as transport, trade, and social networks. Graph neural networks (GNNs) are powerful tools allowing for different kinds of prediction and…

We study quantized enveloping algebras called twisted Yangians. They are analogues of the Yangian Y(gl(N)) for the classical Lie algebras of B, C, and D series. The twisted Yangians are subalgebras in Y(gl(N)) and coideals with respect to…

We consider problems of finding a maximum size/weight $t$-matching without forbidden subgraphs in an undirected graph $G$ with the maximum degree bounded by $t+1$, where $t$ is an integer greater than $2$. Depending on the variant forbidden…

A total dominating set of a graph $G$ is a set $D$ of vertices of $G$ such that every vertex of $G$ has a neighbor in $D$. A locating-total dominating set of $G$ is a total dominating set $D$ of $G$ with the additional property that every…

Nested logit (NL) has been commonly used for discrete choice analysis, including a wide range of applications such as travel mode choice, automobile ownership, or location decisions. However, the classical NL models are restricted by their…

We analyse a class of quantum field theory models illustrating some of the possibilities that have emerged in the general study of the short distance properties of superselection sectors, performed in a previous paper (together with R.…

The representation complexity of a bipartite graph $G=(P,Q)$ is the minimum size $\sum_{i=1}^s (|A_i|+|B_i|)$ over all possible ways to write $G$ as a (not necessarily disjoint) union of complete bipartite subgraphs $G=\cup_{i=1}^s…

Let G be a real or complex linear algebraic reductive group. Let H and F be reductive subgroups. We study the natural H action on G/F. The main theorem of this note shows that generic H orbits are closed. This theorem is then applied to…

Let $G$ be a finite group, $H$ be a normal subgroup of prime index $p$. Let $F$ be a field of either characteristic $0$ or prime to $|G|$. Let $\eta$ be an irreducible $F$-representation of $H$. If $F$ is an algebraically closed field of…

In recent times a new kind of representations has been used to describe superselection sectors of the observable net over a curved spacetime, taking into account of the effects of the fundamental group of the spacetime. Using this notion of…

A Gelfand model for a semisimple algebra A over C is a complex linear representation that contains each irreducible representation of A with multiplicity exactly one. We give a method of constructing these models that works uniformly for a…

Equivariant Graph Neural Networks (GNNs) that incorporate E(3) symmetry have achieved significant success in various scientific applications. As one of the most successful models, EGNN leverages a simple scalarization technique to perform…

A graph $G=(V,E)$ is representable if there exists a word $W$ over the alphabet $V$ such that letters $x$ and $y$ alternate in $W$ if and only if $(x,y)\in E$ for each $x\neq y$. If $W$ is $k$-uniform (each letter of $W$ occurs exactly $k$…

Hadwiger's conjecture asserts that if a simple graph $G$ has no $K_{t+1}$ minor, then its vertex set $V(G)$ can be partitioned into $t$ stable sets. This is still open, but we prove under the same hypotheses that $V(G)$ can be partitioned…

We classify the finite dimensional irreducible representations of rectangular finite $W$-algebras, i.e., the finite $W$-algebras $U(\mathfrak{g}, e)$ where $\mathfrak{g}$ is a symplectic or orthogonal Lie algebra and $e \in \mathfrak{g}$ is…

Existence of superdecomposable pure-injective modules reflects complexity in the category of finite-dimensional representations over an algebra. Such an existence occurs when an algebra is non-domestic; a conjecture due to M. Prest. G.…

Pairwise compatibility graphs (PCGs) with non-negative integer edge weights recently have been used to describe rare evolutionary events and scenarios with horizontal gene transfer. Here we consider the case that vertices are separated by…

The problem of representing nodes in a signed network as low-dimensional vectors, known as signed network embedding (SNE), has garnered considerable attention in recent years. While several SNE methods based on graph convolutional networks…