algebra 0.2.1

data/sample/test-00-groebner-basis.rb

@@ -0,0 +1,274 @@
+#!/usr/local/bin/ruby
+#
+# TEST SCRIPT FOR groebner-basis.rb
+#
+# 2001.04.08 Version 1.05
+
+$totS, $totK = 0, 0
+
+#$lp = "~/ruby/poly"
+#$lp = "~/ruby/poly-2001-0202"
+#$lp = "~/ruby/poly-2001-0326"
+
+if $lp
+  $LOAD_PATH.unshift $lp
+  require "algebra/polynomialm"
+  require "algebra/gbasem"
+end
+$LOAD_PATH.push File.dirname($0)
+
+require "algebra"
+#require "algebra/m-polynomial"
+require "algebra/algebraic-parser"
+require "time-trial"
+include Algebra
+
+def gb(k, f, ord = :lex, sw = false)
+  f0 = f.first
+  print "Basis of: "
+  sw ? puts('', *f.to_s) : puts(f.map { |v| v.to_s }.join(', '))
+  gbase = b = nil
+  $stot.start {
+    a = Time.now
+    k.with_ord(:lex, nil, f) do
+      gbase = Groebner.basis(f)
+    end
+    b = Time.now - a
+  }
+  print "Is: "
+  sw ? puts('', *gbase.to_s) : puts(gbase.map { |v| v.to_s }.join(", "))
+  puts "(#{b} seconds.)"
+  true
+end
+
+def mkarray(s, mod = 0, ord = :lex)
+  if mod < 0
+    require "mathn"
+    require "algebra/rational"
+    puts 'require "mathn"'
+    fp = Rational
+  elsif mod > 0
+    puts "modulo #{mod}"
+    require "algebra/residue-class-ring"
+    fp = ResidueClassRing(Integer, mod)
+  else
+    puts "modulo #{mod}"
+    require "algebra/rational"
+    fp = Rational
+  end
+  k = MPolynomial(fp)
+  if $variables
+    k.variables = $variables
+    $variables = nil
+  end
+  strs = s.collect{|str| str.split(/\s*,\s*/)}.flatten
+  sf = strs.collect{|x| AlgebraicParser.eval(x, k)}
+  kf = strs.collect{|x| PolynomialM(x)} if $lp
+  $lp ? [k, kf, sf, fp] : [k, sf, fp]
+end
+
+def gb_ks(s, mod = 0, ord = :lex)
+  k, kf, sf, fp = mkarray(s, mod, ord)
+
+  stime = sg = ktime = kg = nil
+
+  $stot.start {
+    stime = Time.now
+    k.with_ord(ord, nil, sf) do
+      sg = Groebner.basis(sf)
+    end
+    stime = Time.now - stime
+  }
+
+  $ktot.start {
+    ktime = Time.now
+    kg = mod > 0 ? GBase.getGBaseZp(kf, mod) : GBase.getGBase(kf)
+    ktime = Time.now - ktime
+  }
+
+  sg.rsort!
+  puts(*sg)
+
+  skg = kg.collect{|t| AlgebraicParser.eval(t.to_s, k)}
+
+  skg.rsort!
+  if skg == sg
+    puts "Coinside. (#{stime}, #{ktime}) =-=-=-=-=-=-=-=-=-=-=-=-"
+    true
+  else
+    puts "Defferent. (#{stime}, #{ktime}) !!!!!!!!!!!!!!!!!!!!"
+    puts kg
+    false
+  end
+end
+
+def gbks(s, mod = 0, ord = :lex)
+  print s.inspect + " => "
+  if $lp
+    gb_ks(s, mod, ord)
+  else
+    k, sf, fp = mkarray(s, mod, ord)
+    gb(k, sf, ord, true)
+#    gb(sf)
+  end
+end
+
+
+def test_gb(n, m)
+  case n
+  when 0
+    gbks(["x + y - 1", "x - y - 1"], m)
+  when 1
+    gbks(["3x^2*y+7y", "4x*y^2-5x"], m)
+  when 2
+#    MPolynomial.set_ord(:grlex)
+    Monomial.setTermOrder("deglex") if $lp
+    # "lex"(default), "deglex",  "degrevlex"
+    gbks(["x**3 - 2*x*y", "x**2*y - 2*y**2 + x", "-x**2",
+	   "-2*x*y", "-2*y**2 + x"], m, :grlex)
+  when 3
+    puts "It takes 8 minuites"
+#    MPolynomial.set_ord(:lex)
+    Monomial.setTermOrder("lex") if $lp
+    gbks(["x**3 * y**2 - x**2 * y**3 + x", "3 * x**4 * y + y**2"], m, :lex)
+  when 4
+    gbks(["x**2 + y**2 + z**2 -1, x**2 + z**2 - y, x - z"], m)
+  when 5
+    $variables=["t","x","y","z"]
+    Monomial.setVarOrder(["t","x","y","z"]) if $lp
+    gbks(["t**4 - x, t**3 - y, t**2 - z"], m)
+  when 6 #p145
+    puts "It takes 3 minuites"
+    $variables=["t","u","x","y","z"]
+#    MPolynomial.set_ord(:lex)
+    Monomial.setVarOrder(["t","u","x","y","z"]) if $lp
+    Monomial.setTermOrder("lex") if $lp
+    gbks(["x - (t+u), y - (t**2 + 2*t*u), z - (t**3 + 3 * t**2 * u)"], m, :lex)
+  when 7 #p136
+    $variables=["x","y","z", "w"]
+#    MPolynomial.set_ord(:lex)
+    Monomial.setVarOrder(["x","y","z","w"]) if $lp
+    Monomial.setTermOrder("lex") if $lp
+    gbks(["3*x-6*y-2*z, 2*x-4*y+4*w, x-2*y-z-w"], m, :lex)
+  when 8
+    $variables=["x","y","z", "w"]
+#    MPolynomial.set_ord(:lex)
+    Monomial.setVarOrder(["x","y","z","w"]) if $lp
+    Monomial.setTermOrder("lex") if $lp
+    gbks(["3x^2*y+7y","4x*y^2-5x"], m, :lex)
+  when 9
+    puts "It takes long time"
+#    MPolynomial.set_ord(:lex)
+    Monomial.setTermOrder("lex") if $lp
+    gbks(["x**3 * y**2 - x**2 * y**3 + x", "3 * x**4 * y + y**2"], m, :lex)
+  when 10 #p141
+    puts "It takes very long time"
+    $variables=["w", "x", "y", "z"]
+#    MPolynomial.set_ord(:lex)
+    Monomial.setVarOrder(["w", "x", "y", "z"]) if $lp
+    Monomial.setTermOrder("lex") if $lp
+    gbks(["3x**2 + 2yz - 2xw","2xz - 2yw","2xy - 2z - 2zw", "x**2 + y**2 + z**2 - 1"], m, :lex)
+  when 11
+    gbks(["x**2 + y**2 + z**2 -1, x**2 + z**2 - y, x - z"], m)
+  when 12
+    #
+    gbks(["2x+3y+3","x+5y+2"], m)
+  when 13
+    puts "raise error!"
+    gbks(["2x+3y+3","x+5y+2","x*y-1"], m)
+  when 14
+    gbks(["3x^2*y+7y","4x*y^2-5x"], m)
+  when 15
+    $variables=(["y","x"])
+#    MPolynomial.set_ord(:lex)
+    Monomial.setVarOrder(["y","x"]) if $lp
+    Monomial.setTermOrder("lex") if $lp
+
+    gbks(["2x*y-x,3y-x^2"], m, :lex)
+  when 16
+    Monomial.setTermOrder("deglex") if $lp
+#    MPolynomial.set_ord(:grlex)
+
+    gbks(["3x^2y-3y*z+y", "5x^2z-8z^2"], m, :grlex)
+  when 17
+    Monomial.setTermOrder("lex") if $lp
+#    MPolynomial.set_ord(:lex)
+
+    gbks(["6x^2+y^2", "10x^2y+2x*y"], m, :lex)
+  else
+    puts "All tests succeed."
+    puts
+    nil
+  end
+end
+
+$stot, $ktot = TimeTrial["stot, ktot"]
+
+if false
+  $atime, $btime = TimeTrial["atime, btime"]
+
+  $sbas, $smin, $sred, $sdiv, $sspa, $slt, $smul, $llc =
+    TimeTrial["sbas, smin, sred, sdiv, sspa, slt, smul, llc"]
+
+  $kbas, $kmin, $kred, $kdiv, $kspa, $klt, $kmul =
+    TimeTrial["kbas, kmin, kred, kdiv, kspa, klt, ksml"]
+end
+
+m = ARGV.shift
+m = Integer(m) if m
+
+if m
+  m = Integer(m)
+  if m < 0
+    m = -1
+  end
+else
+  m = 0
+end
+
+k = ARGV.shift
+k = Integer(k) if k
+
+if k
+  test_gb(k, m)
+else
+  n = -1
+  loop do
+    n += 1
+    puts "======================= test #{n} ======================"
+    case n
+    when 10
+      puts "takes very long time. skip."
+      next# if $lp
+    when 9, 3
+      puts "takes long time. skip."
+      next
+    when 13
+      puts "error. skip."
+      next
+    end
+    k = nil if k && k < 0
+    r = test_gb(n, m)
+    break unless r
+  end
+end
+
+unless k
+  puts "<< This is a test script for groebner-basis calculators. >>"
+  puts "USAGE: #$0 [modulo [num]]"
+  puts "  mod ... modulo (= -1, 0, 2, 3, 5... (-1 means 'by mathn')"
+  puts "  num ... No. of test (if omitted, test all)"
+  puts
+  puts "S : K =\n#$stot\n#$ktot"
+end
+
+if false
+puts $atime, $btime
+puts $sbas, $kbas
+puts $smin, $kmin
+puts $sred, $kred
+puts $sdiv, $kdiv
+puts $sspa, $kspa
+puts $slt, $klt
+puts $smul, $llc
+end

