Lupa

Search the repository Help

A- | A+ | Print
Query: search in
search in
search in
search in
* old and bologna study programme

Options:
  Reset


81 - 90 / 160
First pagePrevious page567891011121314Next pageLast page
81.
82.
Paesaggio culturale e ambiente del Carso : l'ǂuso delle risorse naturali in età moderna
Aleksander Panjek, 2015, scientific monograph

Published in RUP: 21.12.2015; Views: 2261; Downloads: 44
.pdf Full text (16,77 MB)

83.
Preference pri sklepanju prijateljstev : zaključna naloga
Tjaša Kunavar, 2015, undergraduate thesis

Keywords: prijateljstvo, prijatelj, zaželjene lastnosti, spoštovanje
Published in RUP: 15.10.2015; Views: 2532; Downloads: 17
URL Link to full text

84.
85.
86.
87.
On the split structure of lifted groups
Aleksander Malnič, Rok Požar, 2016, original scientific article

Abstract: Let ▫$\wp \colon \tilde{X} \to X$▫ be a regular covering projection of connected graphs with the group of covering transformations ▫$\rm{CT}_\wp$▫ being abelian. Assuming that a group of automorphisms ▫$G \le \rm{Aut} X$▫ lifts along $\wp$ to a group ▫$\tilde{G} \le \rm{Aut} \tilde{X}$▫, the problem whether the corresponding exact sequence ▫$\rm{id} \to \rm{CT}_\wp \to \tilde{G} \to G \to \rm{id}$▫ splits is analyzed in detail in terms of a Cayley voltage assignment that reconstructs the projection up to equivalence. In the above combinatorial setting the extension is given only implicitly: neither ▫$\tilde{G}$▫ nor the action ▫$G\to \rm{Aut} \rm{CT}_\wp$▫ nor a 2-cocycle ▫$G \times G \to \rm{CT}_\wp$▫, are given. Explicitly constructing the cover ▫$\tilde{X}$▫ together with ▫$\rm{CT}_\wp$▫ and ▫$\tilde{G}$▫ as permutation groups on ▫$\tilde{X}$▫ is time and space consuming whenever ▫$\rm{CT}_\wp$▫ is large; thus, using the implemented algorithms (for instance, HasComplement in Magma) is far from optimal. Instead, we show that the minimal required information about the action and the 2-cocycle can be effectively decoded directly from voltages (without explicitly constructing the cover and the lifted group); one could then use the standard method by reducing the problem to solving a linear system of equations over the integers. However, along these lines we here take a slightly different approach which even does not require any knowledge of cohomology. Time and space complexity are formally analyzed whenever ▫$\rm{CT}_\wp$▫ is elementary abelian.
Keywords: algorithm, abelian cover, Cayley voltages, covering projection, graph, group extension, group presentation, lifting automorphisms, linear systems over the integers, semidirect product
Published in RUP: 15.10.2015; Views: 2783; Downloads: 157
.pdf Full text (422,56 KB)

88.
Brez vode : parni vlak na Krasu
Aleksander Panjek, Hrvoje Ratkajec, 2015, independent scientific component part or a chapter in a monograph

Keywords: Kras, naravni viri, voda, vodni viri, železnica, parni vlak, novi vek, kulturna krajina
Published in RUP: 14.10.2015; Views: 3560; Downloads: 88
URL Link to full text

89.
90.
Branding trends 2020
Armand Faganel, Aleksander Janeš, 2015, published scientific conference contribution abstract

Keywords: marketing, blagovne znamke, trend, marketing, brands, branding, trends, forecast
Published in RUP: 14.10.2015; Views: 3387; Downloads: 86
URL Link to full text

Search done in 0 sec.
Back to top
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica