Related papers: On Cartesian product of matrices
We give a geometric method for determining the cohomology groups and the product structure of a polyhedral product, under suitable freeness conditions or with coefficients taken in a field. This is done by considering first a special class…
We study the problem when every matrix over a division ring is representable as either the product of traceless matrices or the product of semi-traceless matrices, and also give some applications of such decompositions. Specifically, we…
We study inheritance of path-pairability in the Cartesian product of graphs, and prove different (such as additive and multiplicative) inheritance patterns of path-pairability, depending on the size of the Cartesian product. We present…
Products in double categories, as found in cartesian double categories, are an elegant concept with numerous applications, yet also have a few puzzling aspects. In this paper, we revisit double-categorical products from an unbiased…
We consider the numerical approximation of $f({\cal A})b$ where $b\in{\mathbb R}^{N}$ and $\cal A$ is the sum of Kronecker products, that is ${\cal A}=M_2 \otimes I + I \otimes M_1\in{\mathbb R}^{N\times N}$. Here $f$ is a regular function…
We derive a trace formula for $\sum_n A_{nn}B_{nn}...\delta(E-E_n)$, where $A_{nn}$ is the diagonal matrix element of the operator $A$ in the energy basis of a chaotic system. The result takes the form of a smooth term plus periodic-orbit…
We study Markov chains formed by squared singular values of products of truncated orthogonal, unitary, symplectic matrices (corresponding to the Dyson index $\beta = 1,2,4$ respectively) where time corresponds to the number of terms in the…
An extension of Chernoff's product formula for one-parameter functions taking values in the space of bounded linear operators on a Banach space is given. Essentially, the $n$-th one-parameter function in the product formula is mapped by the…
We describe certain special consequences of certain elementary methods from group theory for studying the algebraic complexity of matrix multiplication, as developed by H. Cohn, C. Umans et. al. in 2003 and 2005. The measure of complexity…
In this paper, we investigate arithmetical structures on Cartesian product graphs, particularly, ladder graph of the form P2\square Pm and grid graph of the form Pn \square Pm. An arithmetical structure on a finite and connected graph G is…
We consider the question of the boundedness of matrix products $A_{n}B_{n}\cdots A_{1}B_{1}$ with factors from two sets of matrices, $A_{i}\in\mathscr{A}$ and $B_{i}\in\mathscr{B}$, due to an appropriate choice of matrices $\{B_{i}\}$. It…
We analyze a definition of product of Banach spaces that is naturally associated by duality with an abstract notion of space of multiplication operators. This dual relation allows to understand several constructions coming from different…
A graph G is said to be 1-perfectly orientable (1-p.o. for short) if it admits an orientation such that the out-neighborhood of every vertex is a clique in G. The class of 1-p.o. graphs forms a common generalization of the classes of…
In this paper we study some algebraic properties of hypergraphs, in particula their Betti numbers. We define some different types of complete hypergraphs, which to the best of our knowledge, are not previously considered in the literature.…
A natural definition of the product of infinite matrices mimics the usual formulation of multiplication of finite matrices with the caveat (in the absence of any sense of convergence) that the intersection of the support of each row of the…
There has been significant research dedicated towards computing the crossing numbers of families of graphs resulting from the Cartesian products of small graphs with arbitrarily large paths, cycles and stars. For graphs with four or fewer…
We prove upper and lower bounds on the chromatic number of the square of the cartesian product of trees. The bounds are equal if each tree has even maximum degree.
Betweenness centrality is a widely-used measure in the analysis of large complex networks. It measures the potential or power of a vertex to control the communication over the network under the assumption that information primarily flows…
We refine two results of Jiang, Shao and Vesel on the $L(2,1)$-labeling number $\lambda$ of the Cartesian and the strong product of two oriented cycles. For the Cartesian product, we compute the exact value of $\lambda(\overrightarrow{C_m}…
We determine the values of s and t for which there is a coloring of the edges of the complete bipartite graph K_{s,t} which admits only the identity automorphism. In particular this allows us to determine the distinguishing number of the…