Related papers: U-cross Gram matrices and their invertibility

Let $\Gamma$ be an undirected and simple graph. A set $ S $ of vertices in $\Gamma$ is called a {cyclic vertex cutset} of $\Gamma$ if $\Gamma - S$ is disconnected and has at least two components each containing a cycle. If $\Gamma$ has a…

We investigate topological properties of density matrices motivated by the question to what extent phenomena like topological insulators and superconductors can be generalized to mixed states in the framework of open quantum systems. The…

The results on the inversion of convolution operators as well as Toeplitz (and block Toeplitz) matrices in the $1$-D (one-dimensional) case are classical and have numerous applications. Last year, we considered the $2$-D case of…

Let $G$ be a connected graph with adjacency matrix $A(G)$. The distance matrix $D(G)$ of $G$ has rows and columns indexed by $V(G)$ with $uv$-entry equal to the distance $\mathrm{dist}(u,v)$ which is the number of edges in a shortest path…

In this paper we study congruence properties of the representations $U_\alpha:=U^{PSL(2,\mathbb{Z})}_{\chi_\alpha}$ of the projective modular group ${\rm PSL}(2,\mathbb{Z})$ induced from a family $\chi_\alpha$ of characters for the Hecke…

A metric basis in a graph $G$ is a smallest possible set $S$ of vertices of $G$, with the property that any two vertices of $G$ are uniquely recognized by using a vector of distances to the vertices in $S$. A strong metric basis is a…

In this Colloqium Lecture (by one of the authors (D.S)) a thorough presentation of the authors' research on the subjects, stated in the title, is given. By quite laborious mathematics it is explained how one can handle systems in which each…

Let $t$ be a regular operator between Hilbert $C^*$-modules and $t^\dag$ be its Moore-Penrose inverse. We investigate the Moore-Penrose invertibility of the Gram operator $t^*t$. More precisely, we study some conditions ensuring that…

This paper investigates a model reduction problem for linear directed network systems, in which the interconnections among the vertices are described by general weakly connected digraphs. First, the definitions of pseudo controllability and…

We generalize von Neumann's well-known trace inequality, as well as related eigenvalue inequalities for hermitian matrices, to Schatten-class operators between complex Hilbert spaces of infinite dimension. To this end, we exploit some…

Extending the work of Godsil and others, we investigate the notion of the inverse of a graph (specifically, of bipartite graphs with a unique perfect matching). We provide a concise necessary and sufficient condition for the invertibility…

Reversible Markov chains play a central role in stochastic modelling and in algorithms such as Markov chain Monte Carlo (MCMC). Motivated by the fundamental importance of reversibility in classical settings, this paper develops a…

We use supersymmetry transformations to design transparent and one-way reflectionless (thus unidirectionally invisible) complex crystals with balanced gain and loss profiles. The scattering coefficients are investigated using the transfer…

Matrix pencils, or pairs of matrices, may be used in a variety of applications. In particular, a pair of matrices (E,A) may be interpreted as the differential equation E x' + A x = 0. Such an equation is invariant by changes of variables,…

For a nonsingular matrix $A$, we propose the form $Tr(^t\!A A^{-1})$, the trace of the product of its transpose and inverse, as a new invariant under congruence of nonsingular matrices.

We define the notion of strong spectral invariance for a dense Frechet subalgebra A of a Banach algebra B. We show that if A is strongly spectral invariant in a C*-algebra B, and G is a compactly generated polynomial growth Type R Lie…

Let $G$ be a finite abelian group, let $E$ be a subset of $G$, and form the Cayley (directed) graph of $G$ with connecting set $E$. We explain how, for various matrices associated to this graph, the spectrum can be used to give information…

Euler graphs are characterized by the simple criterion that degree of each node is even. By restricting on the cycle types yet additional intrinsic properties of Euler graphs are unveiled. For example, regularity higher than degree two is…

Let $X$ be bipartite mixed graph and for a unit complex number $\alpha$, $H_\alpha$ be its $\alpha$-hermitian adjacency matrix. If $X$ has a unique perfect matching, then $H_\alpha$ has a hermitian inverse $H_\alpha^{-1}$. In this paper we…

Let $\Gamma$ be an undirected and simple graph. A set $ S $ of vertices in $\Gamma$ is called a {cyclic vertex cutset} of $\Gamma$ if $\Gamma - S$ is disconnected and has at least two components containing cycles. If $\Gamma$ has a cyclic…