相关论文: The energy of a simplicial complex

Assume that $G$ is a finite group. For every $a, b \in\mathbb N,$ we define a graph $\Gamma_{a,b}(G)$ whose vertices correspond to the elements of $G^a\cup G^b$ and in which two tuples $(x_1,\dots,x_a)$ and $(y_1,\dots,y_b)$ are adjacent if…

In this paper we characterize invertible matrices over an arbitrary commutative antiring S and find the structure of GL_n (S). We find the number of nilpotent matrices over an entire commutative finite antiring. We prove that every…

We elaborate the idea that the matrix models equipped with the gauge symmetry provide a natural framework to describe identical particles. After demonstrating the general prescription, we study an exactly solvable harmonic oscillator type…

The energy of a simple graph $G$, denoted by $E(G)$, is defined as the sum of the absolute values of all eigenvalues of its adjacency matrix. Let $C_n$ denote the cycle of order $n$ and $P^{6,6}_n$ the graph obtained from joining two cycles…

For a relativistic particle moving in the presence of mean scalar and vector fields, the energy at second order in the scalar field is shown to contain two contributions in general. One is a momentum-dependent repulsive interaction…

Combinatorial topology is used in distributed computing to model concurrency and asynchrony. The basic structure in combinatorial topology is the simplicial complex, a collection of subsets called simplices of a set of vertices, closed…

Let G be a reductive group over an algebraically closed field whose characteristic is not a bad prime for G. Let w be an elliptic element of the Weyl group which has minimal length in its conjugacy class. We show that there exists a unique…

Let $G$ be a simple graph with vertex set $V(G) = \{v_1, v_2,\ldots, v_n\}$. The Sombor matrix of $G$, denoted by $A_{SO}(G)$, is defined as the $n\times n$ matrix whose $(i,j)$-entry is $\sqrt{d_i^2+d_j^2}$ if $v_i$ and $v_j$ are adjacent…

We prove the following results: let x,y be (n,n) complex matrices such that x,y,xy have no eigenvalue in ]-infinity,0] and log(xy)=log(x)+log(y). If n=2, or if n>2 and x,y are simultaneously triangularizable, then x,y commute. In both cases…

We prove that the solvable radical of a finite group G coincides with the set of elements y having the following property: for any x in G the subgroup of G generated by x and y is solvable. We present analogues of this result for finite…

Let G be an affine algebraic group over an algebraically closed field such that the identity component G^0 of G is reductive. Let W be the Weyl group of G and let D be a connected component of G whose image in G/G^0 is a unipotent element.…

A subspace of the space, L(n), of traceless complex $n\times n$ matrices can be specified by requiring that the entries at some positions $(i,j)$ be zero. The set, $I$, of these positions is a (zero) pattern and the corresponding subspace…

Gutman and Wagner proposed the concept of matching energy (ME) and pointed out that the chemical applications of ME go back to the 1970s. Let $G$ be a simple graph of order $n$ and $\mu_1,\mu_2,\ldots,\mu_n$ be the roots of its matching…

A signed graph $\Gamma(G)$ is a graph with a sign attached to each of its edges, where $G$ is the underlying graph of $\Gamma(G)$. The energy of a signed graph $\Gamma(G)$ is the sum of the absolute values of the eigenvalues of the…

If K,G are finite abstract simplicial complexes and K is a subcomplex of G then the eigenvalues of the Hodge Laplacian of K are smaller or equal than the eigenvalues of the Hodge Laplacian of G, provided the eigenvalue lists are padded…

Given a graph $M,$ path eigenvalues are eigenvalues of its path matrix. The path energy of a simple graph $M$ is equal to the sum of the absolute values of the path eigenvalues of the graph $M$ (Shikare et. al, 2018). We have discovered new…

We introduce the vertex Seidel energy via the diagonal entries of the absolute Seidel matrix. We establish a spectral formula, compute exact values for several graph families, derive bounds, and present a Coulson-type integral…

We introduce the matrix sums that represent a discrete analog of the matrix models with quartic potential. The probability space is given by the set of all simple n-vertex graphs with the Gibbs weight determined by the graph Laplacian. We…

Let $(x, y)$ and $[x, y]$ denote the greatest common divisor and the least common multiple of the integers $x$ and $y$ respectively. We denote by $|T|$ the number of elements of a finite set $T$. Let $a,b$ and $n$ be positive integers and…

The power graph $P(\Omega)$ of a group $\Omega$ is a graph with the vertex set $\Omega$ such that two distinct vertices form an edge if and only if one of them is an integral power of the other. In this article, we determine the power graph…