La thèse se compose de deux parties. La première partie est consacrée aux transformations des algèbres de dimension finie. Il est facile de voir que le groupe d'automorphismes d'une algèbre de dimension finie est un groupe algébrique affine. N.L. Gordeev et V.L. Popov ont démontré que n'importe quel groupe algébrique affine est isomorphe au groupe d'automorphismes de l'algèbre de dimension finie. Utilisant l'approche similaire nous démontrons que tout monoïde affine peut être obtenue comme un monoïde des endomorphismes d'une algèbre de dimension finie. Ensuite, nous étudions la solvabilité des groupes d'automorphismes d'algèbres commutatives de dimension finie. Nous introduisons un critère de leur solvabilité et l'appliquons aux intersections complètes et aux singularités isolées d'hypersurfaces. Nous étudions également les cas extrêmes du critère introduit. La deuxième partie de la thèse est consacrée à la transitivité infinie de groupes d'automorphismes spéciales de variétés affines et quasi-affines. Cette propriété est équivalente à la flexibilité pour les variétés affines. Tout d'abord, nous montrons l'équivalence entre la transitivité et la transitivité infinie des groupes d'automorphismes spéciaux sur un corps algébriquement clos de caractéristique arbitraire. Nous fournissons ensuite le critère de la flexibilité pour les cônes affines sur les variétés projectives et nous l'appliquons aux surfaces del Pezzo de degré 4 et 5. Enfin, nous étudions la flexibilité des torseurs universels sur les variétés couvertes par des espaces affines et fournissons une large gamme de familles de variétés flexibles. / The thesis consists of two parts. The first part is dedicated to transformations of finite-dimensional algebras. It is easy to see that the automorphism group of a finite-dimensional algebra is an affine algebraic group. N.L.~Gordeev and V.L.~Popov proved that any affine algebraic group is isomorphic to the automorphism group of some finite-dimensional algebra. We use a similar approach to prove that any affine algebraic monoid can be obtained as the endomorphisms' monoid of a finite-dimensional algebra. Next, we study the solvability of automorphism groups of commutative Artin algebras. We introduce a criterion of their solvability and apply it to complete intersections and to isolated hypersurface singularities. We also study extremal cases of the introduced criterion. The second part of the thesis is dedicated to the infinite transitivity of special automorphism groups of affine and quasiaffine varieties. This property is equivalent to the flexibility for affine varieties. Firstly, we prove the equivalence of transitivity and infinite transitivity of special automorphism groups over algebraically closed field of arbitrary characteristic. Then we provide the criterion of flexibility for affine cones over projective varieties and apply it to del Pezzo surfaces of degree 4 and 5. Finally, we study flexibility of universal torsors over varieties covered by affine spaces and provide a wide range of families of flexible varieties.

Title: Algebraic, Structural and Complexity Aspects of Geometric Representations of Graphs Author: Peter Zeman Department: Computer Science Institute Supervisor: RNDr. Pavel Klavík Supervisor's e-mail: klavik@iuuk.mff.cuni.cz Keywords: automorphism groups, interval graphs, circle graphs, comparability graphs, H-graphs, recognition, dominating set, graph isomorphism, maximum clique, coloring Abstract: We study symmetries of geometrically represented graphs. We describe a tech- nique to determine the automorphism group of a geometrically represented graph, by understanding the structure of the induced action on all geometric representations. We prove that interval graphs have the same automorphism groups as trees, and for a given interval graph, we construct a tree with the same automorphism group which answers a question of Hanlon [Trans. Amer. Math. Soc 272(2), 1982]. For permutation and circle graphs, we give an inductive characterization by semidirect and wreath prod- ucts. We also prove that every abstract group can be realized by the automorphism group of a comparability graph/poset of the dimension at most four. We also study H-graphs, introduced by Biró, Hujter, and Tuza in 1992. Those are intersection graphs of connected subgraphs of a subdivision of a graph H. This thesis is the first comprehensive...

The study of integral operators on spaces of analytic functions has been considered for the past few decades. However, most of the studies in this line are based on spaces of analytic functions of the unit disc. For the analytic spaces of the upper half-plane, the literature is still scanty. Most notable is the recent work of Siskakis and Arvanitidis concerning the classical Ces`aro operator on Hardy spaces of the upper half-plane. In this dissertation, we characterize all continuous one-parameter groups of automorphisms of the upper halfplane according to the nature and location of their fixed points into three distinct classes, namely, the scaling, the translation, and the rotation groups. We then introduce the associated groups of weighted composition operators on both Hardy and weighted Bergman spaces of the half-plane. Interestingly, it turns out that these groups of composition operators form three strongly continuous groups of isometries. A detailed analysis of each of these groups of isometries is carried out. Specifically, we determine the spectral properties of the generators of every group, and using both spectral and semigroup theory of Banach spaces, we obtain concrete representations of the resolvents as integral operators on both Hardy and Bergman spaces of the half-plane. For the scaling group, the resulting resolvent operators are exactly the Ces`aro-like operators. The spectral properties of the obtained integral operators is also determined. Finally, we detail the theory of both Szeg¨o and Bergman projections of the half-plane, and use it to determine the duality properties of these spaces. Consequently, we obtain the adjoints of the resolvent operators on the reflexive Hardy and Bergman spaces of the half-plane.

