| Title: | Monoid algebras and graph products |
|---|
| Authors: | ID Imrich, Wilfried (Author)
ID Klep, Igor (Author)
ID Smertnig, Daniel (Author) |
|---|
| Files: |  ADAM_Imrich,_Klep,Smertnig_2025.pdf (441,50 KB)
MD5: B6924DDEC5F50E806B534E2B7BFA1784
|
|---|
| Language: | English |
|---|
| Work type: | Unknown |
|---|
| Typology: | 1.01 - Original Scientific Article |
|---|
| Organization: | ZUP - University of Primorska Press
|
|---|
| Abstract: | In this note, we extend results about unique n^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. |
|---|
| Keywords: | graph products, monoid algebras, power series rings, uniqueness of roots, cancellation property |
|---|
| Publication status: | Published |
|---|
| Publication version: | Version of Record |
|---|
| Publication date: | 22.04.2025 |
|---|
| Publisher: | Založba Univerze na Primorskem |
|---|
| Year of publishing: | 2025 |
|---|
| Number of pages: | 18 str. |
|---|
| Numbering: | Vol. 8, no. 1, [article no.] P1.11 |
|---|
| PID: | 20.500.12556/RUP-21971  |
|---|
| UDC: | 519.17 |
|---|
| ISSN on article: | 2590-9770 |
|---|
| DOI: | 10.26493/2590-9770.1816.e85 |
|---|
| COBISS.SI-ID: | 234550019 |
|---|
| Publication date in RUP: | 21.10.2025 |
|---|
| Views: | 291 |
|---|
| Downloads: | 3 |
|---|
| Metadata: |    |
|---|
|
:
|
Copy citation |
|---|
| | | | Average score: | (0 votes) |
|---|
| Your score: | Voting is allowed only for logged in users. |
|---|
| Share: |  |
|---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |
