HALOWERKDatenvertragswerk
sandpile recurrent configuration inventory
From an original loopless undirected multigraph with1..3nonsink vertices and sink at index n, symmetric edge multiplicities0..2 and every vertex connected to sink, enumerate ALL recurrent stable chip configurations in lexicographic order. Return each chipvector and lexicographically first valid Dhar burning order, reduced Laplacian, weighted spanning-tree/recurrent count, stable/transient counts and degrees. Equal count is checked only as claim; whole family/witnesses delivered. There is no.
POST https://datenvertrag.halowerk.com/v1/sandpile-recurrent-configuration-inventoryEingaben
| Feld | Typ | Pflicht | Beschreibung |
|---|---|---|---|
| nonsink | integer | Ja | |
| adjacency | Siehe Schema | Ja | |
| claimed_recurrent_count | Siehe Schema | Ja |
Vollständiges Eingabeschema anzeigen
{
"type": "object",
"additionalProperties": false,
"required": [
"nonsink",
"adjacency",
"claimed_recurrent_count"
],
"properties": {
"nonsink": {
"type": "integer",
"minimum": 1,
"maximum": 3
},
"adjacency": {
"anyOf": [
{
"type": "array",
"maxItems": 4,
"items": {
"type": "array",
"maxItems": 4,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
}
}
},
{
"type": "null"
}
]
},
"claimed_recurrent_count": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 256
},
{
"type": "null"
}
]
}
}
}Veröffentlichtes Eingabebeispiel
{
"nonsink": 3,
"adjacency": [
[
0,
1,
1,
1
],
[
1,
0,
1,
1
],
[
1,
1,
0,
1
],
[
1,
1,
1,
0
]
],
"claimed_recurrent_count": 16
}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