Apportionable matrices and gracefully labelled graphs
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909214234902528 |
|---|---|
| author | Clark, Antwan Curtis, Bryan A. Gnang, Edinah K. Hogben, Leslie |
| author_facet | Clark, Antwan Curtis, Bryan A. Gnang, Edinah K. Hogben, Leslie |
| contents | To apportion a complex matrix means to apply a similarity so that all entries of the resulting matrix have the same magnitude. We initiate the study of apportionment, both by unitary matrix similarity and general matrix similarity. There are connections between apportionment and classical graph decomposition problems, including graceful labelings of graphs, Hadamard matrices, and equiangluar lines, and potential applications to instantaneous uniform mixing in quantum walks. The connection between apportionment and graceful labelings allows the construction of apportionable matrices from trees. A generalization of the well-known Eigenvalue Interlacing Inequalities using graceful labelings is also presented. It is shown that every rank one matrix can be apportioned by a unitary similarity, but there are $2\x 2$ matrices that cannot be apportioned. A necessary condition for a matrix to be apportioned by unitary matrix is established. This condition is used to construct a set of matrices with nonzero Lebesgue measure that are not apportionable by a unitary matrix. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2308_11808 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Apportionable matrices and gracefully labelled graphs Clark, Antwan Curtis, Bryan A. Gnang, Edinah K. Hogben, Leslie Combinatorics 05C50, 05C78, 15A04, 15A18 To apportion a complex matrix means to apply a similarity so that all entries of the resulting matrix have the same magnitude. We initiate the study of apportionment, both by unitary matrix similarity and general matrix similarity. There are connections between apportionment and classical graph decomposition problems, including graceful labelings of graphs, Hadamard matrices, and equiangluar lines, and potential applications to instantaneous uniform mixing in quantum walks. The connection between apportionment and graceful labelings allows the construction of apportionable matrices from trees. A generalization of the well-known Eigenvalue Interlacing Inequalities using graceful labelings is also presented. It is shown that every rank one matrix can be apportioned by a unitary similarity, but there are $2\x 2$ matrices that cannot be apportioned. A necessary condition for a matrix to be apportioned by unitary matrix is established. This condition is used to construct a set of matrices with nonzero Lebesgue measure that are not apportionable by a unitary matrix. |
| title | Apportionable matrices and gracefully labelled graphs |
| topic | Combinatorics 05C50, 05C78, 15A04, 15A18 |
| url | https://arxiv.org/abs/2308.11808 |