Datenvertragswerk
rational multivariate residue local algebra
For the ordered rational complete intersection f=x^a, g=y^b+x*h(y), construct its ENTIRE origin local algebra residue-duality artifact: fixed monomial basis, both multiplication matrices, normalized residue functional on every basis monomial, full symmetric multiplication-pairing matrix, complete dual-basis coefficient columns, Jacobian class and its residue. a,b1..3; h has b reduced rational coefficients with numerator-2..2 and denominator1..3. Dimension exactly a*b<=9. Basis x^i*y^j.
POST https://datenvertrag.halowerk.com/v1/rational-multivariate-residue-local-algebraInputs
| Field | Type | Required | Description |
|---|---|---|---|
| a | See schema | Yes | |
| b | See schema | Yes | |
| h | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"$schema": "http://json-schema.org/draft-07/schema#",
"type": "object",
"additionalProperties": false,
"required": [
"a",
"b",
"h",
"claim"
],
"properties": {
"a": {
"anyOf": [
{
"type": "integer",
"minimum": 1,
"maximum": 3
},
{
"type": "null"
}
]
},
"b": {
"anyOf": [
{
"type": "integer",
"minimum": 1,
"maximum": 3
},
{
"type": "null"
}
]
},
"h": {
"anyOf": [
{
"type": "array",
"minItems": 1,
"maxItems": 3,
"items": {
"type": "object",
"additionalProperties": false,
"required": [
"numerator",
"denominator"
],
"properties": {
"numerator": {
"type": "integer",
"minimum": -2,
"maximum": 2
},
"denominator": {
"type": "integer",
"minimum": 1,
"maximum": 3
}
}
}
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"additionalProperties": false,
"required": [
"dimension",
"basis_exponents",
"multiplication_x",
"multiplication_y",
"residue_on_basis",
"pairing",
"dual_basis_columns",
"jacobian_class",
"residue_jacobian",
"nondegenerate"
],
"properties": {
"dimension": {
"type": "integer",
"minimum": 1,
"maximum": 9
},
"basis_exponents": {
"type": "array",
"minItems": 1,
"maxItems": 9,
"items": {
"type": "array",
"minItems": 2,
"maxItems": 2,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
}
}
},
"multiplication_x": {
"type": "array",
"minItems": 1,
"maxItems": 9,
"items": {
"type": "array",
"minItems": 1,
"maxItems": 9,
"items": {
"type": "object",
"additionalProperties": false,
"required": [
"numerator",
"denominator"
],
"properties": {
"numerator": {
"type": "string",
"maxLength": 5,
"pattern": "^(0|-?[1-9][0-9]*)$"
},
"denominator": {
"type": "string",
"maxLength": 2,
"pattern": "^[1-9][0-9]*$"
}
}
}
}
},
"multiplication_y": {
"type": "array",
"minItems": 1,
"maxItems": 9,
"items": {
"type": "array",
"minItems": 1,
"maxItems": 9,
"items": {
"type": "object",
"additionalProperties": false,
"required": [
"numerator",
"denominator"
],
"properties": {
"numerator": {
"type": "string",
"maxLength": 5,
"pattern": "^(0|-?[1-9][0-9]*)$"
},
"denominator": {
"type": "string",
"maxLength": 2,
"pattern": "^[1-9][0-9]*$"
}
}
}
}
},
"residue_on_basis": {
"type": "array",
"minItems": 1,
"maxItems": 9,
"items": {
"type": "object",
"additionalProperties": false,
"required": [
"numerator",
"denominator"
],
"properties": {
"numerator": {
"type": "string",
"maxLength": 5,
"pattern": "^(0|-?[1-9][0-9]*)$"
},
"denominator": {
"type": "string",
"maxLength": 2,
"pattern": "^[1-9][0-9]*$"
}
}
}
},
"pairing": {
"type": "array",
"minItems": 1,
"maxItems": 9,
"items": {
"type": "array",
"minItems": 1,
"maxItems": 9,
"items": {
"type": "object",
"additionalProperties": false,
"required": [
"numerator",
"denominator"
],
"properties": {
"numerator": {
"type": "string",
"maxLength": 5,
"pattern": "^(0|-?[1-9][0-9]*)$"
},
"denominator": {
"type": "string",
"maxLength": 2,
"pattern": "^[1-9][0-9]*$"
}
}
}
}
},
"dual_basis_columns": {
"type": "array",
"minItems": 1,
"maxItems": 9,
"items": {
"type": "array",
"minItems": 1,
"maxItems": 9,
"items": {
"type": "object",
"additionalProperties": false,
"required": [
"numerator",
"denominator"
],
"properties": {
"numerator": {
"type": "string",
"maxLength": 5,
"pattern": "^(0|-?[1-9][0-9]*)$"
},
"denominator": {
"type": "string",
"maxLength": 2,
"pattern": "^[1-9][0-9]*$"
}
}
}
}
},
"jacobian_class": {
"type": "array",
"minItems": 1,
"maxItems": 9,
"items": {
"type": "object",
"additionalProperties": false,
"required": [
"numerator",
"denominator"
],
"properties": {
"numerator": {
"type": "string",
"maxLength": 5,
"pattern": "^(0|-?[1-9][0-9]*)$"
},
"denominator": {
"type": "string",
"maxLength": 2,
"pattern": "^[1-9][0-9]*$"
}
}
}
},
"residue_jacobian": {
"type": "object",
"additionalProperties": false,
"required": [
"numerator",
"denominator"
],
"properties": {
"numerator": {
"type": "string",
"maxLength": 5,
"pattern": "^(0|-?[1-9][0-9]*)$"
},
"denominator": {
"type": "string",
"maxLength": 2,
"pattern": "^[1-9][0-9]*$"
}
}
},
"nondegenerate": {
"const": true
}
}
},
{
"type": "null"
}
]
}
}
}Published input example
{
"a": 2,
"b": 2,
"h": [
{
"numerator": 0,
"denominator": 1
},
{
"numerator": 0,
"denominator": 1
}
],
"claim": null
}Result & documentation
Machine-readable documentation of this hub
Source of this page: the published HALOWERK catalog. Updated: 2026-11-17 UTC.
More endpoints in this hub
- Datenvertragswerk0.003 USDC
acyclic automata probabilistic refinement witness
POSThttps://datenvertrag.halowerk.com/v1/acyclic-automata-probabilistic-refinement-witnessFor two finite action-labelled nondeterministic probabilistic automata return the WHOLE greatest DIRECTED STRONG SIMULATION relation, canonical single-transition matching couplings and exhaustive local negative Hall obstructions. Each of 1.
- Datenvertragswerk0.003 USDC
adjacency cospectral graph family
POSThttps://datenvertrag.halowerk.com/v1/adjacency-cospectral-graph-familyGiven n in 1..5 and a monic degree-n integer polynomial det(xI-A), returns every labelled simple undirected graph on vertices 0..n-1 with exactly that adjacency characteristic polynomial. Coefficients are in descending degree order, n+1 ent
- Datenvertragswerk0.003 USDC
adjacent swap permutation tour
POSThttps://datenvertrag.halowerk.com/v1/adjacent-swap-permutation-tourFor 0 to 5 labels starting at zero, construct the whole Steinhaus-Johnson-Trotter permutation tour from identity. Each transition swaps the largest mobile value with its adjacent smaller neighbor, then reverses directions of greater values.