HALOWERKDatenvertragswerk
insertion tableau permutation fiber
Given one original English-convention standard insertion tableau P with0..7cells labelled1..n exactlyonce, return ALL permutations of1..n whose CLASSICAL row-insertion tableau is exactlyP. Rows/columnsstrictlyincrease; rowlengths formpartition. Family sorts by numeric lexicographic word; each member carries its full corresponding standard recordingtableau Q. Count every distinct sourcepermutation; Q is generated, not supplied. EmptyP has oneemptyword andemptyQ. Whole orderedwordfamily claim.
POST https://datenvertrag.halowerk.com/v1/insertion-tableau-permutation-fiberEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| tableau | Siehe Schema | Ja | |
| claimed_words | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"additionalProperties": false,
"required": [
"tableau",
"claimed_words"
],
"properties": {
"tableau": {
"anyOf": [
{
"type": "array",
"maxItems": 7,
"items": {
"type": "array",
"maxItems": 7,
"items": {
"type": "integer",
"minimum": 1,
"maximum": 7
},
"minItems": 1
}
},
{
"type": "null"
}
]
},
"claimed_words": {
"anyOf": [
{
"type": "array",
"maxItems": 40,
"items": {
"type": "array",
"maxItems": 7,
"items": {
"type": "integer",
"minimum": 1,
"maximum": 7
}
}
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"tableau": [
[
1,
2
],
[
3
]
],
"claimed_words": [
[
1,
3,
2
],
[
3,
1,
2
]
]
}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