Related papers: Basis Decompositions and a Mathematica Package for…
Let $\mathfrak{g}$ be an untwisted affine Lie algebra with associated Weyl group $W_a$. To any level 0 weight $\gamma$ we associate a weighted graph $\Gamma_\gamma$ that encodes the orbit of $\gamma$ under the action $W_a$. We show that the…
In modern mathematics, graphs figure as one of the better-investigated class of mathematical objects. Various properties of graphs, as well as graph-processing algorithms, can be useful if graphs of a certain kind are used as denotations…
Inspired by complete graph theory, we demonstrate that a metallic claw "meta-atom" structure can carry a high number of nearly degenerate resonant modes. A photonic meta-crystal composing of a lattice of such meta-atoms exhibits a large…
Let $G_{2n}$ be the Eisenstein series of weight $2n$ for the full modular group $\Gamma=SL_2(\ZZ)$. It is well-known that the space $M_{2k}$ of modular forms of weight $2k$ on $\Gamma$ has a basis $\{G_{4}^\alpha G_{6}^\beta\ |\…
Let $F$ be an arbitrary field and let $f:V\times V\to F$ be a non-degenerate symmetric or alternating bilinear form defined on an $F$-vector space of finite dimension $m\geq 2$. Let $L(f)$ be the subalgebra of $gl(V)$ formed by all…
Finding the most likely (MAP) configuration of a Markov random field (MRF) is NP-hard in general. A promising, recent technique is to reduce the problem to finding a maximum weight stable set (MWSS) on a derived weighted graph, which if…
A general Mackey type decomposition for representations of semisimple Hopf algebras is investigated. We show that such a decomposition occurs in the case that the module is induced from an arbitrary Hopf subalgebra and it is restricted back…
Graph foundation models (GFMs) have recently gained significant attention. However, the unique data processing and evaluation setups employed by different studies hinder a deeper understanding of their progress. Additionally, current…
Questions at the intersection of the AdS/CFT correspondence and quantum information theory motivate the study of projectors in sequences of subalgebras of finite-dimensional commutative associative semisimple algebras $\mathcal{A}$,…
Graph spectral representations are fundamental in graph signal processing, offering a rigorous framework for analyzing and processing graph-structured data. The graph fractional Fourier transform (GFRFT) extends the classical graph Fourier…
We study the problem of constructing a graph Fourier transform (GFT) for directed graphs (digraphs), which decomposes graph signals into different modes of variation with respect to the underlying network. Accordingly, to capture low,…
Multi-modal knowledge graph reasoning (MMKGR) aims to predict the missing links by exploiting both graph structure information and multi-modal entity contents. Most existing works are designed for a transductive setting, which learns…
Suppose a finite, unweighted, combinatorial graph $G = (V,E)$ is the union of several (degree-)regular graphs which are then additionally connected with a few additional edges. $G$ will then have only a small number of vertices $v \in V$…
Weighted hypergraphs are generalizations of weighted simplicial complexes. In recent years, weighted Laplacians of weighted simplicial complexes have been studied. In 2016, as a generalization of the homology of simplicial complexes, the…
We present a new general theory of function-based hypergraph transformations on finite families of finite hypergraphs. A function-based hypergraph transformation formalises the action of structurally modifying hypergraphs from a family in a…
Many multivariate data such as social and biological data exhibit complex dependencies that are best characterized by graphs. Unlike sequential data, graphs are, in general, unordered structures. This means we can no longer use classic,…
We introduce the notion of (nondegenerate) strongly-modular fusion algebras. Here strongly-modular means that the fusion algebra is induced via Verlinde's formula by a representation of the modular group whose kernel contains a congruence…
Graphs and various graph-like combinatorial structures, such as preorders and hypergraphs, are ubiquitous in programming. This paper focuses on representing graphs in a purely functional programming language like Haskell. There are several…
This chapter describes modal decompositions in the framework of matrix factorizations. We highlight the differences between classic space-time decompositions and 2D discrete transforms and discuss the general architecture underpinning…
We define canonical real analytic versions of modular forms of integral weight for the full modular group, generalising real analytic Eisenstein series. They are harmonic Maass waveforms with poles at the cusp, whose Fourier coefficients…