Datenvertragswerk
finite matroid chow ring pairing
Construct the complete ordinary Adiprasito-Huh-Katz matroid Chow ring over Q from a complete labelled rank table, n1..4 and rank1..3. Validate integer rank bounds, empty rank0, all monotonicity and submodular inequalities, and singleton rank1; loops and rank0 are excluded, parallels and coloops allowed. Variables of Chow degree1 are all nonempty proper flats in increasing numeric subset-mask order. Use the COMMUTATIVE presentation Q[x_F]/(incomparable-flat products, differences of sums of.
POST https://datenvertrag.halowerk.com/v1/finite-matroid-chow-ring-pairingInputs
| Field | Type | Required | Description |
|---|---|---|---|
| n | See schema | Yes | |
| rank_values | See schema | Yes |
Show full input schema
{
"type": "object",
"additionalProperties": false,
"required": [
"n",
"rank_values"
],
"properties": {
"n": {
"anyOf": [
{
"type": "integer",
"minimum": 1,
"maximum": 4
},
{
"type": "null"
}
]
},
"rank_values": {
"anyOf": [
{
"type": "array",
"minItems": 2,
"maxItems": 16,
"items": {
"type": "integer",
"minimum": 0,
"maximum": 3
}
},
{
"type": "null"
}
]
}
}
}Published input example
{
"n": 3,
"rank_values": [
0,
1,
1,
2,
1,
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.