Datenvertragswerk
oriented matroid circuit signatures
For a fully supplied ordered rational point configuration in affine dimension1or2 with0..5points,return EVERY minimally supported affine dependency (Radon circuit),not just one linear dependence or unsigned matroid circuit list. Homogenize by adding a row of ones. Coordinates are exact rational objects{n,d},n=-6..6,d=1..6; unreduced fractions accepted. Validate each point has exactly dimension coordinates and every denominator is positive; schema-admitted zero denominators or wrong widths.
POST https://datenvertrag.halowerk.com/v1/oriented-matroid-circuit-signaturesInputs
| Field | Type | Required | Description |
|---|---|---|---|
| dimension | integer | Yes | |
| points | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"dimension": {
"type": "integer",
"minimum": 1,
"maximum": 2
},
"points": {
"anyOf": [
{
"type": "array",
"maxItems": 5,
"items": {
"type": "array",
"minItems": 1,
"maxItems": 2,
"items": {
"type": "object",
"properties": {
"n": {
"type": "integer",
"minimum": -6,
"maximum": 6
},
"d": {
"type": "integer",
"minimum": 0,
"maximum": 6
}
},
"required": [
"n",
"d"
],
"additionalProperties": false
}
}
},
{
"type": "null"
}
]
}
},
"required": [
"dimension",
"points"
],
"additionalProperties": false
}Published input example
{
"dimension": 1,
"points": [
[
{
"n": 0,
"d": 1
}
],
[
{
"n": 1,
"d": 1
}
],
[
{
"n": 2,
"d": 1
}
]
]
}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.