The singular acyclic matrices of even order with a P-set of maximum size
Author(s) -
Zhibin Du,
Fonseca da
Publication year - 2016
Publication title -
filomat
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.449
H-Index - 34
eISSN - 2406-0933
pISSN - 0354-5180
DOI - 10.2298/fil1613403d
Subject(s) - mathematics , combinatorics , order (exchange) , set (abstract data type) , matrix (chemical analysis) , upper and lower bounds , row , discrete mathematics , mathematical analysis , database , computer science , programming language , materials science , composite material , finance , economics
Let $m_A(\lambda)$ denote the multiplicity of the eigenvalue $\lambda$ of a given $n$-by-$n$ symmetric matrix $A$. Set $A(\alpha)$ for the principal submatrix of $A$ obtained after deleting the rows and columns indexed by the nonempty subset $\alpha$ of $\{1,\ldots,n\}$. When $m_{A(\alpha)}(0)=m_{A}(0)+|\alpha|$, we call $\alpha$ a P-set of $A$. The maximum size of a P-set of $A$ is denoted by $P_s(A)$. It is known that $P_{s}(A)\leqslant\left\lfloor\frac{n}{2}\right\rfloor$ and this bound is not sharp for singular acyclic matrices of even order. In this paper, we find the bound for this case and classify all of the underlying trees. Some illustrative examples are provided.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom