dfg

Author: PeterLuschny

Project.toml

@@ -3,6 +3,7 @@ uuid = "b4b868b0-69a7-11e9-2db0-173b4e8e576c"
 version = "0.2.0"
 
 [deps]
+Atom = "c52e3926-4ff0-5f6e-af25-54175e0327b1"
 BenchmarkTools = "6e4b80f9-dd63-53aa-95a3-0cdb28fa8baf"
 DataStructures = "864edb3b-99cc-5e75-8d2d-829cb0a9cfe8"
 Dates = "ade2ca70-3891-5945-98fb-dc099432e06a"
@@ -11,6 +12,7 @@ Documenter = "e30172f5-a6a5-5a46-863b-614d45cd2de4"
 HTTP = "cd3eb016-35fb-5094-929b-558a96fad6f3"
 InteractiveUtils = "b77e0a4c-d291-57a0-90e8-8db25a27a240"
 IterTools = "c8e1da08-722c-5040-9ed9-7db0dc04731e"
+Juno = "e5e0dc1b-0480-54bc-9374-aad01c23163d"
 Nemo = "2edaba10-b0f1-5616-af89-8c11ac63239a"
 Test = "8dfed614-e22c-5e08-85e1-65c5234f0b40"
 

docs/src/index.md

@@ -538,6 +538,9 @@ SetPartitions
 Sfactorial
 ```
 ```@docs
+ShapeOrderedPartitions
+```
+```@docs
 ShapePartitions
 ```
 ```@docs

src/BooleanOperations.jl

@@ -33,9 +33,13 @@ const ModuleBooleanOperations = ""
 
 """
 Return the binary expansions of nonnegative ``n`` and ``k``. If algo=max then pad the resulting int arrays with 0 to make them equally long. For example
+
     BinDigits``(12, 17, max) = ([0, 0, 1, 1, 0], [1, 0, 0, 0, 1])``.
+
 If algo=min then the arrays are truncated to the length of the smaller operand.
+
     BinDigits``(12, 17, min) = ([0, 0, 1, 1], [1, 0, 0, 0])``.
+
 These are the lists which are itemwise compared by the logical operators.
 """
 function BinDigits(n::Int, k::Int, algo=max)
@@ -179,28 +183,28 @@ end
 
 """
 
-Return n NAND n.
+Return ``n`` NAND ``n``.
 """
 V035327(n) = Bits("NAND", n, n)
 # also : V035327(n) = Bits("NEG1", n, n+1, min)
 
 """
 
-Return n EQV n.
+Return ``n`` EQV ``n``.
 """
 V003817(n) = Bits("EQV", n, n)
 # sets a(0) = 1
 
 """
 
-Return n AND n+1, using max length.
+Return ``n`` AND ``n+1``, using max length.
 """
 V129760(n) = Bits("AND", n, n+1)
 # with offset 0
 
 """
 
-Return n CIMP n+1, using max length.
+Return ``n`` CIMP ``n+1``, using max length.
 """
 V142151(n) = Bits("CIMP", n, n+1)
 