data/sample/test-00-polynomial-factor-alg.rb

@@ -0,0 +1,89 @@
+########################################################
+#                                                      #
+#  This is test script for 'polynomial-factor-alg.rb'  #
+#                                                      #
+########################################################
+require "algebra/rational"
+require "algebra/polynomial-factor-alg.rb"
+include Algebra
+
+def test(f, s = "")
+  print "#{f}#{s}\n"
+  a = f.factorize
+  sw = (f == a.pi)
+  puts "#{a.inspect}, #{sw}"
+  raise unless sw
+end
+
+require "algebra/polynomial"
+require "algebra/polynomial-factor"
+require "algebra/rational"
+require "algebra/residue-class-ring"
+
+n, i, j, k = ARGV.collect{|v| v.to_i}
+fss = [
+  "x**4 + 1",#0
+  "x**2 + x + 1",#1
+  "x**4 + 1 + a",#2
+  "(x**4 + 1)*(x**2 + x + 1)",#3
+  "x**4 + 4",#4
+  "x**2 + 4*x + 1",#5
+  "x**2 + 1",#6
+  "x**3 - 1",#7
+  "x**3 - 2",#8
+]
+fs = fss[n||0]
+ass = [
+  "a**2 + 1",#0
+  "a**2 - 2",#1
+  "a**3 - 2",#2
+  "a**2 - 3",#3
+]
+bss = [
+  "b**2 - 2",#0
+  "b**3 - 2",#1
+  "b**2 + b + 1",#2
+  "b**2 + 1",#3
+  "b**2 - 3",#4
+]
+css = [
+  "c**3 - 2",#0
+  "c**2 - 3",#1
+]
+
+as = ass[i||0]
+bs = bss[j||0]
+cs = css[k||0]
+
+unless i
+  [fss, ass, bss, css].each do |xs|
+    puts "-----------"
+    xs.each_with_index do |f, i|
+  puts "#{i}: #{f}"
+    end
+  end
+else
+  ka = AlgebraicExtensionField(Rational, "a") {|a| eval as }
+  a = ka.var    
+  unless j
+    pka = Polynomial(ka, "x")
+    x = pka.var
+    f = eval fs
+    test(f, ", in Q[a, x]/(#{as})")
+  else
+    kab = AlgebraicExtensionField(ka, "b") { |b| eval bs}
+    
+    unless k
+  pkab = Polynomial(kab, "x")
+  x = pkab.var
+  f = eval fs
+  test(f, ", in Q[a, b, x]/(#{as}, #{bs})")
+    else
+  kabc = AlgebraicExtensionField(kab, "c") { |c| eval cs}
+  pkabc = Polynomial(kabc, "x")
+  x = pkabc.var
+  f = eval fs
+  test(f, ", in Q[a, b, c, x]/(#{as}, #{bs}, #{cs})")
+    end
+  end
+end

