Datenvertragswerk
matroid kazhdan lusztig polynomial
For a complete labelled matroid rank table with n 0..6 ground elements, rank_values[mask]=r(subset), validates all 2^n entries (r(empty)=0, 0<=r(A)<=|A|, monotonicity and all submodular inequalities) and constructs the entire EPW matroid Kazhdan-Lusztig polynomial P(t). Output is exact signed decimal string coefficients in ascending power. Every singleton must have rank 1: loops are rejected with 400 invalid_profile; parallel elements and coloops are allowed.
POST https://datenvertrag.halowerk.com/v1/matroid-kazhdan-lusztig-polynomialInputs
| Field | Type | Required | Description |
|---|---|---|---|
| n | See schema | Yes | |
| rank_values | See schema | Yes | |
| claim | See schema | Yes |
Show full input schema
{
"type": "object",
"additionalProperties": false,
"required": [
"n",
"rank_values",
"claim"
],
"properties": {
"n": {
"anyOf": [
{
"type": "integer",
"minimum": 0,
"maximum": 6
},
{
"type": "null"
}
]
},
"rank_values": {
"anyOf": [
{
"type": "array",
"minItems": 1,
"maxItems": 64,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 6
}
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "array",
"minItems": 1,
"maxItems": 3,
"items": {
"type": "string",
"pattern": "^(0|-?[1-9][0-9]{0,99})$"
}
},
{
"type": "null"
}
]
}
}
}Published input example
{
"n": 3,
"rank_values": [
0,
1,
1,
2,
1,
2,
2,
3
],
"claim": [
"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.