| Title: | On the BCI problem |
|---|
| Authors: | ID Dobson, Ted (Author)
ID Robson, Gregory (Author) |
|---|
| Files: |  AMC_Dobson,_Robson_2026.pdf (511,43 KB)
MD5: BBA39FAC26B872F4E857BF4679A11258
|
|---|
| Language: | English |
|---|
| Work type: | Article |
|---|
| Typology: | 1.01 - Original Scientific Article |
|---|
| Organization: | ZUP - University of Primorska Press
|
|---|
| Abstract: | Let G be a group. The BCI problem asks whether two Haar graphs of G are isomorphic if and only if they are isomorphic by an element of an explicit list of isomorphisms. We first generalize this problem in a natural way and give a theoretical way to solve the isomorphism problem for the natural generalization. We then restrict our attention to abelian groups and, with an exception, reduce the problem to the isomorphism problem for a related quotient, component, or corresponding Cayley digraph. For Haar graphs of an abelian group of odd order with connection sets S those of Cayley graphs (i.e. S = -S), the exception does not exist. For Haar graphs of cyclic groups of odd order with connection sets those of a Cayley graph, among others, we solve the isomorphism problem. |
|---|
| Keywords: | Cayley, Haar, CI, BCI, abelian group |
|---|
| Publication status: | Published |
|---|
| Publication version: | Version of Record |
|---|
| Publication date: | 19.05.2026 |
|---|
| Publisher: | Založba Univerze na Primorskem |
|---|
| Year of publishing: | 2026 |
|---|
| Number of pages: | 29 str. |
|---|
| Numbering: | Vol. 26, no. 3, [article no.] P3.01 |
|---|
| PID: | 20.500.12556/RUP-23502  |
|---|
| UDC: | 51 |
|---|
| eISSN: | 1855-3974 |
|---|
| DOI: | 10.26493/1855-3974.3490.91f |
|---|
| Publication date in RUP: | 17.08.2026 |
|---|
| Views: | 94 |
|---|
| Downloads: | 2 |
|---|
| 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. |
