Ovaj rad nastoji problematizirati pitanje razumijevanja identiteta u današnjem vremenu, sagledano u kontekstu djelovanja suvremenih medija, interaktivne estetike i pojave novih vrsta afektivnosti i socijabiliteta. Konceptualizirajući iznova ono što je tradicionalno mišljeno kao identitet i identično, a koje je aktualno medijski, estetski i tehnološki posredovano, i time transformirano u odgovarajuće čulne, tjelesne i medijski generirane podatke, rad će sugerirati preispitivanje uvjeta te osnove za nastanak, mogućnost utemeljenja i dijalektičkog razvoja ne samo novih vidova i mjerila identiteta, nego će pokušati uspostaviti (...) i kritički odnos prema njima, a na temelju iskustava jedne interdisciplinarno zasnovane paradigme humanistike i društvenih znanosti.This paper seeks to problematize the issue of understanding identity today, in the context of contemporary media activities, interactive aesthetics, and appearance of new species of affectivity and sociability. Reconceptualising the traditional notion of identity and identical, which is media, aesthetically and technologically mediated, and thus transformed into the appropriate sensory, physical, and media generated data, the paper will suggest a review of conditions and bases for the creation, possibility of the establishment and dialectical development of not only new forms and standards of identity, but will try to establish a critical attitude towards them, based on experiences of an interdisciplinary-based paradigm of humanities and social sciences. (shrink)

The universal homogeneous triangle-free graph, constructed by Henson [A family of countable homogeneous graphs, Pacific J. Math.38(1) (1971) 69–83] and denoted H3, is the triangle-free analogue of the Rado graph. While the Ramsey theory of the Rado graph has been completely established, beginning with Erdős–Hajnal–Posá [Strong embeddings of graphs into coloured graphs, in Infinite and Finite Sets. Vol.I, eds. A. Hajnal, R. Rado and V. Sós, Colloquia Mathematica Societatis János Bolyai, Vol. 10 (North-Holland, 1973), pp. 585–595] and culminating in work (...) of Sauer [Coloring subgraphs of the Rado graph, Combinatorica26(2) (2006) 231–253] and Laflamme–Sauer–Vuksanovic [Canonical partitions of universal structures, Combinatorica26(2) (2006) 183–205], the Ramsey theory of H3 had only progressed to bounds for vertex colorings [P. Komjáth and V. Rödl, Coloring of universal graphs, Graphs Combin.2(1) (1986) 55–60] and edge colorings [N. Sauer, Edge partitions of the countable triangle free homogenous graph, Discrete Math.185(1–3) (1998) 137–181]. This was due to a lack of broadscale techniques. We solve this problem in general: For each finite triangle-free graph G, there is a finite number T(G) such that for any coloring of all copies of G in H3 into finitely many colors, there is a subgraph of H3 which is again universal homogeneous triangle-free in which the coloring takes no more than T(G) colors. This is the first such result for a homogeneous structure omitting copies of some nontrivial finite structure. The proof entails developments of new broadscale techniques, including a flexible method for constructing trees which code H3 and the development of their Ramsey theory. (shrink)

Countable homogeneous relational structures have been studied by many people. One area of focus is the Ramsey theory of such structures. After a review of background material, a partition theorem of Laflamme, Sauer, and Vuksanovic for countable homogeneous binary relational structures is discussed with a focus on the size of the set of unavoidable colors.