data/sample/test-00.list

@@ -0,0 +1,4 @@
+test-00-cayley-hamilton.rb 3
+test-00-groebner-basis.rb -1
+test-00-groebner-basis.rb 0
+test-00-polynomial-factor-alg.rb 0 0 0

data/sample/time-trial.rb

@@ -0,0 +1,65 @@
+# Time Trial
+#
+#   by Shin-ichiro Hara
+#
+# Version 1.0 (2001.04.01)
+
+class TimeTrial
+  def initialize(name = type.name)
+    @name = name
+    @time = 0
+    @ntime = 0
+    @open = false
+  end
+
+  def start
+    begin
+      open
+      yield @ntime
+    ensure
+      close
+    end
+  end
+
+  def open
+    @ntime += 1
+    if @open
+      $stderr.puts "TimeTrial: warning (duplicate open)"
+    end
+    @open = true
+    @stime = Time.now
+  end
+
+  def close
+    @time += Time.now - @stime
+    unless @open
+      $stderr.puts "TimeTrial: warning (duplicate close)"
+    end
+    @open = nil
+  end
+  
+  def to_s
+    "#{@name}: #{@time} sec. (#{@ntime} times)"
+  end
+
+  def self.[](s)
+    s.split("\s*,\s*").collect{ |name| new(name) }
+  end
+
+  alias inspect to_s
+end
+
+if __FILE__ == $0
+  $a, $b = TimeTrial["addition, multiplication"]
+  x = 0
+  y = 1
+  0.upto 10000 do |i|
+    $a.start{
+      x += i
+    }
+    $b.start{
+      y *= i
+    }
+  end
+  puts $a, $b
+end

