HALOWERKDatenvertragswerk
sandpile group addition table ledger
For an original connected simple undirected labelled graph with0..3nonsink vertices0..n-1 and sink=n, reconstruct its whole finite recurrent sandpile GROUP. Return every recurrent stable chipvector in numeric lexicographic order as indexed elements, ALL indexed pair additions after stabilization, identity index and inverse index for every element. Sink never topples; its incident edges count toward nonsinkdegree. Elements have0<=chips<degree; identity need not be zero. Empty-nonsink graph.
POST https://datenvertrag.halowerk.com/v1/sandpile-group-addition-table-ledgerEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| graph | Siehe Schema | Ja | |
| claimed_group | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"additionalProperties": false,
"required": [
"graph",
"claimed_group"
],
"properties": {
"graph": {
"anyOf": [
{
"type": "object",
"additionalProperties": false,
"required": [
"n",
"edges"
],
"properties": {
"n": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"edges": {
"type": "array",
"maxItems": 6,
"items": {
"type": "array",
"maxItems": 2,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"minItems": 2
}
}
}
},
{
"type": "null"
}
]
},
"claimed_group": {
"anyOf": [
{
"type": "object",
"additionalProperties": false,
"required": [
"elements",
"addition",
"identity",
"inverse"
],
"properties": {
"elements": {
"type": "array",
"maxItems": 16,
"items": {
"type": "array",
"maxItems": 3,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
}
}
},
"addition": {
"type": "array",
"maxItems": 16,
"items": {
"type": "array",
"maxItems": 16,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 15
}
}
},
"identity": {
"type": "integer",
"minimum": 0,
"maximum": 15
},
"inverse": {
"type": "array",
"maxItems": 16,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 15
}
}
}
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"graph": {
"n": 2,
"edges": [
[
0,
1
],
[
0,
2
],
[
1,
2
]
]
},
"claimed_group": {
"elements": [
[
0,
1
],
[
1,
0
],
[
1,
1
]
],
"addition": [
[
1,
2,
0
],
[
2,
0,
1
],
[
0,
1,
2
]
],
"identity": 2,
"inverse": [
1,
0,
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