|
Title
|
|
|
|
When can matrix query languages discern matrices?
|
|
|
Author
|
|
|
|
|
|
|
Abstract
|
|
|
|
| We investigate when two graphs, represented by their adjacency matrices, can be distinguished by means of sentences formed in MATLANG, a matrix query language which supports a number of elementary linear algebra operators. When undirected graphs are concerned, and hence the adjacency matrices are real and symmetric, precise characterisations are in place when two graphs (i.e., their adjacency matrices) can be distinguished. Turning to directed graphs, one has to deal with asymmetric adjacency matrices. This complicates matters. Indeed, it requires to understand the more general problem of when two arbitrary matrices can be distinguished in MATLANG. We provide characterisations of the distinguishing power of MATLANG on real and complex matrices, and on adjacency matrices of directed graphs in particular. The proof techniques are a combination of insights from the symmetric matrix case and results from linear algebra and linear control theory. |
|
|
|
Language
|
|
|
|
English
|
|
|
Source (journal)
|
|
|
|
LIPIcs : Leibniz International Proceedings in Informatics. - Place of publication unknown
|
|
|
Source (book)
|
|
|
|
Proceedings of the 23rd International Conference on Database Theory (ICDT 2020)
|
|
|
Publication
|
|
|
|
Dagstuhl
:
Schloss Dagstuhl--Leibniz-Zentrum für Informatik
,
2020
|
|
|
ISBN
|
|
|
|
978-3-95977-139-9
|
|
|
DOI
|
|
|
|
10.4230/LIPICS.ICDT.2020.12
|
|
|
Volume/pages
|
|
|
|
p. 12:1-12:18
|
|
|
Full text (Publisher's DOI)
|
|
|
|
|
|
|
Full text (open access)
|
|
|
|
|
|