metadata

@@ -0,0 +1,373 @@
+--- !ruby/object:Gem::Specification
+name: algebra
+version: !ruby/object:Gem::Version
+  version: 0.2.1
+platform: ruby
+authors:
+- Takeo Kunishima
+autorequire: 
+bindir: exe
+cert_chain: []
+date: 2016-08-23 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: bundler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.12'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.12'
+- !ruby/object:Gem::Dependency
+  name: rake
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '10.0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '10.0'
+- !ruby/object:Gem::Dependency
+  name: minitest
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '5.0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '5.0'
+description: This is a library for mathematical computations. Our purpose is to express
+  the mathematical object naturally in Ruby. Though it is not operated fast, we can
+  see the algorithm of the mathematical processing not in black box but in scripts.  This
+  library is in development stage.
+email:
+- t.kunishi@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- ".gitignore"
+- ".travis.yml"
+- CODE_OF_CONDUCT.md
+- Gemfile
+- Gemfile.lock
+- LICENSE.txt
+- README-ja.txt
+- README.md
+- Rakefile
+- algebra.gemspec
+- bin/console
+- bin/setup
+- doc-ja/README-ja.html
+- doc-ja/README-ja.rd
+- doc-ja/README.html
+- doc-ja/README.rd
+- doc-ja/algebra-ja.html
+- doc-ja/algebra-ja.rd
+- doc-ja/algebraic-equation-ja.html
+- doc-ja/algebraic-equation-ja.rd
+- doc-ja/algebraic-extension-field-ja.html
+- doc-ja/algebraic-extension-field-ja.rd
+- doc-ja/algebraic-parser-ja.html
+- doc-ja/algebraic-parser-ja.rd
+- doc-ja/changes.html
+- doc-ja/changes.rd
+- doc-ja/elementary-divisor-ja.html
+- doc-ja/elementary-divisor-ja.rd
+- doc-ja/euclidian-ring-ja.html
+- doc-ja/euclidian-ring-ja.rd
+- doc-ja/finite-group-ja.html
+- doc-ja/finite-group-ja.rd
+- doc-ja/finite-map-ja.html
+- doc-ja/finite-map-ja.rd
+- doc-ja/finite-set-ja.html
+- doc-ja/finite-set-ja.rd
+- doc-ja/index-ja.html
+- doc-ja/index-ja.rd
+- doc-ja/jordan-form-ja.html
+- doc-ja/jordan-form-ja.rd
+- doc-ja/localized-ring-ja.html
+- doc-ja/localized-ring-ja.rd
+- doc-ja/m-polynomial-ja.html
+- doc-ja/m-polynomial-ja.rd
+- doc-ja/matrix-algebra-ja.html
+- doc-ja/matrix-algebra-ja.rd
+- doc-ja/matrix-algebra-triplet-ja.html
+- doc-ja/matrix-algebra-triplet-ja.rd
+- doc-ja/permutation-group-ja.html
+- doc-ja/permutation-group-ja.rd
+- doc-ja/polynomial-converter-ja.html
+- doc-ja/polynomial-converter-ja.rd
+- doc-ja/polynomial-ja.html
+- doc-ja/polynomial-ja.rd
+- doc-ja/residue-class-ring-ja.html
+- doc-ja/residue-class-ring-ja.rd
+- doc-ja/sample-algebraic-equation01.rb.v.rd
+- doc-ja/sample-algebraic-equation02.rb.v.rd
+- doc-ja/sample-algebraic-root01.rb.v.rd
+- doc-ja/sample-algebraicfield01.rb.v.rd
+- doc-ja/sample-algebraicfield02.rb.v.rd
+- doc-ja/sample-cayleyhamilton01.rb.v.rd
+- doc-ja/sample-diagonalization01.rb.v.rd
+- doc-ja/sample-divmod01.rb.v.rd
+- doc-ja/sample-elementary-divisor01.rb.v.rd
+- doc-ja/sample-factorize01.rb.v.rd
+- doc-ja/sample-factorize02.rb.v.rd
+- doc-ja/sample-factorize03.rb.v.rd
+- doc-ja/sample-factorize04.rb.v.rd
+- doc-ja/sample-factorize05.rb.v.rd
+- doc-ja/sample-galois-group01.rb.v.rd
+- doc-ja/sample-gaussian-elimination01.rb.v.rd
+- doc-ja/sample-geometry01.rb.v.rd
+- doc-ja/sample-geometry02.rb.v.rd
+- doc-ja/sample-geometry03.rb.v.rd
+- doc-ja/sample-geometry04.rb.v.rd
+- doc-ja/sample-geometry07.rb.v.rd
+- doc-ja/sample-groebner01.rb.v.rd
+- doc-ja/sample-groebner02.rb.v.rd
+- doc-ja/sample-groebner03.rb.v.rd
+- doc-ja/sample-group01.rb.v.rd
+- doc-ja/sample-jordan-form01.rb.v.rd
+- doc-ja/sample-jordanform01.rb.v.rd
+- doc-ja/sample-lagrange-multiplier01.rb.v.rd
+- doc-ja/sample-m-factorize01.rb.v.rd
+- doc-ja/sample-m-factorize02.rb.v.rd
+- doc-ja/sample-m-polynomial01.rb.v.rd
+- doc-ja/sample-map01.rb.v.rd
+- doc-ja/sample-polynomial01.rb.v.rd
+- doc-ja/sample-polynomial02.rb.v.rd
+- doc-ja/sample-primefield01.rb.v.rd
+- doc-ja/sample-quotientfield01.rb.v.rd
+- doc-ja/sample-quotientfield02.rb.v.rd
+- doc-ja/sample-quotientfield03.rb.v.rd
+- doc-ja/sample-quotientfield04.rb.v.rd
+- doc-ja/sample-set01.rb.v.rd
+- doc-ja/sample-splitting-field01.rb.v.rd
+- doc-ja/samples-ja.html
+- doc-ja/samples-ja.rd
+- doc-ja/style.css
+- doc-ja/todo.html
+- doc-ja/todo.rd
+- doc/README.html
+- doc/README.rd
+- doc/algebra.html
+- doc/algebra.rd
+- doc/algebraic-equation.html
+- doc/algebraic-equation.rd
+- doc/algebraic-extension-field.html
+- doc/algebraic-extension-field.rd
+- doc/algebraic-parser.html
+- doc/algebraic-parser.rd
+- doc/changes.html
+- doc/changes.rd
+- doc/elementary-divisor.html
+- doc/elementary-divisor.rd
+- doc/euclidian-ring.html
+- doc/euclidian-ring.rd
+- doc/finite-group.html
+- doc/finite-group.rd
+- doc/finite-map.html
+- doc/finite-map.rd
+- doc/finite-set.html
+- doc/finite-set.rd
+- doc/index.html
+- doc/index.rd
+- doc/jordan-form.html
+- doc/jordan-form.rd
+- doc/localized-ring.html
+- doc/localized-ring.rd
+- doc/m-polynomial.html
+- doc/m-polynomial.rd
+- doc/matrix-algebra-triplet.html
+- doc/matrix-algebra-triplet.rd
+- doc/matrix-algebra.html
+- doc/matrix-algebra.rd
+- doc/permutation-group.html
+- doc/permutation-group.rd
+- doc/polynomial-converter.html
+- doc/polynomial-converter.rd
+- doc/polynomial.html
+- doc/polynomial.rd
+- doc/residue-class-ring.html
+- doc/residue-class-ring.rd
+- doc/sample-algebraic-equation01.rb.v.rd
+- doc/sample-algebraic-equation02.rb.v.rd
+- doc/sample-algebraic-root01.rb.v.rd
+- doc/sample-algebraicfield01.rb.v.rd
+- doc/sample-algebraicfield02.rb.v.rd
+- doc/sample-cayleyhamilton01.rb.v.rd
+- doc/sample-diagonalization01.rb.v.rd
+- doc/sample-divmod01.rb.v.rd
+- doc/sample-elementary-divisor01.rb.v.rd
+- doc/sample-factorize01.rb.v.rd
+- doc/sample-factorize02.rb.v.rd
+- doc/sample-factorize03.rb.v.rd
+- doc/sample-factorize04.rb.v.rd
+- doc/sample-factorize05.rb.v.rd
+- doc/sample-galois-group01.rb.v.rd
+- doc/sample-gaussian-elimination01.rb.v.rd
+- doc/sample-geometry01.rb.v.rd
+- doc/sample-geometry02.rb.v.rd
+- doc/sample-geometry03.rb.v.rd
+- doc/sample-geometry04.rb.v.rd
+- doc/sample-geometry07.rb.v.rd
+- doc/sample-groebner01.rb.v.rd
+- doc/sample-groebner02.rb.v.rd
+- doc/sample-groebner03.rb.v.rd
+- doc/sample-group01.rb.v.rd
+- doc/sample-jordan-form01.rb.v.rd
+- doc/sample-lagrange-multiplier01.rb.v.rd
+- doc/sample-m-factorize01.rb.v.rd
+- doc/sample-m-factorize02.rb.v.rd
+- doc/sample-m-polynomial01.rb.v.rd
+- doc/sample-map01.rb.v.rd
+- doc/sample-polynomial01.rb.v.rd
+- doc/sample-polynomial02.rb.v.rd
+- doc/sample-primefield01.rb.v.rd
+- doc/sample-quotientfield01.rb.v.rd
+- doc/sample-quotientfield02.rb.v.rd
+- doc/sample-quotientfield03.rb.v.rd
+- doc/sample-quotientfield04.rb.v.rd
+- doc/sample-set01.rb.v.rd
+- doc/sample-splitting-field01.rb.v.rd
+- doc/samples.html
+- doc/samples.rd
+- doc/style.css
+- doc/todo.html
+- doc/todo.rd
+- lib/algebra.rb
+- lib/algebra/algebraic-equation.rb
+- lib/algebra/algebraic-extension-field.rb
+- lib/algebra/algebraic-parser.rb
+- lib/algebra/algebraic-system.rb
+- lib/algebra/annihilate.rb
+- lib/algebra/array-supplement.rb
+- lib/algebra/auto-require.rb
+- lib/algebra/chinese-rem-th.rb
+- lib/algebra/combinatorial.rb
+- lib/algebra/elementary-divisor.rb
+- lib/algebra/euclidian-ring.rb
+- lib/algebra/factors.rb
+- lib/algebra/finite-group.rb
+- lib/algebra/finite-map.rb
+- lib/algebra/finite-set.rb
+- lib/algebra/galois-group.rb
+- lib/algebra/gaussian-elimination.rb
+- lib/algebra/groebner-basis-coeff.rb
+- lib/algebra/groebner-basis.rb
+- lib/algebra/import-module-single-thread.rb
+- lib/algebra/import-module.rb
+- lib/algebra/jordan-form.rb
+- lib/algebra/linear-algebra.rb
+- lib/algebra/localized-ring.rb
+- lib/algebra/m-index.rb
+- lib/algebra/m-polynomial-factor-int.rb
+- lib/algebra/m-polynomial-factor-zp.rb
+- lib/algebra/m-polynomial-factor.rb
+- lib/algebra/m-polynomial-gcd.rb
+- lib/algebra/m-polynomial.rb
+- lib/algebra/matrix-algebra-triplet.rb
+- lib/algebra/matrix-algebra.rb
+- lib/algebra/numeric-supplement.rb
+- lib/algebra/permutation-group.rb
+- lib/algebra/polynomial-converter.rb
+- lib/algebra/polynomial-factor-alg.rb
+- lib/algebra/polynomial-factor-int.rb
+- lib/algebra/polynomial-factor-zp.rb
+- lib/algebra/polynomial-factor.rb
+- lib/algebra/polynomial.rb
+- lib/algebra/powers.rb
+- lib/algebra/prime-gen.rb
+- lib/algebra/rational.rb
+- lib/algebra/residue-class-ring.rb
+- lib/algebra/sets-system.rb
+- lib/algebra/splitting-field.rb
+- lib/algebra/version.rb
+- sample/Makefile
+- sample/do-testscripts.rb
+- sample/sample-algebraic-equation01.rb
+- sample/sample-algebraic-equation02.rb
+- sample/sample-algebraic-root01.rb
+- sample/sample-algebraicfield01.rb
+- sample/sample-algebraicfield02.rb
+- sample/sample-cayleyhamilton01.rb
+- sample/sample-diagonalization01.rb
+- sample/sample-divmod01.rb
+- sample/sample-elementary-divisor01.rb
+- sample/sample-factorize01.rb
+- sample/sample-factorize02.rb
+- sample/sample-factorize03.rb
+- sample/sample-factorize04.rb
+- sample/sample-factorize05.rb
+- sample/sample-galois-group01.rb
+- sample/sample-gaussian-elimination01.rb
+- sample/sample-geometry01.rb
+- sample/sample-geometry02.rb
+- sample/sample-geometry03.rb
+- sample/sample-geometry04.rb
+- sample/sample-geometry07.rb
+- sample/sample-groebner01.rb
+- sample/sample-groebner02.rb
+- sample/sample-groebner03.rb
+- sample/sample-group01.rb
+- sample/sample-jordan-form01.rb
+- sample/sample-lagrange-multiplier01.rb
+- sample/sample-m-factorize01.rb
+- sample/sample-m-factorize02.rb
+- sample/sample-m-polynomial01.rb
+- sample/sample-map01.rb
+- sample/sample-polynomial01.rb
+- sample/sample-polynomial02.rb
+- sample/sample-primefield01.rb
+- sample/sample-quotientfield01.rb
+- sample/sample-quotientfield02.rb
+- sample/sample-quotientfield03.rb
+- sample/sample-quotientfield04.rb
+- sample/sample-set01.rb
+- sample/sample-splitting-field01.rb
+- sample/test-00-cayley-hamilton.rb
+- sample/test-00-groebner-basis.rb
+- sample/test-00-polynomial-factor-alg.rb
+- sample/test-00.list
+- sample/time-trial.rb
+homepage: https://github.com/kunishi/algebra-ruby2
+licenses:
+- MIT
+metadata: {}
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubyforge_project: 
+rubygems_version: 2.5.1
+signing_key: 
+specification_version: 4
+summary: a library for mathematical computations.
+test_files: []