Your browser does not allow JavaScript!
JavaScript is necessary for the proper functioning of this website. Please enable JavaScript or use a modern browser.
SLO
Login
Search
Browsing
Upload document
Statistics
RUP
FAMNIT - Faculty of Mathematics, Science and Information Technologies
FHŠ - Faculty of Humanities
FM - Faculty of Management
FTŠ Turistica - Turistica – College of Tourism Portorož
FVZ - Faculty of Health Sciences
IAM - Andrej Marušič Institute
PEF - Faculty of Education
UPR - University of Primorska
ZUP - University of Primorska Press
COBISS
University of Primorska, University Library - all departments
First page
/
Show document
Show document
A-
|
A+
|
Print
Title:
Testing whether the lifted group splits
Authors:
ID
Požar, Rok
(Author)
Files:
RAZ_Pozar_Rok_i2016.pdf
(317,95 KB)
MD5: 2E73B7009D165772EDF532F59E168D33
Language:
English
Work type:
Unknown
Typology:
1.01 - Original Scientific Article
Organization:
ZUP - University of Primorska Press
Abstract:
Let a group of automorphisms lift along a regular covering projection of connected graphs given combinatorially by means of voltages. The data that determine the lifted group and its action are then conveniently encoded in terms of voltages as well. Along these lines, an algorithm for testing whether the lifted group is a split extension of the group of covering transformations has recently been proposed in the case when the group of covering transformations is solvable. It consists of decomposing the covering into a series of coverings with elementary abelian groups of covering transformations, and inductively solving the problem at every elementary abelian step. Although the explicit construction of the lifted group is not needed, it still involves time and space consuming constructions of certain subgroups in the lifted group at every step except at the final one. In this paper, an improved version that completely avoids such constructions is presented. From voltage distribution we first compute the weak action and the factor set that determine the lifted group, and we then carry out the test by extracting the necessary information only from the corresponding weak actions and factor sets at every step. An experimental comparison is made against the previous version.
Keywords:
algorithm
,
graph
,
group extension
,
lifting automorphisms
,
regular covering projection
,
voltages
Year of publishing:
2016
Number of pages:
str. 147-156
Numbering:
Vol. 11, no. 1
PID:
20.500.12556/RUP-17618
UDC:
519.17
ISSN on article:
1855-3966
COBISS.SI-ID:
1537938628
Publication date in RUP:
03.01.2022
Views:
1392
Downloads:
24
Metadata:
Cite this work
Plain text
BibTeX
EndNote XML
EndNote/Refer
RIS
ABNT
ACM Ref
AMA
APA
Chicago 17th Author-Date
Harvard
IEEE
ISO 690
MLA
Vancouver
:
POŽAR, Rok, 2016, Testing whether the lifted group splits.
Ars mathematica contemporanea
[online]. 2016. Vol. 11, no. 1, p. 147–156. [Accessed 5 April 2025]. Retrieved from: https://repozitorij.upr.si/IzpisGradiva.php?lang=eng&id=17618
Copy citation
Average score:
0.5
1
1.5
2
2.5
3
3.5
4
4.5
5
(0 votes)
Your score:
Voting is allowed only for
logged in
users.
Share:
Similar works from our repository:
Sectional split extensions arising from lifts of groups
On the split structure of lifted groups
Computational aspects of lifting automorphisms
On split liftings with sectional complements
Computing stable epimorphisms onto finite groups
Similar works from other repositories:
No similar works found
Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.
Record is a part of a journal
Title:
Ars mathematica contemporanea
Publisher:
Društvo matematikov, fizikov in astronomov, Društvo matematikov, fizikov in astronomov, Univerza na Primorskem, Fakulteta za matematiko, naravoslovje in informacijske tehnologije
ISSN:
1855-3966
COBISS.SI-ID:
239049984
Secondary language
Language:
Slovenian
Title:
Testiranje razcepnosti dvignjene grupe
Abstract:
Naj se grupa avtomorfizmov dvigne vzdolž regularne krovne projekcije povezanih grafov, podane kombinatorično z napetostmi. Tedaj so podatki, ki določajo dvignjeno grupo in njeno delovanje, prav tako zakodirani s pomočjo napetosti. Ustrezni algoritem za testiranje, ali je dvignjena grupa razcepna razširitev grupe krovnih transformacij, je bil nedavno predstavljen v primeru, ko je grupa krovnih transformacij rešljiva. Sestoji iz dekomponiranja krova v zaporedje krovov z elementarnimi abelovimi grupami krovnih transformacij, in induktivnega reševanja problema na vsakem elementarno abelovem koraku. Čeprav eksplicitna konstrukcija dvignjene grupe ni potrebna, algoritem vseeno vključuje časovno in prostorsko zahtevne konstrukcije določenih podgrup v dvignjeni grupi na vsakem koraku z izjemo zadnjega. V tem članku predstavimo izboljšano verzijo algoritma, ki se povsem izogne takšnim konstrukcijam. Iz porazdelitve napetosti najprej izračunamo šibko delovanje in faktorsko množico, ki določata dvignjeno grupo, nato pa izpeljemo test tako, da izluščimo potrebno informacijo samo iz ustreznih šibkih delovanj in faktorskih množic na vsakem koraku. Eksperimentalno primerjamo to in prejšnjo verzijo algoritma.
Comments
Leave comment
You must
log in
to leave a comment.
Comments (0)
0 - 0 / 0
There are no comments!
Back
