@stevenvo780/st-lang 4.10.0 → 4.12.0

package/dist/reasoning/combinatorics/inclusion-exclusion.js

@@ -0,0 +1,45 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.inclusionExclusion = inclusionExclusion;
+/**
+ * Calcula |A_1 ∪ A_2 ∪ ... ∪ A_n| usando el principio de inclusión-exclusión
+ * a fuerza bruta sobre el reticulado de subconjuntos no vacíos de índices.
+ *
+ * |⋃ A_i| = Σ_{S≠∅} (-1)^(|S|+1) |⋂_{i∈S} A_i|
+ */
+function inclusionExclusion(sets) {
+    const n = sets.length;
+    if (n === 0)
+        return 0;
+    let total = 0;
+    const totalMasks = 1 << n;
+    for (let mask = 1; mask < totalMasks; mask++) {
+        let popcount = 0;
+        let intersection = null;
+        for (let i = 0; i < n; i++) {
+            if ((mask >> i) & 1) {
+                popcount++;
+                const si = sets[i];
+                if (si === undefined)
+                    throw new Error('inclusionExclusion: set inválido');
+                if (intersection === null) {
+                    intersection = new Set(si);
+                }
+                else {
+                    const next = new Set();
+                    for (const v of intersection) {
+                        if (si.has(v))
+                            next.add(v);
+                    }
+                    intersection = next;
+                }
+            }
+        }
+        if (intersection === null)
+            continue;
+        const sign = popcount % 2 === 1 ? 1 : -1;
+        total += sign * intersection.size;
+    }
+    return total;
+}
+//# sourceMappingURL=inclusion-exclusion.js.map

package/dist/reasoning/combinatorics/inclusion-exclusion.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"inclusion-exclusion.js","sourceRoot":"","sources":["../../../src/reasoning/combinatorics/inclusion-exclusion.ts"],"names":[],"mappings":";;AAMA,gDA6BC;AAnCD;;;;;GAKG;AACH,SAAgB,kBAAkB,CAAC,IAAwB;IACzD,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;IACtB,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACtB,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,MAAM,UAAU,GAAG,CAAC,IAAI,CAAC,CAAC;IAC1B,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,UAAU,EAAE,IAAI,EAAE,EAAE,CAAC;QAC7C,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,IAAI,YAAY,GAAuB,IAAI,CAAC;QAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;gBACpB,QAAQ,EAAE,CAAC;gBACX,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;gBACnB,IAAI,EAAE,KAAK,SAAS;oBAAE,MAAM,IAAI,KAAK,CAAC,kCAAkC,CAAC,CAAC;gBAC1E,IAAI,YAAY,KAAK,IAAI,EAAE,CAAC;oBAC1B,YAAY,GAAG,IAAI,GAAG,CAAC,EAAE,CAAC,CAAC;gBAC7B,CAAC;qBAAM,CAAC;oBACN,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;oBAC/B,KAAK,MAAM,CAAC,IAAI,YAAY,EAAE,CAAC;wBAC7B,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;4BAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;oBAC7B,CAAC;oBACD,YAAY,GAAG,IAAI,CAAC;gBACtB,CAAC;YACH,CAAC;QACH,CAAC;QACD,IAAI,YAAY,KAAK,IAAI;YAAE,SAAS;QACpC,MAAM,IAAI,GAAG,QAAQ,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACzC,KAAK,IAAI,IAAI,GAAG,YAAY,CAAC,IAAI,CAAC;IACpC,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC"}

package/dist/reasoning/combinatorics/index.d.ts

@@ -0,0 +1,10 @@
+export { factorial, binomial, multinomial, permutations, combinations } from './basic-counts';
+export { generatePermutations, generateCombinations, generatePowerSet, generateSubsetsOfSize } from './generators';
+export { permutationParity, permutationCycles, permutationOrder, composePermutations, inversePermutation } from './permutations';
+export { partitions, partitionsCount, partitionsIntoParts } from './partitions';
+export { stirlingSecondKind, stirlingFirstKind, catalan, bellNumber, eulerNumber, eulerianNumber } from './special-numbers';
+export { setPartitions, setPartitionsCount } from './set-partitions';
+export { burnsideCount, cyclicRotations } from './burnside';
+export { multiplyPolynomials, generatingFunction, binomialGF } from './generating-functions';
+export { inclusionExclusion } from './inclusion-exclusion';
+//# sourceMappingURL=index.d.ts.map

package/dist/reasoning/combinatorics/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/reasoning/combinatorics/index.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,SAAS,EACT,QAAQ,EACR,WAAW,EACX,YAAY,EACZ,YAAY,EACb,MAAM,gBAAgB,CAAC;AAExB,OAAO,EACL,oBAAoB,EACpB,oBAAoB,EACpB,gBAAgB,EAChB,qBAAqB,EACtB,MAAM,cAAc,CAAC;AAEtB,OAAO,EACL,iBAAiB,EACjB,iBAAiB,EACjB,gBAAgB,EAChB,mBAAmB,EACnB,kBAAkB,EACnB,MAAM,gBAAgB,CAAC;AAExB,OAAO,EACL,UAAU,EACV,eAAe,EACf,mBAAmB,EACpB,MAAM,cAAc,CAAC;AAEtB,OAAO,EACL,kBAAkB,EAClB,iBAAiB,EACjB,OAAO,EACP,UAAU,EACV,WAAW,EACX,cAAc,EACf,MAAM,mBAAmB,CAAC;AAE3B,OAAO,EACL,aAAa,EACb,kBAAkB,EACnB,MAAM,kBAAkB,CAAC;AAE1B,OAAO,EACL,aAAa,EACb,eAAe,EAChB,MAAM,YAAY,CAAC;AAEpB,OAAO,EACL,mBAAmB,EACnB,kBAAkB,EAClB,UAAU,EACX,MAAM,wBAAwB,CAAC;AAEhC,OAAO,EACL,kBAAkB,EACnB,MAAM,uBAAuB,CAAC"}

package/dist/reasoning/combinatorics/index.js

