Related papers: Remarks about Connection and Dirac matrices

We consider the Dyson hierarchical graph $\mathcal{G}$, that is a weighted fully-connected graph, where the pattern of weights is ruled by the parameter $\sigma \in (1/2, 1]$. Exploiting the deterministic recursivity through which…

This paper initiates the study of the "Laplacian simplex" $T_G$ obtained from a finite graph $G$ by taking the convex hull of the columns of the Laplacian matrix for $G$. Basic properties of these simplices are established, and then a…

We study some spectral properties of a matrix that is constructed as a combination of a Laplacian and an adjacency matrix of simple graphs. The matrix considered depends on a positive parameter, as such we consider the implications in…

Let $d\geq 3$ be a fixed integer and $A$ be the adjacency matrix of a random $d$-regular directed or undirected graph on $n$ vertices. We show there exist constants $\mathfrak d>0$, \begin{align*} {\mathbb P}(\text{$A$ is singular in…

While Euler characteristic X(G)=sum_x w(x) super counts simplices, Wu characteristics w_k(G) = sum_(x_1,x_2,...,x_k) w(x_1)...w(x_k) super counts simultaneously pairwise interacting k-tuples of simplices in a finite abstract simplicial…

In 2001, Davies, Gladwell, Leydold, and Stadler proved discrete nodal domain theorems for eigenfunctions of generalized Laplacians, i.e., symmetric matrices with non-positive off-diagonal entries. In this paper, we establish nodal domain…

We study equivariant families of Dirac operators on the source fibers of a Lie groupoid with a closed space of units and equipped with an action of an auxiliary compact Lie group. We use the Getzler rescaling method to derive a fixed-point…

If $G$ is a strongly connected finite directed graph, the set $\mathcal{T}G$ of rooted directed spanning trees of $G$ is naturally equipped with a structure of directed graph: there is a directed edge from any spanning tree to any other…

As a discretization of the Hodge Laplacian, the combinatorial Laplacian of simplicial complexes has garnered significant attention. In this paper, we study combinatorial Laplacians for complex pairs $(X, A)$, where $A$ is a subcomplex of a…

Under the Neumann constraints, each equation of the KdV hierarchy is decomposed into two finite dimensional systems, including the well-known Neumann model. Like in the case of the Bargmann constraint, the explicit Lax representations are…

Conjugation, or Legendre transformation, is a basic tool in convex analysis, rational mechanics, economics and optimization. It maps a function on a linear topological space into another one, defined in the dual of the linear space by…

A finite dynamical system with $n$ components is a function $f:X\to X$ where $X=X_1\times\dots\times X_n$ is a product of $n$ finite intervals of integers. The structure of such a system $f$ is represented by a signed digraph $G$, called…

The need to build a link between the structure of a complex network and the dynamical properties of the corresponding complex system (comprised of multiple low dimensional systems) has recently become apparent. Several attempts to tackle…

The \emph{distance matrix} of a simple connected graph $G$ is $D(G)=(d_{ij})$, where $d_{ij}$ is the distance between the vertices $i$ and $j$ in $G$. We consider a weighted tree $T$ on $n$ vertices with edge weights are square matrix of…

For linear operators $L, T$ and nonlinear maps $P$, we describe classes of simple maps $F = I - P T$, $F = L - P$ between Banach and Hilbert spaces, for which no point has more than two preimages. The classes encompass known examples…

Multiplicative and additive $D$-stability, diagonal stability, Schur $D$-stability, $H$-stability are classical concepts which arise in studying linear dynamical systems. We unify these types of stability, as well as many others, in one…

Let $G$ be a simple graph with the Laplacian matrix $L(G)$ and let $e(G)$ be the number of edges of $G$. A conjecture by Brouwer and a conjecture by Grone and Merris state that the sum of the $k$ largest Laplacian eigenvalues of $G$ is at…

A unifying overview of the ways to parameterize the linear group GL(4.C) and its subgroups is given. As parameters for this group there are taken 16 coefficients G = G(A,B,A_{k}, B_{k}, F_{kl}) in resolving matrix G in terms of 16 basic…

The isospectral set of the Dirac matrix D=d+d* consists of orthogonal Q for which Q* D Q is an equivalent Dirac matrix. It can serve as the symmetry of a finite geometry G. The symmetry is a subset of the orthogonal group or unitary group…

We study the two-dimensional Dirac operator with an arbitrary combination of electrostatic and Lorentz scalar $\delta$-interactions of constant strengths supported on a smooth closed curve. For any combination of the coupling constants a…