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


1 - 10 / 25
Na začetekNa prejšnjo stran123Na naslednjo stranNa konec
1.
O razčlenitvah naravnih števil in nekaterih kombinatoričnih temah : zaključna naloga
Matic Požar, 2023, diplomsko delo

Ključne besede: množica, elementi, razčlenitev, bijekcija, indukcija, rekruzija
Objavljeno v RUP: 10.10.2023; Ogledov: 260; Prenosov: 3
.pdf Celotno besedilo (512,81 KB)

2.
3.
Istrska turistična cesta v turistični ponudbi : diplomska naloga
Alenka Požar, 2002, diplomsko delo

Opis: Namen vinske turistične ceste je podpreti razvoj vinogradništva, je dodatna možnost oživljanja podeželja, povezovanje mesta z zaledjem ter obogatitev turistične ponudbe. Hkrati predstavlja najboljšo obliko neposrednega promoviranja vin posameznega vinorodnega okoliša in njegove naravne in kulturne dediščine. V prvem delu je z zgodovinskega in gospodarskega vidika predstavljena slovenska Istra. Sledi opis vinorodnih okolišev Slovenije ter definicija vinske turistične ceste. Naloga temelji na predstavitvi Istrske vinske turistične ceste. Predstavljena so najznačilnejša istrska vina in ponudniki na Istrski vinski turistični cesti. Opisan je pomen naravne in kulturne dediščine za razvoj Istrske vinske turistične ceste. V nadaljevanju je s pomočjo marketiškega spleta in SWOT analize VTC prikazana z vidika trženja. Nazadnje so na podlagi ugotovitev navedeni konkretni predlogi za izboljšanje tega projekta, ki bi hkrati omogočili, da bi Istrska vinska turistična cesta dejansko zaživela in postala del turistične ponudbe obalnih mest.
Ključne besede: Vinska turistična cesta, slovenska Istra, vino, trženje, diplomske naloge
Objavljeno v RUP: 23.06.2022; Ogledov: 729; Prenosov: 31
.pdf Celotno besedilo (1,62 MB)

4.
5.
Testing whether the lifted group splits
Rok Požar, 2016, izvirni znanstveni članek

Opis: 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.
Ključne besede: algorithm, graph, group extension, lifting automorphisms, regular covering projection, voltages
Objavljeno v RUP: 03.01.2022; Ogledov: 656; Prenosov: 17
.pdf Celotno besedilo (317,95 KB)

6.
Sectional split extensions arising from lifts of groups
Rok Požar, 2013, izvirni znanstveni članek

Opis: Covering techniques have recently emerged as an effective tool used for classification of several infinite families of connected symmetric graphs. One commonly encountered technique is based on the concept of lifting groups of automorphisms along regular covering projections ▫$\wp \colon \tilde{X} \to X$▫. Efficient computational methods are known for regular covers with cyclic or elementary abelian group of covering transformations CT▫$(\wp)$▫. In this paper we consider the lifting problem with an additional condition on how a group should lift: given a connected graph ▫$X$▫ and a group ▫$G$▫ of its automorphisms, find all connected regular covering projections ▫$\wp \colon \tilde{X} \to X$▫ along which ▫$G$▫ lifts as a sectional split extension. By this we mean that there exists a complement ▫$\overline{G}$▫ of CT▫$(\wp)$▫ within the lifted group ▫$\tilde{G}$▫ such that ▫$\overline{G}$▫ has an orbit intersecting each fibre in at most one vertex. As an application, all connected elementary abelian regular coverings of the complete graph ▫$K_4$▫ along which a cyclic group of order 4 lifts as a sectional split extension are constructed.
Ključne besede: covering projection, graph, group extension, lifting automorphisms, voltage assignment
Objavljeno v RUP: 31.12.2021; Ogledov: 914; Prenosov: 3
.pdf Celotno besedilo (365,16 KB)

7.
8.
9.
10.
Iskanje izvedeno v 0.11 sek.
Na vrh
Logotipi partnerjev Univerza v Mariboru Univerza v Ljubljani Univerza na Primorskem Univerza v Novi Gorici