@@ -0,0 +1,44 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.inclusionExclusion = exports.binomialGF = exports.generatingFunction = exports.multiplyPolynomials = exports.cyclicRotations = exports.burnsideCount = exports.setPartitionsCount = exports.setPartitions = exports.eulerianNumber = exports.eulerNumber = exports.bellNumber = exports.catalan = exports.stirlingFirstKind = exports.stirlingSecondKind = exports.partitionsIntoParts = exports.partitionsCount = exports.partitions = exports.inversePermutation = exports.composePermutations = exports.permutationOrder = exports.permutationCycles = exports.permutationParity = exports.generateSubsetsOfSize = exports.generatePowerSet = exports.generateCombinations = exports.generatePermutations = exports.combinations = exports.permutations = exports.multinomial = exports.binomial = exports.factorial = void 0;
+var basic_counts_1 = require("./basic-counts");
+Object.defineProperty(exports, "factorial", { enumerable: true, get: function () { return basic_counts_1.factorial; } });
+Object.defineProperty(exports, "binomial", { enumerable: true, get: function () { return basic_counts_1.binomial; } });
+Object.defineProperty(exports, "multinomial", { enumerable: true, get: function () { return basic_counts_1.multinomial; } });
+Object.defineProperty(exports, "permutations", { enumerable: true, get: function () { return basic_counts_1.permutations; } });
+Object.defineProperty(exports, "combinations", { enumerable: true, get: function () { return basic_counts_1.combinations; } });
+var generators_1 = require("./generators");
+Object.defineProperty(exports, "generatePermutations", { enumerable: true, get: function () { return generators_1.generatePermutations; } });
+Object.defineProperty(exports, "generateCombinations", { enumerable: true, get: function () { return generators_1.generateCombinations; } });
+Object.defineProperty(exports, "generatePowerSet", { enumerable: true, get: function () { return generators_1.generatePowerSet; } });
+Object.defineProperty(exports, "generateSubsetsOfSize", { enumerable: true, get: function () { return generators_1.generateSubsetsOfSize; } });
+var permutations_1 = require("./permutations");
+Object.defineProperty(exports, "permutationParity", { enumerable: true, get: function () { return permutations_1.permutationParity; } });
+Object.defineProperty(exports, "permutationCycles", { enumerable: true, get: function () { return permutations_1.permutationCycles; } });
+Object.defineProperty(exports, "permutationOrder", { enumerable: true, get: function () { return permutations_1.permutationOrder; } });
+Object.defineProperty(exports, "composePermutations", { enumerable: true, get: function () { return permutations_1.composePermutations; } });
+Object.defineProperty(exports, "inversePermutation", { enumerable: true, get: function () { return permutations_1.inversePermutation; } });
+var partitions_1 = require("./partitions");
+Object.defineProperty(exports, "partitions", { enumerable: true, get: function () { return partitions_1.partitions; } });
+Object.defineProperty(exports, "partitionsCount", { enumerable: true, get: function () { return partitions_1.partitionsCount; } });
+Object.defineProperty(exports, "partitionsIntoParts", { enumerable: true, get: function () { return partitions_1.partitionsIntoParts; } });
+var special_numbers_1 = require("./special-numbers");
+Object.defineProperty(exports, "stirlingSecondKind", { enumerable: true, get: function () { return special_numbers_1.stirlingSecondKind; } });
+Object.defineProperty(exports, "stirlingFirstKind", { enumerable: true, get: function () { return special_numbers_1.stirlingFirstKind; } });
+Object.defineProperty(exports, "catalan", { enumerable: true, get: function () { return special_numbers_1.catalan; } });
+Object.defineProperty(exports, "bellNumber", { enumerable: true, get: function () { return special_numbers_1.bellNumber; } });
+Object.defineProperty(exports, "eulerNumber", { enumerable: true, get: function () { return special_numbers_1.eulerNumber; } });
+Object.defineProperty(exports, "eulerianNumber", { enumerable: true, get: function () { return special_numbers_1.eulerianNumber; } });
+var set_partitions_1 = require("./set-partitions");
+Object.defineProperty(exports, "setPartitions", { enumerable: true, get: function () { return set_partitions_1.setPartitions; } });
+Object.defineProperty(exports, "setPartitionsCount", { enumerable: true, get: function () { return set_partitions_1.setPartitionsCount; } });
+var burnside_1 = require("./burnside");
+Object.defineProperty(exports, "burnsideCount", { enumerable: true, get: function () { return burnside_1.burnsideCount; } });
+Object.defineProperty(exports, "cyclicRotations", { enumerable: true, get: function () { return burnside_1.cyclicRotations; } });
+var generating_functions_1 = require("./generating-functions");
+Object.defineProperty(exports, "multiplyPolynomials", { enumerable: true, get: function () { return generating_functions_1.multiplyPolynomials; } });
+Object.defineProperty(exports, "generatingFunction", { enumerable: true, get: function () { return generating_functions_1.generatingFunction; } });
+Object.defineProperty(exports, "binomialGF", { enumerable: true, get: function () { return generating_functions_1.binomialGF; } });
+var inclusion_exclusion_1 = require("./inclusion-exclusion");
+Object.defineProperty(exports, "inclusionExclusion", { enumerable: true, get: function () { return inclusion_exclusion_1.inclusionExclusion; } });
+//# sourceMappingURL=index.js.map

package/dist/reasoning/combinatorics/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/reasoning/combinatorics/index.ts"],"names":[],"mappings":";;;AAAA,+CAMwB;AALtB,yGAAA,SAAS,OAAA;AACT,wGAAA,QAAQ,OAAA;AACR,2GAAA,WAAW,OAAA;AACX,4GAAA,YAAY,OAAA;AACZ,4GAAA,YAAY,OAAA;AAGd,2CAKsB;AAJpB,kHAAA,oBAAoB,OAAA;AACpB,kHAAA,oBAAoB,OAAA;AACpB,8GAAA,gBAAgB,OAAA;AAChB,mHAAA,qBAAqB,OAAA;AAGvB,+CAMwB;AALtB,iHAAA,iBAAiB,OAAA;AACjB,iHAAA,iBAAiB,OAAA;AACjB,gHAAA,gBAAgB,OAAA;AAChB,mHAAA,mBAAmB,OAAA;AACnB,kHAAA,kBAAkB,OAAA;AAGpB,2CAIsB;AAHpB,wGAAA,UAAU,OAAA;AACV,6GAAA,eAAe,OAAA;AACf,iHAAA,mBAAmB,OAAA;AAGrB,qDAO2B;AANzB,qHAAA,kBAAkB,OAAA;AAClB,oHAAA,iBAAiB,OAAA;AACjB,0GAAA,OAAO,OAAA;AACP,6GAAA,UAAU,OAAA;AACV,8GAAA,WAAW,OAAA;AACX,iHAAA,cAAc,OAAA;AAGhB,mDAG0B;AAFxB,+GAAA,aAAa,OAAA;AACb,oHAAA,kBAAkB,OAAA;AAGpB,uCAGoB;AAFlB,yGAAA,aAAa,OAAA;AACb,2GAAA,eAAe,OAAA;AAGjB,+DAIgC;AAH9B,2HAAA,mBAAmB,OAAA;AACnB,0HAAA,kBAAkB,OAAA;AAClB,kHAAA,UAAU,OAAA;AAGZ,6DAE+B;AAD7B,yHAAA,kBAAkB,OAAA"}

