Search arXivSearch

arXiv · 2604.03194

On Matrices Whose Distinct Eigenvalues Are Fully Captured by Quotient Matrices

Abstract

Let $M$ be the $n$-square matrix partitioned into $\ell^2$ blocks $b_{ij}$ according to some partition $P=\{C_{1},\dots,C_{\ell}\}$ of index set $\{1,\dots,n\}$. The quotient matrix $Q=(q_{ij})$ is a $k$-square matrix, with $\ell \leq k \leq n-1$, where $(ij)$-th entry is the average row sum (or column sum) of the corresponding block $b_{ij}$ in $M$. The partition $P$ is said to be \emph{equitable} if row sum of each block $b_{ij}$ is constant. In this case, the matrix $Q$ is referred to as the \emph{equitable quotient matrix} of $M$, and the spectrum of $Q$ is the subset of the spectrum of parent matrix $M$. We characterize some classes of matrices such that their equitable quotient matrix $Q$ contains all the distinct eigenvalues of $M$, thereby information can be obtained form the smallest matrix $Q$ without actually analyzing the parent matrix $M.$ We present necessary and the sufficient conditions for distinct eigenvalue of $M$ contained in the spectrum of of $Q$ in terms of eigenspaces. We end up article with some applications, where distinct eigenvalues of a parent matrix can be completely encoded by quotient matrix.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Bilal Ahmad Rather. 2026-04-03. On Matrices Whose Distinct Eigenvalues Are Fully Captured by Quotient Matrices. https://arxiv.org/abs/2604.03194

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO