Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.


Math Forum » Discussions » sci.math.* » sci.math

Topic: ALGEBRA: Explicit Kernel Computation
Replies: 1   Last Post: Jul 1, 1996 2:47 AM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
Peter Hindman

Posts: 1
Registered: 12/12/04
ALGEBRA: Explicit Kernel Computation
Posted: Jun 30, 1996 2:50 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply



I'm looking for explicit references or algorithms (or, preferably,
something along the lines of 'It's obvious, do it like this') for the
following problem: I need to compute a basis for the kernel of a linear
transformation over Z/mZ, the integers mod m, where m is not prime
(specifically 8). It doesn't seem like it should be that hard, but I
haven't been able to puzzle out a solid (i.e. codable) procedure for it,
and ad hoc methods aren't feasible (some of the matrices I need to solve
are 99x50). A program like Maple can do it over a field, but chokes on
anything else. Can anyone point me in the right direction?

--
'Ever since the time I was laid up sick with nothing to read but the Carson
of Venus series by Edgar Rice Burroughs--well, let's just say it left a stain
on the ice-cream suit of my aesthetics. The dry cleaners can't remove that
stain, if you get my meaning, but I gotta wear *something* in public.'







Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.