package/dist/reasoning/combinatorics/partitions.d.ts

@@ -0,0 +1,4 @@
+export declare function partitions(n: number): number[][];
+export declare function partitionsCount(n: number): bigint;
+export declare function partitionsIntoParts(n: number, k: number): bigint;
+//# sourceMappingURL=partitions.d.ts.map

package/dist/reasoning/combinatorics/partitions.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"partitions.d.ts","sourceRoot":"","sources":["../../../src/reasoning/combinatorics/partitions.ts"],"names":[],"mappings":"AAEA,wBAAgB,UAAU,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE,EAAE,CAoBhD;AAID,wBAAgB,eAAe,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CA6BjD;AAED,wBAAgB,mBAAmB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAoBhE"}

package/dist/reasoning/combinatorics/partitions.js

@@ -0,0 +1,90 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.partitions = partitions;
+exports.partitionsCount = partitionsCount;
+exports.partitionsIntoParts = partitionsIntoParts;
+const bigint_helpers_1 = require("./bigint-helpers");
+function partitions(n) {
+    if (!Number.isInteger(n) || n < 0) {
+        throw new RangeError('partitions requiere entero no negativo');
+    }
+    if (n === 0)
+        return [[]];
+    const result = [];
+    function recurse(remaining, maxPart, current) {
+        if (remaining === 0) {
+            result.push(current.slice());
+            return;
+        }
+        const upper = Math.min(maxPart, remaining);
+        for (let i = upper; i >= 1; i--) {
+            current.push(i);
+            recurse(remaining - i, i, current);
+            current.pop();
+        }
+    }
+    recurse(n, n, []);
+    return result;
+}
+const PARTITION_COUNT_CACHE = [bigint_helpers_1.ONE];
+function partitionsCount(n) {
+    if (!Number.isInteger(n) || n < 0) {
+        throw new RangeError('partitionsCount requiere entero no negativo');
+    }
+    // Euler pentagonal number recurrence:
+    // p(n) = sum_{k!=0} (-1)^(k-1) [p(n - k(3k-1)/2) + p(n - k(3k+1)/2)]
+    for (let m = PARTITION_COUNT_CACHE.length; m <= n; m++) {
+        let total = bigint_helpers_1.ZERO;
+        for (let k = 1;; k++) {
+            const g1 = (k * (3 * k - 1)) / 2;
+            const g2 = (k * (3 * k + 1)) / 2;
+            if (g1 > m && g2 > m)
+                break;
+            const sign = k % 2 === 1 ? bigint_helpers_1.ONE : bigint_helpers_1.NEG_ONE;
+            if (g1 <= m) {
+                const v = PARTITION_COUNT_CACHE[m - g1];
+                if (v === undefined)
+                    throw new Error('partitionsCount cache miss');
+                total += sign * v;
+            }
+            if (g2 <= m) {
+                const v = PARTITION_COUNT_CACHE[m - g2];
+                if (v === undefined)
+                    throw new Error('partitionsCount cache miss');
+                total += sign * v;
+            }
+        }
+        PARTITION_COUNT_CACHE[m] = total;
+    }
+    const v = PARTITION_COUNT_CACHE[n];
+    if (v === undefined)
+        throw new Error('partitionsCount cache miss inesperado');
+    return v;
+}
+function partitionsIntoParts(n, k) {
+    if (!Number.isInteger(n) || !Number.isInteger(k) || n < 0 || k < 0) {
+        throw new RangeError('partitionsIntoParts requiere n,k enteros no negativos');
+    }
+    if (k === 0)
+        return n === 0 ? bigint_helpers_1.ONE : bigint_helpers_1.ZERO;
+    if (k > n)
+        return bigint_helpers_1.ZERO;
+    // p_k(n) = p_k(n-k) + p_{k-1}(n-1)
+    // memoization 2D
+    const memo = new Map();
+    function pk(nn, kk) {
+        if (kk === 0)
+            return nn === 0 ? bigint_helpers_1.ONE : bigint_helpers_1.ZERO;
+        if (nn <= 0 || kk > nn)
+            return bigint_helpers_1.ZERO;
+        const key = `${nn}|${kk}`;
+        const cached = memo.get(key);
+        if (cached !== undefined)
+            return cached;
+        const v = pk(nn - kk, kk) + pk(nn - 1, kk - 1);
+        memo.set(key, v);
+        return v;
+    }
+    return pk(n, k);
+}
+//# sourceMappingURL=partitions.js.map

