Related papers: Invariant tensors and graphs
Let G = (V, E) be a finite simple connected graph. We say a graph G realizes a code of the type 0^s_1 1^t_1 0^s_2 1^t_2 ... 0^s_k1^t_k if and only if G can obtained from the code by some rule. Some classes of graphs such as threshold and…
Here, the structural symmetries of a hypergraph are represented through equivalence relations on the vertex set of the hypergraph. A matrix associated with the hypergraph may not reflect a specific structural symmetry. In the context of a…
Based on \cite{DH94}, we introduce a bijective correspondence between first order differential calculi and the graph structure of the symmetric lattice that allows one to encode completely the interconnection structure of the graph in the…
Toral automorphisms, represented by unimodular integer matrices, are investigated with respect to their symmetries and reversing symmetries. We characterize the symmetry groups of GL(n,Z) matrices with simple spectrum through their…
Let $F$ be a non-Archimedean local field. Let $\mathcal{A}_n(F)$ be the set of equivalence classes of irreducible admissible representations of $\textrm{GL}_n(F)$, and $\mathcal{G}_n(F)$ be the set of equivalence classes of n-dimensional…
Although theoretical properties such as expressive power and over-smoothing of graph neural networks (GNN) have been extensively studied recently, its convergence property is a relatively new direction. In this paper, we investigate the…
Maps from links in thickened surfaces to flat-virtual links help to construct invariants of links using invariants of flat-virtual links. This work is dedicated to investigation of equivalence and invariants of flat-virtual diagrams…
In this paper we present a combinatorial machinery, consisting of a graph tower $\overleftarrow \Gamma$ and vector towers $\overleftarrow v$ on $\overleftarrow \Gamma$, which allows us to efficiently describe all invariant measures $\mu =…
We construct a family of groups from suitable higher rank graphs which are analogues of the finite symmetric groups. We introduce homological invariants showing that many of our groups are, for example, not isomorphic to $nV$, when $n \geq…
This paper defines, for each graph $G$, a flag vector $fG$. The flag vectors of the graphs on $n$ vertices span a space whose dimension is $p(n)$, the number of partitions on $n$. The analogy with convex polytopes indicates that the linear…
We introduce a graphical representation for a global SO(n) tensor $\pl_\m\pl_\n h_\ab$, which generally appears in the perturbative approach of gravity around the flat space: $g_\mn=\del_\mn+h_\mn$. We systematically construct global SO(n)…
We consider Lorentz invariant scalar-tensor teleparallel gravity theories with a Lagrangian built from the torsion scalar, a scalar field, its kinetic term and a derivative coupling between the torsion and the scalar field. The field…
This paper studies the existence of invariant smooth Lagrangian graphs for Tonelli Hamiltonian systems with symmetries. In particular, we consider Tonelli Hamiltonians with n independent but not necessarily involutive constants of motion…
We show that the L^2-torsion and the von Neumann rho-invariant give rise to commensurability invariants of knots.
We introduce a geometric completion of the stack of maps from stable marked curves to the quotient stack [point/GL(1)], and use it to construct some gauge-theoretic analogues of the Gromov-Witten invariants. We also indicate the…
Vassiliev invariants can be studied by studying the spaces of chord diagrams associated with singular knots. To these chord diagrams are associated the intersection graphs of the chords. We extend results of Chmutov, Duzhin and Lando to…
Let G be a finite connected simple graph. We define the moduli space of conformal structures on G. We propose a definition of conformally covariant operators on graphs, motivated by [25]. We provide examples of conformally covariant…
Graph Neural Networks (GNNs) and Transformers share significant similarities in their encoding strategies for interacting with features from nodes of interest, where Transformers use query-key scores and GNNs use edges. Compared to GNNs,…
Proceeding in analogy with su(n) work on lambda matrices and f- and d-tensors, this paper develops the technology of the Lie algebra g2, its seven dimensional defining representation gamma and the full set of invariant tensors that arise in…
The present work is concerned with characterizing some algebraic invariants of edge ideals of hypergraphs. To this aim, firstly, we introduce some kinds of combinatorial invariants similar to matching numbers for hypergraphs. Then we…