Hjm Hans Sterk
Eindhoven University of Technology
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Hjm Hans Sterk.
Journal of Symbolic Computation | 2002
Olga Caprotti; Am Arjeh Cohen; Fgmt Hans Cuypers; Hjm Hans Sterk
New technologies such as XML, XSL and both MathML and OpenMath make it possible to bring mathematics to the Internet. Indeed, OpenMath, a markup language for mathematical content, and OmDoc, its extension to mathematical documents, open a way of communicating mathematics between computers, between software applications and over the Internet without losing information. In this paper we describe the latest applications of OpenMath related technologies for Interactive Mathematical Documents. As an example we describe the way we incorporate these new technologies in a new version of Algebra Interactive, an interactive course on first and second year university algebra.
Canadian Journal of Mathematics | 1999
Am Arjeh Cohen; Fgmt Hans Cuypers; Hjm Hans Sterk
A reflection is an invertible linear transformation of a vector space fixing a given hyperplane, its axis, vectorwise and a given complement to this hyperplane, its center, setwise. A reflection torus is a one- dimensional group generated by all reflections with fixed axis and center. In this paper we classify subgroups of general linear groups (in arbitrary dimension and defined over arbitrary fields) generated by reflection tori.
Linear Algebra and its Applications | 1995
Hjm Hans Sterk
We relate a class of degenerations of K3 surfaces of degree 6 to certain lattices via Hodge theory.
international symposium on algorithms and computation | 1999
Fgmt Hans Cuypers; Hjm Hans Sterk; Leonard H. Soicher
Two common ways to describe groups are to present them by generators and relations or as automorphism groups of algebraic, geometric or combinatorial structures. (Think of linear groups acting on vector spaces, symmetry groups of regular polytopes, Galois groups etc.) An automorphism group of such a structure may also be considered to be a subgroup of the group of all permutations of the elements of that structure. Automorphism groups can thus be seen as permutation groups. Permutation groups are groups consisting of permutations of a set with composition of permutations as group multiplication. So, for example, we may view linear groups as permutation groups on the set of vectors of the underlying vector space (but this may not be the most efficient approach). The Todd-Coxeter coset enumeration method provides, among other things, a link between groups given by generators and relations on the one hand and permutation groups on the other.
international symposium on algorithms and computation | 1999
Fgmt Hans Cuypers; Leonard H. Soicher; Hjm Hans Sterk
In this project we use the tools and techniques from Chapter 8 to construct the small Mathieu groups M 10, M 11 and M 12. These groups were discovered by the French mathematician Emile Mathieu (1835–1890), who also discovered the large Mathieu groups M 22, M 23 and M 24. See [9, 10, 11]. They are remarkable groups: for example, apart from the symmetric and alternating groups, M 12 and M 24 are the only 5-transitive permutation groups. The group Mio has a normal subgroup of index 2 isomorphic to A6. The other five groups are among the 26 sporadic simple groups, occurring in the classification of finite simple groups. After Mathieu’s discovery of these five sporadic simple groups it took almost a century before the sixth sporadic simple group was found.
Mathematische Zeitschrift | 1995
Hjm Hans Sterk
Journal of Symbolic Computation | 2000
Olga Caprotti; Am Arjeh Cohen; Fgmt Hans Cuypers; Mn Riem; Hjm Hans Sterk
Engineering Structures | 2009
Fgmt Hans Cuypers; Jw Jan Willem Knopper; Hjm Hans Sterk
Archive | 2005
Ijbf Ivo Adan; Jc Jacob Perrenet; Hjm Hans Sterk
Nieuwe Wiskrant | 2013
Mcm Monique Bakker; M Mascha Klerx; Hjm Hans Sterk