package/dist/reasoning/combinatorics/partitions.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"partitions.js","sourceRoot":"","sources":["../../../src/reasoning/combinatorics/partitions.ts"],"names":[],"mappings":";;AAEA,gCAoBC;AAID,0CA6BC;AAED,kDAoBC;AA7ED,qDAAsD;AAEtD,SAAgB,UAAU,CAAC,CAAS;IAClC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QAClC,MAAM,IAAI,UAAU,CAAC,wCAAwC,CAAC,CAAC;IACjE,CAAC;IACD,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,EAAE,CAAC,CAAC;IACzB,MAAM,MAAM,GAAe,EAAE,CAAC;IAC9B,SAAS,OAAO,CAAC,SAAiB,EAAE,OAAe,EAAE,OAAiB;QACpE,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;YACpB,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC,CAAC;YAC7B,OAAO;QACT,CAAC;QACD,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;QAC3C,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAChC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAChB,OAAO,CAAC,SAAS,GAAG,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC;YACnC,OAAO,CAAC,GAAG,EAAE,CAAC;QAChB,CAAC;IACH,CAAC;IACD,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;IAClB,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,MAAM,qBAAqB,GAAa,CAAC,oBAAG,CAAC,CAAC;AAE9C,SAAgB,eAAe,CAAC,CAAS;IACvC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QAClC,MAAM,IAAI,UAAU,CAAC,6CAA6C,CAAC,CAAC;IACtE,CAAC;IACD,sCAAsC;IACtC,qEAAqE;IACrE,KAAK,IAAI,CAAC,GAAG,qBAAqB,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACvD,IAAI,KAAK,GAAG,qBAAI,CAAC;QACjB,KAAK,IAAI,CAAC,GAAG,CAAC,GAAI,CAAC,EAAE,EAAE,CAAC;YACtB,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACjC,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACjC,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC;gBAAE,MAAM;YAC5B,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,oBAAG,CAAC,CAAC,CAAC,wBAAO,CAAC;YACzC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC;gBACZ,MAAM,CAAC,GAAG,qBAAqB,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;gBACxC,IAAI,CAAC,KAAK,SAAS;oBAAE,MAAM,IAAI,KAAK,CAAC,4BAA4B,CAAC,CAAC;gBACnE,KAAK,IAAI,IAAI,GAAG,CAAC,CAAC;YACpB,CAAC;YACD,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC;gBACZ,MAAM,CAAC,GAAG,qBAAqB,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;gBACxC,IAAI,CAAC,KAAK,SAAS;oBAAE,MAAM,IAAI,KAAK,CAAC,4BAA4B,CAAC,CAAC;gBACnE,KAAK,IAAI,IAAI,GAAG,CAAC,CAAC;YACpB,CAAC;QACH,CAAC;QACD,qBAAqB,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;IACnC,CAAC;IACD,MAAM,CAAC,GAAG,qBAAqB,CAAC,CAAC,CAAC,CAAC;IACnC,IAAI,CAAC,KAAK,SAAS;QAAE,MAAM,IAAI,KAAK,CAAC,uCAAuC,CAAC,CAAC;IAC9E,OAAO,CAAC,CAAC;AACX,CAAC;AAED,SAAgB,mBAAmB,CAAC,CAAS,EAAE,CAAS;IACtD,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QACnE,MAAM,IAAI,UAAU,CAAC,uDAAuD,CAAC,CAAC;IAChF,CAAC;IACD,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,oBAAG,CAAC,CAAC,CAAC,qBAAI,CAAC;IACzC,IAAI,CAAC,GAAG,CAAC;QAAE,OAAO,qBAAI,CAAC;IACvB,mCAAmC;IACnC,iBAAiB;IACjB,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAC;IACvC,SAAS,EAAE,CAAC,EAAU,EAAE,EAAU;QAChC,IAAI,EAAE,KAAK,CAAC;YAAE,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,oBAAG,CAAC,CAAC,CAAC,qBAAI,CAAC;QAC3C,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,GAAG,EAAE;YAAE,OAAO,qBAAI,CAAC;QACpC,MAAM,GAAG,GAAG,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC;QAC1B,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC7B,IAAI,MAAM,KAAK,SAAS;YAAE,OAAO,MAAM,CAAC;QACxC,MAAM,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;QAC/C,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QACjB,OAAO,CAAC,CAAC;IACX,CAAC;IACD,OAAO,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAClB,CAAC"}

package/dist/reasoning/combinatorics/permutations.d.ts

@@ -0,0 +1,6 @@
+export declare function permutationParity(perm: number[]): 1 | -1;
+export declare function permutationCycles(perm: number[]): number[][];
+export declare function permutationOrder(perm: number[]): number;
+export declare function composePermutations(p: number[], q: number[]): number[];
+export declare function inversePermutation(perm: number[]): number[];
+//# sourceMappingURL=permutations.d.ts.map

package/dist/reasoning/combinatorics/permutations.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"permutations.d.ts","sourceRoot":"","sources":["../../../src/reasoning/combinatorics/permutations.ts"],"names":[],"mappings":"AAcA,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAqBxD;AAED,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,MAAM,EAAE,EAAE,CAqB5D;AAkBD,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,MAAM,CAOvD;AAED,wBAAgB,mBAAmB,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,EAAE,CAoBtE;AAED,wBAAgB,kBAAkB,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,MAAM,EAAE,CAY3D"}

package/dist/reasoning/combinatorics/permutations.js

@@ -0,0 +1,124 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.permutationParity = permutationParity;
+exports.permutationCycles = permutationCycles;
+exports.permutationOrder = permutationOrder;
+exports.composePermutations = composePermutations;
+exports.inversePermutation = inversePermutation;
+function assertValidPermutation(perm) {
+    const n = perm.length;
+    const seen = new Set();
+    for (const v of perm) {
+        if (!Number.isInteger(v) || v < 0 || v >= n) {
+            throw new RangeError(`permutación inválida: valor ${v} fuera de [0,${n})`);
+        }
+        if (seen.has(v)) {
+            throw new RangeError(`permutación inválida: valor repetido ${v}`);
+        }
+        seen.add(v);
+    }
+}
+function permutationParity(perm) {
+    assertValidPermutation(perm);
+    const n = perm.length;
+    const visited = new Array(n).fill(false);
+    let totalTranspositions = 0;
+    for (let i = 0; i < n; i++) {
+        if (visited[i])
+            continue;
+        let length = 0;
+        let j = i;
+        while (!visited[j]) {
+            visited[j] = true;
+            const next = perm[j];
+            if (next === undefined) {
+                throw new Error('permutationParity: índice inválido');
+            }
+            j = next;
+            length++;
+        }
+        totalTranspositions += length - 1;
+    }
+    return totalTranspositions % 2 === 0 ? 1 : -1;
+}
+function permutationCycles(perm) {
+    assertValidPermutation(perm);
+    const n = perm.length;
+    const visited = new Array(n).fill(false);
+    const cycles = [];
+    for (let i = 0; i < n; i++) {
+        if (visited[i])
+            continue;
+        const cycle = [];
+        let j = i;
+        while (!visited[j]) {
+            visited[j] = true;
+            cycle.push(j);
+            const next = perm[j];
+            if (next === undefined) {
+                throw new Error('permutationCycles: índice inválido');
+            }
+            j = next;
+        }
+        cycles.push(cycle);
+    }
+    return cycles;
+}
+function gcd(a, b) {
+    let x = Math.abs(a);
+    let y = Math.abs(b);
+    while (y !== 0) {
+        const t = y;
+        y = x % y;
+        x = t;
+    }
+    return x;
+}
+function lcm(a, b) {
+    if (a === 0 || b === 0)
+        return 0;
+    return Math.abs(a * b) / gcd(a, b);
+}
+function permutationOrder(perm) {
+    const cycles = permutationCycles(perm);
+    let order = 1;
+    for (const c of cycles) {
+        order = lcm(order, c.length);
+    }
+    return order;
+}
+function composePermutations(p, q) {
+    assertValidPermutation(p);
+    assertValidPermutation(q);
+    if (p.length !== q.length) {
+        throw new RangeError('composePermutations: longitudes diferentes');
+    }
+    const n = p.length;
+    const out = new Array(n);
+    for (let i = 0; i < n; i++) {
+        const qi = q[i];
+        if (qi === undefined) {
+            throw new Error('composePermutations: índice inválido en q');
+        }
+        const pqi = p[qi];
+        if (pqi === undefined) {
+            throw new Error('composePermutations: índice inválido en p');
+        }
+        out[i] = pqi;
+    }
+    return out;
+}
+function inversePermutation(perm) {
+    assertValidPermutation(perm);
+    const n = perm.length;
+    const inv = new Array(n);
+    for (let i = 0; i < n; i++) {
+        const pi = perm[i];
+        if (pi === undefined) {
+            throw new Error('inversePermutation: índice inválido');
+        }
+        inv[pi] = i;
+    }
+    return inv;
+}
+//# sourceMappingURL=permutations.js.map

