Lupa

Iskanje po repozitoriju Pomoč

A- | A+ | Natisni
Iskalni niz: išči po
išči po
išči po
išči po
* po starem in bolonjskem študiju

Opcije:
  Ponastavi


11 - 20 / 25
Na začetekNa prejšnjo stran123Na naslednjo stranNa konec
11.
Užitek branja : Aidan Chambers in njegov pristop k branju
Nataša Požar Barut, 2017, magistrsko delo

Objavljeno v RUP: 15.06.2020; Ogledov: 1079; Prenosov: 47
.pdf Celotno besedilo (991,84 KB)

12.
13.
14.
Computing stable epimorphisms onto finite groups
Rok Požar, 2018, izvirni znanstveni članek

Ključne besede: algorith, epimorphism, finitely presented group, regular covering projection, quotient group
Objavljeno v RUP: 02.03.2018; Ogledov: 2104; Prenosov: 131
URL Povezava na celotno besedilo

15.
16.
Problem predstavitve objektov v psevdo-evklidskem prostoru : zaključna naloga
Marko Palangetić, 2016, diplomsko delo

Ključne besede: algorithms, optimization, mathematical programming
Objavljeno v RUP: 13.11.2017; Ogledov: 2849; Prenosov: 67
URL Povezava na celotno besedilo
Gradivo ima več datotek! Več...

17.
18.
Lower bounds on the simultaneous conjugacy problem in the symmetric group
Rok Požar, Andrej Brodnik, Aleksander Malnič, 2015, objavljeni povzetek znanstvenega prispevka na konferenci

Ključne besede: communication complexity, lower bound, symmetric group
Objavljeno v RUP: 08.08.2016; Ogledov: 2423; Prenosov: 42
URL Povezava na celotno besedilo

19.
On the split structure of lifted groups
Aleksander Malnič, Rok Požar, 2016, izvirni znanstveni članek

Opis: 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.
Ključne besede: algorithm, abelian cover, Cayley voltages, covering projection, graph, group extension, group presentation, lifting automorphisms, linear systems over the integers, semidirect product
Objavljeno v RUP: 15.10.2015; Ogledov: 2675; Prenosov: 157
.pdf Celotno besedilo (422,56 KB)

20.
Computational aspects of lifting automorphisms
Rok Požar, 2015, objavljeni povzetek znanstvenega prispevka na konferenci

Ključne besede: covering projection, graph, lifting automorphsim
Objavljeno v RUP: 15.10.2015; Ogledov: 2129; Prenosov: 13
URL Povezava na celotno besedilo

Iskanje izvedeno v 0.05 sek.
Na vrh
Logotipi partnerjev Univerza v Mariboru Univerza v Ljubljani Univerza na Primorskem Univerza v Novi Gorici