We compute genus-0 Belyi maps with prescribed monodromy and strictly verify the computed results. Among the computed examples are almost simple primitive groups that satisfy the rational rigidity criterion yielding polynomials with prescribed Galois groups over Q(t). We also give an explicit version of a theorem of Magaard, which lists all sporadic groups occurring as composition factors of monodromy groups of rational functions. / Wir berechnen Geschlecht-0 Belyi-Funktionen mit vorgegebener Monodromiegruppe und liefern rigorose Verifikationsbeweise. Unter den berechneten Exemplaren finden sich fast-einfache primitive Gruppen, welche das sogenannte "Rationale-Starrheitskriterium" erfüllen, die zu Galois-Realisierungen über Q(t) führen. Außerdem liefern wir eine explizite Version eines Satzes von Magaard, der alle sporadischen Gruppen auflistet, die als Kompositionsfaktoren von Monodromiegruppen rationaler Funktionen auftreten.

In a preceding paper [9] we reported on some experience with a new version of the well known Gröbner algorithm with factorization and constraint inequalities. Here we discuss, how this approach may be refined to produce triangular systems in the sense of [12] and [13]. Such a refinement guarantees, different to the usual Gröbner factorizer, to produce a quasi prime decomposition, i.e. the resulting components are at least pure dimensional radical ideals. As in [9] our method weakens the usual restriction to lexicographic term orders. Triangular systems are a very helpful tool between factorization at a heuristical level and full decomposition into prime components. Our approach grew up from a consequent interpretation of the algorithmic ideas in [5] as a delayed quotient computation in favour of early use of (multivariate) factorization. It is implemented in version 2.2 of the REDUCE package CALI [8].

We introduce a special set of relations on a finite set, called clausal relations. A restricted version of the Galois connection between polymorphisms and invariants, called Pol-CInv, is studied, where the invariant relations are clausal relations. Clones arising from this Galois connection, so-called C-clones, are investigated. Finally, we show that clausal relations meet a sufficient condition that is known to ensure polynomial time solvability of the corresponding CSP.

This dissertation investigates the application of multivariate Chebyshev polynomials in the algebraic signal processing theory for the development of FFT-like algorithms for discrete cosine transforms on weight lattices of compact Lie groups. After an introduction of the algebraic signal processing theory, a multivariate Gauss-Jacobi procedure for the development of orthogonal transforms is proven. Two theorems on fast algorithms in algebraic signal processing, one based on a decomposition property of certain polynomials and the other based on induced modules, are proven as multivariate generalizations of prior theorems. The definition of multivariate Chebyshev polynomials based on the theory of root systems is recalled. It is shown how to use these polynomials to define discrete cosine transforms on weight lattices of compact Lie groups. Furthermore it is shown how to develop FFT-like algorithms for these transforms. Then the theory of matrix-valued, multivariate Chebyshev polynomials is developed based on prior ideas. Under an existence assumption a formula for generating functions of these matrix-valued Chebyshev polynomials is deduced. / Diese Dissertation beschäftigt sich mit der Anwendung multivariater Tschebyschow-Polynome in der algebraischen Signalverarbeitungstheorie im Hinblick auf die Entwicklung FFT-artiger Algorithmen für diskrete Kosinus-Transformationen auf Gewichts-Gittern kompakter Lie-Gruppen. Nach einer Einführung in die algebraische Signalverarbeitungstheorie wird eine multivariate Gauss-Jacobi Prozedur für die Entwicklung orthogonaler Transformationen bewiesen. Zwei Theoreme über schnelle Algorithmen in der algebraischen Signalverarbeitung, eines basierend auf einer Dekompositionseigenschaft gewisser Polynome, das andere basierend auf induzierten Moduln, werden als multivariate Verallgemeinerungen vorgängiger Theoreme bewiesen. Die Definition multivariater Tschebyschow-Polynome basierend auf der Theorie der Wurzelsysteme wird vergegenwärtigt. Es wird gezeigt, wie man diese Polynome nutzen kann um diskrete Kosinustransformationen auf den Gewichts-Gittern kompakter Lie-Gruppen zu definieren. Des Weiteren wird gezeigt, wie man FFT-artige Algorithmen für diese Transformationen entwickeln kann. Sodann wird die Theorie Matrix-wertiger, multivariater Tschebyschow-Polynome basierend auf vorgängigen Ideen entwickelt. Unter einer Existenz-Annahme wird eine Formel für die erzeugenden Funktionen dieser Matrix-wertigen Tschebyschow-Polynome hergeleitet