package/dist/reasoning/combinatorics/permutations.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"permutations.js","sourceRoot":"","sources":["../../../src/reasoning/combinatorics/permutations.ts"],"names":[],"mappings":";;AAcA,8CAqBC;AAED,8CAqBC;AAkBD,4CAOC;AAED,kDAoBC;AAED,gDAYC;AAvHD,SAAS,sBAAsB,CAAC,IAAc;IAC5C,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;IACtB,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YAC5C,MAAM,IAAI,UAAU,CAAC,+BAA+B,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC7E,CAAC;QACD,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YAChB,MAAM,IAAI,UAAU,CAAC,wCAAwC,CAAC,EAAE,CAAC,CAAC;QACpE,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACd,CAAC;AACH,CAAC;AAED,SAAgB,iBAAiB,CAAC,IAAc;IAC9C,sBAAsB,CAAC,IAAI,CAAC,CAAC;IAC7B,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;IACtB,MAAM,OAAO,GAAG,IAAI,KAAK,CAAU,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAClD,IAAI,mBAAmB,GAAG,CAAC,CAAC;IAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,IAAI,OAAO,CAAC,CAAC,CAAC;YAAE,SAAS;QACzB,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;YACnB,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;YAClB,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACrB,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;gBACvB,MAAM,IAAI,KAAK,CAAC,oCAAoC,CAAC,CAAC;YACxD,CAAC;YACD,CAAC,GAAG,IAAI,CAAC;YACT,MAAM,EAAE,CAAC;QACX,CAAC;QACD,mBAAmB,IAAI,MAAM,GAAG,CAAC,CAAC;IACpC,CAAC;IACD,OAAO,mBAAmB,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAChD,CAAC;AAED,SAAgB,iBAAiB,CAAC,IAAc;IAC9C,sBAAsB,CAAC,IAAI,CAAC,CAAC;IAC7B,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;IACtB,MAAM,OAAO,GAAG,IAAI,KAAK,CAAU,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAClD,MAAM,MAAM,GAAe,EAAE,CAAC;IAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,IAAI,OAAO,CAAC,CAAC,CAAC;YAAE,SAAS;QACzB,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;YACnB,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;YAClB,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACd,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACrB,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;gBACvB,MAAM,IAAI,KAAK,CAAC,oCAAoC,CAAC,CAAC;YACxD,CAAC;YACD,CAAC,GAAG,IAAI,CAAC;QACX,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACrB,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAS,GAAG,CAAC,CAAS,EAAE,CAAS;IAC/B,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACpB,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACpB,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QACf,MAAM,CAAC,GAAG,CAAC,CAAC;QACZ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACV,CAAC,GAAG,CAAC,CAAC;IACR,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED,SAAS,GAAG,CAAC,CAAS,EAAE,CAAS;IAC/B,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACjC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACrC,CAAC;AAED,SAAgB,gBAAgB,CAAC,IAAc;IAC7C,MAAM,MAAM,GAAG,iBAAiB,CAAC,IAAI,CAAC,CAAC;IACvC,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,KAAK,GAAG,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;IAC/B,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAgB,mBAAmB,CAAC,CAAW,EAAE,CAAW;IAC1D,sBAAsB,CAAC,CAAC,CAAC,CAAC;IAC1B,sBAAsB,CAAC,CAAC,CAAC,CAAC;IAC1B,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC;QAC1B,MAAM,IAAI,UAAU,CAAC,4CAA4C,CAAC,CAAC;IACrE,CAAC;IACD,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;IACnB,MAAM,GAAG,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC;IACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAChB,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;YACrB,MAAM,IAAI,KAAK,CAAC,2CAA2C,CAAC,CAAC;QAC/D,CAAC;QACD,MAAM,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;QAClB,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;YACtB,MAAM,IAAI,KAAK,CAAC,2CAA2C,CAAC,CAAC;QAC/D,CAAC;QACD,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;IACf,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAgB,kBAAkB,CAAC,IAAc;IAC/C,sBAAsB,CAAC,IAAI,CAAC,CAAC;IAC7B,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;IACtB,MAAM,GAAG,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC;IACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACnB,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;YACrB,MAAM,IAAI,KAAK,CAAC,qCAAqC,CAAC,CAAC;QACzD,CAAC;QACD,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;IACd,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC"}

package/dist/reasoning/combinatorics/set-partitions.d.ts

@@ -0,0 +1,3 @@
+export declare function setPartitions<T>(items: T[]): T[][][];
+export declare function setPartitionsCount(n: number): bigint;
+//# sourceMappingURL=set-partitions.d.ts.map

package/dist/reasoning/combinatorics/set-partitions.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"set-partitions.d.ts","sourceRoot":"","sources":["../../../src/reasoning/combinatorics/set-partitions.ts"],"names":[],"mappings":"AAEA,wBAAgB,aAAa,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,CAiCpD;AAED,wBAAgB,kBAAkB,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAEpD"}

package/dist/reasoning/combinatorics/set-partitions.js

@@ -0,0 +1,46 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.setPartitions = setPartitions;
+exports.setPartitionsCount = setPartitionsCount;
+const special_numbers_1 = require("./special-numbers");
+function setPartitions(items) {
+    const n = items.length;
+    if (n === 0)
+        return [[]];
+    const result = [];
+    // restricted growth strings: a[i] indica el bloque de items[i].
+    const assignment = new Array(n).fill(0);
+    function recurse(i, maxUsed) {
+        if (i === n) {
+            const blocks = [];
+            for (let b = 0; b <= maxUsed; b++) {
+                blocks.push([]);
+            }
+            for (let idx = 0; idx < n; idx++) {
+                const bIdx = assignment[idx];
+                const item = items[idx];
+                if (bIdx === undefined)
+                    throw new Error('setPartitions: assignment inválido');
+                if (item === undefined && !(idx in items)) {
+                    throw new Error('setPartitions: ítem inválido');
+                }
+                const block = blocks[bIdx];
+                if (block === undefined)
+                    throw new Error('setPartitions: bloque inválido');
+                block.push(item);
+            }
+            result.push(blocks);
+            return;
+        }
+        for (let b = 0; b <= maxUsed + 1; b++) {
+            assignment[i] = b;
+            recurse(i + 1, Math.max(maxUsed, b));
+        }
+    }
+    recurse(0, -1);
+    return result;
+}
+function setPartitionsCount(n) {
+    return (0, special_numbers_1.bellNumber)(n);
+}
+//# sourceMappingURL=set-partitions.js.map

