Related papers: Multilinear Hyperquiver Representations

Deep representation learning on non-Euclidean data types, such as graphs, has gained significant attention in recent years. Invent of graph neural networks has improved the state-of-the-art for both node and the entire graph representation…

In tensor eigenvalue problems, one is likely to be more interested in H-eigenvalues of tensors. The largest H-eigenvalue of a nonnegative tensor or of a uniform hypergraph is the spectral radius of the tensor or of the uniform hypergraph.…

In this paper we develop a framework to study observability for uniform hypergraphs. Hypergraphs, being extensions of graphs, allow edges to connect multiple nodes and unambiguously represent multi-way relationships which are ubiquitous in…

Adjacency between two vertices in graphs or hypergraphs is a pairwise relationship. It is redefined in this article as 2-adjacency. In general hypergraphs, hyperedges hold for $n$-adic relationship. To keep the $n$-adic relationship the…

We study systems of linear and semilinear mappings considering them as representations of a directed graph $G$ with full and dashed arrows: a representation of $G$ is given by assigning to each vertex a complex vector space, to each full…

We study the geometry of the algebraic set of tuples of composable matrices which multiply to a fixed matrix, using tools from the theory of quiver representations. In particular, we determine its codimension $C$ and the number $\theta$ of…

In many data-driven applications, higher-order relationships among multiple objects are essential in capturing complex interactions. Hypergraphs, which generalize graphs by allowing edges to connect any number of nodes, provide a flexible…

In this paper, we propose a simple and effective {geometric} model fitting method to fit and segment multi-structure data even in the presence of severe outliers. We cast the task of geometric model fitting as a representative mode-seeking…

Relying on the combinatorial classification of toric ideals using their bouquet structure, we focus on toric ideals of hypergraphs and study how they relate to general toric ideals. We show that hypergraphs exhibit a surprisingly general…

We present a simple proof for the universality of invariant and equivariant tensorized graph neural networks. Our approach considers a restricted intermediate hypothetical model named Graph Homomorphism Model to reach the universality…

Using Schofield's characterization of the dimension vectors of general subrepresentations of a representation of a quiver, we give a direct proof of the Derksen-Weyman saturation property.

Associated to any hypergraph is a toric ideal encoding the algebraic relations among its edges. We study these ideals and the combinatorics of their minimal generators, and derive general degree bounds for both uniform and non-uniform…

Orthogonal decomposition of tensors is a generalization of the singular value decomposition of matrices. In this paper, we study the spectral theory of orthogonally decomposable tensors. For such a tensor, we give a description of its…

In a series of recent works, we have generalised the consistency results in the stochastic block model literature to the case of uniform and non-uniform hypergraphs. The present paper continues the same line of study, where we focus on…

For a fixed root of a quiver, it is a very hard problem to construct all or even only one indecomposable representation with this root as dimension vector. We investigate two methods which can be used for this purpose. In both cases we get…

The survey contains a brief description of the ideas, constructions, results, and prospects of the theory of hypergroups and generalized translation operators. Representations of hypergroups are considered, being treated as continuous…

We use group representation theory to give algebraic formulae to compute complete transversals of singularities of vector fields, either in the nonsymmetric or in the reversible equivariant contexts. This computation produces normal forms…

We consider quiver representations respecting a quiver automorphism and show that the dimension vectors of the indecomposables are precisely the positive roots of an associated symmetrisable Kac-Moody Lie algebra. Moreover, every such Lie…

We establish a characterization of the vertices of a tropical polyhedron defined as the intersection of finitely many half-spaces. We show that a point is a vertex if, and only if, a directed hypergraph, constructed from the…

Graph neural networks have recently achieved remarkable success in representing graph-structured data, with rapid progress in both the node embedding and graph pooling methods. Yet, they mostly focus on capturing information from the nodes…