HALOWERKDatenvertragswerk
stirling permutation index ledger
For original order n0..6, each label1..n occurs exactlytwice and EVERY value between equalcopies i must exceed i. Rank supplied whole word in numericlexicographic order among ONLY these Stirling permutations and independently decode supplied zero-based index. Return total, rank, full decodedword and perletter skipped-prefix completioncounts/chosenbranch completioncounts for BOTH queries. Inputword and decodeindex need not correspond. Emptyorder has oneemptyword/index0/emptytraces. At n2.
POST https://datenvertrag.halowerk.com/v1/stirling-permutation-index-ledgerEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| order | integer | Ja | |
| word | Siehe Schema | Ja | |
| index | Siehe Schema | Ja | |
| claimed_rank | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"additionalProperties": false,
"required": [
"order",
"word",
"index",
"claimed_rank"
],
"properties": {
"order": {
"type": "integer",
"minimum": 0,
"maximum": 6
},
"word": {
"anyOf": [
{
"type": "array",
"maxItems": 12,
"items": {
"type": "integer",
"minimum": 1,
"maximum": 6
}
},
{
"type": "null"
}
]
},
"index": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 10394
},
{
"type": "null"
}
]
},
"claimed_rank": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 10394
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"order": 2,
"word": [
2,
2,
1,
1
],
"index": 0,
"claimed_rank": 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