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 - 2 / 2
Na začetekNa prejšnjo stran1Na naslednjo stranNa konec
1.
Make the friendship bracelets : from parasocial attachment to horizontal reciprocity in Taylor Swift fandom
Eva Vrtačič, 2026, izvirni znanstveni članek

Opis: This article analyses the exchange of friendship bracelets among Taylor Swift fans (Swifties) as a gift economy shaped by parasociality and platform capitalism. Because the celebrity is structurally inaccessible at scale, reciprocity cannot return as an interpersonal gift and is instead displaced laterally into fan-to-fan exchange, becoming horizontal reciprocity and a moral economy of belonging. Drawing on Mauss and Lévi-Strauss, and extending the analysis through Malinowski, Appadurai, Kopytoff, Weiner, Gell, and Miller, I show how mass-produced materials are singularised through labour and ex change. The Eras Tour operates as a tournament of value in which bracelets function as pop-cultural valuables whose circulation organises recognition and inclusion. Reciprocity here can be understood as temporally extended, networked circulation anchored around an absent centre.
Ključne besede: Taylor Swift fandom, swifties, friedship bracelets, parasociality, reciprocity, tournaments of value, inalienable possessions
Objavljeno v RUP: 21.08.2026; Ogledov: 279; Prenosov: 5
.pdf Celotno besedilo (140,68 KB)
Gradivo ima več datotek! Več...

2.
Isomorphism testing of k-spanning tournaments is fixed parameter tractable
Vikraman Arvind, Ilia Ponomarenko, Grigory Ryabov, 2025, izvirni znanstveni članek

Opis: An arc-colored tournament is said to be k-spanning for an integer k ≥ 1 if the union of its arc-color classes of maximal valency at most k is the arc set of a strongly connected digraph. It is proved that isomorphism testing of k-spanning tournaments is fixed-parameter tractable.
Ključne besede: graph isomorphism problem, colored tournaments, fixed-parameter tractable algorithm
Objavljeno v RUP: 03.11.2025; Ogledov: 706; Prenosov: 7
.pdf Celotno besedilo (379,74 KB)

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