From ffc06e8e63ab87c9a05f12e1c678f03c32bead17 Mon Sep 17 00:00:00 2001 From: sumiya11 <60229118+sumiya11@users.noreply.github.com> Date: Mon, 14 Oct 2024 10:32:05 +0000 Subject: [PATCH] =?UTF-8?q?Deploying=20to=20gh-pages=20from=20=20@=20c62fb?= =?UTF-8?q?fbee0c83b2fdad4ce0ec48fea050a2437de=20=F0=9F=9A=80?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- assets/interface/code/lowlevel.jl | 10 -------- assets/interface/code/output/lowlevel.out | 0 assets/interface/code/output/lowlevel.res | 1 - assets/tutorial/code/output/gcd3.out | 2 +- assets/tutorial/code/output/gcd4.out | 2 +- assets/tutorial/code/output/graph2.svg | 18 +++++++------- assets/tutorial/code/output/graphcolored.svg | 18 +++++++------- benchmarks/index.html | 8 +++---- developer/index.html | 8 +++---- index.html | 24 +++++-------------- interface/index.html | 25 ++++---------------- sitemap.xml | 14 +++++------ tutorial/index.html | 12 ++++------ 13 files changed, 48 insertions(+), 94 deletions(-) delete mode 100644 assets/interface/code/lowlevel.jl delete mode 100644 assets/interface/code/output/lowlevel.out delete mode 100644 assets/interface/code/output/lowlevel.res diff --git a/assets/interface/code/lowlevel.jl b/assets/interface/code/lowlevel.jl deleted file mode 100644 index dde39b58..00000000 --- a/assets/interface/code/lowlevel.jl +++ /dev/null @@ -1,10 +0,0 @@ -# This file was generated, do not modify it. # hide -using Groebner - -# define {x y - 1, x^3 + 7 y^2} modulo 65537 in DRL -ring = Groebner.PolyRing(2, Groebner.DegRevLex(), 65537) -monoms = [ [[1, 1], [0, 0]], [[3, 0], [0, 2]] ] -coeffs = [ [1, -1], [1, 7] ] - -# compute a GB -gb_monoms, gb_coeffs = Groebner.groebner(ring, monoms, coeffs) \ No newline at end of file diff --git a/assets/interface/code/output/lowlevel.out b/assets/interface/code/output/lowlevel.out deleted file mode 100644 index e69de29b..00000000 diff --git a/assets/interface/code/output/lowlevel.res b/assets/interface/code/output/lowlevel.res deleted file mode 100644 index 56a4d6b6..00000000 --- a/assets/interface/code/output/lowlevel.res +++ /dev/null @@ -1 +0,0 @@ -(Vector{Vector{UInt32}}[[[0x00000001, 0x00000001], [0x00000000, 0x00000000]], [[0x00000000, 0x00000003], [0x00000002, 0x00000000]], [[0x00000003, 0x00000000], [0x00000000, 0x00000002]]], Vector{UInt32}[[0x00000001, 0x00010000], [0x00000001, 0x00004925], [0x00000001, 0x00000007]]) \ No newline at end of file diff --git a/assets/tutorial/code/output/gcd3.out b/assets/tutorial/code/output/gcd3.out index 1e9536b7..e704bc8c 100644 --- a/assets/tutorial/code/output/gcd3.out +++ b/assets/tutorial/code/output/gcd3.out @@ -1 +1 @@ - 83.214 μs (1669 allocations: 64.62 KiB) + 81.782 μs (1669 allocations: 64.62 KiB) diff --git a/assets/tutorial/code/output/gcd4.out b/assets/tutorial/code/output/gcd4.out index 5fb68f83..8e7e2ead 100644 --- a/assets/tutorial/code/output/gcd4.out +++ b/assets/tutorial/code/output/gcd4.out @@ -1 +1 @@ - 150.730 μs (2712 allocations: 137.27 KiB) + 151.401 μs (2706 allocations: 160.52 KiB) diff --git a/assets/tutorial/code/output/graph2.svg b/assets/tutorial/code/output/graph2.svg index 2fcd7a36..96bfcbe3 100644 --- a/assets/tutorial/code/output/graph2.svg +++ b/assets/tutorial/code/output/graph2.svg @@ -13,14 +13,14 @@ - + - + - + @@ -37,13 +37,13 @@ - + - + - + - + @@ -57,7 +57,7 @@ - + 1 @@ -79,7 +79,7 @@ - + diff --git a/assets/tutorial/code/output/graphcolored.svg b/assets/tutorial/code/output/graphcolored.svg index 1fc197bc..252d47a1 100644 --- a/assets/tutorial/code/output/graphcolored.svg +++ b/assets/tutorial/code/output/graphcolored.svg @@ -13,14 +13,14 @@ - + - + - + @@ -37,13 +37,13 @@ - + - + - + - + @@ -57,7 +57,7 @@ - + 1 @@ -79,7 +79,7 @@ - + diff --git a/benchmarks/index.html b/benchmarks/index.html index 84d9a114..d87319fc 100644 --- a/benchmarks/index.html +++ b/benchmarks/index.html @@ -58,7 +58,7 @@

