Related papers: Nest representations of directed graph algebras

Recently, there has been interest in representing single graphs by multiple drawings; for example, using graph stories, storyplans, or uncrossed collections. In this paper, we apply this idea to orthogonal graph drawing. Due to the…

Graph representation learning aims at transforming graph data into meaningful low-dimensional vectors to facilitate the employment of machine learning and data mining algorithms designed for general data. Most current graph representation…

Let $\mathcal{M}$ and $\mathcal{N}$ be nests on separable Hilbert space. If the two nest algebras are distance less than 1 ($d(\mathcal{T}(\mathcal{M}),\mathcal{T}(\mathcal{N})) < 1$), then the nests are distance less than 1…

Let $\mathcal{G}$ be a quasi-split connected reductive group over a non-archimedean local field $F.$ In this paper, we prove the formal degree conjecture for discrete series representations contained in a principal series of…

We consider the oriented graph whose vertices are isomorphism classes of finitely generated groups, with an edge from G to H if, for some generating set T in H and some sequence of generating sets S_i in G, the marked balls of radius i in…

Given a finite set of points in $\mathbb{R}^d$, Tverberg's theorem guarantees the existence of partitions of this set into parts whose convex hulls intersect. We introduce a graph structured on the family of Tverberg partitions of a given…

We wish to understand how irreducible representations of a group G behave when restricted to a subgroup G' (the branching problem). Our primary concern is with representations of reductive Lie groups, which involve both algebraic and…

We consider the problem of classifying those graphs that arise as an undirected square of an oriented graph by generalising the notion of quasi-transitive directed graphs to mixed graphs. We fully classify those graphs of maximum degree…

Let $Q$ be a subset of a finite distributive lattice $D$. An algebra $A$ represents the inclusion $Q\subseteq D$ by principal congruences if the congruence lattice of $A$ is isomorphic to $D$ and the ordered set of principal congruences of…

In this note we present a complete analysis of finite dimensional representations of the Lie superalgebra sl(2|1). This includes, in particular, the decomposition of all tensor products into their indecomposable building blocks. Our…

We consider (not necessarily proper) colorings of the vertices of a graph where every color is thoroughly distributed, that is, appears in every open neighborhood. Equivalently, every color is a total dominating set. We define $\td(G)$ as…

Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$. A family $\mathcal{S}$ of nonempty sets $\{S_1,\ldots,S_n\}$ is a set representation of $G$ if there exists a one-to-one correspondence between the vertices $v_1, \ldots, v_n$…

Graph Neural Networks (GNNs) have emerged as powerful tools for learning representations of graph-structured data, demonstrating remarkable performance across various tasks. Recognising their importance, there has been extensive research…

We study the subgroup structure, Hecke algebras, quasi-regular representations, and asymptotic properties of some fractal groups of branch type. We introduce parabolic subgroups, show that they are weakly maximal, and that the corresponding…

Let $k$ be an algebraically closed field of characteristic 0, $Y=k^{r}\times {(k^{\times})}^{s}$ and let $G$ be an algebraic torus acting diagonally on the ring of differential operators $\cD (Y)^G$. We give necessary and sufficient…

A dominating set of a graph $G$ is a set $D$ of vertices of $G$ such that every vertex outside $D$ is adjacent to a vertex in $D$. A locating-dominating set of $G$ is a dominating set $D$ of $G$ with the additional property that every two…

We consider the structure of algebra of operators, acting in $n-$fold tensor product space, which are partially transposed on the last term. Using purely algebraical methods we show that this algebra is semi-simple and then, considering its…

In this thesis, I present an associative diagram algebra that is a faithful representation of a particular Temperley--Lieb algebra of type affine $C$, which has a basis indexed by the fully commutative elements of the Coxeter group of the…

Let $G$ be a nontrivial connected graph with vertex set $V(G)$. A set of vertices $D\subseteq V(G)$ is called a total outer-independent dominating set of $G$ if every vertex of $G$ is adjacent to at least one vertex in $D$, and…

Discrete-Time Dynamic Graphs (DTDGs), which are prevalent in real-world implementations and notable for their ease of data acquisition, have garnered considerable attention from both academic researchers and industry practitioners. The…