|
| |
|
|
Image of woman in romances of second half of 14th century
Hlavatý, Michal ; Charvátová, Kateřina (advisor) ; Sládková, Kateřina (referee)
This thesis deals with image of women in romances of second half of 14th century with accent on the Czech productions. Foreign productions are mentioned as well, but this productions are mentioned marginally. At the beginning of this project, there are presented primary and secondary sources on which the project is based. Methodics of project are next. Next there is described issue of romances in european and Czech environment and there is description of real stand of woman in the Middle Ages. Afterwards there are presented characters of women in particular sources with historical context. End of project includes conclusion which is trying to explain how a woman in the 14th century was perceived in used sources.
|
|
|
The Ideal of Chivalrous Sovereign. The Case of Czech Medieval Alexandrian Epic
Rajterová, Petra ; Dvořáčková, Dana (advisor) ; Žemlička, Josef (referee)
My final thesis, based on study of primary and secondary sources, is focused on the idea of sovereign around 1300 AD. Old-Czech poem Alexandreida and German version Alexander of Ulrich von Etzenbach are used as primary repository of information. Thesis follows both of them and in their comparison shows, how the idea was formulated. Final thesis deals also with works of historians, literary historians and German studies related to its topic. The goal is not an linguistic analysis but to evaluate the poems as an historiographic source, on which we can study medieval notions of rulers and their role in society. Second main task for this final thesis is to reconstruct niveau of bohemian court surrounding King of Bohemia at the end of 13th century, where the poems were originally written. In the end, thesis describes so called "court culture" in the relation to both of Alexandrian poems and their influence in bohemia society.
|
|
|
Typology of chosen women characters in the Czech literature of the second half of 19th century
Kubálková, Tereza ; Krejčová, Iva (advisor) ; Mocná, Dagmar (referee)
The diploma thesis deals with the typology of nine chosen literary women characters of the second half of 19th century Czech literature. The woman character from the Čtyry doby short story by Božena Němcová, Liduška and Lenka by Vítězslav Hálek, lady Ruska, miss Máry and the unnamed protagonist of the U tří lilií short story from Povídky malostranské by Jan Neruda, Caterina and lady Dragopulos from Jan Maria Plojhar by Julius Zeyer and Lucy from Magdalena by Josef Svatopluk Machar, are at focus. The theoretical part outlines the issues of literary styles of the second half of 19th century Czech literature (namely Romanticism, Realism, Parnasism). Also it delimits the extension of markers for interpretation of women literary characters and, moreover, it briefly presents the women social position in 19th century society. In practical part, the thesis aims to analyze thoroughly the chosen characters, trying to point out all the common features as well as the differences among them. The thesis concludes with the comparison of all chosen characters and, at the same time, it sums up the main changes in the depiction of a women literary character throughout the century.
|
|
|
Additive combinatorics and number theory
Hančl, Jaroslav ; Klazar, Martin (advisor)
We present several results for growth functions of ideals of different com- binatorial structures. An ideal is a set downward closed under a containment relation, like the relation of subpartition for partitions, or the relation of induced subgraph for graphs etc. Its growth function (GF) counts elements of given size. For partition ideals we establish an asymptotics for GF of ideals that do not use parts from a finite set S and use this to construct ideal with highly oscillating GF. Then we present application characterising GF of particular partition ideals. We generalize ideals of ordered graphs to ordered uniform hypergraphs and show two dichotomies for their GF. The first result is a constant to linear jump for k-uniform hypergraphs. The second result establishes the polynomial to exponential jump for 3-uniform hypergraphs. That is, there are no ordered hypergraph ideals with GF strictly inside the constant-linear and polynomial- exponential range. We obtain in both dichotomies tight upper bounds. Finally, in a quite general setting we present several methods how to generate for various combinatorial structures pairs of sets defining two ideals with iden- tical GF. We call these pairs Wilf equivalent pairs and use the automorphism method and the replacement method to obtain such pairs. 1
|
|
|
Additive combinatorics and number theory
Hančl, Jaroslav ; Klazar, Martin (advisor)
We present several results for growth functions of ideals of different com- binatorial structures. An ideal is a set downward closed under a containment relation, like the relation of subpartition for partitions, or the relation of induced subgraph for graphs etc. Its growth function (GF) counts elements of given size. For partition ideals we establish an asymptotics for GF of ideals that do not use parts from a finite set S and use this to construct ideal with highly oscillating GF. Then we present application characterising GF of particular partition ideals. We generalize ideals of ordered graphs to ordered uniform hypergraphs and show two dichotomies for their GF. The first result is a constant to linear jump for k-uniform hypergraphs. The second result establishes the polynomial to exponential jump for 3-uniform hypergraphs. That is, there are no ordered hypergraph ideals with GF strictly inside the constant-linear and polynomial- exponential range. We obtain in both dichotomies tight upper bounds. Finally, in a quite general setting we present several methods how to generate for various combinatorial structures pairs of sets defining two ideals with iden- tical GF. We call these pairs Wilf equivalent pairs and use the automorphism method and the replacement method to obtain such pairs. 1
|
|
|
Additive combinatorics and number theory
Hančl, Jaroslav ; Klazar, Martin (advisor) ; Balogh, Jozsef (referee) ; Nedela, Roman (referee)
We present several results for growth functions of ideals of different com- binatorial structures. An ideal is a set downward closed under a containment relation, like the relation of subpartition for partitions, or the relation of induced subgraph for graphs etc. Its growth function (GF) counts elements of given size. For partition ideals we establish an asymptotics for GF of ideals that do not use parts from a finite set S and use this to construct ideal with highly oscillating GF. Then we present application characterising GF of particular partition ideals. We generalize ideals of ordered graphs to ordered uniform hypergraphs and show two dichotomies for their GF. The first result is a constant to linear jump for k-uniform hypergraphs. The second result establishes the polynomial to exponential jump for 3-uniform hypergraphs. That is, there are no ordered hypergraph ideals with GF strictly inside the constant-linear and polynomial- exponential range. We obtain in both dichotomies tight upper bounds. Finally, in a quite general setting we present several methods how to generate for various combinatorial structures pairs of sets defining two ideals with iden- tical GF. We call these pairs Wilf equivalent pairs and use the automorphism method and the replacement method to obtain such pairs. 1
|
|
|
Literary representation of knightly ideal in Bohemian of High Middle Ages
VACLÍK, Jan
The aim of this work is to deal with concept of ideal knight in seleceted Old Bohemian literary work of High Middle Ages in genre so called hints. The name of this composicion is Rada otce synovi. By means of literary analysis we will try to examine textual strategies which defined central features of knight ethic. We will also try to find the ideal representative of knighthood and other ideals connected with it as well as circumstances which took part in creating phenomenon of kighthood in Bohemical area.
|
|
| |
|
| |
guest ::
