English
Related papers

Related papers: A Resolvent Criterion for Normality

200 papers

In this article we study the structured distance to singularity for a nonsingular matrix $A\in\mathbb{C}^{n\times n}$, with a prescribed linear structure $\mathcal{S}$ (for instance, a sparsity pattern, or a real Toeplitz structure), i.e.,…

Numerical Analysis · Mathematics 2026-03-06 Miryam Gnazzo , Nicola Guglielmi , Federico Poloni , Stefano Sicilia

A generalized definition of the determinant of matrices is given, which is compatible with the usual determinant for square matrices and keeps many important properties, such as being an alternating multilinear function, keeping…

Classical Analysis and ODEs · Mathematics 2021-12-01 Xuesong Lu , Songtao Mao , Zixing Wang , Yuehui Zhang

This work provides a comprehensive theoretical framework for understanding the symmetry properties of High-Resolution NMR spectra. We analyze the conditions under which a spectrum exhibits mirror symmetry (palindromicity). We demonstrate…

Chemical Physics · Physics 2026-02-05 Dmitry A. Cheshkov , Dmitry O. Sinitsyn

In this paper, we give upper and lower bounds for the spectral norms of r-circulant matrices with the generalized bi-periodic Fibonacci numbers. Moreover, we investigate the eigenvalues and determinants of these matrices.

Combinatorics · Mathematics 2021-02-01 Mehmet Dagli , Elif Tan , Oktay Olmez

We present an analysis of sets of matrices with rank less than or equal to a specified number $s$. We provide a simple formula for the normal cone to such sets, and use this to show that these sets are prox-regular at all points with rank…

Optimization and Control · Mathematics 2018-09-24 D. Russell Luke

For $k=1,\ldots,K$, let $A_k$ and $B_k$ be positive semidefinite matrices such that, for each $k$, $A_k$ commutes with $B_k$. We show that, for any unitarily invariant norm, \[ |||\sum_{k=1}^K A_kB_k||| \le ||| (\sum_{k=1}^K…

Functional Analysis · Mathematics 2014-11-25 Koenraad M. R. Audenaert

The Spectral Excess Theorem (SPET) for distance-regular graphs states that a regular (connected) graph is distance-regular if and only if its spectral-excess equals its average excess. Recently, some local or global approaches to the SPET…

Spectral Theory · Mathematics 2012-05-29 M. A. Fiol

We give the first specific conjectures on how frequently graphs satisfy sufficient conditions for being uniquely characterized by spectral information. These conjectures arise from a theoretical framework that we developed based on…

Probability · Mathematics 2026-03-31 Nikita Lvov , Alexander Van Werde

A real symmetric matrix $A$ is said to be completely positive if it can be written as $BB^t$ for some (not necessarily square) nonnegative matrix $B$. A simple graph $G$ is called a completely positive graph if every doubly nonnegative…

Combinatorics · Mathematics 2020-02-07 Joyentanuj Das , Sachindranath Jayaraman , Sumit Mohanty

This paper is on the normal approximation of singular subspaces when the noise matrix has i.i.d. entries. Our contributions are three-fold. First, we derive an explicit representation formula of the empirical spectral projectors. The…

Statistics Theory · Mathematics 2019-07-29 Dong Xia

We consider sets of reals $X$ endowed with the Sorgenfrey lower limit topology denoted $X[\leq]$. Przymusi\'nski proved that if $X$ is a $Q$-set then $(X[\leq])^2$ is normal. While the converse is not in general true we consider examples of…

General Topology · Mathematics 2026-04-22 Paul Szeptycki , Hongwei Wen

A generalized word in two positive definite matrices A and B is a finite product of nonzero real powers of A and B. Symmetric words in positive definite A and B are positive definite, and so for fxed B, we can view a symmetric word, S(A,B),…

Rings and Algebras · Mathematics 2007-05-23 Christopher J. Hillar , Charles R. Johnson

We discuss how the presence of a suitable symmetry can guarantee the perturbative linearizability of a dynamical system - or a parameter dependent family - via the Poincar\'e Normal Form approach. We discuss this at first formally, and…

Mathematical Physics · Physics 2015-06-17 D. Bambusi , G. Cicogna , G. Gaeta , G. Marmo

A matrix $A\in\mathbb{C}^{n\times n}$ is diagonalizable if it has a basis of linearly independent eigenvectors. Since the set of nondiagonalizable matrices has measure zero, every $A\in \mathbb{C}^{n\times n}$ is the limit of diagonalizable…

Functional Analysis · Mathematics 2020-04-23 Jess Banks , Archit Kulkarni , Satyaki Mukherjee , Nikhil Srivastava

We consider smooth linear statistics of determinantal point processes on the complex plane, and their large scale asymptotics. We prove asymptotic normality in the finite variance case, where Soshnikov's theorem is not applicable. The…

Probability · Mathematics 2023-03-22 Antti Haimi , José Luis Romero

Graphs can be associated with a matrix according to some rule and we can find the spectrum of a graph with respect to that matrix. Two graphs are cospectral if they have the same spectrum. Constructions of cospectral graphs help us…

Combinatorics · Mathematics 2020-06-02 Kate Lorenzen

Conditions for the existence of a fixed spectrum \{i.e., the set of fixed modes\} for a multi-channel linear system have been known for a long time. The aim of this paper is to reestablish one of these conditions using a new and transparent…

Systems and Control · Computer Science 2019-11-12 Fengjiao Liu , A. Stephen Morse

We extend the notion of Heyting algebra to a notion of truth values algebra and prove that a theory is consistent if and only if it has a B-valued model for some non trivial truth values algebra B. A theory that has a B-valued model for all…

Logic in Computer Science · Computer Science 2023-05-15 Gilles Dowek

The aim of this paper is to present new upper bounds for the distance between a properly normalized permanent of a rectangular complex matrix and the product of the arithmetic means of the entries of its columns. It turns out that the…

Combinatorics · Mathematics 2018-02-22 Bero Roos

Understanding the singular value spectrum of a matrix $A \in \mathbb{R}^{n \times n}$ is a fundamental task in countless applications. In matrix multiplication time, it is possible to perform a full SVD and directly compute the singular…

Data Structures and Algorithms · Computer Science 2019-01-04 Cameron Musco , Praneeth Netrapalli , Aaron Sidford , Shashanka Ubaru , David P. Woodruff