Related papers: Hypergraph encoding set systems and their linear r…
Graph is a fundamental data structure to model interconnections between entities. Set, on the contrary, stores independent elements. To learn graph representations, current Graph Neural Networks (GNNs) primarily use message passing to…
The demand of two-dimensional source coding and constrained coding has been getting higher these days, but compared to the one-dimensional case, many problems have remained open as the analysis is cumbersome. A main reason for that would be…
For a finite set $X$, we say that a set $H\subseteq X$ crosses a partition ${\cal P}=(X_1,\dots,X_k)$ of $X$ if $H$ intersects $\min (|H|,k)$ partition classes. If $|H|\geq k$, this means that $H$ meets all classes $X_i$, whilst for…
In this paper, we present a hypergraph neural networks (HGNN) framework for data representation learning, which can encode high-order data correlation in a hypergraph structure. Confronting the challenges of learning representation for…
The aim of this paper is to survey some aspects of mapping class groups with focus on their finite dimensional representations arising in topological quantum field theory.
In this paper, we determine the diameter of the commuting involution graphs of special and general linear groups over an arbitrary field. It turns out that our results also determine the diameter for certain projective special linear groups…
A hypergraph $G=(V,E)$ is $(k,\ell)$-sparse if no subset $V'\subset V$ spans more than $k|V'|-\ell$ hyperedges. We characterize $(k,\ell)$-sparse hypergraphs in terms of graph theoretic, matroidal and algorithmic properties. We extend…
Hypergraphs are an invaluable tool to understand many hidden patterns in large data sets. Among many ways to represent hypergraph, one useful representation is that of weighted clique expansion. In this paper, we consider this…
Let $F$ be a non-archimedean local field. The classification of the irreducible representations of $GL_n(F)$, $n\ge0$ in terms of supercuspidal representations is one of the highlights of the Bernstein--Zelevinsky theory. We give an…
We consider the problem of translating between irreducible closed sets and implicational bases in closure systems. To date, the complexity status of this problem is widely open, and it is further known to generalize the notorious hypergraph…
We describe an algorithm for splitting permutation representations of finite group over fields of characteristic zero into irreducible components. The algorithm is based on the fact that the components of the invariant inner product in…
If $G$ is a finite group and $k =q>2$ or $k=q+1$ for a prime power $q$ then, for infinitely many integers $v$, there is a $2$-$(v,k,1)$-design ${\bf D}$ for which ${\rm Aut} {\bf D}\cong G$.
End-spaces of infinite graphs naturally generalise the Freudenthal boundary and sit at the interface between graph theory, geometric group theory and topology. Our main result is that every end-space can topologically be represented by a…
A cycle of length $t$ in a hypergraph is an alternating sequence $v_1,e_1,v_2\dots,v_t,e_t$ of distinct vertices $v_i$ and distinct edges $e_i$ so that $\{v_i,v_{i+1}\}\subseteq e_i$ (with $v_{t+1}:=v_1$). Let $\lambda K_n^h$ be the…
In this monograph we undertake a comprehensive study of separable representations (as well as their unitary equivalence classes) of $C^*$-algebras associated to strongly connected finite $k$-graphs $\Lambda$. We begin with the…
In this paper we construct finite dimensional representations of the wreath product symplectic reflection algebra H(k,c,N,G) of rank N attached to a finite subgroup G of SL(2,C) (here k is a number and c a class function on the set of…
The pervasiveness of graphs in today's real life systems is quite evident, where the system either explicitly exists as graph or can be readily modelled as one. Such graphical structure is thus a store house rich information. This has…
Fractional (hyper-)graph theory is concerned with the specific problems that arise when fractional analogues of otherwise integer-valued (hyper-)graph invariants are considered. The focus of this paper is on fractional edge covers of…
This paper focuses on finite-time in-network computation of linear transforms of distributed graph data. Finite-time transform computation problems are of interest in graph-based computing and signal processing applications in which the…
We show that for any finitely generated subgroup $H$ of a limit group $L$ there exists a finite-index subgroup $K$ containing $H$, such that $K$ is a subgroup of a group obtained from $H$ by a series of extensions of centralizers and free…