Hackage :: [Package]

sigma-ij: Thom polynomials of second order Thom-Boardman singularities

[ bsd3, library, math, program ] [ Propose Tags ] [ Report a vulnerability ]

A program to compute Thom polynomials of second order Thom-Boardman singularities, using the localization method described in the author's PhD thesis http://renyi.hu/~komuves/phdthesis.pdf.

[Skip to Readme]

Modules

  • Math
    • Algebra
      • Math.Algebra.Determinant
      • Math.Algebra.ModP
      • Math.Algebra.Schur
    • FreeModule
      • Math.FreeModule.Class
      • Math.FreeModule.Helper
      • Math.FreeModule.PP
      • Math.FreeModule.Parser
      • Math.FreeModule.PrettyPrint
      • Math.FreeModule.SortedList
      • Math.FreeModule.Symbol
    • ThomPoly
      • Math.ThomPoly.Formulae
      • Math.ThomPoly.Shared
      • Math.ThomPoly.SigmaI
      • Math.ThomPoly.SigmaIJ
      • Math.ThomPoly.Subs

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

  • No Candidates
Versions [RSS] 0.2, 0.2.0.1, 0.2.0.2
Dependencies array (>=0.5), base (>=4 && <5), combinat (>=0.2.8), containers (>=0.5), optparse-applicative, parsec2, random, sigma-ij (>=0.2.0.1), time [details]
Tested with ghc ==7.10.3
License BSD-3-Clause
Copyright (c) 2010, 2016 Balazs Komuves
Author Balazs Komuves
Maintainer bkomuves (plus) hackage (at) gmail (dot) com
Category Math
Home page http://code.haskell.org/~bkomuves/
Uploaded by BalazsKomuves at 2016-10-22T19:25:28Z
Distributions
Executables sigma-ij
Downloads 1786 total (2 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs not available [build log]
All reported builds failed as of 2016-11-14 [all 4 reports]

Readme for sigma-ij-0.2.0.2

[back to package description] 
This is a program to compute Thom polynomials of second-order 
Thom-Boardman singularities $Sigma^{i,j}(n)$.

The computation is based on the localization method described in 
the author's PhD thesis: <http://renyi.hu/~komuves/phdthesis.pdf>.


USAGE:
======

sigma-ij -h                        help
sigma-ij -i3 -j1 -n7               compute $Tp(Sigma^{3,1}(7))$
sigma-oj -i3 -j1 -n7 -r<RING>      compute with coefficients in the given ring
sigma-oj -i3 -j1 -n7 -B<N> -b<n>   compute the n-th (out of N) part
sigma-oj -i3 -j1 -n7 -rZp          compute in the (baked-in) prime field Zp
sigma-oj -i3 -j1 -n7 -o<FILE>      change the output file

Supported rings:
 * rationals 
 * integers (remark: the division-free determinant algorithm often fails)
 * Zp, a baked-in prime field 

The -B and -b options are useful to parallelize the computation over 
many computers.
 

TODO:
=====

 - better (and faster) prime field implementation(s)
 - allow arbitrary prime fields instead of just a baked-in one
 - pivoting for the Bareiss (division-free) determinant algorithm
 - implement explicit formula for j=1