@@ -213,109 +217,109 @@ V142151(n) = Bits("CIMP", n, n+1)
 
 """
 
-Return n NEG1 n+1, using max length.
+Return ``n`` NEG1 ``n+1``, using max length.
 """
 V080079(n) = Bits("NEG1", n, n+1)
 # with offset 0
 
 """
 
-Return n OR n+1, using max length.
+Return ``n`` OR ``n+1``, using max length.
 """
 V086799(n) = Bits("OR", n, n+1)
 # with offset 0
 
 """
 
-Return n OR 2n, using max length.
+Return ``n`` OR ``2n``, using max length.
 """
 V163617(n) = Bits("OR", n, n<<1)
 
 """
 
-Return n XOR n+1, using max length.
+Return ``n`` XOR ``n+1``, using max length.
 """
 V038712(n) = Bits("XOR", n, n+1)
 # with offset 0
 
 """
 
-Return max(1, 2n) - (n EQV n), using max length.
+Return max``(1, 2n) - (n`` EQV ``n)``, using max length.
 """
 V006257(n) = max(1, 2n) - Bits("EQV", n, n)
 
 """
 
-Return n XOR 2n, using max length.
+Return ``n`` XOR ``2n``, using max length.
 """
 V048724(n) = Bits("XOR", n, n<<1)
 
 """
 
-Return n XOR n>>1, using max length.
+Return ``n`` XOR ``n>>1``, using max length.
 """
 V003188(n) = Bits("XOR", n, n>>1)
 
 """
 
-Return n XOR n>>1, using min length.
+Return ``n`` XOR ``n>>1``, using min length.
 """
 V038554(n) = Bits("XOR", n, n>>1, min)
 # with a(1) = 1
 
 """
 
-Return n AND n>>1, using min length.
+Return ``n`` AND ``n>>1``, using min length.
 """
 V048735(n) = Bits("AND", n, n>>1, min)
 
 """
 
-Return n AND n<<1, using min length.
+Return ``n`` AND ``n<<1``, using min length.
 """
 V213370(n) = Bits("AND", n, n<<1, min)
 
 """
 
-Return n CNIMP n+1, using min length.
+Return ``n`` CNIMP ``n+1``, using min length.
 """
 V080940(n) = Bits("CNIMP", n, n+1, min)
 # with a(0) = 1
 
 """
 
-Return n XOR n+1, using min length.
+Return ``n`` XOR ``n+1``, using min length.
 """
 V135521(n) = Bits("XOR", n, n+1, min)
 # prepend a(0) = 1
 
 """
 
-Return n XOR k, using max length.
+Return ``n`` XOR ``k``, using max length.
 """
 V051933(n, k) = Bits("XOR", n, k)
 
 """
 
-Return (k-1 XOR n-k) + 1, using max length.
+Return ``(k-1`` XOR ``n-k) + 1``, using max length.
 """
 L280172(n) = [Bits("XOR", k-1, n-k) + 1 for k in 1:n]
 
 """
 
-Return n+1 CNIMP n, using max length.
+Return ``n+1`` CNIMP ``n``, using max length.
 """
 V135481(n) = Bits("CNIMP", n+1, n)
 
 """
 
-Return Sum``_{d|n} d & (n/d)``, where & is the bitwise AND operator.
+Return ∑``_{d|n} d & (n/d)``, where & is the bitwise AND operator.
 """
 V327987(n) = sum([Bits("AND", d, div(n, d)) for d ∈ divisors(n)])
 
 """
 
-Is V327987(n) = ``∑_{d|n} d & (n/d)`` = 0 ?
+Is V327987(n) = ``∑_{d|n} d & (n/d) = 0`` ?
 """
 is327988(n) = V327987(n) == 0
 

src/BuildSequences.jl

@@ -474,6 +474,29 @@ function addsig(srcfile, docfile)
     end
 end
 
+
+#  Version information
+version() = v"0.3.0-dev"
+
+function versioninfo()
+  print("IntegerSequences version $(version())\n")
+  isrepo = dirname(dirname(@__FILE__))
+
+  print("IntegerSequences: ")
+  prepo = Base.LibGit2.GitRepo(isrepo)
+  Base.LibGit2.with(LibGit2.head(prepo)) do phead
+    print("commit: ")
+    print(string(LibGit2.Oid(phead))[1:8])
+    print(" date: ")
+    commit = Base.LibGit2.get(Base.LibGit2.GitCommit, prepo, LibGit2.Oid(phead))
+    print(Base.Dates.unix2datetime(Base.LibGit2.author(commit).time))
+    print(")\n")
+  end
+
+  finalize(prepo)
+  return nothing
+end
+
 function build_all()
 
     build_seq()

src/CantorMachines.jl

@@ -40,7 +40,7 @@ end
 
 """
 
-The  Cantor enumeration of N X N where N = {0, 1, 2, ...}. If (x, y) and (x', y') are adjacent points on the trajectory of the map then max(|x - x'|, |y - y'|) can become arbitrarily large. In this sense Cantor's enumeration is not continous.
+The  Cantor enumeration of ℕ X ℕ where ℕ ``= {0, 1, 2, ...}``. If ``(x, y)`` and ``(x', y')`` are adjacent points on the trajectory of the map then max``(|x - x'|, |y - y'|)`` can become arbitrarily large. In this sense Cantor's enumeration is not continous.
 """
 function CantorEnumeration(len)
     x, y, state = 0, 0, false
@@ -53,7 +53,7 @@ end
 
 """
 
-The inverse function of the Cantor enumeration (the pairing function), computes n for given (x, y) and returns (x + y)*(x + y + 1)/2 + p where p = x if x - y is odd and y otherwise.
+The inverse function of the Cantor enumeration (the pairing function), computes n for given ``(x, y)`` and returns ``(x + y)(x + y + 1)/2 + p`` where ``p = x`` if ``x - y`` is odd and ``y`` otherwise.
 """
 function CantorPairing(x, y)
     p = isodd(x - y) ? x : y