Groebner Home - +
  • Introductory tutorial +
  • Development @@ -103,7 +101,7 @@

    Groebner
    - © Alexander Demin, Shashi Gowda, and others. Last modified: October 13, 2024. Website built with Franklin.jl and PkgPage.jl. + © Alexander Demin, Shashi Gowda, and others. Last modified: October 14, 2024. Website built with Franklin.jl and PkgPage.jl.
    diff --git a/developer/index.html b/developer/index.html index 8fbb267d..5d11f1c5 100644 --- a/developer/index.html +++ b/developer/index.html @@ -59,7 +59,7 @@

    Groebner Home - +
  • Introductory tutorial +
  • Development @@ -141,7 +139,7 @@

    - © Alexander Demin, Shashi Gowda, and others. Last modified: October 13, 2024. Website built with Franklin.jl and PkgPage.jl. + © Alexander Demin, Shashi Gowda, and others. Last modified: October 14, 2024. Website built with Franklin.jl and PkgPage.jl.
    diff --git a/index.html b/index.html index 3e8cf35e..fc3cd4b0 100644 --- a/index.html +++ b/index.html @@ -59,7 +59,7 @@

    Groebner Home - +
  • Introductory tutorial +
  • Development @@ -97,24 +95,14 @@

    Groebner
    -

    Groebner.jl is a package for Gröbner bases computation based on the Faugère's F4 algorithm written in Julia.

    +

    Groebner.jl is a package for fast and generic Gröbner bases computations based on Faugère's F4 algorithm written in Julia.

    Installation

    To install Groebner.jl, run the following in the Julia REPL:

    using Pkg; Pkg.add("Groebner")
    -

    Features

    -

    Groebner.jl features:

    -
      -

    • Gröbner basis computation over integers modulo a prime and over the rationals

      -
      • -

    • Gröbner trace algorithms

      -
      • -

    • Multi-threading by default

      -
      • -
    -

    See Interface page for a list of all exported functions.

    +

    See Interface for a description of all exported functions. For a quick introduction to Groebner bases we refer to Tutorials. Meanwhile, below are simple examples.

    Examples

    -

    As input, Groebner.jl supports polynomials from AbstractAlgebra.jl, DynamicPolynomials.jl, and Nemo.jl.

    +

    Currently, polynomials from AbstractAlgebra.jl, DynamicPolynomials.jl, and Nemo.jl are supported as input.

    with AbstractAlgebra.jl

    First, import AbstractAlgebra.jl. Then, we can create an array of polynomials over a finite field

    @@ -159,7 +147,7 @@

    Acknow

    We are grateful to The Max Planck Institute for Informatics and The MAX team at l'X for providing computational resources.

    - © Alexander Demin, Shashi Gowda, and others. Last modified: October 13, 2024. Website built with Franklin.jl and PkgPage.jl. + © Alexander Demin, Shashi Gowda, and others. Last modified: October 14, 2024. Website built with Franklin.jl and PkgPage.jl.

    diff --git a/interface/index.html b/interface/index.html index cfa8517b..91ed0141 100644 --- a/interface/index.html +++ b/interface/index.html @@ -59,7 +59,7 @@

    Groebner Home - +
  • Introductory tutorial +
  • Development @@ -550,7 +548,7 @@

    Example@assert flag @assert gb_2 == groebner([2x2*y2^2 + 3x2, 4y2*x2^2 + 5y2], ordering=DegRevLex()) -

    Using groebner_apply! in batches:

    +

    Using groebner_apply! in batches (works only in :degrevlex at the moment):

    using Groebner, AbstractAlgebra
 R, (x, y) = polynomial_ring(GF(2^31-1), ["x", "y"], internal_ordering=:degrevlex)
 
