Vorlesungsskript zur Vorlesung „Lineare Algebra und Analytische Geometrie“ an der Universität Kassel im Sommersemester 2020. Es handelt sich um die Druckversion.

A Laurent-Puiseux series $$ \sum\limits_{n = n_0}^{\infty }{a_n (z - z_0)^{n/k} (a_n \in K, k \in ℕ, n_0 \in ℤ ) } \quad (1) $$ where $ k $ denotes the corresponding Puiseux number and $ K $ an infinite computable field - mostly $ K= ℚ(α_1,\ldots,α_n) $ : a field of rational functions in several variables, is mainly characterized by the general coefficient. We consider the case where an is a term of an m-fold hypergeometric sequence. That is $ a_{n+m} = r(n) a_n $ for all sufficiently large integers $ n, r(n) $ ...

Bei abelschen t-Moduln über Funktionenkörpern, denen der Ring F_q[t] zugrunde liegt, spielt die Frage der Uniformisierbarkeit eine wichtige Rolle. In dieser Arbeit werden t-Moduln betrachtet, die durch t = τ^2 + A τ+ θ gegeben sind, wobei τ den q-Frobenius-Endomorphismus bezeichnet, A eine (d x d)-Matrix mit d = 2 ist und θ eine Unbestimmte über F_q ist, die als Skalar (der t entspricht) im Funktionenkörper F_q(( 1/θ )) aufgefasst wird. Nach einem Satz von Anderson aus der grundlegenden Arbeit “t-motives” (1986) ...

Using an algorithmic approach, we derive classes of mixed recurrence equations satisfied by classical orthogonal polynomials. Starting from certain structure relations satisfied by classical orthogonal polynomials or their connection formulae, we show that our mixed recurrence equations are structurally valid. However, they couldn't be easily obtained with classical methods and for this reason, our algorithmic approach is important. The main algorithmic tool used here is an extended version of Zeilberger's ...

When jumping from the number fields theory to the function fields theory, one cannot miss the deep analogy between rank 1 Drinfeld modules and the group of root of unity and the analogy between rank 2 Drinfeld modules and elliptic curves. But so far, there is no known structure in number fields theory that is analogous to the Drinfeld modules of higher rank r ≥ 3. In this thesis we investigate the classes of those Drinfeld modules of higher rank r ≥ 3 defined over a finite field L. We describe explicitly the Weil ...

The present thesis is about the inverse problem in differential Galois Theory. Given a differential field, the inverse  problem asks which linear algebraic groups can be realized as differential Galois groups of Picard-Vessiot extensions of this field.   In this thesis we will concentrate on the realization of the classical groups as differential Galois groups. We introduce a method for a very general realization of these groups. This means that we present for the classical groups of Lie rank $l$ explicit linear ...

Sei k ein algebraisch abgeschlossener Erweiterungskörper von Q der Charakteristik 0 und k(x)[∂] der Ring der Differentialoperatoren mit Koeffizienten in k(x). Sei L ∈ k(x)[∂] ein irreduzibler Differentialoperator dritter Ordung ohne Liouvillesche Lösungen. Sei E = B_^2, 1F_1^2, 0F_2, 1F_2, 2F_2}, wobei B_v eine Besselfunktion ist und pF_q mit p ∈ {0,1,2},q ∈{1,2}, die verallgemeinerte hypergeometrische Funktion. Das Ziel dieser Dissertation ist es, Lösungen von L zu finden, die durch Elemente S ∈ E ausgedrückt werden ...

The main goal of this thesis is to develop computational methods which allow effective computations on Hilbert and Quot schemes. At first we introduce marked bases over modules. They may be considered as a form of Gröbner basis which do not depend on a term order. Instead, one chooses for each generator some term as head module term such that the head module terms generate a prescribed monomial module. We show that the involutive normal form algorithm with respect to Pommaret division will terminate if the ...

Time series are useful for modeling systems behavior, for predicting some events (catastrophes, epidemics, weather, . . . ) or for classification purposes (pattern recognition, pattern analysis). Among the existing data analysis algorithms, ordinal pattern based algorithms have been shown effective when dealing with simulation data. However, when applied to quasi-periodically forced systems, they fail to detect SNA and tori as regular dynamics. In this work we address this concern by defining ordinal array (OA) ...

The identification of chemical mechanism that can exhibit oscillatory phenomena in reaction networks are currently of intense interest. In particular, the parametric question of the existence of Hopf bifurcations has gained increasing popularity due to its relation to the oscillatory behavior around the fixed points. However, the detection of oscillations in high-dimensional systems and systems with constraints by the available symbolic methods has proven to be difficult. The development of new efficient methods are ...