Datenvertragswerk
stable matching rotation lattice
Given complete strict left and right preference permutations on the same 1..4 participants, enumerate every stable perfect matching lexicographically, the left-dominance Hasse covers and distinct cover rotations as ordered [left,old_right,new_right] triples. Covers point from left-preferred to right-preferred matching; rotation IDs follow first cover discovery in lexicographic matching-index order. Return both extremal matching indices and first lexicographic blocking pair for every rejected.
POST https://datenvertrag.halowerk.com/v1/stable-matching-rotation-latticeInputs
| Field | Type | Required | Description |
|---|---|---|---|
| preferences | See schema | Yes | |
| claim_count | See schema | Yes |
Show full input schema
{
"type": "object",
"properties": {
"preferences": {
"anyOf": [
{
"type": "object",
"properties": {
"left": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"minItems": 1,
"maxItems": 4
},
"minItems": 1,
"maxItems": 4
},
"right": {
"type": "array",
"items": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
},
"minItems": 1,
"maxItems": 4
},
"minItems": 1,
"maxItems": 4
}
},
"required": [
"left",
"right"
],
"additionalProperties": false
},
{
"type": "null"
}
]
},
"claim_count": {
"anyOf": [
{
"type": "integer",
"minimum": 1,
"maximum": 24
},
{
"type": "null"
}
]
}
},
"required": [
"preferences",
"claim_count"
],
"additionalProperties": false
}Published input example
{
"preferences": {
"left": [
[
0,
1
],
[
1,
0
]
],
"right": [
[
1,
0
],
[
0,
1
]
]
},
"claim_count": 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.