@@ -74,7 +74,7 @@ end
 
 """
 
-# The boustrophedonic Cantor enumeration of N X N where N = {0, 1, 2, ...}. If (x, y) and (x', y') are adjacent points on the trajectory of the map then max(|x - x'|, |y - y'|) is always 1 whereas for the Cantor enumeration this quantity can become arbitrarily large. In this sense the boustrophedonic variant is continuous whereas Cantor's realization is not.
+The boustrophedonic Cantor enumeration of ℕ X ℕ where ``ℕ = {0, 1, 2, ...}``. If ``(x, y)`` and ``(x', y')`` are adjacent points on the trajectory of the map then max``(|x - x'|, |y - y'|)`` is always 1 whereas for the Cantor enumeration this quantity can become arbitrarily large. In this sense the boustrophedonic variant is continuous whereas Cantor's realization is not.
 """
 function CantorBoustrophedonicEnumeration(len)
     x, y = 0, 0
@@ -87,7 +87,7 @@ end
 
 """
 
-The inverse function of the boustrophedonic Cantor enumeration (the pairing function), computes n for given (x, y) and returns (x + y)*(x + y + 1)/2 + m where m = abs(x - y) - (x > y ? 1 : 0).
+The inverse function of the boustrophedonic Cantor enumeration (the pairing function), computes n for given ``(x, y)`` and returns ``(x + y)(x + y + 1)/2 + m`` where ``m = abs(x - y) - (x > y ? 1 : 0)``.
 """
 function CantorBoustrophedonicPairing(x, y)
     m = abs(x - y) - (x > y ? 1 : 0)
@@ -113,7 +113,7 @@ end
 
 """
 
-The boustrophedonic Rosenberg-Strong enumeration of N X N where N = {0, 1, 2, ...}. If (x, y) and (x', y') are adjacent points on the trajectory of the map then max(|x - x'|, |y - y'|) is always 1 whereas the Rosenberg-Strong realization is not.
+The boustrophedonic Rosenberg-Strong enumeration of ℕ X ℕ where ℕ ``= {0, 1, 2, ...}``. If ``(x, y)`` and ``(x', y')`` are adjacent points on the trajectory of the map then max``(|x - x'|, |y - y'|)`` is always 1 whereas the Rosenberg-Strong realization is not.
 """
 function RosenbergStrongBoustrophedonicEnumeration(len)
     x, y, state = 0, 0, 0
@@ -126,7 +126,7 @@ end
 
 """
 
-The inverse function of the boustrophedonic Rosenberg-Strong enumeration (the pairing function), computes n for given (x, y).
+The inverse function of the boustrophedonic Rosenberg-Strong enumeration (the pairing function), computes ``n`` for given ``(x, y)``.
 """
 function RosenbergStrongBoustrophedonicPairing(x::Int, y::Int)
     m = max(x, y)
@@ -136,7 +136,7 @@ end
 
 """
 
-Return the pair (x, y) for given n as given by the boustrophedonic Rosenberg-Strong enumeration.
+Return the pair ``(x, y)`` for given n as given by the boustrophedonic Rosenberg-Strong enumeration.
 """
 function V319514(n)
     k, r = divrem(n, 2)
@@ -148,7 +148,7 @@ end
 
 """
 
-Return a list of pairs (x, y) given by the boustrophedonic Rosenberg-Strong enumeration.
+Return a list of pairs ``(x, y)`` given by the boustrophedonic Rosenberg-Strong enumeration.
 """
 L319514(len) = [V319514(n) for n ∈ 0:len-1]
 

src/CyclotomicBinaryForms.jl

@@ -32,8 +32,8 @@ const ModuleCyclotomicBinaryForms = ""
 #A206942########################################################################
 """
 
-Is ``n`` a numbers of the form ``Phi_k(m)`` with ``k > 2`` and ``|m| > 1``
-where ``Phi_k(m)`` denotes the ``k``-th cyclotomic polynomial evaluated at ``m``.
+Is ``n`` a numbers of the form ``𝚽_k(m)`` with ``k > 2`` and ``|m| > 1``
+where ``𝚽_k(m)`` denotes the ``k``-th cyclotomic polynomial evaluated at ``m``.
 """
 function is206942(n)
     if n < 3