package/dist/reasoning/combinatorics/set-partitions.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"set-partitions.js","sourceRoot":"","sources":["../../../src/reasoning/combinatorics/set-partitions.ts"],"names":[],"mappings":";;AAEA,sCAiCC;AAED,gDAEC;AAvCD,uDAA+C;AAE/C,SAAgB,aAAa,CAAI,KAAU;IACzC,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;IACvB,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,EAAE,CAAC,CAAC;IACzB,MAAM,MAAM,GAAY,EAAE,CAAC;IAC3B,gEAAgE;IAChE,MAAM,UAAU,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAChD,SAAS,OAAO,CAAC,CAAS,EAAE,OAAe;QACzC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACZ,MAAM,MAAM,GAAU,EAAE,CAAC;YACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;gBAClC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAClB,CAAC;YACD,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC;gBACjC,MAAM,IAAI,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC;gBAC7B,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;gBACxB,IAAI,IAAI,KAAK,SAAS;oBAAE,MAAM,IAAI,KAAK,CAAC,oCAAoC,CAAC,CAAC;gBAC9E,IAAI,IAAI,KAAK,SAAS,IAAI,CAAC,CAAC,GAAG,IAAI,KAAK,CAAC,EAAE,CAAC;oBAC1C,MAAM,IAAI,KAAK,CAAC,8BAA8B,CAAC,CAAC;gBAClD,CAAC;gBACD,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;gBAC3B,IAAI,KAAK,KAAK,SAAS;oBAAE,MAAM,IAAI,KAAK,CAAC,gCAAgC,CAAC,CAAC;gBAC3E,KAAK,CAAC,IAAI,CAAC,IAAS,CAAC,CAAC;YACxB,CAAC;YACD,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACpB,OAAO;QACT,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,OAAO,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YAClB,OAAO,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC;QACvC,CAAC;IACH,CAAC;IACD,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACf,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAgB,kBAAkB,CAAC,CAAS;IAC1C,OAAO,IAAA,4BAAU,EAAC,CAAC,CAAC,CAAC;AACvB,CAAC"}

package/dist/reasoning/combinatorics/special-numbers.d.ts

@@ -0,0 +1,7 @@
+export declare function stirlingSecondKind(n: number, k: number): bigint;
+export declare function stirlingFirstKind(n: number, k: number): bigint;
+export declare function catalan(n: number): bigint;
+export declare function bellNumber(n: number): bigint;
+export declare function eulerNumber(n: number): bigint;
+export declare function eulerianNumber(n: number, k: number): bigint;
+//# sourceMappingURL=special-numbers.d.ts.map

package/dist/reasoning/combinatorics/special-numbers.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"special-numbers.d.ts","sourceRoot":"","sources":["../../../src/reasoning/combinatorics/special-numbers.ts"],"names":[],"mappings":"AAKA,wBAAgB,kBAAkB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAe/D;AAID,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAc9D;AAED,wBAAgB,OAAO,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAMzC;AAID,wBAAgB,UAAU,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAgB5C;AAkBD,wBAAgB,WAAW,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAuB7C;AAED,wBAAgB,cAAc,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAK3D"}

package/dist/reasoning/combinatorics/special-numbers.js

@@ -0,0 +1,128 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.stirlingSecondKind = stirlingSecondKind;
+exports.stirlingFirstKind = stirlingFirstKind;
+exports.catalan = catalan;
+exports.bellNumber = bellNumber;
+exports.eulerNumber = eulerNumber;
+exports.eulerianNumber = eulerianNumber;
+const basic_counts_1 = require("./basic-counts");
+const bigint_helpers_1 = require("./bigint-helpers");
+const STIRLING2_CACHE = new Map();
+function stirlingSecondKind(n, k) {
+    if (!Number.isInteger(n) || !Number.isInteger(k) || n < 0 || k < 0) {
+        throw new RangeError('stirlingSecondKind requiere enteros no negativos');
+    }
+    if (k === 0)
+        return n === 0 ? bigint_helpers_1.ONE : bigint_helpers_1.ZERO;
+    if (k > n)
+        return bigint_helpers_1.ZERO;
+    if (k === n)
+        return bigint_helpers_1.ONE;
+    if (k === 1)
+        return bigint_helpers_1.ONE;
+    const key = `${n}|${k}`;
+    const cached = STIRLING2_CACHE.get(key);
+    if (cached !== undefined)
+        return cached;
+    // S(n,k) = k*S(n-1,k) + S(n-1,k-1)
+    const v = BigInt(k) * stirlingSecondKind(n - 1, k) + stirlingSecondKind(n - 1, k - 1);
+    STIRLING2_CACHE.set(key, v);
+    return v;
+}
+const STIRLING1_CACHE = new Map();
+function stirlingFirstKind(n, k) {
+    if (!Number.isInteger(n) || !Number.isInteger(k) || n < 0 || k < 0) {
+        throw new RangeError('stirlingFirstKind requiere enteros no negativos');
+    }
+    if (k === 0)
+        return n === 0 ? bigint_helpers_1.ONE : bigint_helpers_1.ZERO;
+    if (k > n)
+        return bigint_helpers_1.ZERO;
+    if (k === n)
+        return bigint_helpers_1.ONE;
+    const key = `${n}|${k}`;
+    const cached = STIRLING1_CACHE.get(key);
+    if (cached !== undefined)
+        return cached;
+    // c(n,k) = c(n-1,k-1) + (n-1)*c(n-1,k)  (unsigned)
+    const v = stirlingFirstKind(n - 1, k - 1) + BigInt(n - 1) * stirlingFirstKind(n - 1, k);
+    STIRLING1_CACHE.set(key, v);
+    return v;
+}
+function catalan(n) {
+    if (!Number.isInteger(n) || n < 0) {
+        throw new RangeError('catalan requiere entero no negativo');
+    }
+    // C_n = C(2n,n) / (n+1)
+    return (0, basic_counts_1.binomial)(2 * n, n) / BigInt(n + 1);
+}
+const BELL_CACHE = [bigint_helpers_1.ONE];
+function bellNumber(n) {
+    if (!Number.isInteger(n) || n < 0) {
+        throw new RangeError('bellNumber requiere entero no negativo');
+    }
+    for (let m = BELL_CACHE.length; m <= n; m++) {
+        let total = bigint_helpers_1.ZERO;
+        for (let k = 0; k < m; k++) {
+            const bk = BELL_CACHE[k];
+            if (bk === undefined)
+                throw new Error('bellNumber cache miss');
+            total += (0, basic_counts_1.binomial)(m - 1, k) * bk;
+        }
+        BELL_CACHE[m] = total;
+    }
+    const v = BELL_CACHE[n];
+    if (v === undefined)
+        throw new Error('bellNumber cache miss');
+    return v;
+}
+const EULER_CACHE = new Map();
+function eulerianFirstOrder(n, k) {
+    if (k < 0 || k >= n)
+        return bigint_helpers_1.ZERO;
+    if (k === 0)
+        return bigint_helpers_1.ONE;
+    const key = `${n}|${k}`;
+    const cached = EULER_CACHE.get(key);
+    if (cached !== undefined)
+        return cached;
+    // <n,k> = (k+1) <n-1,k> + (n-k) <n-1,k-1>
+    const v = BigInt(k + 1) * eulerianFirstOrder(n - 1, k) + BigInt(n - k) * eulerianFirstOrder(n - 1, k - 1);
+    EULER_CACHE.set(key, v);
+    return v;
+}
+const ZIGZAG_CACHE = [bigint_helpers_1.ONE, bigint_helpers_1.ONE];
+function eulerNumber(n) {
+    if (!Number.isInteger(n) || n < 0) {
+        throw new RangeError('eulerNumber requiere entero no negativo');
+    }
+    // Número de permutaciones alternantes ("zigzag"): A(0)=1, A(1)=1,
+    // 2*A(n+1) = sum_{k=0..n} C(n,k) * A(k) * A(n-k).
+    for (let m = ZIGZAG_CACHE.length; m <= n; m++) {
+        const prev = m - 1;
+        let total = bigint_helpers_1.ZERO;
+        for (let k = 0; k <= prev; k++) {
+            const ak = ZIGZAG_CACHE[k];
+            const ank = ZIGZAG_CACHE[prev - k];
+            if (ak === undefined || ank === undefined)
+                throw new Error('eulerNumber cache miss');
+            total += (0, basic_counts_1.binomial)(prev, k) * ak * ank;
+        }
+        if (total % bigint_helpers_1.TWO !== bigint_helpers_1.ZERO) {
+            throw new Error('eulerNumber: total impar inesperado');
+        }
+        ZIGZAG_CACHE[m] = total / bigint_helpers_1.TWO;
+    }
+    const v = ZIGZAG_CACHE[n];
+    if (v === undefined)
+        throw new Error('eulerNumber cache miss');
+    return v;
+}
+function eulerianNumber(n, k) {
+    if (!Number.isInteger(n) || !Number.isInteger(k) || n < 0 || k < 0) {
+        throw new RangeError('eulerianNumber requiere enteros no negativos');
+    }
+    return eulerianFirstOrder(n, k);
+}
+//# sourceMappingURL=special-numbers.js.map

