Related papers: Remarks about Connection and Dirac matrices

The purpose of this paper is to establish a connection between various subjects such as dynamical r-matrices, Lie bialgebroids, and Lagrangian subalgebras. Our method relies on the theory of Dirac structures developed in dg-ga/9508013 and…

We prove a Lefschetz formula for general simple graphs which equates the Lefschetz number L(T) of an endomorphism T with the sum of the degrees i(x) of simplices in G which are fixed by T. The degree i(x) of x with respect to T is defined…

We discuss some linear algebra related to the Dirac matrix D of a finite simple graph G=(V,E).

We define a ring R of geometric objects G generated by finite abstract simplicial complexes. To every G belongs Hodge Laplacian H as the square of the Dirac operator determining its cohomology and a unimodular connection matrix L). The sum…

A finite abstract simplicial complex G defines a matrix L, where L(x,y)=1 if two simplicies x,y in G intersect and where L(x,y)=0 if they don't. This matrix is always unimodular so that the inverse g of L has integer entries g(x,y). In…

For a finite abstract simplicial complex G with n sets, define the n x n matrix K(x,y) which is the number of subsimplices in the intersection of x and y. We call it the counting matrix of G. Similarly as the connection matrix L which is…

Let $G$ be a finite simple graph. The line graph $L(G)$ represents the adjacencies between edges of $G$. We define first the line simplicial complex $\Delta_L(G)$ of $G$ containing Gallai and anti-Gallai simplicial complexes…

Connection matrices are one of the central tools in Conley's approach to the study of dynamical systems, as they provide information on the existence of connecting orbits in Morse decompositions. They may be considered a generalisation of…

For a simple connected graph $ G $ of order $ n $, the normalized Laplacian is a square matrix of order $ n $, defined as $\mathcal{L}(G)= D(G)^{-\frac{1}{2}}L(G)D(G)^{-\frac{1}{2}}$, where $ D(G)^{-\frac{1}{2}} $ is the diagonal matrix…

The integrability of two symplectic maps, that can be considered as discrete-time analogs of the Garnier and Neumann systems is established in the framework of the $r$-matrix approach, starting from their Lax representation. In contrast…

Let $G$ be a strongly connected and balanced directed graph. The Laplacian matrix of $G$ is then the matrix (not necessarily symmetric) $L:=D-A$, where $A$ is the adjacency matrix of $G$ and $D$ is the diagonal matrix such that the row sums…

Let X be a locally compact space with a continuous proper action of a locally compact group G. Assuming that X satisfies a certain kind of duality in equivariant bivariant Kasparov theory, we can enrich the classical construction of…

Let G be a graph on n vertices. The Laplacian matrix of G, denoted by L(G), is defined as L(G) = D(G) - A(G), where A(G) is the adjacency matrix of G and D(G) is the diagonal matrix of the vertex degrees of G. A graph G is said to be…

We look at connection Laplacians L,g defined by a field h:G to K, where G is a finite set of sets and K is a normed division ring which does not need to be commutative, nor associative but has a conjugation leading to the norm as the square…

We consider modified Laplacian matrices of graphs, obtained by adding the identity matrix to the Laplacian matrix $L_G$ of a graph $G$. This results in a positive definite matrix $\tilde{L}_G$. The inverse of $\tilde{L}_G$ is a doubly…

The lattice Dirac equation is formulated on a simplicial complex which approximates a smooth Riemann manifold by introducing a lattice vierbein on each site and a lattice spin connection on each link. Care is taken so the construction…

The graph Laplacian is a fundamental object in the analysis of and optimization on graphs. This operator can be extended to a simplicial complex $K$ and therefore offers a way to perform ``signal processing" on $p$-(co)chains of $K$.…

A folklore result due to M.W. Hirsch states that most competitive maps admit a carrying simplex, i.e., an invariant hypersurface which attracts all nontrivial orbits. The common approach in the study of these maps is to focus on the…

We associate to a finite digraph $D$ a lattice polytope $P_D$ whose vertices are the rows of the Laplacian matrix of $D$. This generalizes a construction introduced by Braun and the third author. As a consequence of the Matrix-Tree Theorem,…

Simplicial Dirac structures as finite analogues of the canonical Stokes-Dirac structure, capturing the topological laws of the system, are defined on simplicial manifolds in terms of primal and dual cochains related by the coboundary…