6 results for "Fallat Shaun"
Showing 1–6 · 0.44 seconds · RSS
-
Preprint Full text
Linear Preservers of Real Matrix Classes Admitting a Real Logarithm
In real Lie theory, matrices that admit a real logarithm reside in the identity component $\mathrm{GL}_n(\mathbb{R})_+$ of the general linear group $\mathrm{GL}_n(\mathbb{R})$, with logarithms in the Lie algebra $\mathfrak{gl}_n(\mathbb{R})$. The exponential map \[ \exp : \mnr \to…
-
Journal Article
On the Relationships between Zero Forcing Numbers and Certain Graph Coverings
The zero forcing number and the positive zero forcing number of a graph are two graph parameters that arise from two types of graph colourings. The zero forcing number is an upper bound on the minimum number of induced paths in the graph that cover all the vertices of the graph, while the positive…
-
Preprint Full text
Semigroup automorphisms of total positivity
Totally positive (TP) and totally nonnegative (TN) matrices connect to analysis, mechanics, and to dual canonical bases in reductive groups, by well-known works of Schoenberg, Gantmacher-Krein, Lusztig, and others. TP matrices form a multiplicatively closed semigroup, contained in the larger monoid…
-
Journal Article
Corrigendum to “Achievable Multiplicity partitions in the Inverse Eigenvalue Problem of a graph” [Spec. Matrices 2019; 7:276-290.]
We correct an error in the original Lemma 3.4 in our paper “Achievable Multiplicity partitions in the IEVP of a graph”’ [Spec. Matrices 2019; 7:276-290.]. We have re-written Section 3 accordingly.
-
Journal Article
Achievable multiplicity partitions in the inverse eigenvalue problem of a graph
Associated to a graph G is a set 𝒮(G) of all real-valued symmetric matrices whose off-diagonal entries are nonzero precisely when the corresponding vertices of the graph are adjacent, and the diagonal entries are free to be chosen. If G has n vertices, then the multiplicities of the eigenvalues of…