HALOWERKDatenvertragswerk
integer marginal table family
Given1..3 labelled row totals and1..3 labelled column totals, each nonnegative integer vector with sum at most6, construct EVERY nonnegative integer matrix with exactly those margins. Return entire matrix family in ascending row-major lexicographic order, count, feasibility and both original totals. Row/column labels and zero-total rows/columns remain in their supplied order; do not quotient by permutations. Unequal grand totals are well-formed known-empty families. A zero grand total has.
POST https://datenvertrag.halowerk.com/v1/integer-marginal-table-familyEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| row_sums | Siehe Schema | Ja | |
| column_sums | Siehe Schema | Ja | |
| claimed_tables | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"additionalProperties": false,
"required": [
"row_sums",
"column_sums",
"claimed_tables"
],
"properties": {
"row_sums": {
"anyOf": [
{
"type": "array",
"maxItems": 3,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 6
},
"minItems": 1
},
{
"type": "null"
}
]
},
"column_sums": {
"anyOf": [
{
"type": "array",
"maxItems": 3,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 6
},
"minItems": 1
},
{
"type": "null"
}
]
},
"claimed_tables": {
"anyOf": [
{
"type": "array",
"maxItems": 32,
"items": {
"type": "array",
"maxItems": 3,
"items": {
"type": "array",
"maxItems": 3,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 6
}
}
}
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"row_sums": [
1,
1
],
"column_sums": [
1,
1
],
"claimed_tables": [
[
[
0,
1
],
[
1,
0
]
],
[
[
1,
0
],
[
0,
1
]
]
]
}Ergebnis & Dokumentation
Maschinenlesbare Dokumentation dieses Hubs
Quelle dieser Seite: der veröffentlichte HALOWERK-Katalog. Stand: 2026-11-07, 02:42 UTC.
Weitere Endpunkte dieses Hubs
- Datenvertragswerk0,003 USDC
adjacency cospectral graph family
POSThttps://datenvertrag.halowerk.com/v1/adjacency-cospectral-graph-familyGiven n1..5 and a monic degree-n integer polynomial det(xI-A), return EVERY labelled simple undirected graph on vertices0..n-1 having exactly that adjacency characteristic polynomial over integers. Coefficients are descending degree order,
- 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.
- Datenvertragswerk0,003 USDC
aligned record cut audit
POSThttps://datenvertrag.halowerk.com/v1/aligned-record-cut-auditA stream-runtime fixture maintainer checks which record IDs belong to a supplied aligned checkpoint cut and which same-channel post-barrier records must stay buffered until all input barriers arrive. One aligned local checkpoint;record iden