Cette thèse porte sur l'étude des groupes polonais vus comme groupes d'automorphismes de structures métriques. L'observation que tout groupe polonais non archimédien est le groupe d'automorphismes d'une structure dénombrable ultra homogène a en effet mené à des interactions fructueuses entre la théorie des groupes et la théorie des modèles. Dans le cadre de la théorie des modèles métriques, introduite par Ben Yaacov, Henson et Usvyatsov, cette correspondance a été étendue par Melleray à tous les groupes polonais. Dans cette thèse, nous étudions diverses facettes de cette correspondance. Le lien entre une structure et son groupe d automorphismes est particulièrement étroit dans le cadre des structures ℵ0-categoriques. En effet, le théorème de reconstruction d'Ahlbrandt-Ziegler permet de retrouver une structure ℵ0-categorique, à bi-interprètabilité près, à partir de son groupe d'automorphismes. Dans un travail en commun avec Itai Ben Yaacov, nous généralisons ce résultat aux structures métriques separablement catégoriques. Les structures dénombrables ultra homogènes ont de plus l avantage d'être complètement déterminées par leurs sous-structures finiment engendrées. Cela a notamment permis a Moore de donner une caractérisation combinatoire de la moyennabilité des groupes polonais non archimédiens. Nous étendons cette caractérisation à tous les groupes polonais et nous en déduisons que la moyennabilite est une condition Gδ. Toujours dans une optique de reconstruction, nous nous intéressons à la propriété de continuité automatique pour les groupes polonais. Sabok et Malicki ont introduit des conditions de nature combinatoire sur une structure métrique ultra homogène qui impliquent la propriété de continuité automatique pour son groupe d'automorphismes. Nous montrons que ces conditions passent à la puissance dénombrable, ce qui a pour conséquence que les groupes Aut(μ)N, U(l2)N et Iso(U)N satisfont la propriété de continuité automatique. Ces conditions sont un affaiblissement du fait d'avoir des amples génériques. Dans un travail en commun avec Francois Le Maitre, nous exhibons les premiers exemples de groupes connexes qui ont des amples génériques, ce qui répond à une question de Kechris et Rosendal / This thesis focuses on the study of Polish groups seen as automorphism groups of metric structures. The observation that every non-archimedean Polish group is the automorphism group of an ultrahomogeneous countable structure has indeed led to fruitful interactions between group theory and model theory. In the framework of metric model theory, introduced by Ben Yaacov, Henson and Usvyastov, this correspondence has been extended to all Polish groups by Melleray. In this thesis, we study various facets of this correspondence. The relationship between a structure and its automorphism group is particularly close in the setting of ℵ0-categorical structures. Indeed, the Ahlbrandt-Ziegler reconstruction theorem allows one to recover an ℵ0-categorical structure, up to bi-interpretability, from its automorphism group. In a joint work with Itai Ben Yaacov, we generalize this result to separably categorical metric structures. Besides, ultrahomogeneous countable structures have the advantage of being completely determined by their finitely generated substructures. In particular, this enabled Moore to give a combinatorial characterization of amenability for nonarchimedean Polish groups. We extend this characterization to all Polish groups and we deduce that amenability is a Gδ condition. Still in a reconstruction perspective, we are interested in the automatic continuity property for Polish groups. Sabok and Malicki introduced conditions of a combinatorial nature on an ultrahomogeneous metric structure that imply the automatic continuity property for its automorphism group. We show that these conditions carry to countable powers, which leads to the groups Aut(μ)N, U(l2)N and Iso(U)N satisfying the automatic continuity property. Those conditions are a weakening of the property of having ample generics. In a joint work with Francois Le Maitre, we exhibit the first examples of connected groups with ample generics, which answers a question of Kechris and Rosendal. Finally, in a joint work with Isabel Muller and Aristotelis Panagiotopoulos, we study the relative homogeneity of substructures in an ultrahomogeneous countable structure. We characterize it completely by a property of the types over the substructures: being determined by a finite set

