Related papers: On the sum of normal matrices
This work is in a stream initiated by a paper of Killip and Simon [Ann. of Math. (2003)]. Using methods of Functional Analysis and the classical Szeg\"o Theorem we prove sum rule identities in a very general form. Then, we apply the result…
Motivated by studies of oscillator networks, we study the spectrum of the join of several normal matrices with constant row sums. We apply our results to compute the characteristic polynomial of the join of several regular graphs. We then…
Due to some results by John P. D Angelo and Dusty Grundmeier about CR- mappings the main results of my 2001 paper about recurrences for some sequences of binomial sums can be simplified.
In this paper, using some arithmetic properties of Jacobi sums, we investigate some products involving Jacobi sums and reveal the connections between these products and certain cyclotomic matrices. In particular, as an application of our…
The near orthgonality of certain $k$-vectors involving the Ramanujan sums were studied by E. Alkan in [J. Number Theory, 140:147--168 (2014)]. Here we undertake the study of similar vectors involving a generalization of the Ramanujan sums…
Networks are frequently studied algebraically through matrices. In this work, we show that networks may be studied in a more abstract level using results from the theory of matroids by establishing connections to networks by decomposition…
Let $A$ be an $n\times n$ matrix and let $\vee^k A$ be its $k$-th symmetric tensor product. We express the normalized trace of $\vee^k A$ as an integral of the $k$-th powers of the numerical values of $A$ over the unit sphere…
This article is an exposition of recent results and methods on the prevalence of normal numbers in the support of self-similar measures on the line. We also provide an essentially self-contained proof of a recent Theorem that the Rajchman…
We extend the result of Markus, Spielman, and Srivastava about the sum of rank-one symmetric random matrices to the case when the isotropy assumption on the random matrices is relaxed.
In this expository paper, various properties of matrix traces, determinants and adjugate matrices are proved, including the *trace Cayley-Hamilton theorem*, which says that \[ kc_k + \sum_{i=1}^k \operatorname{Tr} (A^i) c_{k-i} = 0 \qquad…
We present a fast Jacobi-like algorithm for computing the eigenvalues, and optionally the eigenvectors, of a real normal matrix. The method gains a computational advantage by using Paardekooper's method for skew-symmetric matrices The…
This paper establishes new upper bounds for the sum of the $k$ largest eigenvalues of symmetric matrices. When applied to the adjacency matrix of a graph, our results improve upon a related bound due to Mohar {\bf [On the sum of k largest…
Given a nonnegative matrix $A$, can you find diagonal matrices $D_1,~D_2$ such that $D_1AD_2$ is doubly stochastic? The answer to this question is known as Sinkhorn's theorem. It has been proved with a wide variety of methods, each…
New lower bounds involving sum, difference, product, and ratio sets for a set $A\subset \C$ are given. The estimates involving the sum set match, up to constants, the one obtained by Solymosi for the reals and are obtained by generalising…
While Kolmogorov's probability axioms are widely recognized, it is less well known that in an often-overlooked 1930 note, Kolmogorov proposed an axiomatic framework for a unifying concept of the mean -- referred to as regular means. This…
In [arXiv:2107.01437], the authors studied the mean-square of certain sums of the divisor function $d_k(f)$ over the function field $\mathbb{F}_q[T]$ in the limit as $q \to \infty$ and related these sums to integrals over the ensemble of…
This note resolves an open problem asked by Bezrukov in the open problem session of IWOCA 2014. It shows an equivalence between regular graphs and graphs for which a sequence of invariants presents some symmetric property. We extend this…
Based on various strategies and a new general doubling operator, we obtain several simple proofs of the celebrated Sharkovsky's cycle coexistence theorem. A simple non-directed graph proof which is especially suitable for a calculus course…
We give a new, elementary proof of a key inequality used by Rudelson in the derivation of his well-known bound for random sums of rank-one operators. Our approach is based on Ahlswede and Winter's technique for proving operator Chernoff…
The paper studies the global convergence of the block Jacobi me\-thod for symmetric matrices. Given a symmetric matrix $A$ of order $n$, the method generates a sequence of matrices by the rule $A^{(k+1)}=U_k^TA^{(k)}U_k$, $k\geq0$, where…