Datenvertragswerk
matroid principal partition density filtration
Construct the entire principal density filtration of an original finite matroid from its COMPLETE rank table r(mask), subset labels are bitmasks. Infer ground size n from table length2^n, n0..6; r must satisfy all matroid rank axioms. For EVERY real parameter lambda minimize r(X)-lambda*|X|, not just a caller-sampled parameter. Return ALL reduced rational critical values in increasing order, unique minimal/maximal minimizing sets, canonical coarse chain and nonempty density blocks. At EVERY.
POST https://datenvertrag.halowerk.com/v1/matroid-principal-partition-density-filtrationInputs
| Field | Type | Required | Description |
|---|---|---|---|
| rank_table | See schema | Yes | |
| claim | See schema | No |
Show full input schema
{
"type": "object",
"properties": {
"rank_table": {
"anyOf": [
{
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 6
},
"minItems": 1,
"maxItems": 64
},
{
"type": "null"
}
]
},
"claim": {
"anyOf": [
{
"type": "object",
"properties": {
"ground_size": {
"type": "integer",
"minimum": 0,
"maximum": 6
},
"rank": {
"type": "integer",
"minimum": 0,
"maximum": 6
},
"sequence": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 63
},
"minItems": 1,
"maxItems": 7
},
"critical": {
"type": "array",
"items": {
"type": "object",
"properties": {
"value": {
"type": "object",
"properties": {
"num": {
"type": "integer",
"minimum": 0,
"maximum": 6
},
"den": {
"type": "integer",
"minimum": 1,
"maximum": 6
}
},
"required": [
"num",
"den"
],
"additionalProperties": false
},
"lower": {
"type": "integer",
"minimum": 0,
"maximum": 63
},
"upper": {
"type": "integer",
"minimum": 0,
"maximum": 63
},
"block": {
"type": "integer",
"minimum": 0,
"maximum": 63
},
"rank_gain": {
"type": "integer",
"minimum": 0,
"maximum": 6
},
"minimizers": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 63
},
"minItems": 2,
"maxItems": 64
},
"tie_blocks": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 63
},
"minItems": 1,
"maxItems": 6
},
"predecessors": {
"type": "array",
"items": {
"type": "integer",
"minimum": 0,
"maximum": 63
},
"minItems": 1,
"maxItems": 6
}
},
"required": [
"value",
"lower",
"upper",
"block",
"rank_gain",
"minimizers",
"tie_blocks",
"predecessors"
],
"additionalProperties": false
},
"minItems": 0,
"maxItems": 6
},
"complete": {
"const": true
}
},
"required": [
"ground_size",
"rank",
"sequence",
"critical",
"complete"
],
"additionalProperties": false
},
{
"type": "null"
}
]
}
},
"required": [
"rank_table"
],
"additionalProperties": false
}Published input example
{
"rank_table": [
0,
0,
1,
1,
1,
1,
1,
1,
1,
1,
2,
2,
2,
2,
2,
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.