Datenvertragswerk
finite category equalizer cones
For one fully specified finite category and a parallel pair f,g:A->B, return ALL universal equalizing cones e:E->A, sorted by original arrow index. For each equalizer return its domain object and a complete mediation table: for EVERY equalizing arrow h:X->A, identify the unique u:X->E with e after u=h. Return all equalizing arrow indices and whether any equalizer exists. The empty universal family is a complete known result, even if equalizing cones exist but lack unique mediation. Multiple.
POST https://datenvertrag.halowerk.com/v1/finite-category-equalizer-conesInputs
| Field | Type | Required | Description |
|---|---|---|---|
| category | See schema | Yes | |
| pair | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"category": {
"anyOf": [
{
"type": "object",
"properties": {
"objects": {
"type": "integer",
"minimum": 1,
"maximum": 4
},
"arrows": {
"type": "array",
"items": {
"type": "object",
"properties": {
"source": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"target": {
"type": "integer",
"minimum": 0,
"maximum": 3
}
},
"required": [
"source",
"target"
],
"additionalProperties": false
},
"minItems": 1,
"maxItems": 12
},
"identities": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 11
},
"minItems": 1,
"maxItems": 4
},
"compose": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": -1,
"maximum": 11
},
"minItems": 1,
"maxItems": 12
},
"minItems": 1,
"maxItems": 12
}
},
"required": [
"objects",
"arrows",
"identities",
"compose"
],
"additionalProperties": false
},
{
"type": "null"
}
]
},
"pair": {
"anyOf": [
{
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 11
},
"minItems": 2,
"maxItems": 2
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "array",
"items": {
"type": "object",
"properties": {
"arrow": {
"type": "integer",
"minimum": 0,
"maximum": 11
},
"object": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"mediations": {
"type": "array",
"items": {
"type": "object",
"properties": {
"cone": {
"type": "integer",
"minimum": 0,
"maximum": 11
},
"u": {
"type": "integer",
"minimum": 0,
"maximum": 11
}
},
"required": [
"cone",
"u"
],
"additionalProperties": false
},
"minItems": 0,
"maxItems": 12
}
},
"required": [
"arrow",
"object",
"mediations"
],
"additionalProperties": false
},
"minItems": 0,
"maxItems": 12
},
{
"type": "null"
}
]
}
},
"required": [
"category",
"pair",
"claim"
],
"additionalProperties": false
}Published input example
{
"category": {
"objects": 3,
"arrows": [
{
"source": 0,
"target": 0
},
{
"source": 1,
"target": 1
},
{
"source": 2,
"target": 2
},
{
"source": 0,
"target": 1
},
{
"source": 0,
"target": 1
},
{
"source": 2,
"target": 0
},
{
"source": 2,
"target": 1
}
],
"identities": [
0,
1,
2
],
"compose": [
[
0,
-1,
-1,
-1,
-1,
5,
-1
],
[
-1,
1,
-1,
3,
4,
-1,
6
],
[
-1,
-1,
2,
-1,
-1,
-1,
-1
],
[
3,
-1,
-1,
-1,
-1,
6,
-1
],
[
4,
-1,
-1,
-1,
-1,
6,
-1
],
[
-1,
-1,
5,
-1,
-1,
-1,
-1
],
[
-1,
-1,
6,
-1,
-1,
-1,
-1
]
]
},
"pair": [
3,
4
],
"claim": [
{
"arrow": 5,
"object": 2,
"mediations": [
{
"cone": 5,
"u": 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.