Related papers: Hypergraph encoding set systems and their linear r…

A $t\text{-}(n,k,\lambda;q)$-design is a set of $k$-subspaces, called blocks, of an $n$-dimensional vector space $V$ over the finite field with $q$ elements such that each $t$-subspace is contained in exactly $\lambda$ blocks. A partition…

It is known that the notion of a transitive subgroup of a permutation group $G$ extends naturally to subsets of $G$. We consider subsets of the general linear group $\operatorname{GL}(n,q)$ acting transitively on flag-like structures, which…

In math.RT/0302174 we developed a framework to study representations of groups of the form $G((t))$, where $G$ is an algebraic group over a local field $K$. The main feature of this theory is that natural representations of groups of this…

AG codes correspond geometrically to points in the Grassmannian of k-planes in an n-dimensional projective space PG(n, F_q) defined over a finite field F_q of q elements. We prove that invariant subgrassmannians by the action of a triangle…

In this paper, we develop a representation-theoretic formulation of discrete-time linear systems. We show that such systems are naturally viewed as representations of time groups acting on vector spaces, thereby endowing the state space…

Non-uniform hypergraphs appear in various domains of computer science as in the satisfiability problems and in data analysis. We analyse a general model where the probability for an edge of size $t$ to belong to the hypergraph depends of a…

Preface (A.Vershik) - about these texts (3.); I.Interpolation between inductive and projective limits of finite groups with applicatons to linear groups over finite fields; II.The characters of the groups of almost triangle matrices over…

In a recent paper Cameron, Lakshmanan and Ajith began an exploration of hypergraphs defined on algebraic structures, especially groups, to investigate whether this can add a new perspective. Following their suggestions, we consider suitable…

We classify all triples $(G,V,H)$ such that $SL_n(q)\leq G\leq GL_n(q)$, $V$ is a representation of $G$ of dimension greater than one over an algebraically closed field $\FF$ of characteristic coprime to $q$, and $H$ is a proper subgroup of…

Let PG$(\mathbb{F}_q^v)$ be the $(v-1)$-dimensional projective space over $\mathbb{F}_q$ and let $\Gamma$ be a simple graph of order ${q^k-1\over q-1}$ for some $k$. A 2$-(v,\Gamma,\lambda)$ design over $\mathbb{F}_q$ is a collection $\cal…

Graph Transformers (GTs) facilitate the comprehension of graph-structured data by calculating the self-attention of node pairs without considering node position information. To address this limitation, we introduce an innovative and…

Beyond word embeddings, continuous representations of knowledge graph (KG) components, such as entities, types and relations, are widely used for entity mention disambiguation, relation inference and deep question answering. Great strides…

We propose a new representation of $k$-partite, $k$-uniform hypergraphs, that is, a hypergraph with a partition of vertices into $k$ parts such that each hyperedge contains exactly one vertex of each type; we call them $k$-hypergraphs for…

We investigate group coding for arbitrary finite groups acting linearly on a vector space. These yield robust codes based on real or complex matrix groups. We give necessary and sufficient conditions for correct subgroup decoding using…

A subset $Y$ of the general linear group $\operatorname{GL}(n,q)$ is called $t$-intersecting if $\operatorname{rk}(x-y)\le n-t$ for all $x,y\in Y$, or equivalently $x$ and $y$ agree pointwise on a $t$-dimensional subspace of…

Topological drawings are natural representations of graphs in the plane, where vertices are represented by points, and edges by curves connecting the points. Topological drawings of complete graphs and of complete bipartite graphs have been…

As set systems, hypergraphs are omnipresent and have various representations ranging from Euler and Venn diagrams to contact representations. In a geometric representation of a hypergraph $H=(V,E)$, each vertex $v\in V$ is associated with a…

Molecular graphs generally contain subgraphs (known as groups) that are identifiable and significant in composition, functionality, geometry, etc. Flat latent representations (node embeddings or graph embeddings) fail to represent, and…

Motivated by the theory of graph limits, we introduce and study the convergence and limits of linear representations of finite groups over finite fields. The limit objects are infinite dimensional representations of free groups in…

We study a family of complex representations of the group GL(n,O), where O is the ring of integers of a non-archimedean local field F. These representations occur in the restriction of the Grassmann representation of GL(n,F) to its maximal…