In this thesis, we describe linear codes over prime fields obtained from incidence designs of iterated line graphs of complete graphs Li(Kn) where i = 1, 2. In the binary case, results are extended to codes from neighbourhood designs of the line graphs Li+1(Kn) using certain elementary relations. Codes from incidence designs of complete graphs, Kn, and neighbourhood designs of their line graphs, L1(Kn) (the so-called triangular graphs), have been considered elsewhere by others. We consider codes from incidence designs of L1(Kn) and L2(Kn), and neighbourhood designs of L2(Kn) and L3(Kn). In each case, basic parameters of the codes are determined. Further, we introduce a family of vertex-transitive graphs 􀀀n that are embeddable into the strong product L1(Kn) ⊠ K2, of triangular graphs and K2, a class which at first sight may seem unnatural but, on closer look, is a repository of graphs rich with combinatorial structures. For instance, unlike most regular graphs considered here and elsewhere that only come with incidence and neighbourhood designs, 􀀀n also has what we have termed as 6-cycle designs. These are designs in which the point set contains vertices of the graph and every block contains vertices of a 6-cycle in the graph. Also, binary codes from incidence matrices of these graphs have other minimum words in addition to incidence vectors of the blocks. In addition, these graphs have induced subgraphs isomorphic to the family Hn of complete porcupines (see Definition 4.11). We describe codes from incidence matrices of 􀀀n and Hn and determine their parameters.

In this thesis, we describe linear codes over prime fields obtained from incidence designs of iterated line graphs of complete graphs Li(Kn) where i = 1, 2. In the binary case, results are extended to codes from neighbourhood designs of the line graphs Li+1(Kn) using certain elementary relations. Codes from incidence designs of complete graphs, Kn, and neighbourhood designs of their line graphs, L1(Kn) (the so-called triangular graphs), have been considered elsewhere by others. We consider codes from incidence designs of L1(Kn) and L2(Kn), and neighbourhood designs of L2(Kn) and L3(Kn). In each case, basic parameters of the codes are determined. Further, we introduce a family of vertex-transitive graphs 􀀀n that are embeddable into the strong product L1(Kn) ⊠ K2, of triangular graphs and K2, a class which at first sight may seem unnatural but, on closer look, is a repository of graphs rich with combinatorial structures. For instance, unlike most regular graphs considered here and elsewhere that only come with incidence and neighbourhood designs, 􀀀n also has what we have termed as 6-cycle designs. These are designs in which the point set contains vertices of the graph and every block contains vertices of a 6-cycle in the graph. Also, binary codes from incidence matrices of these graphs have other minimum words in addition to incidence vectors of the blocks. In addition, these graphs have induced subgraphs isomorphic to the family Hn of complete porcupines (see Definition 4.11). We describe codes from incidence matrices of 􀀀n and Hn and determine their parameters.

Philosophiae Doctor - PhD (Mathematics) / The main theme of this thesis is the construction of linear codes from adjacency matrices or sub-matrices of adjacency matrices of regular graphs. We first examine the binary codes from the row span of biadjacency matrices and their transposes for some classes of bipartite graphs. In this case we consider a sub-matrix of an adjacency matrix of a graph as the generator of the code. We then shift our attention to uniform subset graphs by exploring the automorphism groups of graph covers and some classes of uniform subset graphs. In the sequel, we explore equal codes from adjacency matrices of non-isomorphic uniform subset graphs and finally consider codes generated by an adjacency matrix formed by adding adjacency matrices of two classes of uniform subset graphs.

Le groupe de Cremona en n variables Cr_n(C) est le groupe des transformations birationnelles de l'espace projectif complexe de dimension n. Dans cette thèse, on étudie les groupes de Cremona en considérant certaines classes de „grands'' sous-groupes. Dans la première partie on considère des plongements algébriques de Cr_2(C) vers Cr_n(C). On décrit notamment quelques propriétés géométriques d'un plongement de Cr_2(C) dans Cr_5(C) dû à Gizatullin. En outre, on classifie tous les plongements algébriques de Cr_2(C) dans Cr_3(C) et on généralise ce résultat partiellement pour les plongements de Cr_n(C) dans Cr_{n+1}(C). Dans la deuxième partie, on regarde les suites des degrés des transformations birationnelles des variétés définies sur un corps quelconque. On montre qu'il n'existe qu'un nombre dénombrable de telles suites et on donne de nouvelles contraintes sur la croissance des degrés des automorphismes de l'espace affine de dimension n. Dans la troisième partie, on classifie les sous-groupes de Cr_2(C) qui ne contiennent que des éléments elliptiques, c'est-`a-dire des éléments dont les degrés des itérés sont bornés. On en déduit notamment l'alternative de Tits pour les sous-groupes quelconques de Cr_2(C). Dans la dernière partie on montre que tous les sous-groupes simples de type fini de Cr_2(C) sont finis et, sous l'hypothèse d'un lemme conjectural, qu'un groupe simple se plonge dans Cr_2(C) si et seulement s'il se plonge dans PGL_3(C). / The Cremona group in n-variables Cr_n(C) is the group of birational transformations of the complex projective n-space. This thesis contributes to the research on Cremona groups through the study of certain classes of „large'' subgroups. In the first part we consider algebraic embeddings of Cr_2(C) into Cr_n(C). In particular, we describe geometrical properties of an embedding of Cr_2(C) into Cr_5(C) that was discovered by Gizatullin. We also classify all algebraic embeddings from Cr_2(C) into Cr_3(C), and we partially generalize this result to embeddings of Cr_n(C) into Cr_{n+1}(C). In a second part, we look at degree sequences of birational transformations of varieties over arbitrary fields. We show that there exist only countably many such sequences and we give new obstructions on the degree growth of automorphisms of affine n-space. In the third part, we classify subgroups of Cr_2(C) containing only elliptic elements, i.e. elements whose iterates are of bounded degree. From this we deduce in particular the Tits alternative for arbitrary subgroups of Cr_2(C). In the last part, we show that every finitely generated simple subgroup of Cr_2(C) is finite and, under the hypothesis of an unproven conjectural lemma, that a simple group can be embedded into Cr_2(C) if and only if it can be embedded into PGL_3(C).

