Related papers: HNN extensions and embedding theorems for groups

Graph neural network (GNN)'s success in graph classification is closely related to the Weisfeiler-Lehman (1-WL) algorithm. By iteratively aggregating neighboring node features to a center node, both 1-WL and GNN obtain a node representation…

In this paper we survey recent developments in the theory of groups acting on $\Lambda$-trees. We are trying to unify all significant methods and techniques, both classical and recently developed, in an attempt to present various faces of…

Despite recent advances in representation learning in hypercomplex (HC) space, this subject is still vastly unexplored in the context of graphs. Motivated by the complex and quaternion algebras, which have been found in several contexts to…

The K-theoretic Farrell-Jones isomorphism conjecture for a group ring $R[G]$ has been proved for several groups. The toolbox for proving the Farrell-Jones conjecture for a given group depends on some geometric properties of the group as it…

Knowledge Graph(KG) has gained traction as a machine-readable organization of real-world knowledge for analytics using artificial intelligence systems. Graph Neural Network(GNN), is proven to be an effective KG embedding technique that…

This expository paper contains a detailed introduction to some important works concerning the Gauss-Bonnet-Chern theorem. The study of this theorem has a long history dating back to Gauss's Theorema Egregium (Latin: Remarkable Theorem) and…

Graph spectra are an important class of structural features on graphs that have shown promising results in enhancing Graph Neural Networks (GNNs). Despite their widespread practical use, the theoretical understanding of the power of…

Kingman's Theorem on skeleton limits---passing from limits as $n\to \infty $ along $nh$ ($n\in \mathbb{N}$) for enough $h>0$ to limits as $t\to \infty $ for $t\in \mathbb{R}$---is generalized to a Baire/measurable setting via a topological…

Semistability at infinity is an asymptotic property of finitely presented groups that is needed in order to effectively define the fundamental group at infinity for a 1-ended group. It is an open problem whether or not all finitely…

This paper is partly a survey of certain kinds of results and proofs in additive combinatorics, and partly a discussion of how useful the finite-dimensional Hahn-Banach theorem can be. The most interesting single result is probably a…

In his study of amenable unitary representations, M. E. B. Bekka asked if there is an analogue for such representations of the remarkable fixed-point property for amenable groups. In this paper, we prove such a fixed-point theorem in the…

This article is about Artin's braid group and its role in knot theory. We set ourselves two goals: (i) to provide enough of the essential background so that our review would be accessible to graduate students, and (ii) to focus on those…

We prove a rank-one theorem \`a la G. Alberti for the derivatives of vector-valued maps with bounded variation in a class of Carnot groups that includes Heisenberg groups $\mathbb H^n$ for $n\geq 2$. The main tools are properties relating…

Given a group action on a finite set, we define the group-action model which consists of tensor network diagrams which are invariant under the group symmetry. In particular, group-action models can be realized as the even part of…

Deep multi-task learning attracts much attention in recent years as it achieves good performance in many applications. Feature learning is important to deep multi-task learning for sharing common information among tasks. In this paper, we…

We present a dataset and experiments on applying recurrent neural networks (RNNs) for guiding clause selection in the connection tableau proof calculus. The RNN encodes a sequence of literals from the current branch of the partial proof…

In this paper, we explore some interesting applications of the matrix tree theorem. In particular, we present a combinatorial interpretation of a distribution of $(n-1)^{n-1}$, in the context of uprooted spanning trees of the complete graph…

Given a hypergraph G, we introduce a Grassmann algebra over the vertex set, and show that a class of Grassmann integrals permits an expansion in terms of spanning hyperforests. Special cases provide the generating functions for rooted and…

The growing interest in hypergraph neural networks (HGNNs) is driven by their capacity to capture the complex relationships and patterns within hypergraph structured data across various domains, including computer vision, complex networks,…

In recent lattice QCD studies, the Feynman-Hellmann theorem is often used to estimate separate contributions of the connected and disconnected diagrams to the nucleon sigma term. We demonstrate through a simple analysis within an effective…