Monoid algebras and graph products
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908757698543616 |
|---|---|
| author | Imrich, Wilfried Klep, Igor Smertnig, Daniel |
| author_facet | Imrich, Wilfried Klep, Igor Smertnig, Daniel |
| contents | In this note, we extend results about unique $n^{\textrm{th}}$ roots and cancellation of finite disconnected graphs with respect to the Cartesian, the strong and the direct product, to the rooted hierarchical products, and to a modified lexicographic product. We show that these results also hold for graphs with countably many finite connected components, as long as every connected component appears only finitely often (up to isomorphism). The proofs are via monoid algebras and generalized power series rings. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_02615 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Monoid algebras and graph products Imrich, Wilfried Klep, Igor Smertnig, Daniel Combinatorics Primary 05C25, 20F16, Secondary 05C63 In this note, we extend results about unique $n^{\textrm{th}}$ roots and cancellation of finite disconnected graphs with respect to the Cartesian, the strong and the direct product, to the rooted hierarchical products, and to a modified lexicographic product. We show that these results also hold for graphs with countably many finite connected components, as long as every connected component appears only finitely often (up to isomorphism). The proofs are via monoid algebras and generalized power series rings. |
| title | Monoid algebras and graph products |
| topic | Combinatorics Primary 05C25, 20F16, Secondary 05C63 |
| url | https://arxiv.org/abs/2407.02615 |