English
Related papers

Related papers: On conjugacy of diagonalizable integral matrices

200 papers

We consider commuting pairs of holomorphic endomorphisms of P^2 with disjoint sequence of iterates. The remaining case to be studied is when their degrees coincide after some number of iterations. We show in this case that they are either…

Complex Variables · Mathematics 2016-09-28 Lucas Kaufmann

Dariush Kiani et al.\cite{kiani2015unitary} claim to have found the unitary Cayley graph $Cay(M_{n}(F),GL_{n}(F))$ of matrix algebras over finite field $F$ is strongly regular only when $n=2$, but they have only considered two special…

Combinatorics · Mathematics 2020-06-17 Yihan Chen , Bicheng Zhang

We give a necessary and sufficient condition on a matrix for its centralizer in $\sf{GL}(n,\mathbb{Z})$ to be polycyclic, or equivalently in this case, not to contain a non-abelian free subgroup. We give a simple condition on the matrix…

Group Theory · Mathematics 2026-04-09 Adem Zeghib

We explore an identity between two branching graphs and propose a physical meaning in the context of the gauge-gravity correspondence. From the mathematical point of view, the identity equates probabilities associated with $\mathbb{GT}$,…

High Energy Physics - Theory · Physics 2023-02-16 Pablo Diaz , Hai Lin , Alvaro Veliz-Osorio

We generalize several important results from the perturbation theory of linear operators to the setting of semisimple orthogonal symmetric Lie algebras. These Lie algebras provide a unifying framework for various notions of matrix…

Representation Theory · Mathematics 2023-07-04 Emanuel Malvetti , Gunther Dirr , Frederik vom Ende , Thomas Schulte-Herbrüggen

In this paper we prove that if G is a connected, simply-connected, semi-simple algebraic group over an algebraically closed field of sufficiently large characteristic, then all the blocks of the restricted enveloping algebra (Ug)_0 of the…

Representation Theory · Mathematics 2019-12-19 Simon Riche

Let $G$ be a group. The prime index graph of $G$, denoted by $\Pi(G)$, is the graph whose vertex set is the set of all subgroups of $G$ and two distinct comparable vertices $H$ and $K$ are adjacent if and only if the index of $H$ in $K$ or…

Group Theory · Mathematics 2015-08-06 S. Akbari , A. Ashtab , F. Heydari , M. Rezaee , F. Sherafati

Let $K$ be a perfect field, $L$ be an extension field of $K$ and $A,B\in\mathcal{M}_n(K)$. If $A$ has $n$ distinct eigenvalues in $L$ that are explicitly known, then we can check if $A,B$ are simultaneously triangularizable over $L$. Now we…

Rings and Algebras · Mathematics 2012-11-01 Gerald Bourgeois

The canonical double cover $\D(\Gamma)$ of a graph $\Gamma$ is the direct product of $\Gamma$ and $K_2$. If $\Aut(\D(\Gamma))\cong\Aut(\Gamma)\times\ZZ_2$ then $\Gamma$ is called stable; otherwise $\Gamma$ is called unstable. An unstable…

Combinatorics · Mathematics 2020-10-29 Yan-Li Qin , Binzhou Xia , Sanming Zhou

The problem of diagonalizing hermitian matrices of continuous fiunctions was studied by Grove and Pederson in 1984. While diagonalization is not possible in general, in the presence of differentiability conditions we are able to obtain…

Operator Algebras · Mathematics 2012-12-27 Justin Cyr , Jason Ekstrand , Nathan Meyers , Crystal Peoples , Justin R. Peters

For an odd prime $p$, we realize the trivial representation of $\mathrm{GL}_2(\mathbb{Z}/p^n\mathbb{Z})$ on the free $\mathbb{Z}/p^n \mathbb{Z}$-module of rank one as a subquotient of a direct sum of symmetric power representations (twisted…

Representation Theory · Mathematics 2025-10-10 Atsushi Ichino , Kartik Prasanna

A graph G is locally isometric if the subgraph induced by the neighbourhood of every vertex is an isometric subgraph of G. It is shown that the hamilton cycle problem for locally isometric graphs with maximum degree at most 8 is…

Combinatorics · Mathematics 2016-01-08 Adam Borchert , Skylar Nicol , Ortrud R. Oellermann

In this paper, we show that the eigenvalues of certain classes of Cayley graphs are integers. The (n,k,r)-arrangement graph A(n,k,r) is a graph with all the k-permutations of an n-element set as vertices where two k-permutations are…

Combinatorics · Mathematics 2013-12-17 Bai Fan Chen , Ebrahim Ghorbani , Kok Bin Wong

We introduce and investigate the solvable graph $\Gamma_\mathfrak{S}(L)$ of a finite-dimensional Lie algebra $L$ over a field $F$. The vertices are the elements outside the solvabilizer $\sol(L)$, and two vertices are adjacent whenever they…

Rings and Algebras · Mathematics 2025-11-12 David Towers , Ismael Gutierrez , Luis Fernandez

If all the eigenvalues of the Hermitian-adjacency matrix of a mixed graph are integers, then the mixed graph is called \emph{H-integral}. If all the eigenvalues of the (0,1)-adjacency matrix of a mixed graph are \emph{Gaussian integers},…

Combinatorics · Mathematics 2023-02-17 Monu Kadyan , Bikash Bhattacharjya

Let $X$ be a compact metric space which is locally absolutely retract and let $\phi: C(X)\to C(Y, M_n)$ be a unital homomorphism, where $Y$ is a compact metric space with ${\rm dim}Y\le 2.$ It is proved that there exists a sequence of $n$…

Operator Algebras · Mathematics 2009-09-10 Huaxin Lin

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…

Spectral Theory · Mathematics 2022-10-21 Chuanyuan Ge , Shiping Liu

Let $S$ be a semigroup. The elements $a,b\in S$ are called primarily conjugate if $a=xy$ and $b=yx$ for certain $x,y\in S$. The relation of conjugacy is defined as the transitive closure of the relation of primary conjugacy. In the case…

Group Theory · Mathematics 2007-05-23 Ganna Kudryavtseva

We consider graphs that represent pairwise marginal independencies amongst a set of variables (for instance, the zero entries of a covariance matrix for normal data). We characterize the directed acyclic graphs (DAGs) that faithfully…

Artificial Intelligence · Computer Science 2015-08-04 Johannes Textor , Alexander Idelberger , Maciej Liśkiewicz

A set $S$ of vertices in a graph $G$ is a paired dominating set if every vertex of $G$ is adjacent to a vertex in $S$ and the subgraph induced by $S$ admits a perfect matching. The minimum cardinality of a paired dominating set of $G$ is…

Combinatorics · Mathematics 2025-05-06 Csilla Bujtás , Michael A. Henning