Related papers: Intersection matrices revisited
The traditional adjacency matrix of a mixed graph is not symmetric in general, hence its eigenvalues may be not real. To overcome this obstacle, several authors have recently defined and studied various Hermitian adjacency matrices of…
An algorithm is presented for generating successive approximations to trigonometric functions of sums of non-commuting matrices. The resulting expressions involve nested commutators of the respective matrices. The procedure is shown to…
The Erd\H{o}s--Ko--Rado theorem is extended to designs in semilattices with certain conditions. As an application, we show the intersection theorems for the Hamming schemes, the Johnson schemes, bilinear forms schemes, Grassmann schemes,…
We systematically study how properties of abstract operator systems help classifying linear matrix inequality definitions of sets. Our main focus is on polyhedral cones, the 3-dimensional Lorentz cone, where we can completely describe all…
Application of the intersection theory to construction of n-point finite-difference equations associated with classical integrable systems is discussed. As an example, we present a few new discretizations of motion of the Euler top sharing…
We give a new residual intersection decomposition for the refined intersection products of Fulton-MacPherson. Our formula refines the celebrated residual intersection formula of Fulton, Kleiman, Laksov, and MacPherson. The new decomposition…
In this paper a generalization of the Gram-Schmidt Algorithm is presented. Actually we provide an algorithm to construct a set of equiangular vectors with a given angle $\theta\in(0,\arccos(\frac{-1}{n-1}))$ using a set of input independent…
Using the connection between intersection theory on the Deligne-Mumford spaces and the edge scaling of the GUE matrix model (see math.CO/9903176, math.AG/0101147), we express the n-point functions for the intersection numbers as…
The ensemble of antagonistic matrices is introduced and studied. In antagonistic matrices the entries $\mathcal A_{i,j}$ and $\mathcal A_{j,i}$ are real and have opposite signs, or are both zero, and the diagonal is zero. This…
We consider the vector space of $n \times n$ matrices over $\mathbb C$, Fermi operators and operators constructed from these matrices and Fermi operators. The properties of these operators are studied with respect to the underlying…
In an earlier work, the author together with Guo [Hermitian adjacency matrix of digraphs and mixed graphs, J. Graph Theory 85 (2017) 217-248] introduced the Hermitian adjacency matrix of directed (and partially directed) graphs. However, it…
We introduce a new method of expressing a $k$-graph $C^*$-algebra as a Cuntz-Pimsner algebra. Kumjian, Pask, and Sims have done this directly, using a linking algebra approach and a $(k-1)$-graph algebra. This can be iterated downward. Our…
We present a prescription for forming matrices with specified eigenvalues and known eigenvectors. With this method, we can form Hermitian, anti-Hermitian, symmetric and general matrices with arbitrary eigenvalues. In addition we propose an…
We describe a general algorithm for computing intersection pairings on arithmetic surfaces. We have implemented our algorithm for curves over $\mathbb Q$, and we show how to use it to compute regulators for a number of Jacobians of smooth…
Well-known subadditivity results for positive operators (of Brown-Kosaki and Rotfeld/Ando-Zhan types) are extended to Hermitian and normal ones. Applications to Cartesian decomposition and block-matrices are given.
We revisit the asymptotic analysis of probabilistic construction of adjacency matrices of expander graphs proposed in [4]. With better bounds we derived a new reduced sample complexity for the number of nonzeros per column of these…
The improvement of traffic efficiency at urban intersections receives strong research interest in the field of automated intersection management. So far, mostly non-learning algorithms like reservation or optimization-based ones were…
We obtain a new inequality for arbitrary Hermitian matrices. We describe particular linear maps called the matrix portrait of arbitrary NxN matrices. The maps are obtained as analogs of partial tracing of density matrices of multipartite…
The problem of approximate joint diagonalization of a collection of matrices arises in a number of diverse engineering and signal processing problems. This problem is usually cast as an optimization problem, and it is the main goal of this…
Riordan matrices are infinite lower triangular matrices determined by a pair of formal power series over the real or complex field. These matrices have been mainly studied as combinatorial objects with an emphasis placed on the algebraic or…