Search
Now showing items 141-150 of 210
Aufsatz
Theme group 6: Mathematics and other subjects
(Hirst, Ann (Hrsg.), 1988)
Aufsatz
Warum haben nicht-triviale Lösungen von f' = f keine Nullstellen?
(H. Kautschitsch [Hrsg.], 1989)
Aufsatz
An introduction to ordinary differential equations by computer algebra-systems
(Jacob, G. (Hrsg.), 1993)
We report on an elementary course in ordinary differential equations (odes) for students in engineering sciences. The course is also intended to become a self-study package for odes and is is based on several interactive computer lessons using REDUCE and MATHEMATICA . The aim of the course is not to do Computer Algebra (CA) by example or to use it for doing classroom examples. The aim ist to teach and to learn mathematics by using CA-systems.
Preprint
Parity of the Number of Irreducible Factors for Composite Polynomials
(2008)
Various results on parity of the number of irreducible factors of given polynomials over finite fields have been obtained in the recent literature. Those are mainly based on Swan’s theorem in which discriminants of polynomials over a finite field or the integral ring Z play an important role. In this paper we consider discriminants of the composition of some polynomials over finite fields. The relation between the discriminants of composed polynomial and the original ones will be established. We apply this to obtain ...
Preprint
Divisibility of Trinomials by Irreducible Polynomials over F_2
(2008)
Irreducible trinomials of given degree n over F_2 do not always exist and in the cases that there is no irreducible trinomial of degree n it may be effective to use trinomials with an irreducible factor of degree n. In this paper we consider some conditions under which irreducible polynomials divide trinomials over F_2. A condition for divisibility of self-reciprocal trinomials by irreducible polynomials over F_2 is established. And we extend Welch's criterion for testing if an irreducible polynomial divides trinomials ...
Dissertation
Deterministic Genericity and the Computation of homological Invariants
(2016-08-10)
The main goal of this thesis is to discuss the determination of homological invariants of polynomial ideals. Thereby we consider different coordinate systems and analyze their meaning for the computation of certain invariants. In particular,
we provide an algorithm that transforms any ideal into strongly stable position if char k = 0. With a slight modification, this algorithm can also be used to achieve a stable or quasi-stable position. If our field has positive characteristic, the Borel-fixed position is the ...