We present a technique for computing multi-branch-point covers with prescribed ramification and demonstrate the applicability of our method in relatively large degrees by computing several families of polynomials with symplectic and linear Galois groups. As a first application, we present polynomials over \(\mathbb{Q}(\alpha,t)\) for the primitive rank-3 groups \(PSp_4(3)\) and \(PSp_4(3).C_2\) of degree 27 and for the 2-transitive group \(PSp_6(2)\) in its actions on 28 and 36 points, respectively. Moreover, the degree-28 polynomial for \(PSp_6(2)\) admits infinitely many totally real specializations. Next, we present the first (to the best of our knowledge) explicit polynomials for the 2-transitive linear groups \(PSL_4(3)\) and \(PGL_4(3)\) of degree 40, and the imprimitive group \(Aut(PGL_4(3))\) of degree 80. Additionally, we negatively answer a question by König whether there exists a degree-63 rational function with rational coefficients and monodromy group \(PSL_6(2)\) ramified over at least four points. This is achieved due to the explicit computation of the corresponding hyperelliptic genus-3 Hurwitz curve parameterizing this family, followed by a search for rational points on it. As a byproduct of our calculations we obtain the first explicit \(Aut(PSL_6(2))\)-realizations over \(\mathbb{Q}(t)\). At last, we present a technique by Elkies for bounding the transitivity degree of Galois groups. This provides an alternative way to verify the Galois groups from the previous chapters and also yields a proof that the monodromy group of a degree-276 cover computed by Monien is isomorphic to the sporadic 2-transitive Conway group \(Co_3\). / Wir stellen eine Technik zur Berechnung von Mehrpunktüberlagerungen mit vorgeschriebener Verzweigung vor und demonstrieren die Anwendbarkeit unserer Methode in relativ großen Graden durch die Berechnung mehrerer Familien von Polynomen mit symplektischen und linearen Galoisgruppen. Als erste Anwendung präsentieren wir Polynome über \(\mathbb{Q}(\alpha,t)\) für die primitiven Rang-3-Gruppen \(PSp_4(3)\) und \(PSp_4(3).C_2\) vom Grad 27 und für die 2-fach transitive Gruppe \(PSp_6(2)\) in ihren Operationen auf 28 bzw. 36 Punkten. Außerdem lässt das Polynom vom Grad 28 für \(PSp_6(2)\) unendlich viele total-reelle Spezialisierungen zu. Als Nächstes präsentieren wir die (unseres Wissens nach) ersten expliziten Polynome für die 2-fach transitiven linearen Gruppen \(PSL_4(3)\) und \(PGL_4(3)\) vom Grad 40 und die imprimitive Gruppe \(Aut(PGL_4(3))\) vom Grad 80. Zusätzlich geben wir eine negative Antwort auf die Frage von König, ob es eine rationale Funktion vom Grad 63 mit rationalen Koeffizienten gibt, die über mindestens vier Punkten verzweigt ist und Monodromiegruppe \(PSL_6(2)\) besitzt. Dies wird durch die explizite Berechnung der entsprechenden hyperelliptischen Geschlecht-3 Hurwitzkurve erreicht, die diese Familie parametrisiert, gefolgt von einer Suche nach rationalen Punkten auf ihr. Als Nebenprodukt unserer Berechnungen erhalten wir die ersten expliziten \(Aut(PSL_6(2))\)-Realisierungen über \(\mathbb{Q}(t)\). Schließlich stellen wir eine Technik von Elkies zur Beschränkung des Transitivitätsgrades von Galoisgruppen vor. Diese bietet einen alternativen Weg, die Galoisgruppen aus den vorherigen Kapiteln zu verifizieren und liefert auch einen Beweis dafür, dass die Monodromiegruppe einer von Monien berechneten Grad-276 Überlagerung isomorph zur sporadischen 2-fach transitiven Conway-Gruppe \(Co_3\) ist.