package/dist/reasoning/combinatorics/special-numbers.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"special-numbers.js","sourceRoot":"","sources":["../../../src/reasoning/combinatorics/special-numbers.ts"],"names":[],"mappings":";;AAKA,gDAeC;AAID,8CAcC;AAED,0BAMC;AAID,gCAgBC;AAkBD,kCAuBC;AAED,wCAKC;AAlHD,iDAA0C;AAC1C,qDAAkD;AAElD,MAAM,eAAe,GAAG,IAAI,GAAG,EAAkB,CAAC;AAElD,SAAgB,kBAAkB,CAAC,CAAS,EAAE,CAAS;IACrD,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QACnE,MAAM,IAAI,UAAU,CAAC,kDAAkD,CAAC,CAAC;IAC3E,CAAC;IACD,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,oBAAG,CAAC,CAAC,CAAC,qBAAI,CAAC;IACzC,IAAI,CAAC,GAAG,CAAC;QAAE,OAAO,qBAAI,CAAC;IACvB,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,oBAAG,CAAC;IACxB,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,oBAAG,CAAC;IACxB,MAAM,GAAG,GAAG,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;IACxB,MAAM,MAAM,GAAG,eAAe,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACxC,IAAI,MAAM,KAAK,SAAS;QAAE,OAAO,MAAM,CAAC;IACxC,mCAAmC;IACnC,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,kBAAkB,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,kBAAkB,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IACtF,eAAe,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IAC5B,OAAO,CAAC,CAAC;AACX,CAAC;AAED,MAAM,eAAe,GAAG,IAAI,GAAG,EAAkB,CAAC;AAElD,SAAgB,iBAAiB,CAAC,CAAS,EAAE,CAAS;IACpD,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QACnE,MAAM,IAAI,UAAU,CAAC,iDAAiD,CAAC,CAAC;IAC1E,CAAC;IACD,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,oBAAG,CAAC,CAAC,CAAC,qBAAI,CAAC;IACzC,IAAI,CAAC,GAAG,CAAC;QAAE,OAAO,qBAAI,CAAC;IACvB,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,oBAAG,CAAC;IACxB,MAAM,GAAG,GAAG,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;IACxB,MAAM,MAAM,GAAG,eAAe,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACxC,IAAI,MAAM,KAAK,SAAS;QAAE,OAAO,MAAM,CAAC;IACxC,mDAAmD;IACnD,MAAM,CAAC,GAAG,iBAAiB,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,iBAAiB,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IACxF,eAAe,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IAC5B,OAAO,CAAC,CAAC;AACX,CAAC;AAED,SAAgB,OAAO,CAAC,CAAS;IAC/B,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QAClC,MAAM,IAAI,UAAU,CAAC,qCAAqC,CAAC,CAAC;IAC9D,CAAC;IACD,wBAAwB;IACxB,OAAO,IAAA,uBAAQ,EAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;AAC5C,CAAC;AAED,MAAM,UAAU,GAAa,CAAC,oBAAG,CAAC,CAAC;AAEnC,SAAgB,UAAU,CAAC,CAAS;IAClC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QAClC,MAAM,IAAI,UAAU,CAAC,wCAAwC,CAAC,CAAC;IACjE,CAAC;IACD,KAAK,IAAI,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5C,IAAI,KAAK,GAAG,qBAAI,CAAC;QACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,EAAE,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;YACzB,IAAI,EAAE,KAAK,SAAS;gBAAE,MAAM,IAAI,KAAK,CAAC,uBAAuB,CAAC,CAAC;YAC/D,KAAK,IAAI,IAAA,uBAAQ,EAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC;QACnC,CAAC;QACD,UAAU,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;IACxB,CAAC;IACD,MAAM,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;IACxB,IAAI,CAAC,KAAK,SAAS;QAAE,MAAM,IAAI,KAAK,CAAC,uBAAuB,CAAC,CAAC;IAC9D,OAAO,CAAC,CAAC;AACX,CAAC;AAED,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;AAE9C,SAAS,kBAAkB,CAAC,CAAS,EAAE,CAAS;IAC9C,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;QAAE,OAAO,qBAAI,CAAC;IACjC,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,oBAAG,CAAC;IACxB,MAAM,GAAG,GAAG,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;IACxB,MAAM,MAAM,GAAG,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACpC,IAAI,MAAM,KAAK,SAAS;QAAE,OAAO,MAAM,CAAC;IACxC,0CAA0C;IAC1C,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,kBAAkB,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,kBAAkB,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IAC1G,WAAW,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IACxB,OAAO,CAAC,CAAC;AACX,CAAC;AAED,MAAM,YAAY,GAAa,CAAC,oBAAG,EAAE,oBAAG,CAAC,CAAC;AAE1C,SAAgB,WAAW,CAAC,CAAS;IACnC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QAClC,MAAM,IAAI,UAAU,CAAC,yCAAyC,CAAC,CAAC;IAClE,CAAC;IACD,kEAAkE;IAClE,kDAAkD;IAClD,KAAK,IAAI,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9C,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC;QACnB,IAAI,KAAK,GAAG,qBAAI,CAAC;QACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/B,MAAM,EAAE,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;YAC3B,MAAM,GAAG,GAAG,YAAY,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;YACnC,IAAI,EAAE,KAAK,SAAS,IAAI,GAAG,KAAK,SAAS;gBAAE,MAAM,IAAI,KAAK,CAAC,wBAAwB,CAAC,CAAC;YACrF,KAAK,IAAI,IAAA,uBAAQ,EAAC,IAAI,EAAE,CAAC,CAAC,GAAG,EAAE,GAAG,GAAG,CAAC;QACxC,CAAC;QACD,IAAI,KAAK,GAAG,oBAAG,KAAK,qBAAI,EAAE,CAAC;YACzB,MAAM,IAAI,KAAK,CAAC,qCAAqC,CAAC,CAAC;QACzD,CAAC;QACD,YAAY,CAAC,CAAC,CAAC,GAAG,KAAK,GAAG,oBAAG,CAAC;IAChC,CAAC;IACD,MAAM,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;IAC1B,IAAI,CAAC,KAAK,SAAS;QAAE,MAAM,IAAI,KAAK,CAAC,wBAAwB,CAAC,CAAC;IAC/D,OAAO,CAAC,CAAC;AACX,CAAC;AAED,SAAgB,cAAc,CAAC,CAAS,EAAE,CAAS;IACjD,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QACnE,MAAM,IAAI,UAAU,CAAC,8CAA8C,CAAC,CAAC;IACvE,CAAC;IACD,OAAO,kBAAkB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAClC,CAAC"}

