Datenvertragswerk
finite sheaf derived pushforward
Constructs a full finite-poset model of the right-derived sheaf direct image Rf_*F over F2 for an order-preserving vertex_map f from poset P (1..4 labels) to poset Q (1..3 labels), where every P-stalk is exactly F2. Returns natural cochain restriction maps, all higher-image stalks and maps, and the comparison to strict-fiber cohomology with kernel/cokernel witnesses. With principal open U_q={r:q<=r}, each q uses U=f^-1(U_q), not merely the strict fiber f^-1({q}).
POST https://datenvertrag.halowerk.com/v1/finite-sheaf-derived-pushforwardInputs
| Field | Type | Required | Description |
|---|---|---|---|
| p_order_rows | See schema | Yes | |
| q_order_rows | See schema | Yes | |
| vertex_map | See schema | Yes | |
| sheaf_rows | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"p_order_rows": {
"anyOf": [
{
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 15
},
"minItems": 1,
"maxItems": 4
},
{
"type": "null"
}
]
},
"q_order_rows": {
"anyOf": [
{
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 7
},
"minItems": 1,
"maxItems": 3
},
{
"type": "null"
}
]
},
"vertex_map": {
"anyOf": [
{
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 2
},
"minItems": 1,
"maxItems": 4
},
{
"type": "null"
}
]
},
"sheaf_rows": {
"anyOf": [
{
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 15
},
"minItems": 1,
"maxItems": 4
},
{
"type": "null"
}
]
}
},
"required": [
"p_order_rows",
"q_order_rows",
"vertex_map",
"sheaf_rows"
],
"additionalProperties": false
}Published input example
{
"p_order_rows": [
3,
2
],
"q_order_rows": [
3,
2
],
"vertex_map": [
0,
1
],
"sheaf_rows": [
1,
2
]
}Result & documentation
Machine-readable documentation of this hub
Source of this page: the published HALOWERK catalog. Updated: 2026-11-17 UTC.
More endpoints in this hub
- Datenvertragswerk0.003 USDC
acyclic automata probabilistic refinement witness
POSThttps://datenvertrag.halowerk.com/v1/acyclic-automata-probabilistic-refinement-witnessFor two finite action-labelled nondeterministic probabilistic automata return the WHOLE greatest DIRECTED STRONG SIMULATION relation, canonical single-transition matching couplings and exhaustive local negative Hall obstructions. Each of 1.
- Datenvertragswerk0.003 USDC
adjacency cospectral graph family
POSThttps://datenvertrag.halowerk.com/v1/adjacency-cospectral-graph-familyGiven n in 1..5 and a monic degree-n integer polynomial det(xI-A), returns every labelled simple undirected graph on vertices 0..n-1 with exactly that adjacency characteristic polynomial. Coefficients are in descending degree order, n+1 ent
- 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.