Let E and F be Hilbert C*-modules over a C*-algebra A. New classes of (possibly unbounded) operators t: E->F are introduced and investigated - first of all graph regular operators. Instead of the density of the domain D(t) we only assume that t is essentially defined, that is, D(t) has an trivial ortogonal complement. Then t has a well-defined adjoint. We call an essentially defined operator t graph regular if its graph G(t) is orthogonally complemented and orthogonally closed if G(t) coincides with its biorthogonal complement. A theory of these operators and related concepts is developed: polar decomposition, functional calculus. Various characterizations of graph regular operators are given: (a, a_*, b)-transform and bounded transform. A number of examples of graph regular operators are presented (on commutative C*-algebras, a fraction algebra related to the Weyl algebra, Toeplitz algebra, C*-algebra of the Heisenberg group). A new characterization of operators affiliated to a C*-algebra in terms of resolvents is given as well as a Kato-Rellich theorem for affiliated operators. The association relation is introduced and studied as a counter part of graph regularity for concrete C*-algebras.:Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 Sightings 1. Unitary *-module spaces Algebraic essence of adjointability on Hilbert C*-modules . . . . . 13 a) Operators on Hilbert C*-modules - Notions. . . . . . . . . . . . . . 13 b) Essential submodules and adjointability . . . . . . . . . . . . . . . . 15 c) From Hilbert C*-modules to unitary *-module spaces . . . . . . 16 2. Operators on unitary *-module spaces Basic theory . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 21 3. Graph regularity Pragmatism between weak and (strong) regularity . . . . . . . . . 27 a) Types of regularity . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 27 b) The case C(X) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 27 c) Graph regularity . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 36 Transition. Orthogonal complementability and topology Back to Hilbert C*-modules . . . . . . . . . . . . . . . . . . . . . . . . . . . . 43 Graph regular operators on Hilbert C*-modules 4. Commutative case: Operators on C_0(X) Phenomena . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 49 Interjection. Unboundedness and graph regularity . . . . . . . . . . 55 5. Relation to adjointable operators Sources of graph regularity . . . . . . . . . . . . . . . . . . . . . . . . . . . . 57 6. Concrete C*-algebras Association relation and affiliation relation . . . . . . . . . . . . . . . . 61 7. Examples Graph regular operators that are not regular . . . . . . . . . . . . . 67 a) Position and momentum operators as graph regular operators on a fraction algebra related to the Weyl algebra . . 67 b) A graph regular but not regular operator on the group C*-algebra of the Heisenberg group . . . . . . . . . . . . . . . 69 c) Unbounded Toeplitz operators . . . . . . . . . . . . . . . . . . . . . . . 70 8. Bounded transform The canonical regular operator associated to a graph regular operator . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 73 9. Absolute value and polar decomposition . . . . . . . . . . . . . . . 79 10. Functional calculus . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 83 11. Special matrices of C*-algebras Counter examples . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 85 Abstract and open questions . . . . . . . . . . . . . . . . . . . . . . . . . 89 Notations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 91 Bibliography . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 93 Dank . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 97 Erklärung . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 99

Inspired by work of Hubery [Hub] and Fomin, Shapiro and Thurston [FST06] related to cluster algebras, we construct a bijection between certain curves on a cylinder and the string modules over a path algebra of type Ãn. We show that under this bijection irreducible maps and the Auslander-Reiten translation have a geometric interpretation. Furthermore we prove that the dimension of extension groups can be expressed in terms of intersection numbers. Finally we explain the connection to cluster algebras and apply our results to describe the exchange graph in type Ãn. / Angeregt durch Arbeiten zu Cluster-Algebren von Hubery [Hub] und Fomin, Shapiro und Thurston [FST06] konstruieren wir eine Bijektion zwischen gewissen Kurven auf einem Zylinder und den Fadenmoduln über einer Wege-Algebra vom Typ Ãn. Wir zeigen, daß unter dieser Bijektion sowohl irreduzible Abbildungen als auch die Auslander-Reiten-Verschiebung eine geometrische Interpretation haben. Weiterhin beweisen wir, daß sich die Dimension der Erweiterungsgruppen mittels Anzahlen von Schnittpunkten ausdrücken läßt. Schließlich erklären wir die Verbindung zu Cluster-Algebren und verwenden unsere Ergebnisse um den Austauschgraph im Typ Ãn zu beschreiben.

Context and lattice orbifolds have been discussed by M. Zickwolff, B. Ganter and D. Borchmann. Preordering the folding automorphisms by set inclusion of their orbits gives rise to further development. The minimal elements of this preorder have a prime group order and any group element can be dissolved into the product of group elements whose group order is a prime power. This contribution describes a way to compress an orbifold annotation to sets of such minimal automorphisms. This way a hierarchical annotation is described together with an interpretation of the annotation. Based on this annotation an example is given that illustrates the construction of an automaton for certain pattern matching problems in music processing.

We introduce a special set of relations on a finite set, called clausal relations. A restricted version of the Galois connection between polymorphisms and invariants, called Pol-CInv, is studied, where the invariant relations are clausal relations. Clones arising from this Galois connection, so-called C-clones, are investigated. Finally, we show that clausal relations meet a sufficient condition that is known to ensure polynomial time solvability of the corresponding CSP.

Let E and F be Hilbert C*-modules over a C*-algebra A. New classes of (possibly unbounded) operators t: E->F are introduced and investigated - first of all graph regular operators. Instead of the density of the domain D(t) we only assume that t is essentially defined, that is, D(t) has an trivial ortogonal complement. Then t has a well-defined adjoint. We call an essentially defined operator t graph regular if its graph G(t) is orthogonally complemented and orthogonally closed if G(t) coincides with its biorthogonal complement. A theory of these operators and related concepts is developed: polar decomposition, functional calculus. Various characterizations of graph regular operators are given: (a, a_*, b)-transform and bounded transform. A number of examples of graph regular operators are presented (on commutative C*-algebras, a fraction algebra related to the Weyl algebra, Toeplitz algebra, C*-algebra of the Heisenberg group). A new characterization of operators affiliated to a C*-algebra in terms of resolvents is given as well as a Kato-Rellich theorem for affiliated operators. The association relation is introduced and studied as a counter part of graph regularity for concrete C*-algebras.