package/dist/reasoning/constructive-analysis/cauchy.d.ts

@@ -0,0 +1,51 @@
+/**
+ * Constructive Cauchy sequences with explicit modulus of convergence.
+ *
+ * In Bishop's school, a "Cauchy sequence" without a modulus is not enough
+ * data to extract a limit constructively — one needs an explicit
+ * `modulus(eps)` returning an index N(eps) such that
+ *   for all m, n >= N(eps), |x_m - x_n| < eps.
+ */
+import { type CReal } from '../constructive-reals';
+export interface ConstructiveCauchySeq {
+    /** n-th term of the sequence (n >= 0). */
+    approx: (n: number) => CReal;
+    /**
+     * Modulus of convergence: returns N such that for all m, n >= N,
+     * |x_m - x_n| < 1/epsPrecision. `epsPrecision` is a positive integer
+     * (we work with rational 1/k thresholds to stay constructive).
+     */
+    modulus: (epsPrecision: number) => number;
+}
+/**
+ * Sound (one-sided) check: returns true if the modulus genuinely
+ * witnesses Cauchy-ness at precision `eps` for the first few terms.
+ *
+ * Constructively we cannot inspect "all m, n >= N" — we sample a window
+ * and verify the bound holds. If the modulus is correct this will
+ * return true; if it is a counterexample for some sampled pair, false.
+ *
+ * `sampleWindow` controls how many terms past N we inspect. Default 8
+ * is enough to expose almost all wrong moduli.
+ */
+export declare const isCauchy: (seq: ConstructiveCauchySeq, epsPrecision: number, sampleWindow?: number) => boolean;
+/**
+ * Limit of a Cauchy sequence with modulus.
+ *
+ * `bits` (the CReal precision argument) is the number of binary fractional
+ * bits required. We need |limit - approx| < 2^{-bits}.
+ *
+ * Strategy: find index N such that the N-th term x_N is within 2^{-(bits+1)}
+ * of the true limit. By the triangle inequality, evaluating x_N at (bits+1)
+ * binary bits gives a result within 2^{-bits} of the limit.
+ *
+ * The modulus(eps) guarantees |x_m - x_n| < 1/eps for m,n >= N(eps).
+ * We need 1/eps <= 2^{-(bits+1)}, so eps >= 2^{bits+1}.
+ */
+export declare const limit: (seq: ConstructiveCauchySeq) => CReal;
+/**
+ * Convenience: builds a Cauchy seq from a generator + a known rate `1/f(eps)`.
+ * `f(eps)` must return an integer N with |x_m - x_n| < 1/eps for m, n >= N.
+ */
+export declare const cauchyFrom: (term: (n: number) => CReal, modulus: (eps: number) => number) => ConstructiveCauchySeq;
+//# sourceMappingURL=cauchy.d.ts.map

package/dist/reasoning/constructive-analysis/cauchy.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"cauchy.d.ts","sourceRoot":"","sources":["../../../src/reasoning/constructive-analysis/cauchy.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,EAAE,KAAK,KAAK,EAAiC,MAAM,uBAAuB,CAAC;AAElF,MAAM,WAAW,qBAAqB;IACpC,0CAA0C;IAC1C,MAAM,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,KAAK,CAAC;IAC7B;;;;OAIG;IACH,OAAO,EAAE,CAAC,YAAY,EAAE,MAAM,KAAK,MAAM,CAAC;CAC3C;AAED;;;;;;;;;;GAUG;AACH,eAAO,MAAM,QAAQ,GACnB,KAAK,qBAAqB,EAC1B,cAAc,MAAM,EACpB,qBAAgB,KACf,OAiBF,CAAC;AAEF;;;;;;;;;;;;GAYG;AACH,eAAO,MAAM,KAAK,GAAI,KAAK,qBAAqB,KAAG,KASjD,CAAC;AAEH;;;GAGG;AACH,eAAO,MAAM,UAAU,GACrB,MAAM,CAAC,CAAC,EAAE,MAAM,KAAK,KAAK,EAC1B,SAAS,CAAC,GAAG,EAAE,MAAM,KAAK,MAAM,KAC/B,qBAGD,CAAC"}