Philosophiae Doctor - PhD / In this thesis, we describe linear codes over prime fields obtained from incidence designs of iterated line graphs of complete graphs Li(Kn) where i = 1, 2. In the binary case, results are extended to codes from neighbourhood designs of the line graphs Li+1(Kn) using certain elementary relations. Codes from incidence designs of complete graphs, Kn, and neighbourhood designs of their line graphs, L1(Kn) (the so-called triangular graphs), have been considered elsewhere by others. We consider codes from incidence designs of L1(Kn) and L2(Kn), and neighbourhood designs of L2(Kn) and L3(Kn). In each case, basic parameters of the codes are determined. Further, we introduce a family of vertex-transitive graphs Γn that are embeddable into the strong product L1(Kn)⊠  K2, of triangular graphs and K2, a class which at first sight may seem unnatural but, on closer look, is a repository of graphs rich with combinatorial structures. For instance, unlike most regular graphs considered here and elsewhere that only come with incidence and neighbourhood designs, Γn also has what we have termed as 6-cycle designs. These are designs in which the point set contains vertices of the graph and every block contains vertices of a 6-cycle in the graph. Also, binary codes from incidence matrices of these graphs have other minimum words in addition to incidence vectors of the blocks. In addition, these graphs have induced subgraphs isomorphic to the family Hn of complete porcupines (see Definition 4.11). We describe codes from incidence matrices of Γn and Hn and determine their parameters. / South Africa

Philosophiae Doctor - PhD / In this thesis, we describe linear codes over prime fields obtained from incidence designs of iterated line graphs of complete graphs Li(Kn) where i = 1,2. In the binary case, results are extended to codes from neighbourhood designs of the line graphs Li+l(Kn) using certain elementary relations. Codes from incidence designs of complete graphs, Kn' and neighbourhood designs of their line graphs, £1(Kn) (the so-called triangular graphs), have been considered elsewhere by others. We consider codes from incidence designs of Ll(Kn) and L2(Kn), and neighbourhood designs of L2(Kn) and L3(Kn). In each case, the basic parameters of the codes are determined. Further, we introduce a family of vertex-transitive graphs Rn that are embeddable into the strong product Ll(Kn) ~ K2' of triangular graphs and K2' a class that at first sight may seem unnatural but, on closer look, is a repository of graphs rich with combinatorial structures. For instance, unlike most regular graphs considered here and elsewhere that only come with incidence and neighbourhood designs, Rn also has what we have termed as 6-cycle designs. These are designs in which the point set contains vertices of the graph and every block contains vertices of a 6-cycle in the graph. Also, binary codes from incidence matrices of these graphs have other minimum words in addition to incidence vectors of the blocks. In addition, these graphs have induced subgraphs isomorphic to the family Hn of complete porcupines (see Definition 4.11). We describe codes from incidence matrices of Rn and Hn and determine their parameters. The discussion is concluded with a look at complements of Rn and Hn, respectively denoted by Rn and Hn. Among others, the complements rn are contained in the union of the categorical product Ll(Kn) x Kn' and the categorical product £1(Kn) x Kn (where £1(Kn) is the complement of the iii triangular graph £1(Kn)). As with the other graphs, we have also considered codes from the span of incidence matrices of Rn and Hn and determined some of their properties. In each case, automorphisms of the graphs, designs and codes have been determined. For the codes from incidence designs of triangular graphs, embeddings of Ll(Kn) x K2 and complements of complete porcupines, we have exhibited permutation decoding sets (PD-sets) for correcting up to terrors where t is the full error-correcting capacity of the codes. For the remaining codes, we have only been able to determine PD-sets for which it is possible to correct a fraction of t-errors (partial permutation decoding). For these codes, we have also determined the number of errors that can be corrected by permutation decoding in the worst-case.