相关论文: On conjugacy of diagonalizable integral matrices

Let $G$ be a finite group and $N(G)$ be the set of its conjugacy class sizes excluding~$1$. Let us define a directed graph $\Gamma(G)$, the set of vertices of this graph is $N(G)$ and the vertices $x$ and $y$ are connected by a directed…

Let $k \geq 2$ be an integer. Let $q$ be a prime power such that $q \equiv 1 \pmod {k}$ if $q$ is even, or, $q \equiv 1 \pmod {2k}$ if $q$ is odd. The generalized Paley graph of order $q$, $G_k(q)$, is the graph with vertex set…

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…

An oriented graph is said positively multiplicative when its adjacency matrix $A$ embeds in a matrix algebra admitting a basis $\mathsf{B}$ with nonnegative structure constants in which the matrix of the multiplication by $A$ coincides with…

Let $N(\Gamma,G)$ be the number of homomorphisms from $\Gamma$ to $G$ up to conjugation by $G$. Physics of four-dimensional $\mathcal{N}=4$ supersymmetric gauge theories predicts that $N(\Gamma,G)=N(\Gamma , \tilde G)$ when $\Gamma$ is a…

We give characterizations of the center, of conjugated and of commuting elements in a fundamental group of a graph of group. We deduce various results : on the one hand we give a sufficient condition for the center, the centralizers, and…

We investigate a graph theoretic analog of geodesic geometry. In a graph $G=(V,E)$ we consider a system of paths $\mathcal{P}=\{P_{u,v}|u,v\in V\}$ where $P_{u,v}$ connects vertices $u$ and $v$. This system is consistent in that if vertices…

Mirsky proved that, for the existence of a complex matrix with given eigenvalues and diagonal entries, the obvious necessary condition is also sufficient. We generalize this theorem to matrices over any field and provide a short proof.…

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…

The general correlation function for the eigenvalues of $p$ complex hermitian matrices coupled in a chain is given as a single determinant. For this we use a slight generalization of a theorem of Dyson.

If $G$ is a looped graph, then its adjacency matrix represents a binary matroid $M_{A}(G)$ on $V(G)$. $M_{A}(G)$ may be obtained from the delta-matroid represented by the adjacency matrix of $G$, but $M_{A}(G)$ is less sensitive to the…

Let $G$ be a bipartite graph and its adjacency matrix $\mathbb A$. If $G$ has a unique perfect matching, then $\mathbb A$ has an inverse $\mathbb A^{-1}$ which is a symmetric integral matrix, and hence the adjacency matrix of a multigraph.…

The connection Laplacian L and the Dirac matrix D are both n x n matrices defined from a given finite simplicial complex G with n sets. In both cases, there is interlacing of the eigenvalues for subcomplexes. This gives general upper bounds…

For an $n \times n$ matrix $A$, let $q(A)$ be the number of distinct eigenvalues of $A$. If $G$ is a connected graph on $n$ vertices, let $\mathcal{S}(G)$ be the set of all real symmetric $n \times n$ matrices $A=[a_{ij}]$ such that for…

We consider matrices of the form $qD+A$, with $D$ being the diagonal matrix of degrees, $A$ being the adjacency matrix, and $q$ a fixed value. Given a graph $H$ and $B\subseteq V(G)$, which we call a coalescent pair $(H,B)$, we derive a…

In this paper we investigate families of connected graphs which do not contain an odd cycle in their complement. Specifically, we consider graphs formed by two complete graphs connected in a particular way. We determine which of these…

We present an intuitive diagrammatic representation of a new class of integrable $\s$-models. It is shown that to any given diagram corresponds an integrable theory that couples $N$ WZW models with a certain number of each of the following…

For each piecewise linear Lorenz map that expand on average, we show that it admits a dichotomy: it is either periodic renormalizable or prime. As a result, such a map is conjugate to a $\beta$-transformation.

Let $G$ be a group. Two elements $x, y$ are said to be {\it $z$-equivalent} if their centralizers are conjugate in $G$. The class equation of $G$ is the partition of $G$ into conjugacy classes. Further decomposition of conjugacy classes…

A graph is said to be orthogonalisable if the set of real symmetric matrices whose off-diagonal pattern is prescribed by its edges contains an orthogonal matrix. We determine some necessary and some sufficient conditions on the sizes of the…