@@ -624,24 +622,9 @@ 
    Notes
    
 
   
 
-
    Low-level interface
    
-
-
    Some functions in the interface have a low-level entry point. Low-level functions accept and output ''raw'' exponent vectors and coefficients. This could be convenient when one does not want to depend on a frontend.
    
-
    For example,
    
-
    using Groebner
-
-# define {x y - 1, x^3 + 7 y^2} modulo 65537 in DRL
-ring = Groebner.PolyRing(2, Groebner.DegRevLex(), 65537)
-monoms = [ [[1, 1], [0, 0]], [[3, 0], [0, 2]] ]
-coeffs = [ [1, -1], [1, 7] ]
-
-# compute a GB
-gb_monoms, gb_coeffs = Groebner.groebner(ring, monoms, coeffs)
    (Vector{Vector{UInt32}}[[[0x00000001, 0x00000001], [0x00000000, 0x00000000]], [[0x00000000, 0x00000003], [0x00000002, 0x00000000]], [[0x00000003, 0x00000000], [0x00000000, 0x00000002]]], Vector{UInt32}[[0x00000001, 0x00010000], [0x00000001, 0x00004925], [0x00000001, 0x00000007]])
    
-
    The list of functions that provide a low-level entry point: groebner, normalform, isgroebner, groebner_learn, groebner_apply.
    
-
    The low-level functions may be faster than their user-facing analogues since they bypass internal checks and conversions. Low-level functions do not make any specific assumptions, that is, all of these are correctly handled in the input: unsorted monomials, nonnormalized coefficients, duplicate terms, aliasing memory.
    
 
    
   
    
-    © Alexander Demin, Shashi Gowda, and others. Last modified: October 13, 2024. Website built with Franklin.jl and PkgPage.jl.
+    © Alexander Demin, Shashi Gowda, and others. Last modified: October 14, 2024. Website built with Franklin.jl and PkgPage.jl.
   
    
 
    
 
diff --git a/sitemap.xml b/sitemap.xml
index 226a84cc..fb1e5322 100644
--- a/sitemap.xml
+++ b/sitemap.xml
@@ -3,43 +3,43 @@
 
 
     index.html
-    2024-10-13
+    2024-10-14
     monthly
     0.5
 
 
     tutorial/index.html
-    2024-10-13
+    2024-10-14
     monthly
     0.5
 
 
     benchmarks/index.html
-    2024-10-13
+    2024-10-14
     monthly
     0.5
 
 
     interface/index.html
-    2024-10-13
+    2024-10-14
     monthly
     0.5
 
 
     developer/index.html
-    2024-10-13
+    2024-10-14
     monthly
     0.5
 
 
     build/index/
-    2024-10-13
+    2024-10-14
     monthly
     0.5
 
 
     build/search/index/
-    2024-10-13
+    2024-10-14
     monthly
     0.5
 
diff --git a/tutorial/index.html b/tutorial/index.html
index 7188ccea..977f7a9c 100644
--- a/tutorial/index.html
+++ b/tutorial/index.html
@@ -59,7 +59,7 @@ 
    Groebner
       Home
       
-      
+      
  • Introductory tutorial
         
+      
  • Development
     
 
   
@@ -175,11 +173,11 @@ 
    h = (x + 3)^5
 
-@btime gcd(gcd($f, $g), $h)
    •   83.214 μs (1669 allocations: 64.62 KiB)
+@btime gcd(gcd($f, $g), $h)
      81.782 μs (1669 allocations: 64.62 KiB)
 3 + x

    With Groebner.jl:

    F = [f, g, h]
-@btime groebner($F)
      150.730 μs (2712 allocations: 137.27 KiB)
+@btime groebner($F)
      151.401 μs (2706 allocations: 160.52 KiB)
 1-element Vector{DynamicPolynomials.Polynomial{DynamicPolynomials.Commutative{DynamicPolynomials.CreationOrder}, MultivariatePolynomials.Graded{MultivariatePolynomials.LexOrder}, Rational{BigInt}}}:
  3//1 + x

    Variable Elimination

    @@ -349,7 +347,7 @@

    Graph Co
    - © Alexander Demin, Shashi Gowda, and others. Last modified: October 13, 2024. Website built with Franklin.jl and PkgPage.jl. + © Alexander Demin, Shashi Gowda, and others. Last modified: October 14, 2024. Website built with Franklin.jl and PkgPage.jl.